...
Noncompliant Code Example (Bitwise Negation)
Similarly, the The toggle()
method can may also use the compound assignment operator ^=
to negate the current value of flag
.
...
This code is also not thread-safe. A data race exists because ^=
is a non-atomic nonatomic compound operation.
Noncompliant Code Example (
...
Volatile)
Declaring flag
volatile does not help solve the problem either:
Code Block | ||
---|---|---|
| ||
final class Flag { private volatile boolean flag = true; public void toggle() { // Unsafe flag ^= true; } public boolean getFlag() { // Safe return flag; } } |
This code remains unsuitable for multithreaded use because declaring a variable as volatile fails to does not guarantee the atomicity of compound operations on the variable.
...
Code Block | ||
---|---|---|
| ||
final class Flag { private boolean flag = true; public synchronized void toggle() { flag ^= true; // Same as flag = !flag; } public synchronized boolean getFlag() { return flag; } } |
This solution guards reads and writes to the flag
field with a lock on the instance, that is, this
. This compliant solution Furthermore, doing so ensures that changes are visible to all the threads. Now, only two execution orders are possible, one of which is shown below.in the following scenario:
Time | flag= | Thread | Action |
---|---|---|---|
1 | true | t1 | reads the current value of |
2 | true | t1 | toggles the temporary variable to false |
3 | false | t1 | writes the temporary variable's value to |
4 | false | t2 | reads the current value of |
5 | false | t2 | toggles the temporary variable to true |
6 | true | t2 | writes the temporary variable's value to |
The second execution order involves the same operations, but t2 starts and finishes before t1.
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.
...
In this compliant solution, the getFlag()
method is not synchronized, and flag
is declared as volatile. This solution is compliant because the read of flag
in the getFlag()
method is an atomic operation and the volatile qualification assures visibility. The toggle()
method still requires synchronization because it performs a non-atomic nonatomic operation.
Code Block | ||
---|---|---|
| ||
final class Flag { private volatile boolean flag = true; public synchronized void toggle() { flag ^= true; // Same as flag = !flag; } public boolean getFlag() { return flag; } } |
...
This compliant solution declares flag
as an AtomicBoolean
type to be of type AtomicBoolean
.
Code Block | ||
---|---|---|
| ||
import java.util.concurrent.atomic.AtomicBoolean; final class Flag { private AtomicBoolean flag = new AtomicBoolean(true); public void toggle() { boolean temp; do { temp = flag.get(); } while (!flag.compareAndSet(temp, !temp)); } public AtomicBoolean getFlag() { return flag; } } |
...
In this noncompliant code example, multiple threads can invoke the setValues()
method to set the a
and b
fields. Because this class fails to test for integer overflow, users of the Adder
class must ensure that the arguments to the setValues()
method can be added without overflow. (For more information, see See rule NUM00-J. Detect or prevent integer overflow for more information.)
Code Block | ||
---|---|---|
| ||
final class Adder { private int a; private int b; public int getSum() { return a + b; } public void setValues(int a, int b) { this.a = a; this.b = b; } } |
The getSum()
method contains a race condition. For example, when a
and b
currently have the values 0
and Integer.MAX_VALUE
, respectively, and one thread calls getSum()
while another calls setValues(Integer.MAX_VALUE, 0)
, the getSum()
method might return either 0
or Integer.MAX_VALUE
, or it might overflow and wrap. Overflow will occur when the first thread reads a
and b
after the second thread has set the value of a
to Integer.MAX_VALUE
, but before it has set the value of b
to 0
.
Note that declaring the variables as volatile fails to resolve the issue because these compound operations involve reads and writes of multiple variables.
...
The operations within the synchronized methods are now atomic with respect to other synchronized methods that lock on that object's monitor (intrinsic that is, it's intrinsic lock). It is now possible, for example, to add overflow checking to the synchronized getSum()
method without introducing the possibility of a race condition.
...
Rule | Severity | Likelihood | Remediation Cost | Priority | Level |
---|---|---|---|---|---|
VNA02-J | medium | probable | medium | P8 | L2 |
Automated Detection
The SureLogic Flashlight tool Some available tools can diagnose violations of this rule as by detecting instance fields with empty locksets.
The Coverity Prevent Version 5.0 ATOMICITY checker Some available static analysis tools can detect the instances of non-atomic nonatomic update of a concurrently shared value. The result of the update will be is determined by the interleaving of thread execution. The GUARDED_BY_VIOLATION checker These tools can detect the instances where thread-shared data is accessed without holding an appropriate lock, possibly causing a race condition.
Related Guidelines
CWE-667, ". Improper Locking" locking | |
| CWE-413, "Improper Resource Locking" . Improper resource locking |
| CWE-366, ". Race Condition condition within a Thread" thread |
| 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="68df64ebe4bf2b77-dc87864b-4e734493-9cd9bb70-62e7f5e52cda823823f2d06e"><ac:plain-text-body><![CDATA[ | [[API 2006 | AA. Bibliography#API 06]] | Class | ]]></ac:plain-text-body></ac:structured-macro> | |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="999c3335a1cc8a55-fc1e9ae9-452448ad-b5cb8acb-bd4d528950997c55171710d8"><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="81c04879f7112188-9e4cf62a-45cf48eb-87a7a49b-49729091ac15f96cb040ab92"><ac:plain-text-body><![CDATA[ | [[Goetz 2006 | AA. Bibliography#Goetz 06]] | 2.3. ", Locking " | ]]></ac:plain-text-body></ac:structured-macro> | |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="c5e8802011a491b3-9b13d5b7-44e44791-a6bdb950-8f15f620ad6a7b0c32645cad"><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="0c1ed5dd801ec928-cf2f8358-40154e99-8791be64-d76e378f24233ec75c5834fe"><ac:plain-text-body><![CDATA[ | [[Lea 2000 | AA. Bibliography#Lea 00]] | Section 2.2.7, The Java Memory Model | ]]></ac:plain-text-body></ac:structured-macro> | |
| Section 2.1.1.1, Objects and Locks | ||||
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="056ecca37169328a-831ab70b-4c074a21-9035a295-5bcdeb4442425209bf5757eb"><ac:plain-text-body><![CDATA[ | [[Tutorials 2008 | AA. Bibliography#Tutorials 08]] | [Java Concurrency Tutorial | http://java.sun.com/docs/books/tutorial/essential/concurrency/index.html] | ]]></ac:plain-text-body></ac:structured-macro> |
...