Reading a shared primitive variable in one thread may not yield the value of the most recent write to the variable from another thread. Consequently, the thread may observe a stale value of the shared variable. To ensure the visibility of the most recent update, either the variable must be declared volatile
or the reads and writes must be synchronized.
Declaring a shared variable volatile
guarantees visibility in a thread-safe manner only when both of the following conditions are met:
- A write to a variable is independent from its current value.
- A write to a variable is independent from the result of any non-atomic nonatomic compound operations involving reads and writes of other variables. (For more information, see See rule VNA02-J. Ensure that compound operations on shared variables are atomic for more information.)
Wiki Markup |
---|
The first condition can be relaxed when you can be sure that only one thread will ever update the value of the variable \[[Goetz 2006|AA. Bibliography#Goetz 06]\]. However, code that relies on a single-thread confinement is error- prone and difficult to maintain. This design approach is permitted under this rule, but is discouraged. |
Synchronizing the code makes it easier to reason about its behavior and is frequently more secure than simply using the volatile
keyword. However, synchronization has somewhat higher performance overhead and can result in thread contention and deadlocks when used excessively.
Declaring a variable volatile
or correctly synchronizing the code both guarantee that 64-bit primitive long
and double
variables will be accessed atomically. (For more information on sharing those variables among multiple threads, see rule VNA05-J. Ensure atomicity when reading and writing 64-bit values.)
Noncompliant Code Example (Non-
...
volatile Flag)
This noncompliant code example uses a shutdown()
method to set a the non-volatile done
flag that is checked in the run()
method.
...
If one thread invokes the shutdown()
method to set the flag, a second thread might not observe that change. Consequently, the second thread may might observe that done
is still false
and incorrectly invoke the sleep()
method. Compilers and just-in-time compilers (JITs) are allowed to optimize the code when they determine that the value of done
is never modified by the same thread, resulting in an infinite loop.
Compliant Solution (
...
Volatile
)
In this compliant solution, the done
flag is declared volatile
to ensure that writes are visible to other threads.
Code Block | ||
---|---|---|
| ||
final class ControlledStop implements Runnable { private volatile boolean done = false; @Override public void run() { while (!done) { try { // ... Thread.currentThread().sleep(1000); // Do something } catch(InterruptedException ie) { Thread.currentThread().interrupt(); // Reset interrupted status } } } public void shutdown() { done = true; } } |
Compliant Solution (
...
AtomicBoolean
)
In this compliant solution, the done
flag is declared to be of type java.util.concurrent.atomic.AtomicBoolean
. Atomic types also guarantee that writes are visible to other threads.
...
Synchronization is a more secure alternative in situations where the volatile
keyword or a java.util.concurrent.atomic.Atomic*
field is inappropriate, such as if a variable's new value depends on its current value. For more information, see See rule VNA02-J. Ensure that compound operations on shared variables are atomic for more information.
Compliance with rule LCK00-J. Use private final lock objects to synchronize classes that may interact with untrusted code can reduce the likelihood of misuse by ensuring that untrusted callers cannot access the lock object.
...
Rule | Severity | Likelihood | Remediation Cost | Priority | Level |
---|---|---|---|---|---|
VNA00-J | medium | probable | medium | P8 | L2 |
Automated Detection
Some static analysis tools are capable of detecting violations of this rule.
The following table summarizes the examples flagged as violations by SureLogic Flashlight:
...
Related Guidelines
CWE-667, ". Improper Locking" locking | |
| CWE-413, "Improper Resource Locking" . Improper resource locking |
| CWE-567, ". Unsynchronized Access access to Shared Data shared data in a Multithreaded Context" multithreaded context |
Bibliography
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="ab672c2f41b3205f-5cc20ac6-46c34aec-b442b725-02f93bcfd7af64738a307b62"><ac:plain-text-body><![CDATA[ | [[Bloch 2008 | AA. Bibliography#Bloch 08]] | Item 66: . Synchronize access to shared mutable data | ]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="0bb44416c10c1d8e-c656668b-4a764eb2-87f3b480-448bb33e00df9b3532f1797b"><ac:plain-text-body><![CDATA[ | [[Goetz 2006 | AA. Bibliography#Goetz 06]] | 3.4.2. ", Example: Using Volatile to Publish Immutable Objects " | ]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="0bce6884a3ba4537-b627c21e-493a4d8e-adc28b74-91dc0811d5540e32262313b6"><ac:plain-text-body><![CDATA[ | [[JLS 2005 | AA. Bibliography#JLS 05]] | [Chapter 17, Threads and Locks | http://java.sun.com/docs/books/jls/third_edition/html/memory.html]]]></ac:plain-text-body></ac:structured-macro> |
| §17.4.5, Happens-Before Order | |||
| §17.4.3, Programs and Program Order | |||
| §17.4.8, Executions and Causality Requirements | |||
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="811a81cc5abe162b-cdd5ca7a-43c94f84-b1838f02-325b253522518dc86dd22cc8"><ac:plain-text-body><![CDATA[ | [[JPL 2006 | AA. Bibliography#JPL 06]] | 14.10.3. ", The Happens-Before Relationship " | ]]></ac:plain-text-body></ac:structured-macro> |
...