| /libcore/ojluni/src/main/java/java/util/ |
| D | LinkedList.java | 155 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 …]
|
| D | HashMap.java | 2034 TreeNode<K,V> succ = (TreeNode<K,V>)next, pred = prev; in removeTreeNode() local
2036 tab[index] = first = succ; in removeTreeNode()
2038 pred.next = succ; in removeTreeNode()
2039 if (succ != null) in removeTreeNode()
2040 succ.prev = pred; in removeTreeNode()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| D | StampedLock.java | 1352 WNode succ, pp; // find valid successor in cancelWaiter() local
1353 while ((succ = node.next) == null || in cancelWaiter()
1354 succ.status == CANCELLED) { in cancelWaiter()
1359 if (succ == q || // ensure accurate successor in cancelWaiter()
1361 succ, succ = q)) { in cancelWaiter()
1362 if (succ == null && node == wtail) in cancelWaiter()
1368 U.compareAndSwapObject(pred, WNEXT, node, succ); in cancelWaiter()
1369 if (succ != null && (w = succ.thread) != null) { in cancelWaiter()
1370 succ.thread = null; in cancelWaiter()
1376 U.compareAndSwapObject(pp, WNEXT, pred, succ); in cancelWaiter()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentLinkedQueue.java | 298 final Node<E> succ(Node<E> p) { in succ() method in ConcurrentLinkedQueue
455 for (Node<E> p = first(); p != null; p = succ(p)) { in contains()
483 next = succ(p); in remove()
489 next = succ(p); in remove()
738 for (Node<E> p = succ(pred), q;; p = q) { in next()
746 if ((q = succ(p)) != null) in next()
775 for (Node<E> p = first(); p != null; p = succ(p)) { in writeObject()
|
| D | ConcurrentLinkedDeque.java | 720 final Node<E> succ(Node<E> p) { in succ() method in ConcurrentLinkedDeque
903 for (Node<E> p = first(); p != null; p = succ(p)) { in peekFirst()
935 for (Node<E> p = first(); p != null; p = succ(p)) { in pollFirst()
1032 for (Node<E> p = first(); p != null; p = succ(p)) { in removeFirstOccurrence()
1076 for (Node<E> p = first(); p != null; p = succ(p)) { in contains()
1430 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode()
1564 for (Node<E> p = first(); p != null; p = succ(p)) { in writeObject()
|
| D | LinkedBlockingDeque.java | 1057 private Node<E> succ(Node<E> n) { in succ() method in LinkedBlockingDeque.AbstractItr
1081 next = succ(next); in advance()
|
| D | LinkedTransferQueue.java | 758 final Node succ(Node p) { in succ() method in LinkedTransferQueue
1503 for (Node p = head; p != null; p = succ(p)) { in contains()
|
| D | ConcurrentSkipListMap.java | 599 final boolean link(Index<K,V> succ, Index<K,V> newSucc) { in link() argument
601 newSucc.right = succ; in link()
602 return n.value != null && casRight(succ, newSucc); in link()
612 final boolean unlink(Index<K,V> succ) { in unlink() argument
613 return node.value != null && casRight(succ, succ.right); in unlink()
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | LinkedList.java | 53 void linkBefore(E e, java.util.LinkedList.Node<E> succ) { in linkBefore() argument
|
| /libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
| D | LinkedBlockingDeque.java | 325 private Node<E> succ( in succ() method in LinkedBlockingDeque.AbstractItr
|