Searched defs:prev (Results 1 - 9 of 9) sorted by relevance
/libcore/luni/src/main/java/java/lang/ref/ |
H A D | FinalizerReference.java | 34 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 D | LinkedBlockingDeque.java | 65 * 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 D | ConcurrentLinkedDeque.java | 85 * ("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 537 unlinkLast(Node<E> last, Node<E> prev) argument [all...] |
H A D | LinkedTransferQueue.java | 798 * Moves to next node after prev, or first node if prev null. 800 private void advance(Node prev) { argument 824 this.lastRet = prev; 826 for (Node p = prev, s, n;;) {
|
H A D | ConcurrentHashMap.java | 1306 if ((t.prev = tl) == null) 1771 if ((p.prev = loTail) == null) 1779 if ((p.prev = hiTail) == null) 1826 if ((p.prev = tl) == null) 1864 TreeNode<K,V> prev; // needed to unlink next upon deletion field in class:ConcurrentHashMap.TreeNode 2087 f.prev = x; 2121 TreeNode<K,V> pred = p.prev; // unlink traversal pointers 2128 next.prev = pred; 2406 tb = t.prev, tn = (TreeNode<K,V>)t.next; 2409 if (tn != null && tn.prev ! [all...] |
/libcore/luni/src/main/java/java/util/ |
H A D | TreeMap.java | 287 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 D | AbstractQueuedLongSynchronizer.java | 71 * +------+ 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 D | AbstractQueuedSynchronizer.java | 301 * +------+ 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 D | caliper.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ... |
Completed in 1869 milliseconds