java linkedblockingqueue_Java LinkedBlockingQueue实现

我看着JDK LinkedBlockingQueue类而迷路了.

public void put(E e) throws InterruptedException {

if (e == null) throw new NullPointerException();

// Note: convention in all put/take/etc is to preset local var

// holding count negative to indicate failure unless set.

int c = -1;

final ReentrantLock putLock = this.putLock;

final AtomicInteger count = this.count;

putLock.lockInterruptibly();

try {

/*

* Note that count is used in wait guard even though it is

* not protected by lock. This works because count can

* only decrease at this point (all other puts are shut

* out by lock), and we (or some other waiting put) are

* signalled if it ever changes from

* capacity. Similarly for all other uses of count in

* other wait guards.

*/

while (count.get() == capacity) {

notFull.await();

}

enqueue(e);

c = count.getAndIncrement();

if (c + 1 < capacity)

notFull.signal();

} finally {

putLock.unlock();

}

if (c == 0)

signalNotEmpty();

}

请看最后一个条件(c == 0),我认为应该是(c!= 0)

谢谢,我了解.

但是我还有一个关于LinkedBlockingQueue实现的问题.

入队和出队功能不得相交.我看到执行put()时,也可以执行take().头和尾对象没有同步,因为入队和出队可以在不同线程中同时工作.它不是线程安全的,可能会发生故障.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值