Searched defs:pred (Results 1 - 5 of 5) sorted by relevance
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedDeque.java | 270 * - all live nodes are reachable from the last node via pred() 731 final Node<E> pred(Node<E> p) { method in class:ConcurrentLinkedDeque 912 for (Node<E> p = last(); p != null; p = pred(p)) { 946 for (Node<E> p = last(); p != null; p = pred(p)) { 1056 for (Node<E> p = last(); p != null; p = pred(p)) { 1436 Node<E> nextNode(Node<E> p) { return pred(p); }
|
H A D | LinkedTransferQueue.java | 636 Node pred = tryAppend(s, haveData); 637 if (pred == null) 640 return awaitMatch(s, pred, e, (how == TIMED), nanos); 685 * @param pred the predecessor of s, or s itself if it has no 693 private E awaitMatch(Node s, Node pred, E e, boolean timed, long nanos) { argument 708 unsplice(pred, s); // try to unlink and cancel 713 if ((spins = spinsFor(pred, s.isData)) > 0) 739 private static int spinsFor(Node pred, boolean haveData) { argument 740 if (MP && pred != null) { 741 if (pred 1135 unsplice(Node pred, Node s) argument [all...] |
H A D | SynchronousQueue.java | 767 * Gets rid of cancelled node s with original predecessor pred. 769 void clean(QNode pred, QNode s) { argument 779 while (pred.next == s) { // Return early if already unlinked 798 if (sn == s || pred.casNext(s, sn)) 813 if (dp == pred) 815 } else if (casCleanMe(null, pred))
|
/libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 316 Node pred = node.prev; 317 while (pred.waitStatus > 0) 318 node.prev = pred = pred.prev; 323 Node predNext = pred.next; 331 if (node == tail && compareAndSetTail(node, pred)) { 332 pred.compareAndSetNext(predNext, null); 334 // If successor needs signal, try to set pred's next-link 337 if (pred != head && 338 ((ws = pred 361 shouldParkAfterFailedAcquire(Node pred, Node node) argument [all...] |
H A D | AbstractQueuedSynchronizer.java | 782 Node pred = node.prev; 783 while (pred.waitStatus > 0) 784 node.prev = pred = pred.prev; 789 Node predNext = pred.next; 797 if (node == tail && compareAndSetTail(node, pred)) { 798 pred.compareAndSetNext(predNext, null); 800 // If successor needs signal, try to set pred's next-link 803 if (pred != head && 804 ((ws = pred 827 shouldParkAfterFailedAcquire(Node pred, Node node) argument [all...] |
Completed in 59 milliseconds