我正在进行LinkedBlockingQueue put( e )和函数的内部实现。
public E take() throws InterruptedException {
E x;
int c = -1;
final AtomicInteger count = this.count;
final ReentrantLock takeLock = this.takeLock;
takeLock.lockInterruptibly();
try {
while (count.get() == 0) {
notEmpty.await();
}
x = dequeue();
c = count.getAndDecrement();
if (c > 1)
**notEmpty.signal();**
} finally {
takeLock.unlock();
}
if (c == capacity)
signalNotFull();
return x;
}
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;
Node<E> node = new Node<E>(e);
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(node);
c = count.getAndIncrement();
if (c + 1 < capacity)
**notFull.signal();**
} finally {
putLock.unlock();
}
if (c == 0)
signalNotEmpty();
}在这两种方法中,在与容量进行比较之后,都没有得到在条件下调用signal()的原因。如果有人能解释的话,会非常感激的。
发布于 2018-04-20 14:02:01
下面是我可以考虑使用的一种情况:
if (c > 1)
notEmpty.signal();假设队列是空的,并且有3个线程,thread_1、thread_2、thread_3。
take(),在notEmpty.await()被堵住。take(),在notEmpty.await()被堵住。take(),在notEmpty.await()被堵住。然后,出现了另外3个线程,thread_4、thread_5、thread_6。
put(),在队列中添加一个元素,以及signal thread_1。takeLock,并尝试使用第一个元素。put(),在队列中添加另一个元素,并添加signal thread_2。takeLock,但是thread_1现在持有锁,所以它必须等待。InterruptedException并终止。c > 1 就出现了。如果signal**,thread_1不调用,则thread_3无法唤醒并接受第二个元素。signal,thread_3醒来,并接受第二个元素。https://stackoverflow.com/questions/49940745
复制相似问题