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 nonatomic compound operations involving reads and writes of other variables. (See rule VNA02-J. Ensure that compound operations on shared variables are atomic for more information.)
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]. 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 are 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 the non-volatile done
flag that is checked in the run()
method.
final class ControlledStop implements Runnable { private 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; } }
If one thread invokes the shutdown()
method to set the flag, a second thread might not observe that change. Consequently, the second thread 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.
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.
final class ControlledStop implements Runnable { private final AtomicBoolean done = new AtomicBoolean(false); @Override public void run() { while (!done.get()) { try { // ... Thread.currentThread().sleep(1000); // Do something } catch(InterruptedException ie) { Thread.currentThread().interrupt(); // Reset interrupted status } } } public void shutdown() { done.set(true); } }
Compliant Solution (synchronized
)
This compliant solution uses the intrinsic lock of the Class
object to ensure that updates are visible to other threads.
final class ControlledStop implements Runnable { private boolean done = false; @Override public void run() { while (!isDone()) { try { // ... Thread.currentThread().sleep(1000); // Do something } catch(InterruptedException ie) { Thread.currentThread().interrupt(); // Reset interrupted status } } } public synchronized boolean isDone() { return done; } public synchronized void shutdown() { done = true; } }
While this is an acceptable compliant solution, intrinsic locks cause threads to block and may introduce contention. On the other hand, volatile-qualified shared variables do not block. Excessive synchronization can also make the program prone to deadlock.
Synchronization is a more secure alternative in situations where the volatile
keyword or a java.util.concurrent.atomic.Atomic*
field is inappropriate, such as when a variable's new value depends on its current value. 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.
Exceptions
VNA00-EX0: Class
objects are created by the virtual machine; their initialization always precedes any subsequent use. Consequently, cross-thread visibility of Class
objects is already assured by default
Risk Assessment
Failing to ensure the visibility of a shared primitive variable may result in a thread observing a stale value of the variable.
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.
Tool | Version | Checker | Description |
---|---|---|---|
Eclipse | 4.2.0 | Not Implemented | |
FindBugs | 2.0.1 | Not Implemented | |
PMD | 5.0.0 | Not Implemented | |
Fortify | Not Implemented | ||
Coverity | v7.5 | SERVLET_ATOMICITY | Implemented |
ThreadSafe | 1.3 | CCE_SL_INCONSISTENT CCE_CC_CALLBACK_ACCESS CCE_SL_MIXED CCE_SL_INCONSISTENT_COL CCE_SL_MIXED_COL CCE_CC_UNSAFE_CONTENT CCE_FF_VOLATILE | Implemented |
Related Guidelines
CWE-667. Improper locking | |
| CWE-413. Improper resource locking |
| CWE-567. Unsynchronized access to shared data in a multithreaded context |
Bibliography
Item 66. Synchronize access to shared mutable data | |
3.4.2, Example: Using Volatile to Publish Immutable Objects | |
[JLS 2005] | |
| §17.4.5, Happens-Before Order |
| §17.4.3, Programs and Program Order |
| §17.4.8, Executions and Causality Requirements |
[JPL 2006] | 14.10.3, The Happens-Before Relationship |