在ReentrantLock
中很明顯能夠看到其中同步包括兩種,分別是公平的FairSync
和非公平的NonfairSync
。公平鎖的做用就是嚴格按照線程啓動的順序來執行的,不容許其餘線程插隊執行的;而非公平鎖是容許插隊的。java
默認狀況下ReentrantLock
是經過非公平鎖來進行同步的,包括synchronized
關鍵字都是如此,由於這樣性能會更好。由於從線程進入了RUNNABLE
狀態,能夠執行開始,到實際線程執行是要比較久的時間的。並且,在一個鎖釋放以後,其餘的線程會須要從新來獲取鎖。其中經歷了持有鎖的線程釋放鎖,其餘線程從掛起恢復到RUNNABLE
狀態,其餘線程請求鎖,得到鎖,線程執行,這一系列步驟。若是這個時候,存在一個線程直接請求鎖,可能就避開掛起到恢復RUNNABLE
狀態的這段消耗,因此性能更優化。markdown
/** * Creates an instance of {@code ReentrantLock}. * This is equivalent to using {@code ReentrantLock(false)}. */
public ReentrantLock() {
sync = new NonfairSync();
}
默認狀態,使用的ReentrantLock()
就是非公平鎖。再參考以下代碼,咱們知道ReentrantLock
的獲取鎖的操做是經過裝飾模式代理給sync
的。app
/**
* Acquires the lock.
*
* <p>Acquires the lock if it is not held by another thread and returns
* immediately, setting the lock hold count to one.
*
* <p>If the current thread already holds the lock then the hold
* count is incremented by one and the method returns immediately.
*
* <p>If the lock is held by another thread then the
* current thread becomes disabled for thread scheduling
* purposes and lies dormant until the lock has been acquired,
* at which time the lock hold count is set to one.
*/
public void lock() {
sync.lock();
}
下面參考一下FairSync
和NonfairSync
對lock方法的實現
:性能
/** * Sync object for non-fair locks */
static final class NonfairSync extends Sync {
/** * Performs lock. Try immediate barge, backing up to normal * acquire on failure. */
final void lock() {
if (compareAndSetState(0, 1))
setExclusiveOwnerThread(Thread.currentThread());
else
acquire(1);
}
}
/** * Sync object for fair locks */
static final class FairSync extends Sync {
final void lock() {
acquire(1);
}
}
當使用非公平鎖的時候,會馬上嘗試配置狀態,成功了就會插隊執行,失敗了就會和公平鎖的機制同樣,調用acquire()
方法,以排他的方式來獲取鎖,成功了馬上返回,不然將線程加入隊列,知道成功調用爲止。優化