CountDownLatch原理分析

构造函数

public CountDownLatch(int count) {
        if (count < 0) throw new IllegalArgumentException("count < 0");
        this.sync = new Sync(count); //设置锁次数（可以这么理解）
    }

sync是一个内部类，实现AQS抽象类

 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;
            }
        }
    }

await()方法

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

//AbstractQueuedSynchronizer#acquireSharedInterruptibly

public final void acquireSharedInterruptibly(int arg)
            throws InterruptedException {
        if (Thread.interrupted())
            throw new InterruptedException();
        if (tryAcquireShared(arg) < 0)  //<0代表state还不是0，也就是说还有锁
            doAcquireSharedInterruptibly(arg);
}

 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;
            }
        }
    }

//AbstractQueuedSynchronizer#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);  //判断锁的状态 state
                    if (r >= 0) { //如果state为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);
        }
    }

第一次await(),主线程等待，之后再调用await()就不等待了。也不会出现调用两次await()都等待的情况。所以上面代码的阻塞方法 就会被执行一次（其实在队列里 仅仅存在一个 排队的node，这里和reentrantLock是不一样的）

countDown()

public void countDown() {
        sync.releaseShared(1);
    }

// AbstractQueuedSynchronizer#releaseShared
public final boolean releaseShared(int arg) {
        if (tryReleaseShared(arg)) { //没有锁了，就释放，其实这里才是关键
            doReleaseShared();//没有锁了，就释放
            return true;
        }
        return false;
    }

 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; //是不是没有 活儿了
            }
        }
    }

CountDownLatch的关键性代码我觉得是tryReleaseShared，也就是去利用cas去设置state变量的值。所以由此启发  利用automicInt也可以实现这个功能。