Searched defs:prev (Results 1 - 9 of 9) sorted by relevance

/libcore/ojluni/src/main/java/sun/misc/
H A DCleaner.java76 prev = null; field in class:Cleaner
81 first.prev = cl;
98 first = cl.prev;
101 cl.next.prev = cl.prev;
102 if (cl.prev != null)
103 cl.prev.next = cl.next;
107 cl.prev = cl;
/libcore/luni/src/main/java/java/lang/ref/
H A DFinalizerReference.java34 private FinalizerReference<?> prev; field in class:FinalizerReference
56 reference.prev = null;
59 head.prev = reference;
68 FinalizerReference<?> prev = reference.prev;
70 reference.prev = null;
71 if (prev != null) {
72 prev.next = next;
77 next.prev = prev;
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedDeque.java85 * ("prev") and successor ("next") nodes:
87 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
94 * prev reference that terminates any chain of prev references
100 * A new element is added atomically by CASing the null prev or
108 * A "self-link" is a next or prev reference that is the same node:
109 * p.prev == p or p.next == p
116 * (p.prev == null && p.next != p) ||
117 * (p.next == null && p.prev != p)
122 * following prev pointer
263 volatile Node<E> prev; field in class:ConcurrentLinkedDeque.Node
533 unlinkLast(Node<E> last, Node<E> prev) argument
[all...]
H A DLinkedBlockingDeque.java68 * or "last" (for prev links).
93 Node<E> prev; field in class:LinkedBlockingDeque.Node
111 * (first.prev == null && first.item != null)
198 f.prev = node;
212 node.prev = l;
239 n.prev = null;
253 Node<E> p = l.prev;
256 l.prev = l; // help GC
272 Node<E> p = x.prev;
280 n.prev
[all...]
H A DLinkedTransferQueue.java904 * Moves to next node after prev, or first node if prev null.
906 private void advance(Node prev) { argument
930 this.lastRet = prev;
932 for (Node p = prev, s, n;;) {
H A DConcurrentHashMap.java1489 if ((t.prev = tl) == null)
2499 if ((p.prev = loTail) == null)
2507 if ((p.prev = hiTail) == null)
2655 if ((p.prev = tl) == null)
2693 TreeNode<K,V> prev; // needed to unlink next upon deletion field in class:ConcurrentHashMap.TreeNode
2935 f.prev = x;
2969 TreeNode<K,V> pred = p.prev; // unlink traversal pointers
2976 next.prev = pred;
3254 tb = t.prev, tn = (TreeNode<K,V>)t.next;
3257 if (tn != null && tn.prev !
[all...]
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DStampedLock.java280 volatile WNode prev; field in class:StampedLock.WNode
286 WNode(int m, WNode p) { mode = m; prev = p; }
986 for (WNode t = wtail; t != null && t != h; t = t.prev)
1025 else if (node.prev != p)
1026 node.prev = p;
1047 node.prev = null;
1067 if ((np = node.prev) != p) {
1074 if ((pp = p.prev) != null) {
1075 node.prev = pp;
1089 whead == h && node.prev
[all...]
H A DAbstractQueuedSynchronizer.java294 * +------+ prev +-----+ +-----+
307 * <p>The "prev" links (not used in original CLH locks), are mainly
417 volatile Node prev; field in class:AbstractQueuedSynchronizer.Node
427 * to be null, we can scan prev's from the tail to
467 Node p = prev;
509 (Node.class.getDeclaredField("prev"));
634 node.prev = null;
661 for (Node p = tail; p != node && p != null; p = p.prev)
754 Node pred = node.prev;
756 node.prev
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DLinkedList.java92 * (first.prev == null && first.item != null)
132 f.prev = newNode;
157 final Node<E> pred = succ.prev;
159 succ.prev = newNode;
181 next.prev = null;
193 final Node<E> prev = l.prev;
195 l.prev = null; // help GC
196 last = prev;
197 if (prev
974 Node<E> prev; field in class:LinkedList.Node
976 Node(Node<E> prev, E element, Node<E> next) argument
[all...]

Completed in 138 milliseconds