Home
last modified time | relevance | path

Searched refs:succ (Results 1 – 7 of 7) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DLinkedList.java155 void linkBefore(E e, Node<E> succ) { in linkBefore() argument
157 final Node<E> pred = succ.prev; in linkBefore()
158 final Node<E> newNode = new Node<>(pred, e, succ); in linkBefore()
159 succ.prev = newNode; in linkBefore()
413 Node<E> pred, succ; in addAll()
415 succ = null; in addAll()
418 succ = node(index); in addAll()
419 pred = succ.prev; in addAll()
432 if (succ == null) { in addAll()
435 pred.next = succ; in addAll()
[all …]
/libcore/luni/src/main/java/java/util/concurrent/locks/
DStampedLock.java1323 WNode succ, pp; // find valid successor in cancelWaiter() local
1324 while ((succ = node.next) == null || in cancelWaiter()
1325 succ.status == CANCELLED) { in cancelWaiter()
1330 if (succ == q || // ensure accurate successor in cancelWaiter()
1332 succ, succ = q)) { in cancelWaiter()
1333 if (succ == null && node == wtail) in cancelWaiter()
1339 U.compareAndSwapObject(pred, WNEXT, node, succ); in cancelWaiter()
1340 if (succ != null && (w = succ.thread) != null) { in cancelWaiter()
1341 succ.thread = null; in cancelWaiter()
1347 U.compareAndSwapObject(pp, WNEXT, pred, succ); in cancelWaiter()
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentLinkedQueue.java269 final Node<E> succ(Node<E> p) { in succ() method in ConcurrentLinkedQueue
426 for (Node<E> p = first(); p != null; p = succ(p)) { in contains()
454 next = succ(p); in remove()
460 next = succ(p); in remove()
709 for (Node<E> p = succ(pred), q;; p = q) { in next()
717 if ((q = succ(p)) != null) in next()
746 for (Node<E> p = first(); p != null; p = succ(p)) { in writeObject()
DConcurrentLinkedDeque.java691 final Node<E> succ(Node<E> p) { in succ() method in ConcurrentLinkedDeque
874 for (Node<E> p = first(); p != null; p = succ(p)) { in peekFirst()
906 for (Node<E> p = first(); p != null; p = succ(p)) { in pollFirst()
1003 for (Node<E> p = first(); p != null; p = succ(p)) { in removeFirstOccurrence()
1047 for (Node<E> p = first(); p != null; p = succ(p)) { in contains()
1401 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode()
1535 for (Node<E> p = first(); p != null; p = succ(p)) { in writeObject()
DLinkedBlockingDeque.java1028 private Node<E> succ(Node<E> n) { in succ() method in LinkedBlockingDeque.AbstractItr
1052 next = succ(next); in advance()
DLinkedTransferQueue.java729 final Node succ(Node p) { in succ() method in LinkedTransferQueue
1474 for (Node p = head; p != null; p = succ(p)) { in contains()
DConcurrentSkipListMap.java570 final boolean link(Index<K,V> succ, Index<K,V> newSucc) { in link() argument
572 newSucc.right = succ; in link()
573 return n.value != null && casRight(succ, newSucc); in link()
583 final boolean unlink(Index<K,V> succ) { in unlink() argument
584 return node.value != null && casRight(succ, succ.right); in unlink()