Page History

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 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 guarantees that 64-bit primitive long and double variables are accessed atomically. For more information on sharing those variables among multiple threads, see VNA05-J. Ensure atomicity when reading and writing 64-bit values.

Noncompliant Code Example (Non-volatile Flag

Declaring shared variables as volatile ensures visibility and limits reordering of accesses. Volatile accesses do not guarantee the atomicity of composite operations such as incrementing a variable. Consequently, this recommendation is not applicable in cases where the atomicity of composite operations must be guaranteed (see CON01-J. Do not assume that composite operations on primitive data are atomic).

Declaring variables as volatile establishes a happens-before relationship such that a write to the volatile variable is always seen by a subsequent read. Statements that occur before the write to the volatile field also happen-before the read of the volatile field.

Consider two threads that are executing some statements:

Image Removed

Thread 1 and Thread 2 have a happens-before relationship such that Thread 2 does not start before Thread 1 finishes. This is established by the semantics of volatile accesses.

In this example, Statement 3 writes to a volatile variable, and statement 4 (in Thread 2) reads the same volatile variable. The read sees the most recent write (to the same variable v) from statement 3.

Volatile read and write operations cannot be reordered with respect to each other and also with respect to nonvolatile variables accesses. When Thread 2 reads the volatile variable it sees the results of all the writes occurring before the write to the volatile variable in Thread 1. Because of the relatively strong guarantees of volatile, the performance overhead of volatile is almost the same as that of synchronization

However, this does not mean that statements 1 and 2 are executed in the order in which they appear in the program. They may be freely reordered by the compiler.

The possible reorderings between volatile and non-volatile variables are summarized in the matrix shown below. Load and store operations are synonymous to read and write operations, respectively. \[[Lea 08|AA. Java References#Lea 08]\]

Image Removed

...

)

This noncompliant code example uses a shutdown() method to set a non-volatile the nonvolatile done flag that is checked in the run() method. If one thread invokes the shutdown() method to set the flag, it is possible that another thread might not observe this change. Consequently, the second thread may still observe that done is false and incorrectly invoke the sleep() 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 handleinterrupted exceptionstatus
      } 
    } 	 
  }

  protectedpublic 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)

This In this compliant solution qualifies , the done flag as is declared volatile so to ensure that updates 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(); // handleReset interrupted exceptionstatus
      } 
    } 	 
  }

  protectedpublic void shutdown() {
    done = true;
  }
}

Noncompliant Code Example (non-volatile guard)

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 threadsThis noncompliant code example declares a non-volatile variable of type int which is initialized in the constructor depending on a security check.

final class BankOperationControlledStop implements Runnable {
  private intfinal AtomicBoolean balancedone = 0;
  private boolean initialized = falsenew AtomicBoolean(false);
 
  @Override public BankOperationvoid run() {
    ifwhile (!performAccountVerificationdone.get()) {
      try throw{
  new SecurityException("Invalid Account"); 
   // }...
     balance  = 1000 Thread.currentThread().sleep(1000); // Do something
    initialized = true; 
  }
  } catch(InterruptedException ie) { 
  private int getBalance() {
    if (initialized == true) {Thread.currentThread().interrupt(); // Reset interrupted status
      return} balance;
    }
 	 
  else {}

  public void   return -1;shutdown() {
    }done.set(true);
  }
}

...

Compliant Solution (

...

synchronized)

This compliant solution declares the initialized flag as volatile to ensure that initialization happens before the initialized flag is set. uses the intrinsic lock of the Class object to ensure that updates are visible to other threads:

final class BankOperationControlledStop {
implements  private int balance = 0;Runnable {
  private volatile boolean initializeddone = false; // Now
 volatile
 
 @Override public BankOperationvoid run() {
    ifwhile (!performAccountVerificationisDone()) {
      throw new SecurityException("Invalid Account"); try {
    }
    balance = 1000;   // ...
    initialized = true; 
  }
  
  private int getBalance() {
    if (initialized == true) {
      return balance;
 Thread.currentThread().sleep(1000); // Do something
      }
 catch(InterruptedException ie) { else {
      return -1;
    }
  }
}

Noncompliant Code Example (visibility)

This noncompliant code example consists of two classes: an immutable final ImmutablePoint class and a mutable Holder class. Holder is mutable because a new ImmutablePoint instance can be assigned to it using the setPoint() method (see CON09-J. Synchronize access to shared references). The ImmutablePoint is final so that an attacker may not subclass it and assign a mutable subclass to ipoint.

class Holder {
  ImmutablePoint ipoint;
  
  Holder(ImmutablePoint ip) {
   ipoint = ip;
  }
  
  ImmutablePoint getPoint() {
    return ipoint; Thread.currentThread().interrupt(); // Reset interrupted status
      } 
    } 	 
  }

  public synchronized voidboolean setPointisDone(ImmutablePoint ip) {
    this.ipoint = ipreturn done;
  }
}

public final classpublic ImmutablePointsynchronized {
  final int x;
  final int y;

  public ImmutablePoint(int x, int yvoid shutdown() {
    this.xdone = xtrue;
    this.y = y;
  }
}

Because the ipoint field is non-volatile, changes to this value may not be immediately visible to other threads.

Compliant Solution (visibility)

This compliant solution declares the ipoint field as volatile so that updates are immediately visible to other threads.

class Holder {
  volatile ImmutablePoint ipoint;
  
  Holder(ImmutablePoint ip) {
    ipoint = ip;
  }
  
  ImmutablePoint getPoint() {
    return ipoint;
  }

  void setPoint(ImmutablePoint ip) {
    this.ipoint = ip;
  }
}

Declaring immutable fields as volatile enables their safe publication in that, once published, it is impossible to change the state of the sub-object.

The setPoint() method does not currently need to be synchronized because it operates atomically on immutable data, that is, on an instance of ImmutablePoint. However, remember that the volatile keyword does not protect against TOCTOU race conditions. A routine that checked the current value of ipoint and subsequently set it would require additional locking to prevent the TOCTOU race condition. Such locking would render the volatile keyword unnecessary.

Risk Assessment

Although this compliant solution is acceptable, 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 VNA02-J. Ensure that compound operations on shared variables are atomic for more information).

Compliance with 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-J-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 variableFailing to use volatile to guarantee visibility of shared values across multiple thread and prevent reordering of accesses can result in unpredictable control flow.

Automated Detection

TODO

Related Vulnerabilities

Search for vulnerabilities resulting from the violation Some static analysis tools are capable of detecting violations of this rule on the CERT website.

References

\[[JLS 05|AA. Java References#JLS 05]\] [Chapter 17, Threads and Locks|http://java.sun.com/docs/books/jls/third_edition/html/memory.html], section 17.4.5 Happens-before Order, section 17.4.3 Programs and Program Order, section 17.4.8 Executions and Causality Requirements
\[[Tutorials 08|AA. Java References#Tutorials 08]\] [Java Concurrency Tutorial|http://java.sun.com/docs/books/tutorial/essential/concurrency/index.html]
\[[Lea 00|AA. Java References#Lea 00]\] Sections, 2.2.7 The Java Memory Model, 2.2.5 Deadlock, 2.1.1.1 Objects and locks
\[[Bloch 08|AA. Java References#Bloch 08]\] Item 66: Synchronize access to shared mutable data
\[[Goetz 06|AA. Java References#Goetz 06]\] 3.4.2. "Example: Using Volatile to Publish Immutable Objects"
\[[JPL 06|AA. Java References#JPL 06]\] 14.10.3. "The Happens-Before Relationship"
\[[MITRE 09|AA. Java References#MITRE 09]\] [CWE ID 667|http://cwe.mitre.org/data/definitions/667.html] "Insufficient Locking", [CWE ID 413|http://cwe.mitre.org/data/definitions/413.html] "Insufficient Resource Locking", [CWE ID 366|http://cwe.mitre.org/data/definitions/366.html]  "Race Condition within a Thread", [CWE ID 567|http://cwe.mitre.org/data/definitions/567.html]  "Unsynchronized Access to Shared Data"

Related Guidelines

Bibliography

...

Image Added Image Added Image Added11. Concurrency (CON)      11. Concurrency (CON)      CON02-J. Always synchronize on the appropriate object