...
According
...
to
...
the
...
Java
...
Language
...
Specification
...
, §8.3.1.4, "volatile
Fields" [JLS 2013],
A field may be declared
volatile
, in which case the Java Memory Model ensures that all threads see a consistent value for the variable (§17.4).
This safe publication guarantee applies only to primitive fields and object references. Programmers commonly use imprecise terminology and speak about "member objects." For the purposes of this visibility guarantee, the actual member is the object reference; the objects referred to (aka referents) by volatile object references are beyond the scope of the safe publication guarantee. Consequently, declaring an object reference to be volatile is insufficient to guarantee that changes to the members of the referent are published to other threads. A thread may fail to observe a recent write from another thread to a member field of such an object referent.
Furthermore, when the referent is mutable and lacks thread safety, other threads might see a partially constructed object or an object in a (temporarily) inconsistent state [Goetz 2007]. However, when the referent is immutable, declaring the reference volatile suffices to guarantee safe publication of the members of the referent. Programmers cannot use the volatile
keyword to guarantee safe publication of mutable objects. Use of the volatile
keyword can only guarantee safe publication of primitive fields, object references, or fields of immutable object referents.
Confusing a volatile object with the volatility of its member objects is a similar error to the one described in OBJ50-J. Never confuse the immutability of a reference with that of the referenced object.
Noncompliant Code Example (Arrays)
This noncompliant code example declares a volatile reference to an array object.
Code Block | ||
---|---|---|
| ||
final class Foo {
private volatile int[] arr = new int[20];
public int getFirst() {
return arr[0];
}
public void setFirst(int n) {
arr[0] = n;
}
// ...
}
|
Values assigned to an array element by one thread—for example, by calling setFirst()
—might not be visible to another thread calling getFirst()
because the volatile
keyword guarantees safe publication only for the array reference; it makes no guarantee regarding the actual data contained within the array.
This problem arises when the thread that calls setFirst()
and the thread that calls getFirst()
lack a happens-before relationship. A happens-before relationship exists between a thread that writes to a volatile variable and a thread that subsequently reads it. However, setFirst()
and getFirst()
read only from a volatile variable—the volatile reference to the array. Neither method writes to the volatile variable.
Compliant Solution (AtomicIntegerArray
)
To ensure that the writes to array elements are atomic and that the resulting values are visible to other threads, this compliant solution uses the AtomicIntegerArray
class defined in java.util.concurrent.atomic
.
Code Block | ||
---|---|---|
| ||
final class Foo {
private final AtomicIntegerArray atomicArray =
new AtomicIntegerArray(20);
public int getFirst() {
return atomicArray.get(0);
}
public void setFirst(int n) {
atomicArray.set(0, 10);
}
// ...
}
|
AtomicIntegerArray
guarantees a happens-before relationship between a thread that calls atomicArray.set()
and a thread that subsequently calls atomicArray.get()
.
Compliant Solution (Synchronization)
To ensure visibility, accessor methods may synchronize access while performing operations on nonvolatile elements of an array, whether the array is referred to by a volatile or a nonvolatile reference. Note that the code is thread-safe even though the array reference is not volatile.
Code Block | ||
---|---|---|
| ||
final class Foo {
private int[] arr = new int[20];
public synchronized int getFirst() {
return arr[0];
}
public synchronized void setFirst(int n) {
arr[0] = n;
}
}
|
Synchronization establishes a happens-before relationship between threads that synchronize on the same lock. In this case, the thread that calls setFirst()
and the thread that subsequently calls getFirst()
on the same object instance both synchronize on that instance, so safe publication is guaranteed.
Noncompliant Code Example (Mutable Object)
This noncompliant code example declares the Map
instance field volatile. The instance of the Map
object is mutable because of its put()
method.
Code Block | ||
---|---|---|
| ||
final {{volatile}} Fields: {quote} A field may be declared {{volatile}}, in which case the Java memory model (§17) ensures that all threads see a consistent value for the variable. {quote} Notably, this applies only to fields and not to the contents of objects that are declared {{volatile}}. A thread may not observe a recent write to the object's field from another thread. Declaring an object {{volatile}} in order to ensure visibility of the most up-to-date object state does not work without the use of explicit synchronization, unless the object is [effectively immutable|BB. Definitions#effectively immutable]. In the absence of synchronization, the effect of declaring an object reference {{volatile}} is that when one thread sets the object to a new value, other threads can see the new reference immediately. If the object is immutable, this has the effect that other threads also see a consistent view of the state of the object. However, if the object is mutable and so, modified by a thread, other threads may see a partially-modified object, or an object in a (temporarily) inconsistent state \[[Goetz 07|AA. Java References#Goetz 07]\]. Declaring the object {{volatile}} does not prevent this issue. h2. Noncompliant Code Example (Arrays) This noncompliant code example shows an array object (arrays are objects in Java) that is declared {{volatile}}. It appears that when, a value is written by a thread to one of the array elements, it will be visible to other threads immediately. This is misleading because the {{volatile}} keyword just makes the array reference visible to all threads and does not affect the actual data contained within the array. {code:bgColor=#FFcccc} volatile int[] arr = new int[20]; // ... arr[1] = 10; {code} It is possible for one thread to set a new value to {{arr\[1\]}} while another thread attempts to read the value of {{arr\[1\]}}, with the result that the reading thread receives an inconsistent value for {{arr\[1\]}}. h2. Compliant Solution ({{AtomicIntegerArray}} This compliant solution suggests using the {{java.util.concurrent.atomic.AtomicIntegerArray}} concurrency utility. Using its {{set(index, value)}} method ensures that the write is atomic and the resulting value is immediately visible to other threads. The other threads can retrieve a value from a specific index by using the {{get(index)}} method. {code:bgColor=#ccccff} AtomicIntegerArray aia = new AtomicIntegerArray(5); // ... aia.set(1, 10); {code} h2. Noncompliant Code Example ({{Properties}} object) This noncompliant code example declares an instance field of type {{Properties}} as {{volatile}}. The field can be mutated using the {{put()}} method. {code:bgColor=#FFcccc} class Foo { private volatile Map<String, PropertiesString> propertiesmap; public Foo() { propertiesmap = new PropertiesHashMap<String, String>(); // Load some useful values into propertiesmap } public String get(String s) { return propertiesmap.getPropertyget(s); } public void put(String key, String value) { // Validate Performthe validationvalues ofbefore valueinserting if properties(!value.setProperty(key, value); } } {code} This class permits a race condition. If one thread calls {{get()}} while another calls {{put()}}, the first thread may receive a stale value, or an internally inconsistent value from the {{properties}} object. Declaring the object {{volatile}} does not prevent this data race. Even if the client thread sees the new reference to {{properties}}, the object state that it observes may change in the meantime. {mc} The Java Memory Model does not guarantee that the {{properties}} field will have been properly initialized when it is necessary. ==Let's not talk about initialization here=={mc} Because the object is not immutable, it is unsafe for use in a multi-threaded environment. h2. Compliant Solution (immutable) This compliant solution renders the {{Foo}} class effectively immutable. Consequently, once it is properly constructed, no thread can modify {{properties}} and cause a race condition. {code:bgColor=#ccccff} matches("[\\w]*")) { throw new IllegalArgumentException(); } map.put(key, value); } } |
Interleaved calls to get()
and put()
may result in the retrieval of internally inconsistent values from the Map
object because put()
modifies its state. Declaring the object reference volatile is insufficient to eliminate this data race.
Noncompliant Code Example (Volatile-Read, Synchronized-Write)
This noncompliant code example attempts to use the volatile-read, synchronized-write technique described in Java Theory and Practice [Goetz 2007]. The map
field is declared volatile to synchronize its reads and writes. The put()
method is also synchronized to ensure that its statements are executed atomically.
Code Block | ||
---|---|---|
| ||
final class Foo { private Properties properties volatile Map<String, String> map; public Foo() { propertiesmap = new HashMap<String, PropertiesString>(); // Load some useful values into propertiesmap } public String get(String s) { return propertiesmap.getPropertyget(s); } } {code} The drawback of this solution is that the {{put()}} method cannot be accommodated if the goal is to ensure immutability. The {{Foo}} and {{Properties}} classes are both effectively immutable. They are not truly [immutable|BB. Definitions#immutable] because the {{Properties}} class is not final. h2. Compliant Solution (the cheap read-write lock trick) This compliant solution uses explicit synchronization to ensure thread safety. It declares the object {{volatile}} to guard retrievals that use the getter method. A synchronized setter method is used to set the value of the {{ public synchronized void put(String key, String value) { // Validate the values before inserting if (!value.matches("[\\w]*")) { throw new IllegalArgumentException(); } map.put(key, value); } } |
The volatile-read, synchronized-write technique uses synchronization to preserve atomicity of compound operations, such as increment, and provides faster access times for atomic reads. However, it fails for mutable objects because the safe publication guarantee provided by volatile
extends only to the field itself (the primitive value or object reference); the referent is excluded from the guarantee, as are the referent's members. In effect, the write and a subsequent read of the map
lack a happens-before relationship.
This technique is also discussed in VNA02-J. Ensure that compound operations on shared variables are atomic.
Compliant Solution (Synchronized)
This compliant solution uses method synchronization to guarantee visibility:
Code Block | ||
---|---|---|
| ||
finalProperties}} object. {code:bgColor=#ccccff} public class Foo { private final volatileMap<String, PropertiesString> propertiesmap; public Foo() { propertiesmap = new PropertiesHashMap<String, String>(); // Load some useful values into propertiesmap } public synchronized String get(String s) { return propertiesmap.getPropertyget(s); } public synchronized void put(String key, String value) { // Perform validation of valueValidate the values before inserting if (!value.matches("[\\w]*")) { throw new IllegalArgumentException(); } propertiesmap.setPropertyput(key, value); } } {code} This compliant solution has the advantage that it can accommodate the setter method. Declaring the object as {{volatile}} for safe publication using getter methods is cheaper in terms of performance, than declaring the getters as {{synchronized}}. However, synchronizing the setter methods is mandatory. h2. Risk Assessment Failing to synchronize access to shared mutable data can cause different threads to observe different states of the object. || Rule || Severity || Likelihood || Remediation Cost || Priority || Level || | CON11-J | medium | probable | medium | {color:#cc9900}{*}P8{*}{color} | {color:#cc9900}{*}L2{*}{color} | h3. Automated Detection TODO h3. Related Vulnerabilities Search for vulnerabilities resulting from the violation of this rule on the [CERT website|https://www.kb.cert.org/vulnotes/bymetric?searchview&query=FIELD+KEYWORDS+contains+CON11-J]. h2. References \[[Goetz 07|AA. Java References#Goetz 07]\] Pattern #2: "one-time safe publication" \[[JLS 05|AA. Java References#JLS 05]\] ---- [!The CERT Sun Microsystems Secure Coding Standard for Java^button_arrow_left.png!|FIO36-J. Do not create multiple buffered wrappers on an InputStream] [!The CERT Sun Microsystems Secure Coding Standard for Java^button_arrow_up.png!|09. Input Output (FIO)] [!The CERT Sun Microsystems Secure Coding Standard for Java^button_arrow_right.png!|09. Input Output (FIO)] |
It is unnecessary to declare the map
field volatile because the accessor methods are synchronized. The field is declared final
to prevent publication of its reference when the referent is in a partially initialized state (see TSM03-J. Do not publish partially initialized objects for more information).
Noncompliant Code Example (Mutable Subobject)
In this noncompliant code example, the volatile format
field stores a reference to a mutable object, java.text.DateFormat
:
Code Block | ||
---|---|---|
| ||
final class DateHandler {
private static volatile DateFormat format =
DateFormat.getDateInstance(DateFormat.MEDIUM);
public static java.util.Date parse(String str)
throws ParseException {
return format.parse(str);
}
}
|
Because DateFormat
is not thread-safe [API 2013], the value for Date
returned by the parse()
method may not correspond to the str
argument:
Compliant Solution (Instance per Call/Defensive Copying)
This compliant solution creates and returns a new DateFormat
instance for each invocation of the parse()
method [API 2013]:
Code Block | ||
---|---|---|
| ||
final class DateHandler {
public static java.util.Date parse(String str)
throws ParseException {
return DateFormat.getDateInstance(
DateFormat.MEDIUM).parse(str);
}
}
|
Compliant Solution (Synchronization)
This compliant solution makes DateHandler
thread-safe by synchronizing statements within the parse()
method [API 2013]:
Code Block | ||
---|---|---|
| ||
final class DateHandler {
private static DateFormat format =
DateFormat.getDateInstance(DateFormat.MEDIUM);
public static java.util.Date parse(String str)
throws ParseException {
synchronized (format) {
return format.parse(str);
}
}
}
|
Compliant Solution (ThreadLocal
Storage)
This compliant solution uses a ThreadLocal
object to create a separate DateFormat
instance per thread:
Code Block | ||
---|---|---|
| ||
final class DateHandler {
private static final ThreadLocal<DateFormat> format =
new ThreadLocal<DateFormat>() {
@Override protected DateFormat initialValue() {
return DateFormat.getDateInstance(DateFormat.MEDIUM);
}
};
// ...
}
|
Applicability
Incorrectly assuming that declaring a field volatile guarantees safe publication of a referenced object's members can cause threads to observe stale or inconsistent values.
Technically, strict immutability of the referent is a stronger condition than is fundamentally required for safe publication. When it can be determined that a referent is thread-safe by design, the field that holds its reference may be declared volatile. However, this approach to using volatile
decreases maintainability and should be avoided.
Bibliography
...