Searched refs:pred (Results 1 - 9 of 9) sorted by relevance

/libcore/luni/src/main/java/java/util/concurrent/
H A DLinkedTransferQueue.java612 Node pred = tryAppend(s, haveData);
613 if (pred == null)
616 return awaitMatch(s, pred, e, (how == TIMED), nanos);
661 * @param pred the predecessor of s, or s itself if it has no
669 private E awaitMatch(Node s, Node pred, E e, boolean timed, long nanos) { argument
684 unsplice(pred, s);
689 if ((spins = spinsFor(pred, s.isData)) > 0)
716 private static int spinsFor(Node pred, boolean haveData) { argument
717 if (MP && pred != null) {
718 if (pred
896 unsplice(Node pred, Node s) argument
[all...]
H A DConcurrentLinkedQueue.java459 Node<E> pred = null;
466 if (pred != null && next != null)
467 pred.casNext(p, next);
470 pred = p;
671 Node<E> pred, p;
674 pred = null;
676 pred = nextNode;
694 if (pred != null && next != null)
695 pred.casNext(p, next);
H A DFutureTask.java415 for (WaitNode pred = null, q = waiters, s; q != null; q = s) {
418 pred = q;
419 else if (pred != null) {
420 pred.next = s;
421 if (pred.thread == null) // check for race
H A DForkJoinTask.java440 ExceptionNode pred = null;
444 if (pred == null)
447 pred.next = next;
450 pred = e;
527 ExceptionNode pred = null;
531 if (pred == null)
534 pred.next = next;
537 pred = e;
H A DSynchronousQueue.java739 * Gets rid of cancelled node s with original predecessor pred.
741 void clean(QNode pred, QNode s) { argument
751 while (pred.next == s) { // Return early if already unlinked
770 if (sn == s || pred.casNext(s, sn))
785 if (dp == pred)
787 } else if (casCleanMe(null, pred))
H A DConcurrentLinkedDeque.java244 * - all live nodes are reachable from the last node via pred()
709 final Node<E> pred(Node<E> p) { method in class:ConcurrentLinkedDeque
917 for (Node<E> p = last(); p != null; p = pred(p)) {
951 for (Node<E> p = last(); p != null; p = pred(p)) {
1039 for (Node<E> p = last(); p != null; p = pred(p)) {
1359 Node<E> nextNode(Node<E> p) { return pred(p); }
H A DConcurrentHashMap.java527 HashEntry<K,V> pred = null;
535 if (pred == null)
538 pred.setNext(next);
545 pred = e;
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java355 Node pred = tail;
356 if (pred != null) {
357 node.prev = pred;
358 if (compareAndSetTail(pred, node)) {
359 pred.next = node;
495 Node pred = node.prev;
496 while (pred.waitStatus > 0)
497 node.prev = pred = pred.prev;
502 Node predNext = pred
540 shouldParkAfterFailedAcquire(Node pred, Node node) argument
[all...]
H A DAbstractQueuedSynchronizer.java584 Node pred = tail;
585 if (pred != null) {
586 node.prev = pred;
587 if (compareAndSetTail(pred, node)) {
588 pred.next = node;
724 Node pred = node.prev;
725 while (pred.waitStatus > 0)
726 node.prev = pred = pred.prev;
731 Node predNext = pred
769 shouldParkAfterFailedAcquire(Node pred, Node node) argument
[all...]

Completed in 67 milliseconds