CountDownLatch有什么作用?
简单来说通过一个计数器控制线程的执行和阻塞,和CyclicBarrier其实很相似,在一组线程执行完成之前,另一个或者多个线程阻塞,等到这一组线程执行完之后再执行。
CountDownlatch与CyclicBarrier区别:
1.CountDownLatch的作用是允许1或N个线程等待其他线程完成执行;而CyclicBarrier则是允许N个线程相互等待。
2.CountDownLatch的计数器无法被重置;CyclicBarrier的计数器可以被重置后使用(reset方法),因此它被称为是循环的barrier。
源码分析
变量:
private final Sync sync;//是一个静态内部类,继承AQS。分析其源码可以发现,CountDownLatch采用的是共享锁实现的
private static final class Sync extends AbstractQueuedSynchronizer {
private static final long serialVersionUID = 4982264981922014374L;
Sync(int count) {
setState(count);//将count作为共享变量,是volatile类型,保证可见性
}
int getCount() {
return getState();//获取count大小
}
//尝试获取共享锁,如果count值不为0的话说明没有到最终线程的执行条件
protected int tryAcquireShared(int acquires) {
return (getState() == 0) ? 1 : -1;
}
//尝试释放共享锁,通过cas将state值减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;
}
}
}
protected final boolean compareAndSetState(int expect, int update) {
// See below for intrinsics setup to support this
return unsafe.compareAndSwapInt(this, stateOffset, expect, update);
}
构造方法:
//其实就是将传入的count值作为共享变量,控制线程的状态,通过调用静态内部类Sync实现
public CountDownLatch(int count) {
if (count < 0) throw new IllegalArgumentException("count < 0");
this.sync = new Sync(count);
}
await()方法:
public void await() throws InterruptedException {
sync.acquireSharedInterruptibly(1);
}
//上面分析过tryAcquireShared方法,当count的数量为0的时候返回值为1,否则返回值为0,所以如果小于0则执行doAcquireSharedInterruptibly
public final void acquireSharedInterruptibly(int arg)
throws InterruptedException {
if (Thread.interrupted())
throw new InterruptedException();
if (tryAcquireShared(arg) < 0)
doAcquireSharedInterruptibly(arg);
}
//该方法就是一个自旋方法,不断的尝试去获取同步锁
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) {
//不断的取出同步等待队列中的线程节点,然后使用tryAcquireShared判断是否count==0,如果计数器值不等于0,那么r 会一直小于0
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);
}
}
countdown()方法:
//递减锁存器的计数,如果计数到达零,则释放所有等待的线程
public void countDown() {
sync.releaseShared(1);
}
public final boolean releaseShared(int arg) {
if (tryReleaseShared(arg)) {
doReleaseShared();
return true;
}
return false;
}
protected boolean tryReleaseShared(int releases) {
for (;;) {
//获取锁状态
int c = getState();
//c == 0 直接返回,释放锁成功
if (c == 0)
return false;
//计算新“锁计数器”
int nextc = c-1;
//更新锁状态(计数器)
if (compareAndSetState(c, nextc))
return nextc == 0;
}
}
总结:CountDownLatch内部使用count计数器来控制同步的状态,当调用await()方法后,如果count值不为0,那么当前线程就会加入到CLH的阻塞队列中,并进行自旋操作,不间断尝试获取共享锁。而CountDownLatch初始化的时候count不为0,需要通过调用countDown()方法来释放共享锁,也就是将count值减1,直到count的值为0,当count=0的时候,wait中的线程通过自旋可以获取到锁的状态,可以继续执行。count值的更新都是通过cas操作完成的,因此可以保证线程安全。