CountDownLatch

本文深入解析了Java并发工具类CountDownLatch的内部实现,包括构造函数、Sync内部类、await()和countDown()核心方法。通过AQS的共享模式,解释了CountDownLatch如何控制线程同步,当计数器归零时唤醒等待线程的机制。
摘要由CSDN通过智能技术生成

类结构

在这里插入图片描述

	public CountDownLatch(int count) {
        if (count < 0) throw new IllegalArgumentException("count < 0");
        this.sync = new Sync(count);
    }

  构造函数用传入的count初始化状态数,CountDownLatch内只有一个Sync类型的属性。

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

核心函数 await

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

  await的操作转移到sync上,sync的acquireSharedInterruptibly继承自AQS。

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

  AQS内调用了doAcquireSharedInterruptibly(int 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) {
                    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);
        }
    }

  Sync重写了doAcquireSharedInterruptibly(int arg)内的tryAcquireShared(int acquires)

protected int tryAcquireShared(int acquires) {
            return (getState() == 0) ? 1 : -1;
        }

  结合AQS的代码来看,只要state不为0,线程就会进入AQS阻塞队列,进入阻塞状态。

核心函数 countDown

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

  操作同样转移到了Sync继承于AQS的方法里。

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

  Sync重写了tryReleaseShared(int releases)方法

		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成功设为0才会返回true,当某个线程将state从1减为0时,会唤醒所有线程,阻塞在await操作的线程被唤醒。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值