When multiple threads must access or make modifications to a common variable, they may also inadvertently access other variables in adjacent memory. This is an artifact of variables being stored compactly, with one byte possibly holding multiple variables, and is a common optimization on word-addressed machines. Bit-fields are especially prone to this behavior because compilers are allowed to store multiple bit-fields in one addressable byte or word. Consequently, race conditions data races may exist not just on a variable accessed by multiple threads but also on other variables sharing the same byte or word address.
A common One tool for preventing race conditions data races in concurrent programming is the mutex. When properly observed by all threads, a mutex can provide safe and secure access to a common variable; however. However, it guarantees nothing with regard to other variables that might be accessed when a common variable is accessedthe mutex is not controlled by the accessing thread.
Unfortunately, there is no portable way to determine which adjacent variables may be stored along with a certain variable.
A better Another approach is to embed a concurrently accessed variable inside a union, along with a long
variable, or at least some padding to ensure that the concurrent variable is the only element to be accessed at that address. This technique would effectively guarantee that no other variables are accessed or modified when the concurrent variable is accessed or modified.
...
This compliant solution protects all accesses of the flags with a mutex, thereby preventing any thread-scheduling interleaving from occurring. In addition, the flags are declared volatile
to ensure that the compiler will not attempt to move operations on them outside the mutex. Finallydata races. Finally, the flags are embedded in a union alongside a long
, and a static assertion guarantees that the flags do not occupy more space than the long
. This technique prevents any data not checked by the mutex from being accessed or modified with the bit-fields.
Code Block | ||||
---|---|---|---|---|
| ||||
struct multi_threaded_flags { volatile unsigned int flag1 : 2; volatile unsigned int flag2 : 2; }; union mtf_protect { struct multi_threaded_flags s; long padding; }; static_assert(sizeof(long) >= sizeof(struct multi_threaded_flags)); struct mtf_mutex { union mtf_protect u; mtx_t mutex; }; struct mtf_mutex flags; void thread1(void) { int result; if ((result = mtx_lock(&flags.mutex)) == thrd_error) { /* Handle error */ } flags.u.s.flag1 = 1; if ((result = mtx_unlock(&flags.mutex)) == thrd_error) { /* Handle error */ } } void thread2(void) { int result; if ((result = mtx_lock(&flags.mutex)) == thrd_error) { /* Handle error */ } flags.u.s.flag2 = 2; if ((result = mtx_unlock(&flags.mutex)) == thrd_error) { /* Handle error */ } } |
...