ReentrantLock線程未獲取到鎖進入等待隊列原理


公平鎖  

非公平鎖 都會調用acquire方法

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

 

1 使用tryacquire獲取鎖 2 未獲取到鎖,則將當前線程添加到等到隊列

 

acquireQueued(addWaiter(Node.EXCLUSIVE), arg))原理剖析
  1. 線程A獲取到鎖,但是未釋放
  2. 線程B嘗試獲取鎖,但是鎖未被釋放,因此進入等待隊列
  3. 線程C嘗試獲取鎖,但是鎖未被釋放,因此進入等待隊列

 

 
        

 AbstractQueuedSynchronizer

    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);
        }
    }

 

 

 

 當前線程的前驅不是head節點(空節點,不存儲線程相關信息),且獲取鎖失敗(tryAcquire),則判斷是否需要阻塞當前線程 shouldParkAfterFailedAcquire
 
        
    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;
    }
 
        

 判斷當前線程是否需要被阻塞(加入等待隊列)流程圖 shouldParkAfterFailedAcquire

 

 

 

 

 
       


免責聲明!

本站轉載的文章為個人學習借鑒使用,本站對版權不負任何法律責任。如果侵犯了您的隱私權益,請聯系本站郵箱yoyou2525@163.com刪除。



 
粵ICP備18138465號   © 2018-2025 CODEPRJ.COM