讀Semaphore源碼

//一個信號量,只有在池中還擁有許可時才允許線程繼續執行。
//先看構造函數
//默認是非公平模式
public Semaphore(int permits) {
        sync = new NonfairSync(permits);
    }


NonfairSync(int permits) {
            super(permits);
        }

//設置狀態
 Sync(int permits) {
            setState(permits);
        }
 public Semaphore(int permits, boolean fair) {
        sync = fair ? new FairSync(permits) : new NonfairSync(permits);
    }

//獲取一個許可
public void acquire() throws InterruptedException {
        sync.acquireSharedInterruptibly(1);
    }

public final void acquireSharedInterruptibly(int arg)
            throws InterruptedException {
        if (Thread.interrupted())
            throw new InterruptedException();
        if (tryAcquireShared(arg) < 0)
	    //沒有獲得鎖阻塞調用AQS裏面的方法阻塞
            doAcquireSharedInterruptibly(arg);
    }

 final int nonfairTryAcquireShared(int acquires) {
            for (;;) {
                int available = getState();
                int remaining = available - acquires;
		//如果remaining<0說明沒有許可了。或者有許可直接CAS嘗試設置state的值
                if (remaining < 0 ||
                    compareAndSetState(available, remaining))
                    return remaining;
            }
        }

 private void doAcquireSharedInterruptibly(int arg)
        throws InterruptedException {
        final Node node = addWaiter(Node.SHARED);
        boolean failed = true;
        try {
            for (;;) {
                final Node p = node.predecessor();
                if (p == head) {
                    int r = tryAcquireShared(arg);
                    if (r >= 0) {
                        setHeadAndPropagate(node, r);
                        p.next = null; // help GC
                        failed = false;
                        return;
                    }
                }
                if (shouldParkAfterFailedAcquire(p, node) &&
                    parkAndCheckInterrupt())
                    throw new InterruptedException();
            }
        } finally {
            if (failed)
                cancelAcquire(node);
        }
    }

//獲取指定數量的許可
public void acquire(int permits) throws InterruptedException {
        if (permits < 0) throw new IllegalArgumentException();
        sync.acquireSharedInterruptibly(permits);
    }

//釋放許可
 public void release() {
        sync.releaseShared(1);
    }

public final boolean releaseShared(int arg) {
        if (tryReleaseShared(arg)) {
            doReleaseShared();
            return true;
        }
        return false;
    }

 protected final boolean tryReleaseShared(int releases) {
            for (;;) {
                int current = getState();
                int next = current + releases;
                if (next < current) // overflow
                    throw new Error("Maximum permit count exceeded");
		//CAS設置當前許可數量
                if (compareAndSetState(current, next))
                    return true;
            }
        }

//釋放指定數量的許可
  public void release(int permits) {
        if (permits < 0) throw new IllegalArgumentException();
        sync.releaseShared(permits);
    }

//獲取許可
public void acquireUninterruptibly() {
        sync.acquireShared(1);
    }

//不阻塞的直接獲取許可,獲取失敗則直接返回false
public boolean tryAcquire() {
        return sync.nonfairTryAcquireShared(1) >= 0;
    }
//在一定時間內去嘗試獲取鎖超時返回false
public boolean tryAcquire(long timeout, TimeUnit unit)
        throws InterruptedException {
        return sync.tryAcquireSharedNanos(1, unit.toNanos(timeout));
    }

//返回次信號量的可用許可數
 public int availablePermits() {
        return sync.getPermits();
    }

//獲取可用的所有許可並清空許可
public int drainPermits() {
        return sync.drainPermits();
    }

final int drainPermits() {
            for (;;) {
                int current = getState();
                if (current == 0 || compareAndSetState(current, 0))
                    return current;
            }
        }

//縮減當前的可用許可量
 protected void reducePermits(int reduction) {
        if (reduction < 0) throw new IllegalArgumentException();
        sync.reducePermits(reduction);
    }


 final void reducePermits(int reductions) {
            for (;;) {
                int current = getState();
                int next = current - reductions;
                if (next > current) // underflow
                    throw new Error("Permit count underflow");
                if (compareAndSetState(current, next))
                    return;
            }
        }
//是否是公平模式
 public boolean isFair() {
        return sync instanceof FairSync;
    }

//查看是否有線程等待獲取
 public final boolean hasQueuedThreads() {
        return sync.hasQueuedThreads();
    }

  public final boolean hasQueuedThreads() {
        return head != tail;
    }

//獲取正在等待許可的線程數量
public final int getQueueLength() {
        return sync.getQueueLength();
    }

public final int getQueueLength() {
        int n = 0;
        for (Node p = tail; p != null; p = p.prev) {
            if (p.thread != null)
                ++n;
        }
        return n;
    }

//將可能正在等待的線程封裝到集合中
protected Collection<Thread> getQueuedThreads() {
        return sync.getQueuedThreads();
    }

public final Collection<Thread> getQueuedThreads() {
        ArrayList<Thread> list = new ArrayList<Thread>();
        for (Node p = tail; p != null; p = p.prev) {
            Thread t = p.thread;
            if (t != null)
                list.add(t);
        }
        return list;
    }