CountDownLatch介绍
CountDownLatch是什么呢?我个人的话用的比较少,这次学习这块的源码把粗浅的原理搞懂就行,这个在我理解就是用来一个线程等待其他线程的动作都处理完之后触发,可能这么说比较难以理解,我们还是直接来看源码实现会比较简单。
CountDownLatch概览
CountDownLatch内部也有一个继承了AQS的Sync的内部类,不过和ReentrantLock不同,他实现的是tryAcquireShared的共享方法。然后通过AQS的state变量控制还需要等待多少线程,只要应用方法是await和countDown.
源码分析
Sync内部类源码
private static final class Sync extends AbstractQueuedSynchronizer {
private static final long serialVersionUID = 4982264981922014374L;
Sync(int count) {
setState(count);
}
int getCount() {
return getState();
}
protected int tryAcquireShared(int acquires) {
return (getState() == 0) ? 1 : -1;
}
protected boolean tryReleaseShared(int releases) {
// Decrement count; signal when transition to zero
for (;;) {
int c = getState();
if (c == 0)
return false;
int nextc = c-1;
if (compareAndSetState(c, nextc))
return nextc == 0;
}
}
}
- 是不是发现这个类贼简单,就是跟state变量打交道,一眼就能看出逻辑,我不过多赘述。
await方法源码
public void await() throws InterruptedException {
sync.acquireSharedInterruptibly(1);
}
- 这里就涉及到了我再AQS里没有分析的acquireSharedInterruptibly方法,下面我们直接开干
AQS的acquireSharedInterruptibly源码
public final void acquireSharedInterruptibly(int arg)
throws InterruptedException {
if (Thread.interrupted())
throw new InterruptedException();
if (tryAcquireShared(arg) < 0)
doAcquireSharedInterruptibly(arg);
}
- 这里也比较简单,第一是线程有中断信号的话,抛出异常
- 如果判断state没有为0,则调用doAcquireSharedInterruptibly方法,下面我们再来看这块源码
AQS的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 GC
failed = false;
return;
}
}
if (shouldParkAfterFailedAcquire(p, node) &&
parkAndCheckInterrupt())
throw new InterruptedException();
}
} finally {
if (failed)
cancelAcquire(node);
}
}
- 这里的整体逻辑我们看过AQS的源码会比较清楚,这里说下不同点,就是addWaiter添加的节点是Node.SHARED节点。
- 然后如果state的值不为0的话,就把当前线程添加到队列挂起,然后怎么唤醒呢?往下看
countDown方法源码
public void countDown() {
sync.releaseShared(1);
}
public final boolean releaseShared(int arg) {
if (tryReleaseShared(arg)) {
doReleaseShared();
return true;
}
return false;
}
- tryReleaseShared里面的逻辑就是把state的变量值减arg,然后判断是否为0
- doReleaseShared则也是AQS里我们没介绍的源码,我们下面来看
AQS的doReleaseShared源码
private void doReleaseShared() {
for (;;) {
Node h = head;
if (h != null && h != tail) {
int ws = h.waitStatus;
if (ws == Node.SIGNAL) {
if (!compareAndSetWaitStatus(h, Node.SIGNAL, 0))
continue; // loop to recheck cases
unparkSuccessor(h);
}
else if (ws == 0 &&
!compareAndSetWaitStatus(h, 0, Node.PROPAGATE))
continue; // loop on failed CAS
}
if (h == head) // loop if head changed
break;
}
}
- 这里的逻辑也比较清晰,第一步判断是否存在挂起的节点,也就是队列里head如果等于tail说明不存在
- 第二步把Node节点的waitStatus改为0,成功之后就唤醒该线程
个人总结
这块的源码在之前已有的基础上阅读会比较的简单,这个类有个特点是count设置的值是不能复用的,下面是我的知识图谱总结: