Deepak Vadgama bio photo

Deepak Vadgama

Software developer, amateur photographer

Email LinkedIn Github Stackoverflow Youtube Subscribe (RSS)


While reading source code of ArrayBlockingQueue implementation, I found this rather intriguing snippet of code.

public ArrayBlockingQueue(int capacity, boolean fair) {
    if (capacity <= 0)
        throw new IllegalArgumentException();
    this.items = new Object[capacity];
    lock = new ReentrantLock(fair);  // Intriguing
    notEmpty = lock.newCondition();
    notFull =  lock.newCondition();

What!? That’s it? Either true or false for a lock decides fairness of all blocking queue operations? Let’s find out what makes a ReentrantLock so special. It’s source code can be found here.

Table of contents

ReentrantLock & AQS

It turns out ReentrantLock creates 2 helper classes extending AbstractQueuedSynchronizer, and delegates all locking operations including the fairness.

public ReentrantLock() {
    // default is unfair sync
    sync = new NonfairSync();

public ReentrantLock(boolean fair) {
    sync = fair ? new FairSync() : new NonfairSync();

abstract static class Sync extends AbstractQueuedSynchronizer { ... }
static final class FairSync extends Sync { ... }
static final class NonfairSync extends Sync { ... }

// delegate lock
public void lock() {

// delegate release
public void unlock() {

Also, the class AbstractQueueSynchronizer aka AQS seems to be used by most locks in Java.

Let us try to understand the code. This code walk through is not sequential nor atomic (per method). In each subsequent step, we will add one feature or address a problem.


Basic locking

Locking means exclusive access. Integer variable called state is used to maintain this access. Value of 0 means the state is unlocked, while value of 1 or more means state is locked by 1 or more threads. Using integer variable is better because it allows use of single-instruction compare-and-swap operations.

private volatile int state;   // value of 0 = unlocked, >0 = locked

// basic lock acquire
final void lock() {
    // if state = 0, update the state to 1 and set the current thread as owner i.e. acquire the lock
    if (compareAndSetState(0, 1)){

Algorithm for concurrent access

For locking operation, if lock is already being used, the basic algorithm is to enqueue the thread and block. Similarly for unlock operation, release the lock (reset the state) and unblock first queued thread.

 * <pre>
 * Acquire:
 *     while (!tryAcquire(arg)) {
 *        <em>enqueue thread if it is not already queued</em>;
 *        <em>possibly block current thread</em>;
 *     }
 * Release:
 *     if (tryRelease(arg))
 *        <em>unblock the first queued thread</em>;
 * </pre>

Fair acquire

// try to acquire the lock, if unable to do so, enqueue the thread.
public final void acquire(int arg) {
    // partial code
    if (!tryAcquire(arg)) {
        addWaiter(Node.EXCLUSIVE), arg);

// fair Sync acquire
protected final boolean tryAcquire(int acquires) {
    final Thread current = Thread.currentThread();
    int c = getState();

    if (c == 0) {
        // if state = 0 (unlocked), and if no threads are queued (waiting to acquire a lock)
        // then reset the state and acquire the lock
        if (!hasQueuedPredecessors() &&
            compareAndSetState(0, acquires)) {
            return true;
    // if current thread itself is the owner of the lock,
    // then update the state value (in case of ReentrantLock, add 1) and continue
    else if (current == getExclusiveOwnerThread()) {
        int nextc = c + acquires;
        return true;
    // else return false so that this thread can be then added to the wait queue
    return false;

Add to the FIFO queue

If the tryAcquire fails, then add the thread to the queue and block it until the lock is released and it is at head of the queue (all earlier threads are removed from the queue).

private Node addWaiter(Node mode) {
    // create a new node with current thread
    Node node = new Node(Thread.currentThread(), mode);
    // try the fast path of enqueue; backup to full enq on failure
    Node pred = tail;
    if (pred != null) {
        node.prev = pred;
        if (compareAndSetTail(pred, node)) {
   = node;
            return node;
    // full enqueue
    return node;

Note that the actual queue used a variation on the standard queue we know. Lets not go into details of it now. If interested, you can read about it here.

Node Exclusivity

You may have noticed Node.EXCLUSIVE in the code snippet above. This is easy to understand if we understand its sibling Node.SHARED. Shared node is used for read locks where multiple threads can simultaneously have access to the lock. In most cases we use Node.EXCLUSIVE, especially in our context of ReentrantLock where-in we need exclusive access by a single thread.


Now that we understand how queues are used, lets look at what is Barging.

Lets revisit the snippet of code.

// unfair Sync partial code
final void lock() {
    // don't care about the potential queued threads
    if (compareAndSetState(0, 1))

Suppose the state was just unlocked, and there are few threads waiting in the queue. But, suddenly a new thread tries to acquire the lock, and it does not check the waiting-thread-queue. It acquires the lock, unfairly ahead of all waiting threads i.e. Barging.

Unfair acquire

Unfair acquire is almost same, except, it again tries to barge in without checking the wait-thread-queue.

// unfair Sync partial code
final boolean nonfairTryAcquire(int acquires) {
    final Thread current = Thread.currentThread();
    int c = getState();
    if (c == 0) {
        // don't bother with state of the queue
        if (compareAndSetState(0, acquires)) {
            return true;
    // rest is same as fair tryAndAcquire


Basic unlocking

Now that the thread owns a lock, unlocking/releasing it is simple. Reset the state and remove thread as lock owner.

public void unlock() {

// partial, modified code for both fair/unfair sync
protected final boolean tryRelease(int releases) {
    setState(0); // reset the state
    setExclusiveOwnerThread(null); // remove the ownership
    return true;

When thread is reentrant

When the thread has acquired the lock multiple times (i.e. Reentrant), we reduce the state value by 1 each time the thread calls unlock/release. This is because thread is expected to call unlock same number of times as lock. Thus, in this case, the state cannot be set to 0, and ownership is still retained by the thread.

// partial code for both fair/unfair sync
protected final boolean tryRelease(int releases) {

    // update the state (in case of ReentrantLock, subtract 1)
    int c = getState() - releases;
    boolean free = false;
    // if state = 0 (unlocked), only then remove ownership.
    if (c == 0) {
        free = true;
    // update the state
    return free;

What about queued threads

If there are threads waiting to acquire the lock, we need to unpark the thread at head of the queue (thread that has waited the longest).

public final boolean release(int arg) {
    // if lock was successfully released, remove a waiting thread from queue
    if (tryRelease(arg)) {
        Node h = head;
        // if queue is not empty (i.e. head is not null) and
        // wait status = 0 (default value, other values are for Condition and such)
        if (h != null && h.waitStatus != 0)
        return true;
    return false;

// partial and updated code for unpark
// i.e. remove the node from the queue and wake it up (so that it can acquire the lock)
private void unpark(Node node) {
    if (node != null)

Note: The actual code unparks node’s successor instead of node itself. This is because, during acquire, immediately after adding node to the queue, it tries again to acquire the lock for the head node. We skipped that part to retain simplicity. You can checkout the acquire and unpark code for more details.


I was putting off going through this code for a long time. It turned out to be a wonderful ride. We skipped some important parts of the code like Condition object, doAcquireInterruptibly, Cancelled status and lot more. But hopefully, now that we understand the basics, it will be easier to unpack.

Hats off to the original author of the code, Doug Lea. It is relatively easy to understand (considering its complex functionality) and the documentation for these classes is the most comprehensive and informative I’ve ever encountered.

Hit me up in the comments for any queries or corrections.