Home | History | Annotate | Download | only in concurrent

Lines Matching defs:putLock

85      * A variant of the "two lock queue" algorithm.  The putLock gates
99 * Whenever an element is enqueued, the putLock is acquired and
101 * enqueued Node by either acquiring the putLock (via fullyLock)
161 private final ReentrantLock putLock = new ReentrantLock();
164 private final Condition notFull = putLock.newCondition();
184 final ReentrantLock putLock = this.putLock;
185 putLock.lock();
189 putLock.unlock();
199 // assert putLock.isHeldByCurrentThread();
225 putLock.lock();
234 putLock.unlock();
241 // return (putLock.isHeldByCurrentThread() &&
278 final ReentrantLock putLock = this.putLock;
279 putLock.lock(); // Never contended, but necessary for visibility
292 putLock.unlock();
337 final ReentrantLock putLock = this.putLock;
339 putLock.lockInterruptibly();
357 putLock.unlock();
378 final ReentrantLock putLock = this.putLock;
380 putLock.lockInterruptibly();
392 putLock.unlock();
417 final ReentrantLock putLock = this.putLock;
418 putLock.lock();
427 putLock.unlock();