AQS源码探究

aqs

• 此时main函数有a,b两个线程

public class AQSDemo {
    public static void main(String[] args) {
        ReentrantLock lock = new ReentrantLock();
        new Thread(()->{
            lock.lock();
            try {
                System.out.println("-----A thread come in");
                TimeUnit.MINUTES.sleep(20);
            }catch (Exception e){
                e.printStackTrace();
            }finally {
                lock.unlock();
            }
        },"A").start();

        //b只能等待
        new Thread(()->{
            lock.lock();
            try {
                System.out.println("-----B thread come in");
            }finally {
                lock.unlock();
            }
        },"B").start();

    }
}

• 我们进入lock方法,内部调用了一个 sync.lock()的方法,然后Sync继承了AbstractQueuedSynchronizer(AQS)

private final Sync sync;

public void lock() {
        sync.lock();
}

abstract static class Sync extends AbstractQueuedSynchronizer 

• 我们找到Sync的lock,是一个抽象方法,我们找到他的非公平锁实现方法,从lock中我们可以看出.他调用了一次cas操作,state为0改为1然后返回true(当前没有线程进来,为0),于是进入if,把a线程放入

abstract void lock();
 
final void lock() {
            if (compareAndSetState(0, 1))
                setExclusiveOwnerThread(Thread.currentThread());
            else
                acquire(1);
        }

• 然后我们进入b线程,一样到了lock方法,因为此时state值为1,所以进去else,于是我们进入acquire方法

public final void acquire(int arg) {
        if (!tryAcquire(arg) &&
            acquireQueued(addWaiter(Node.EXCLUSIVE), arg))
            selfInterrupt();
    }

• 接下来我们进入非公平锁tryAcquire方法

protected final boolean tryAcquire(int acquires) {
            return nonfairTryAcquire(acquires);
        }

• 进入nonfairTryAcquire方法,我们可以看到,他获得了b线程,并且又做了一次判断(跟据getState()),判断a是否结束,争抢一波,但肯定是失败的,因为a线程卡了20分钟,然后又判断是否跟之前的a是否同一个线程(可重入锁原理),肯定不是,然后往下面走,直接return false;

final boolean nonfairTryAcquire(int acquires) {
            final Thread current = Thread.currentThread();
            int c = getState();
            if (c == 0) {
                if (compareAndSetState(0, acquires)) {
                    setExclusiveOwnerThread(current);
                    return true;
                }
            }
            else if (current == getExclusiveOwnerThread()) {
                int nextc = c + acquires;
                if (nextc < 0) // overflow
                    throw new Error("Maximum lock count exceeded");
                setState(nextc);
                return true;
            }
            return false;
        }

• 我们回到进去此方法之前的acquire方法,tryAcquire取反所以返回true,进去addWriter方法,新建一个b的节点,目前双向队列为null,所以不进if

public final void acquire(int arg) {
        if (!tryAcquire(arg) &&
            acquireQueued(addWaiter(Node.EXCLUSIVE), arg))
            selfInterrupt();
    }

private Node addWaiter(Node mode) {
        Node node = new Node(Thread.currentThread(), mode);
        // Try the fast path of enq; backup to full enq on failure
        Node pred = tail;
        if (pred != null) {
            node.prev = pred;
            if (compareAndSetTail(pred, node)) {
                pred.next = node;
                return node;
            }
        }
        enq(node);
        return node;
    }

• 进入enq方法,又是cas,new了一个新节点,把他搞成头,俗称哨兵节点,因为循环,继续执行,然后b的上一个节点变成哨兵节点(node.prev = t),哨兵下一个为b(t.next = node),然后现在b入队了,返回队列

private Node enq(final Node node) {
        for (;;) {
            Node t = tail;
            if (t == null) { // Must initialize
                if (compareAndSetHead(new Node()))
                    tail = head;
            } else {
                node.prev = t;
                if (compareAndSetTail(t, node)) {
                    t.next = node;
                    return t;
                }
            }
        }
    }

• 又回到acquire方法,addWaiter返回了当前队列,进入acquireQueued,得到哨兵节点p(node.predecessor()),他为头又继续抢一次(tryAcquire(arg))

public final void acquire(int arg) {
        if (!tryAcquire(arg) &&
            acquireQueued(addWaiter(Node.EXCLUSIVE), arg))
            selfInterrupt();
    }


final boolean acquireQueued(final Node node, int arg) {
        boolean failed = true;
        try {
            boolean interrupted = false;
            for (;;) {
                final Node p = node.predecessor();
                if (p == head && tryAcquire(arg)) {
                    setHead(node);
                    p.next = null; // help GC
                    failed = false;
                    return interrupted;
                }
                if (shouldParkAfterFailedAcquire(p, node) &&
                    parkAndCheckInterrupt())
                    interrupted = true;
            }
        } finally {
            if (failed)
                cancelAcquire(node);
        }
    }

• 很显然抢不到,进入shouldParkAfterFailedAcquire方法,然后cas(compareAndSetWaitStatus(pred, ws, Node.SIGNAL);)把哨兵节点的status改为-1,回到之前方法是循环,所以又进入shouldParkAfterFailedAcquire,现在是-1,直接返回true

 private static boolean shouldParkAfterFailedAcquire(Node pred, Node node) {
        int ws = pred.waitStatus;
        if (ws == Node.SIGNAL)
            /*
             * This node has already set status asking a release
             * to signal it, so it can safely park.
             */
            return true;
        if (ws > 0) {
            /*
             * Predecessor was cancelled. Skip over predecessors and
             * indicate retry.
             */
            do {
                node.prev = pred = pred.prev;
            } while (pred.waitStatus > 0);
            pred.next = node;
        } else {
            /*
             * waitStatus must be 0 or PROPAGATE.  Indicate that we
             * need a signal, but don't park yet.  Caller will need to
             * retry to make sure it cannot acquire before parking.
             */
            compareAndSetWaitStatus(pred, ws, Node.SIGNAL);
        }
        return false;
    }

• 返回上一层方法,进入下面的parkAndCheckInterrupt方法,终于,我们发现,这个b总算是阻塞了(LockSupport.park(this)😉

private final boolean parkAndCheckInterrupt() {
        LockSupport.park(this);
        return Thread.interrupted();
    }

• 然后回到最开始的main函数,进入unlock方法,里面调用的release方法

public void unlock() {
        sync.release(1);
    }

• 进入release方法

public final boolean release(int arg) {
        if (tryRelease(arg)) {
            Node h = head;
            if (h != null && h.waitStatus != 0)
                unparkSuccessor(h);
            return true;
        }
        return false;
    }

• 进入tryRelease方法,1-1把state搞成0,线程解除占用

protected final boolean tryRelease(int releases) {
            int c = getState() - releases;
            if (Thread.currentThread() != getExclusiveOwnerThread())
                throw new IllegalMonitorStateException();
            boolean free = false;
            if (c == 0) {
                free = true;
                setExclusiveOwnerThread(null);
            }
            setState(c);
            return free;
        }

• 进入上一层的unparkSuccessor方法,因为为-1,进入ws<0,又是cas,改为0,然后解除阻塞(LockSupport.unpark(s.thread)😉

private void unparkSuccessor(Node node) {
        /*
         * If status is negative (i.e., possibly needing signal) try
         * to clear in anticipation of signalling.  It is OK if this
         * fails or if status is changed by waiting thread.
         */
        int ws = node.waitStatus;
        if (ws < 0)
            compareAndSetWaitStatus(node, ws, 0);

        /*
         * Thread to unpark is held in successor, which is normally
         * just the next node.  But if cancelled or apparently null,
         * traverse backwards from tail to find the actual
         * non-cancelled successor.
         */
        Node s = node.next;
        if (s == null || s.waitStatus > 0) {
            s = null;
            for (Node t = tail; t != null && t != node; t = t.prev)
                if (t.waitStatus <= 0)
                    s = t;
        }
        if (s != null)
            LockSupport.unpark(s.thread);
    }

• 解除阻塞之后,我们回到之前阻塞的那个地方

 private final boolean parkAndCheckInterrupt() {
        LockSupport.park(this);
        return Thread.interrupted();
    }

• 进入上一层方法,开始抢锁(tryAcquire)

   final boolean acquireQueued(final Node node, int arg) {
        boolean failed = true;
        try {
            boolean interrupted = false;
            for (;;) {
                final Node p = node.predecessor();
                if (p == head && tryAcquire(arg)) {
                    setHead(node);
                    p.next = null; // help GC
                    failed = false;
                    return interrupted;
                }
                if (shouldParkAfterFailedAcquire(p, node) &&
                    parkAndCheckInterrupt())
                    interrupted = true;
            }
        } finally {
            if (failed)
                cancelAcquire(node);
        }
    }

进去nonfairTryAcquire,然后setExclusiveOwnerThread(current),b线程占用了,返回true,b开始运行

 final boolean nonfairTryAcquire(int acquires) {
            final Thread current = Thread.currentThread();
            int c = getState();
            if (c == 0) {
                if (compareAndSetState(0, acquires)) {
                    setExclusiveOwnerThread(current);
                    return true;
                }
            }
            else if (current == getExclusiveOwnerThread()) {
                int nextc = c + acquires;
                if (nextc < 0) // overflow
                    throw new Error("Maximum lock count exceeded");
                setState(nextc);
                return true;
            }
            return false;
        }

• 返回上层的acquireQueued,执行 if (p == head && tryAcquire(arg))下面,执行
• setHead方法(head = node;
  node.thread = null;
  node.prev = null;)
• 头变成b,b前面为null(原哨兵节点出队列),b的thread置为null,b成为新的哨兵节点

final boolean acquireQueued(final Node node, int arg) {
        boolean failed = true;
        try {
            boolean interrupted = false;
            for (;;) {
                final Node p = node.predecessor();
                if (p == head && tryAcquire(arg)) {
                    setHead(node);
                    p.next = null; // help GC
                    failed = false;
                    return interrupted;
                }
                if (shouldParkAfterFailedAcquire(p, node) &&
                    parkAndCheckInterrupt())
                    interrupted = true;
            }
        } finally {
            if (failed)
                cancelAcquire(node);
        }
    } 					

同理如果有c,d,e线程,争抢几次之后加入队列阻塞就可以了