When multiple threads must access or make modifications to a common variable, they may also inadvertently access other variables adjacent in 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 compliers are allowed to store multiple bit-fields in one addressable byte or word. This implies that race conditions may exist not just on a variable accessed by multiple threads but also on other variables sharing the same byte or word address. This recommendation is a specific instance of CON32-C. Prevent data races when accessing bit-fields from multiple threads using POSIX threads.
A common tool for preventing race conditions 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, it guarantees nothing with regard to other variables that might be accessed when a common variable is accessed.
Unfortunately, there is no portable way to determine which adjacent variables may be stored along with a certain variable.
A better 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.
Noncompliant Code Example (Bit-field)
In this noncompliant code example, two executing threads simultaneously access two separate members of a global
Although this code appears to be harmless, it is likely that
flag2 are stored in the same byte. If both assignments occur on a thread-scheduling interleaving that ends with both stores occurring after one another, it is possible that only one of the flags will be set as intended, and the other flag will equal its previous value, because both bit-fields are represented by the same byte, which is the smallest unit the processor can work on.
For example, the following sequence of events can occur:
Even though each thread is modifying a separate bit-field, they are both modifying the same location in memory. This is the same problem discussed in CON43-C. Do not allow data races in multithreaded code but is harder to diagnose because it is not immediately obvious that the same memory location is being modified.
Compliant Solution (Bit-field)
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. 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.
Static assertions are discussed in detail in DCL03-C. Use a static assertion to test the value of a constant expression.
Although the race window is narrow, having an assignment or an expression evaluate improperly because of misinterpreted data can result in a corrupted running state or unintended information disclosure.
|Axivion Bauhaus Suite|
Multiple Accesses of Atomic
Various concurrency checkers
|Partially implemented; needs further investigation|
|Use locks to prevent race conditions when modifying bit fields|
Partially supported: access is detected at the object level (not at the field level)
|Polyspace Bug Finder|
|CERT C: Rule POS49-C|
Checks for data race (rule fully covered)
|1774,1775||Enforced by MTA|
Search for vulnerabilities resulting from the violation of this rule on the CERT website.
|[ISO/IEC 9899:2011]||Subclause 22.214.171.124, "Structure and Union Specifiers"|