若有不正之處請多多諒解，并歡迎批評指正。

請尊重作者勞動成果，轉載請標明原文鏈接：

http://www.cnblogs.com/go2sea/p/5625536.html

?

Semaphore是JUC包提供的一個共享鎖，一般稱之為信號量。

Semaphore通過自定義的同步器維護了一個或多個共享資源，線程通過調用acquire獲取共享資源，通過調用release釋放。

源代碼：

/** ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.*********************//******* Written by Doug Lea with assistance from members of JCP JSR-166* Expert Group and released to the public domain, as explained at* http://creativecommons.org/publicdomain/zero/1.0/*/package java.util.concurrent; import java.util.*; import java.util.concurrent.locks.*; import java.util.concurrent.atomic.*;/*** A counting semaphore. Conceptually, a semaphore maintains a set of* permits. Each {@link #acquire} blocks if necessary until a permit is* available, and then takes it. Each {@link #release} adds a permit,* potentially releasing a blocking acquirer.* However, no actual permit objects are used; the {@code Semaphore} just* keeps a count of the number available and acts accordingly.** <p>Semaphores are often used to restrict the number of threads than can* access some (physical or logical) resource. For example, here is* a class that uses a semaphore to control access to a pool of items:* <pre>* class Pool {* private static final int MAX_AVAILABLE = 100;* private final Semaphore available = new Semaphore(MAX_AVAILABLE, true);** public Object getItem() throws InterruptedException {* available.acquire();* return getNextAvailableItem();* }** public void putItem(Object x) {* if (markAsUnused(x))* available.release();* }** // Not a particularly efficient data structure; just for demo** protected Object[] items = ... whatever kinds of items being managed* protected boolean[] used = new boolean[MAX_AVAILABLE];** protected synchronized Object getNextAvailableItem() {* for (int i = 0; i < MAX_AVAILABLE; ++i) {* if (!used[i]) {* used[i] = true;* return items[i];* }* }* return null; // not reached* }** protected synchronized boolean markAsUnused(Object item) {* for (int i = 0; i < MAX_AVAILABLE; ++i) {* if (item == items[i]) {* if (used[i]) {* used[i] = false;* return true;* } else* return false;* }* }* return false;* }** }* </pre>** <p>Before obtaining an item each thread must acquire a permit from* the semaphore, guaranteeing that an item is available for use. When* the thread has finished with the item it is returned back to the* pool and a permit is returned to the semaphore, allowing another* thread to acquire that item. Note that no synchronization lock is* held when {@link #acquire} is called as that would prevent an item* from being returned to the pool. The semaphore encapsulates the* synchronization needed to restrict access to the pool, separately* from any synchronization needed to maintain the consistency of the* pool itself.** <p>A semaphore initialized to one, and which is used such that it* only has at most one permit available, can serve as a mutual* exclusion lock. This is more commonly known as a <em>binary* semaphore</em>, because it only has two states: one permit* available, or zero permits available. When used in this way, the* binary semaphore has the property (unlike many {@link Lock}* implementations), that the &quot;lock&quot; can be released by a* thread other than the owner (as semaphores have no notion of* ownership). This can be useful in some specialized contexts, such* as deadlock recovery.** <p> The constructor for this class optionally accepts a* <em>fairness</em> parameter. When set false, this class makes no* guarantees about the order in which threads acquire permits. In* particular, <em>barging</em> is permitted, that is, a thread* invoking {@link #acquire} can be allocated a permit ahead of a* thread that has been waiting - logically the new thread places itself at* the head of the queue of waiting threads. When fairness is set true, the* semaphore guarantees that threads invoking any of the {@link* #acquire() acquire} methods are selected to obtain permits in the order in* which their invocation of those methods was processed* (first-in-first-out; FIFO). Note that FIFO ordering necessarily* applies to specific internal points of execution within these* methods. So, it is possible for one thread to invoke* {@code acquire} before another, but reach the ordering point after* the other, and similarly upon return from the method.* Also note that the untimed {@link #tryAcquire() tryAcquire} methods do not* honor the fairness setting, but will take any permits that are* available.** <p>Generally, semaphores used to control resource access should be* initialized as fair, to ensure that no thread is starved out from* accessing a resource. When using semaphores for other kinds of* synchronization control, the throughput advantages of non-fair* ordering often outweigh fairness considerations.** <p>This class also provides convenience methods to {@link* #acquire(int) acquire} and {@link #release(int) release} multiple* permits at a time. Beware of the increased risk of indefinite* postponement when these methods are used without fairness set true.** <p>Memory consistency effects: Actions in a thread prior to calling* a "release" method such as {@code release()}* <a href="package-summary.html#MemoryVisibility"><i>happen-before</i></a>* actions following a successful "acquire" method such as {@code acquire()}* in another thread.** @since 1.5* @author Doug Lea**/public class Semaphore implements java.io.Serializable {private static final long serialVersionUID = -3222578661600680210L;/** All mechanics via AbstractQueuedSynchronizer subclass */private final Sync sync;/*** Synchronization implementation for semaphore. Uses AQS state* to represent permits. Subclassed into fair and nonfair* versions.*/abstract static class Sync extends AbstractQueuedSynchronizer {private static final long serialVersionUID = 1192457210091910933L;Sync(int permits) {setState(permits);}final int getPermits() {return getState();}final int nonfairTryAcquireShared(int acquires) {for (;;) {int available = getState();int remaining = available - acquires;if (remaining < 0 ||compareAndSetState(available, remaining))return remaining;}}protected final boolean tryReleaseShared(int releases) {for (;;) {int current = getState();int next = current + releases;if (next < current) // overflowthrow new Error("Maximum permit count exceeded");if (compareAndSetState(current, next))return true;}}final void reducePermits(int reductions) {for (;;) {int current = getState();int next = current - reductions;if (next > current) // underflowthrow new Error("Permit count underflow");if (compareAndSetState(current, next))return;}}final int drainPermits() {for (;;) {int current = getState();if (current == 0 || compareAndSetState(current, 0))return current;}}}/*** NonFair version*/static final class NonfairSync extends Sync {private static final long serialVersionUID = -2694183684443567898L;NonfairSync(int permits) {super(permits);}protected int tryAcquireShared(int acquires) {return nonfairTryAcquireShared(acquires);}}/*** Fair version*/static final class FairSync extends Sync {private static final long serialVersionUID = 2014338818796000944L;FairSync(int permits) {super(permits);}protected int tryAcquireShared(int acquires) {for (;;) {if (hasQueuedPredecessors())return -1;int available = getState();int remaining = available - acquires;if (remaining < 0 ||compareAndSetState(available, remaining))return remaining;}}}/*** Creates a {@code Semaphore} with the given number of* permits and nonfair fairness setting.** @param permits the initial number of permits available.* This value may be negative, in which case releases* must occur before any acquires will be granted.*/public Semaphore(int permits) {sync = new NonfairSync(permits);}/*** Creates a {@code Semaphore} with the given number of* permits and the given fairness setting.** @param permits the initial number of permits available.* This value may be negative, in which case releases* must occur before any acquires will be granted.* @param fair {@code true} if this semaphore will guarantee* first-in first-out granting of permits under contention,* else {@code false}*/public Semaphore(int permits, boolean fair) {sync = fair ? new FairSync(permits) : new NonfairSync(permits);}/*** Acquires a permit from this semaphore, blocking until one is* available, or the thread is {@linkplain Thread#interrupt interrupted}.** <p>Acquires a permit, if one is available and returns immediately,* reducing the number of available permits by one.** <p>If no permit is available then the current thread becomes* disabled for thread scheduling purposes and lies dormant until* one of two things happens:* <ul>* <li>Some other thread invokes the {@link #release} method for this* semaphore and the current thread is next to be assigned a permit; or* <li>Some other thread {@linkplain Thread#interrupt interrupts}* the current thread.* </ul>** <p>If the current thread:* <ul>* <li>has its interrupted status set on entry to this method; or* <li>is {@linkplain Thread#interrupt interrupted} while waiting* for a permit,* </ul>* then {@link InterruptedException} is thrown and the current thread's* interrupted status is cleared.** @throws InterruptedException if the current thread is interrupted*/public void acquire() throws InterruptedException {sync.acquireSharedInterruptibly(1);}/*** Acquires a permit from this semaphore, blocking until one is* available.** <p>Acquires a permit, if one is available and returns immediately,* reducing the number of available permits by one.** <p>If no permit is available then the current thread becomes* disabled for thread scheduling purposes and lies dormant until* some other thread invokes the {@link #release} method for this* semaphore and the current thread is next to be assigned a permit.** <p>If the current thread is {@linkplain Thread#interrupt interrupted}* while waiting for a permit then it will continue to wait, but the* time at which the thread is assigned a permit may change compared to* the time it would have received the permit had no interruption* occurred. When the thread does return from this method its interrupt* status will be set.*/public void acquireUninterruptibly() {sync.acquireShared(1);}/*** Acquires a permit from this semaphore, only if one is available at the* time of invocation.** <p>Acquires a permit, if one is available and returns immediately,* with the value {@code true},* reducing the number of available permits by one.** <p>If no permit is available then this method will return* immediately with the value {@code false}.** <p>Even when this semaphore has been set to use a* fair ordering policy, a call to {@code tryAcquire()} <em>will</em>* immediately acquire a permit if one is available, whether or not* other threads are currently waiting.* This &quot;barging&quot; behavior can be useful in certain* circumstances, even though it breaks fairness. If you want to honor* the fairness setting, then use* {@link #tryAcquire(long, TimeUnit) tryAcquire(0, TimeUnit.SECONDS) }* which is almost equivalent (it also detects interruption).** @return {@code true} if a permit was acquired and {@code false}* otherwise*/public boolean tryAcquire() {return sync.nonfairTryAcquireShared(1) >= 0;}/*** Acquires a permit from this semaphore, if one becomes available* within the given waiting time and the current thread has not* been {@linkplain Thread#interrupt interrupted}.** <p>Acquires a permit, if one is available and returns immediately,* with the value {@code true},* reducing the number of available permits by one.** <p>If no permit is available then the current thread becomes* disabled for thread scheduling purposes and lies dormant until* one of three things happens:* <ul>* <li>Some other thread invokes the {@link #release} method for this* semaphore and the current thread is next to be assigned a permit; or* <li>Some other thread {@linkplain Thread#interrupt interrupts}* the current thread; or* <li>The specified waiting time elapses.* </ul>** <p>If a permit is acquired then the value {@code true} is returned.** <p>If the current thread:* <ul>* <li>has its interrupted status set on entry to this method; or* <li>is {@linkplain Thread#interrupt interrupted} while waiting* to acquire a permit,* </ul>* then {@link InterruptedException} is thrown and the current thread's* interrupted status is cleared.** <p>If the specified waiting time elapses then the value {@code false}* is returned. If the time is less than or equal to zero, the method* will not wait at all.** @param timeout the maximum time to wait for a permit* @param unit the time unit of the {@code timeout} argument* @return {@code true} if a permit was acquired and {@code false}* if the waiting time elapsed before a permit was acquired* @throws InterruptedException if the current thread is interrupted*/public boolean tryAcquire(long timeout, TimeUnit unit)throws InterruptedException {return sync.tryAcquireSharedNanos(1, unit.toNanos(timeout));}/*** Releases a permit, returning it to the semaphore.** <p>Releases a permit, increasing the number of available permits by* one. If any threads are trying to acquire a permit, then one is* selected and given the permit that was just released. That thread* is (re)enabled for thread scheduling purposes.** <p>There is no requirement that a thread that releases a permit must* have acquired that permit by calling {@link #acquire}.* Correct usage of a semaphore is established by programming convention* in the application.*/public void release() {sync.releaseShared(1);}/*** Acquires the given number of permits from this semaphore,* blocking until all are available,* or the thread is {@linkplain Thread#interrupt interrupted}.** <p>Acquires the given number of permits, if they are available,* and returns immediately, reducing the number of available permits* by the given amount.** <p>If insufficient permits are available then the current thread becomes* disabled for thread scheduling purposes and lies dormant until* one of two things happens:* <ul>* <li>Some other thread invokes one of the {@link #release() release}* methods for this semaphore, the current thread is next to be assigned* permits and the number of available permits satisfies this request; or* <li>Some other thread {@linkplain Thread#interrupt interrupts}* the current thread.* </ul>** <p>If the current thread:* <ul>* <li>has its interrupted status set on entry to this method; or* <li>is {@linkplain Thread#interrupt interrupted} while waiting* for a permit,* </ul>* then {@link InterruptedException} is thrown and the current thread's* interrupted status is cleared.* Any permits that were to be assigned to this thread are instead* assigned to other threads trying to acquire permits, as if* permits had been made available by a call to {@link #release()}.** @param permits the number of permits to acquire* @throws InterruptedException if the current thread is interrupted* @throws IllegalArgumentException if {@code permits} is negative*/public void acquire(int permits) throws InterruptedException {if (permits < 0) throw new IllegalArgumentException();sync.acquireSharedInterruptibly(permits);}/*** Acquires the given number of permits from this semaphore,* blocking until all are available.** <p>Acquires the given number of permits, if they are available,* and returns immediately, reducing the number of available permits* by the given amount.** <p>If insufficient permits are available then the current thread becomes* disabled for thread scheduling purposes and lies dormant until* some other thread invokes one of the {@link #release() release}* methods for this semaphore, the current thread is next to be assigned* permits and the number of available permits satisfies this request.** <p>If the current thread is {@linkplain Thread#interrupt interrupted}* while waiting for permits then it will continue to wait and its* position in the queue is not affected. When the thread does return* from this method its interrupt status will be set.** @param permits the number of permits to acquire* @throws IllegalArgumentException if {@code permits} is negative**/public void acquireUninterruptibly(int permits) {if (permits < 0) throw new IllegalArgumentException();sync.acquireShared(permits);}/*** Acquires the given number of permits from this semaphore, only* if all are available at the time of invocation.** <p>Acquires the given number of permits, if they are available, and* returns immediately, with the value {@code true},* reducing the number of available permits by the given amount.** <p>If insufficient permits are available then this method will return* immediately with the value {@code false} and the number of available* permits is unchanged.** <p>Even when this semaphore has been set to use a fair ordering* policy, a call to {@code tryAcquire} <em>will</em>* immediately acquire a permit if one is available, whether or* not other threads are currently waiting. This* &quot;barging&quot; behavior can be useful in certain* circumstances, even though it breaks fairness. If you want to* honor the fairness setting, then use {@link #tryAcquire(int,* long, TimeUnit) tryAcquire(permits, 0, TimeUnit.SECONDS) }* which is almost equivalent (it also detects interruption).** @param permits the number of permits to acquire* @return {@code true} if the permits were acquired and* {@code false} otherwise* @throws IllegalArgumentException if {@code permits} is negative*/public boolean tryAcquire(int permits) {if (permits < 0) throw new IllegalArgumentException();return sync.nonfairTryAcquireShared(permits) >= 0;}/*** Acquires the given number of permits from this semaphore, if all* become available within the given waiting time and the current* thread has not been {@linkplain Thread#interrupt interrupted}.** <p>Acquires the given number of permits, if they are available and* returns immediately, with the value {@code true},* reducing the number of available permits by the given amount.** <p>If insufficient permits are available then* the current thread becomes disabled for thread scheduling* purposes and lies dormant until one of three things happens:* <ul>* <li>Some other thread invokes one of the {@link #release() release}* methods for this semaphore, the current thread is next to be assigned* permits and the number of available permits satisfies this request; or* <li>Some other thread {@linkplain Thread#interrupt interrupts}* the current thread; or* <li>The specified waiting time elapses.* </ul>** <p>If the permits are acquired then the value {@code true} is returned.** <p>If the current thread:* <ul>* <li>has its interrupted status set on entry to this method; or* <li>is {@linkplain Thread#interrupt interrupted} while waiting* to acquire the permits,* </ul>* then {@link InterruptedException} is thrown and the current thread's* interrupted status is cleared.* Any permits that were to be assigned to this thread, are instead* assigned to other threads trying to acquire permits, as if* the permits had been made available by a call to {@link #release()}.** <p>If the specified waiting time elapses then the value {@code false}* is returned. If the time is less than or equal to zero, the method* will not wait at all. Any permits that were to be assigned to this* thread, are instead assigned to other threads trying to acquire* permits, as if the permits had been made available by a call to* {@link #release()}.** @param permits the number of permits to acquire* @param timeout the maximum time to wait for the permits* @param unit the time unit of the {@code timeout} argument* @return {@code true} if all permits were acquired and {@code false}* if the waiting time elapsed before all permits were acquired* @throws InterruptedException if the current thread is interrupted* @throws IllegalArgumentException if {@code permits} is negative*/public boolean tryAcquire(int permits, long timeout, TimeUnit unit)throws InterruptedException {if (permits < 0) throw new IllegalArgumentException();return sync.tryAcquireSharedNanos(permits, unit.toNanos(timeout));}/*** Releases the given number of permits, returning them to the semaphore.** <p>Releases the given number of permits, increasing the number of* available permits by that amount.* If any threads are trying to acquire permits, then one* is selected and given the permits that were just released.* If the number of available permits satisfies that thread's request* then that thread is (re)enabled for thread scheduling purposes;* otherwise the thread will wait until sufficient permits are available.* If there are still permits available* after this thread's request has been satisfied, then those permits* are assigned in turn to other threads trying to acquire permits.** <p>There is no requirement that a thread that releases a permit must* have acquired that permit by calling {@link Semaphore#acquire acquire}.* Correct usage of a semaphore is established by programming convention* in the application.** @param permits the number of permits to release* @throws IllegalArgumentException if {@code permits} is negative*/public void release(int permits) {if (permits < 0) throw new IllegalArgumentException();sync.releaseShared(permits);}/*** Returns the current number of permits available in this semaphore.** <p>This method is typically used for debugging and testing purposes.** @return the number of permits available in this semaphore*/public int availablePermits() {return sync.getPermits();}/*** Acquires and returns all permits that are immediately available.** @return the number of permits acquired*/public int drainPermits() {return sync.drainPermits();}/*** Shrinks the number of available permits by the indicated* reduction. This method can be useful in subclasses that use* semaphores to track resources that become unavailable. This* method differs from {@code acquire} in that it does not block* waiting for permits to become available.** @param reduction the number of permits to remove* @throws IllegalArgumentException if {@code reduction} is negative*/protected void reducePermits(int reduction) {if (reduction < 0) throw new IllegalArgumentException();sync.reducePermits(reduction);}/*** Returns {@code true} if this semaphore has fairness set true.** @return {@code true} if this semaphore has fairness set true*/public boolean isFair() {return sync instanceof FairSync;}/*** Queries whether any threads are waiting to acquire. Note that* because cancellations may occur at any time, a {@code true}* return does not guarantee that any other thread will ever* acquire. This method is designed primarily for use in* monitoring of the system state.** @return {@code true} if there may be other threads waiting to* acquire the lock*/public final boolean hasQueuedThreads() {return sync.hasQueuedThreads();}/*** Returns an estimate of the number of threads waiting to acquire.* The value is only an estimate because the number of threads may* change dynamically while this method traverses internal data* structures. This method is designed for use in monitoring of the* system state, not for synchronization control.** @return the estimated number of threads waiting for this lock*/public final int getQueueLength() {return sync.getQueueLength();}/*** Returns a collection containing threads that may be waiting to acquire.* Because the actual set of threads may change dynamically while* constructing this result, the returned collection is only a best-effort* estimate. The elements of the returned collection are in no particular* order. This method is designed to facilitate construction of* subclasses that provide more extensive monitoring facilities.** @return the collection of threads*/protected Collection<Thread> getQueuedThreads() {return sync.getQueuedThreads();}/*** Returns a string identifying this semaphore, as well as its state.* The state, in brackets, includes the String {@code "Permits ="}* followed by the number of permits.** @return a string identifying this semaphore, as well as its state*/public String toString() {return super.toString() + "[Permits = " + sync.getPermits() + "]";} } View Code

?

下面我們來詳細分下下Semaphore的工作原理。

一、構造函數

public Semaphore(int permits) {sync = new NonfairSync(permits);}public Semaphore(int permits, boolean fair) {sync = fair ? new FairSync(permits) : new NonfairSync(permits);}

?

初始化Semaphore時需要指定共享資源的個數。Semaphore提供了兩種模式：公平模式&非公平模式。如果不指定工作模式的話，默認工作在非公平模式下。后面我們將看到，兩種模式的區別在于獲取共享資源時的排序策略。Semaphore有三個內部類：Sync&NonfairSync&FairSync。后兩個繼承自Sync，Sync繼承自AQS。除了序列化版本號之外，Semaphore只有一個成員變量sync，公平模式下sync初始化為FairSync，非公平模式下sync初始化為NonfairSync。

二、acquire 響應中斷獲取資源

Semaphore提供了兩種獲取資源的方式：響應中斷&不響應中斷。我們先來看一下響應中斷的獲取。

public void acquire() throws InterruptedException {sync.acquireSharedInterruptibly(1);}

acquire方法由同步器sync調用上層AQS提供的acquireSharedInterruptibly方法獲取：

public final void acquireSharedInterruptibly(int arg)throws InterruptedException {if (Thread.interrupted())throw new InterruptedException();if (tryAcquireShared(arg) < 0)doAcquireSharedInterruptibly(arg);}

acquireSharedInterruptibly方法先檢測中斷。然后調用tryAcquireShared方法試圖獲取共享資源。這時公平模式和非公平模式的代碼執行路徑發生分叉，FairSync和NonfairSync各自重寫了tryAcquireShared方法。

我們先來看下非公平模式下的tryAcquireShared方法：

protected int tryAcquireShared(int acquires) {return nonfairTryAcquireShared(acquires);}

它直接代用了父類Sync提供的nonfairTryAcquireShared方法：

final int nonfairTryAcquireShared(int acquires) {for (;;) {int available = getState();int remaining = available - acquires;if (remaining < 0 ||compareAndSetState(available, remaining))return remaining;}}

注意，這里是一個CAS自旋。因為Semaphore是一個共享鎖，可能有多個線程同時申請共享資源，因此CAS操作可能失敗。直到成功獲取返回剩余資源數目，或者發現沒有剩余資源返回負值代表申請失敗。有一個問題，為什么我們不在CAS操作失敗后就直接返回失敗呢？因為這樣做雖然不會導致錯誤，但會降低效率：在還有剩余資源的情況下，一個線程因為競爭導致CAS失敗后被放入等待序列尾，一定在隊列頭部有一個線程被喚醒去試圖獲取資源，這比直接自旋繼續獲取多了操作等待隊列的開銷。

這里“非公平”的語義體現在：如果一個線程通過nonfairTryAcquireShared成功獲取了共享資源，對于此時正在等待隊列中的線程來說，可能是不公平的：隊列中線程先到，卻沒能先獲取資源。

如果tryAcquireShared沒能成功獲取，acquireSharedInterruptibly方法調用doAcquireSharedInterruptibly方法將當前線程放入等待隊列并開始自旋檢測獲取資源：

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 GCfailed = false;return;}}if (shouldParkAfterFailedAcquire(p, node) &&parkAndCheckInterrupt())throw new InterruptedException();}} finally {if (failed)cancelAcquire(node);}}

我們注意到，doAcquireSharedInterruptibly中，當一個線程從parkAndCheckInterrupt方法中被中斷喚醒之后，直接拋出了中斷異常。還記得我們分析AQS時的doAcquireShared方法嗎，它在這里的處理方式是用一個局部變量interrupted記錄下這個異常但不立即處理，而是等到成功獲取資源之后返回這個中斷標志，并在上層調用selfInterrupt方法補上中斷。這正是兩個方法的關鍵區別：是否及時響應中斷。

我們再來看公平模式下的tryAcquireShared方法：

protected int tryAcquireShared(int acquires) {for (;;) {if (hasQueuedPredecessors())return -1;int available = getState();int remaining = available - acquires;if (remaining < 0 ||compareAndSetState(available, remaining))return remaining;}}

相比較非公平模式的nonfairTryAcquireShared方法，公平模式下的tryAcquireShared方法在試圖獲取之前做了一個判斷，如果發現等對隊列中有線程在等待獲取資源，就直接返回-1表示獲取失敗。當前線程會被上層的acquireSharedInterruptibly方法調用doAcquireShared方法放入等待隊列中。這正是“公平”模式的語義：如果有線程先于我進入等待隊列且正在等待，就直接進入等待隊列，效果便是各個線程按照申請的順序獲得共享資源，具有公平性。

三、acquireUnInterruptibly 不響應中斷獲取資源

public void acquireUninterruptibly() {sync.acquireShared(1);}

acquireUnInterruptibly方法調用AQS提供的acquireShared方法：

public final void acquireShared(int arg) {if (tryAcquireShared(arg) < 0)doAcquireShared(arg);}

acquireShared方法首先試圖獲取資源，這與acquireSharedInterruptibly方法相比，沒有先檢測中斷的這一步。緊接著調用doAcquireShared方法，由于這個方法我在另一篇博文AQS源碼學習筆記中已經詳細分析過，這里我們只關注它與doAcquireSharedInterruptibly方法的區別：

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

正如剛剛說過的，區別只在線程從parkAndCheckInterrupt方法中因中斷而返回時的處理：在這里它沒有拋出異常，而是用一個局部變量interrupted記錄下這個異常但不立即處理，而是等到成功獲取資源之后返回這個中斷標志，并在上層調用selfInterrupt方法補上中斷。

四、acquire(int) & acquireUninterruptibly(int) 指定申請的資源數目的獲取

public void acquire(int permits) throws InterruptedException {if (permits < 0) throw new IllegalArgumentException();sync.acquireSharedInterruptibly(permits);}public void acquireUninterruptibly(int permits) {if (permits < 0) throw new IllegalArgumentException();sync.acquireShared(permits);}

可以看到，與不指定數目時的獲取的區別僅在參數值，不再贅述。

五、release 釋放資源

公平模式和非公平模式的釋放資源操作是一樣的：

public void release() {sync.releaseShared(1);}public void release(int permits) {if (permits < 0) throw new IllegalArgumentException();sync.releaseShared(permits);}

調用AQS提供的releaseShared方法：

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

releaseShared方法首先調用我們重寫的tryReleaseShared方法試圖釋放資源。然后調用doReleaseShared方法喚醒隊列之后的等待線程。由于在我的另一篇博文AQS源碼學習筆記中已經詳細分析了doReleaseShared方法，因此不再贅述。我們主要關注tryReleaseShared方法：

protected final boolean tryReleaseShared(int releases) {for (;;) {int current = getState();int next = current + releases;if (next < current) // overflowthrow new Error("Maximum permit count exceeded");if (compareAndSetState(current, next))return true;}}

這個方法也是一個CAS自旋，原因是應為Semaphore是一個共享鎖，可能有多個線程同時釋放資源，因此CAS操作可能失敗。最后方法總會成功釋放并返回true（如果不出錯的話）。

六、tryAcquire & tryAcquire(timeout) 方法

public boolean tryAcquire() {return sync.nonfairTryAcquireShared(1) >= 0;}public boolean tryAcquire(long timeout, TimeUnit unit)throws InterruptedException {return sync.tryAcquireSharedNanos(1, unit.toNanos(timeout));}public boolean tryAcquire(int permits) {if (permits < 0) throw new IllegalArgumentException();return sync.nonfairTryAcquireShared(permits) >= 0;}public boolean tryAcquire(int permits, long timeout, TimeUnit unit)throws InterruptedException {if (permits < 0) throw new IllegalArgumentException();return sync.tryAcquireSharedNanos(permits, unit.toNanos(timeout));}

沒有指定等待時間的tryAcquire調用的是nonfairTryAcquireShared方法，我們已經分析過，不再贅述。我們重點關注指定等待時長的方法。限時等待是通過調用AQS提供的tryAcquireSharedNanos方法實現的：

public final boolean tryAcquireSharedNanos(int arg, long nanosTimeout)throws InterruptedException {if (Thread.interrupted())throw new InterruptedException();return tryAcquireShared(arg) >= 0 ||doAcquireSharedNanos(arg, nanosTimeout);}

注意：限時等待默認都是及時響應中斷的。方法開始先檢測中斷，然后調用tryAcquireShared方法試圖獲取資源，如果成功的話直接返回true，不成功則調用doAcquireSharedNanos方法：

private boolean doAcquireSharedNanos(int arg, long nanosTimeout)throws InterruptedException {if (nanosTimeout <= 0L)return false;final long deadline = System.nanoTime() + nanosTimeout;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 GCfailed = false;return true;}}nanosTimeout = deadline - System.nanoTime();if (nanosTimeout <= 0L)return false;if (shouldParkAfterFailedAcquire(p, node) &&nanosTimeout > spinForTimeoutThreshold)LockSupport.parkNanos(this, nanosTimeout);if (Thread.interrupted())throw new InterruptedException();}} finally {if (failed)cancelAcquire(node);}}

方法在自旋之前先計算了一個結束等待的時間節點deadline，然后便開始自旋，每次自旋都要計算一下剩余等待時間nanosTimeout，如果nanosTimeout小于等于0，說明已經到達deadline，直接返回false表示超時。

有一點值得注意，spinForTimeoutThreshold這個值規定了一個閾值，當剩余等待時間小于這個值的時候，線程將不再被park，而是一直在自旋試圖獲取資源。關于這個值的作用Doug Lea是這樣注釋的：

/*** The number of nanoseconds for which it is faster to spin* rather than to use timed park. A rough estimate suffices* to improve responsiveness with very short timeouts.*/

我的理解是，park和unpark操作需要一定的開銷，當nanosTimeout很小的時候，這個開銷就相對很大了。這個閾值的設置可以讓短時等待的線程一直保持自旋，可以提高短時等待的反應效率，而由于nanosTimeout很小，自旋又不會有過多的開銷。

除此之外，doAcquireSharedNanos方法與不限時等待的doAcquireShared方法還有兩點重要區別：①由于有等待時限，所以線程從park方法返回時我們不能確定返回的原因是中斷還是超時，因此需要調用interrupted方法檢測一下中斷標志；②doAcquireSharedNanos方法是及時響應中斷的，而doAcquireShared方法延遲處理中斷。

七、drainPermits & reducePermits 修改剩余共享資源數量

Semaphore提供了“耗盡”所有剩余共享資源的操作：

public int drainPermits() {return sync.drainPermits();}

drainPermits調用了自定義同步器Sync的同名方法：

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

用CAS自旋將剩余資源清空。

我們再來看看“縮減”剩余共享資源的操作：

protected void reducePermits(int reduction) {if (reduction < 0) throw new IllegalArgumentException();sync.reducePermits(reduction);}

首先，縮減必須是單向的，即只能減少不能增加，然后調用Sync的同名方法：

final void reducePermits(int reductions) {for (;;) {int current = getState();int next = current - reductions;if (next > current) // underflowthrow new Error("Permit count underflow");if (compareAndSetState(current, next))return;}}

用CAS自旋在剩余共享資源上做縮減。

上述兩個對共享資源數量的修改操作有兩點需要注意：①是不可逆的②是對剩余資源的操作而不是全部資源，當剩余資源數目不足或已經為0時，方法就返回，正咋被占用的資源不參與。

八、其他

public int availablePermits() {return sync.getPermits();}public boolean isFair() {return sync instanceof FairSync;}public final boolean hasQueuedThreads() {return sync.hasQueuedThreads();}public final int getQueueLength() {return sync.getQueueLength();}protected Collection<Thread> getQueuedThreads() {return sync.getQueuedThreads();}public String toString() {return super.toString() + "[Permits = " + sync.getPermits() + "]";}

這些方法比較簡單，不再贅述。

?

總結：

Semaphore是JUC包提供的一個典型的共享鎖，它通過自定義兩種不同的同步器（FairSync&NonfairSync）提供了公平&非公平兩種工作模式，兩種模式下分別提供了限時/不限時、響應中斷/不響應中斷的獲取資源的方法（限時獲取總是及時響應中斷的），而所有的釋放資源的release操作是統一的。

?

轉載于:https://www.cnblogs.com/go2sea/p/5625536.html

總結

以上是生活随笔為你收集整理的Java多线程之JUC包：Semaphore源码学习笔记的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。