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

/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 DLinkedBlockingDeque.java65 * or "last" (for prev links).
90 Node<E> prev; field in class:LinkedBlockingDeque.Node
108 * (first.prev == null && first.item != null)
195 f.prev = node;
209 node.prev = l;
236 n.prev = null;
250 Node<E> p = l.prev;
253 l.prev = l; // help GC
269 Node<E> p = x.prev;
277 n.prev
[all...]
H A DConcurrentLinkedDeque.java87 * ("prev") and successor ("next") nodes:
89 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
96 * prev reference that terminates any chain of prev references
102 * A new element is added atomically by CASing the null prev or
110 * A "self-link" is a next or prev reference that is the same node:
111 * p.prev == p or p.next == p
118 * (p.prev == null && p.next != p) ||
119 * (p.next == null && p.prev != p)
124 * following prev pointer
265 volatile Node<E> prev; field in class:ConcurrentLinkedDeque.Node
539 unlinkLast(Node<E> last, Node<E> prev) argument
[all...]
H A DLinkedTransferQueue.java799 * Moves to next node after prev, or first node if prev null.
801 private void advance(Node prev) { argument
825 this.lastRet = prev;
827 for (Node p = prev, s, n;;) {
/libcore/luni/src/main/java/java/util/
H A DTreeMap.java287 return nearest.prev();
313 return nearest.prev();
817 public Node<K, V> prev() { method in class:TreeMap.Node
898 next = next.prev();
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java71 * +------+ prev +-----+ +-----+
84 * <p>The "prev" links (not used in original CLH locks), are mainly
194 volatile Node prev; field in class:AbstractQueuedLongSynchronizer.Node
204 * to be null, we can scan prev's from the tail to
244 Node p = prev;
339 node.prev = t;
359 node.prev = pred;
379 node.prev = null;
406 for (Node t = tail; t != null && t != node; t = t.prev)
497 Node pred = node.prev;
[all...]
H A DAbstractQueuedSynchronizer.java301 * +------+ prev +-----+ +-----+
314 * <p>The "prev" links (not used in original CLH locks), are mainly
424 volatile Node prev; field in class:AbstractQueuedSynchronizer.Node
434 * to be null, we can scan prev's from the tail to
474 Node p = prev;
569 node.prev = t;
589 node.prev = pred;
609 node.prev = null;
636 for (Node t = tail; t != null && t != node; t = t.prev)
727 Node pred = node.prev;
[all...]
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 2231 milliseconds