Searched defs:pred (Results 1 - 5 of 5) sorted by relevance
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedDeque.java | 241 * - all live nodes are reachable from the last node via pred() 702 final Node<E> pred(Node<E> p) { method in class:ConcurrentLinkedDeque 883 for (Node<E> p = last(); p != null; p = pred(p)) { 917 for (Node<E> p = last(); p != null; p = pred(p)) { 1027 for (Node<E> p = last(); p != null; p = pred(p)) { 1407 Node<E> nextNode(Node<E> p) { return pred(p); }
|
H A D | LinkedTransferQueue.java | 607 Node pred = tryAppend(s, haveData); 608 if (pred == null) 611 return awaitMatch(s, pred, e, (how == TIMED), nanos); 656 * @param pred the predecessor of s, or s itself if it has no 664 private E awaitMatch(Node s, Node pred, E e, boolean timed, long nanos) { argument 679 unsplice(pred, s); // try to unlink and cancel 684 if ((spins = spinsFor(pred, s.isData)) > 0) 710 private static int spinsFor(Node pred, boolean haveData) { argument 711 if (MP && pred != null) { 712 if (pred 1106 unsplice(Node pred, Node s) argument [all...] |
H A D | SynchronousQueue.java | 738 * Gets rid of cancelled node s with original predecessor pred. 740 void clean(QNode pred, QNode s) { argument 750 while (pred.next == s) { // Return early if already unlinked 769 if (sn == s || pred.casNext(s, sn)) 784 if (dp == pred) 786 } else if (casCleanMe(null, pred))
|
/libcore/luni/src/main/java/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 287 Node pred = node.prev; 288 while (pred.waitStatus > 0) 289 node.prev = pred = pred.prev; 294 Node predNext = pred.next; 302 if (node == tail && compareAndSetTail(node, pred)) { 303 pred.compareAndSetNext(predNext, null); 305 // If successor needs signal, try to set pred's next-link 308 if (pred != head && 309 ((ws = pred 332 shouldParkAfterFailedAcquire(Node pred, Node node) argument [all...] |
H A D | AbstractQueuedSynchronizer.java | 754 Node pred = node.prev; 755 while (pred.waitStatus > 0) 756 node.prev = pred = pred.prev; 761 Node predNext = pred.next; 769 if (node == tail && compareAndSetTail(node, pred)) { 770 pred.compareAndSetNext(predNext, null); 772 // If successor needs signal, try to set pred's next-link 775 if (pred != head && 776 ((ws = pred 799 shouldParkAfterFailedAcquire(Node pred, Node node) argument [all...] |
Completed in 80 milliseconds