/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 91 * - There is exactly one (last) Node with a null next reference, 92 * which is CASed when enqueueing. This last Node can be 98 * reference of a Node to null atomically removes it from the 101 * head to advance. A dequeued Node may remain in use 106 * from a predecessor dequeued Node. That would cause two problems: 109 * a Node was tenured while live, which generational GCs have a 114 * linking a Node that has just been dequeued to itself. Such a 127 * CASing a Node's item reference to null atomically removes the 135 * When constructing a Node (before enqueuing it) we avoid paying 140 * Both head and tail may or may not point to a Node wit 148 private static class Node<E> { class in class:ConcurrentLinkedQueue 156 Node(E item) { method in class:ConcurrentLinkedQueue.Node [all...] |
H A D | LinkedBlockingQueue.java | 69 * enqueued Node by either acquiring the putLock (via fullyLock) 74 * keep all Nodes GC-reachable from a predecessor dequeued Node. 78 * a Node was tenured while live, which generational GCs have a 83 * linking a Node that has just been dequeued to itself. Such a 90 static class Node<E> { class in class:LinkedBlockingQueue 95 * - the real successor Node 96 * - this Node, meaning the successor is head.next 99 Node<E> next; 101 Node(E x) { item = x; } method in class:LinkedBlockingQueue.Node 114 transient Node< [all...] |
H A D | Exchanger.java | 81 * place item in a Node; 213 * uses. Note that field Node.item is not declared as volatile 218 * slot CASes, it would also be legal for the write to Node.match 279 static final class Node { class in class:Exchanger 294 static final class Participant extends ThreadLocal<Node> { 295 public Node initialValue() { return new Node(); } 307 private volatile Node[] arena; 312 private volatile Node slot; 332 Node[] [all...] |
H A D | LinkedBlockingDeque.java | 54 * keep all Nodes GC-reachable from a predecessor dequeued Node. 58 * a Node was tenured while live, which generational GCs have a 63 * linking a Node that has just been dequeued to itself. Such a 78 static final class Node<E> { class in class:LinkedBlockingDeque 86 * - the real predecessor Node 87 * - this Node, meaning the predecessor is tail 90 Node<E> prev; 94 * - the real successor Node 95 * - this Node, meaning the successor is head 98 Node< 100 Node(E x) { method in class:LinkedBlockingDeque.Node [all...] |
H A D | ArrayBlockingQueue.java | 765 * Node in a linked list of weak iterator references. 767 private class Node extends WeakReference<Itr> { class in class:ArrayBlockingQueue.Itrs 768 Node next; 770 Node(Itr iterator, Node next) { method in class:ArrayBlockingQueue.Itrs.Node 780 private Node head; 783 private Node sweeper; 804 Node o, p; 805 final Node sweeper = this.sweeper; 827 final Node nex [all...] |
H A D | ConcurrentLinkedDeque.java | 87 * class Node<E> { volatile Node<E> prev, next; volatile E item; } 234 private transient volatile Node<E> head; 248 private transient volatile Node<E> tail; 250 private static final Node<Object> PREV_TERMINATOR, NEXT_TERMINATOR; 253 Node<E> prevTerminator() { 254 return (Node<E>) PREV_TERMINATOR; 258 Node<E> nextTerminator() { 259 return (Node<E>) NEXT_TERMINATOR; 262 static final class Node< class in class:ConcurrentLinkedDeque 267 Node() { // default constructor for NEXT_TERMINATOR, PREV_TERMINATOR method in class:ConcurrentLinkedDeque.Node 274 Node(E item) { method in class:ConcurrentLinkedDeque.Node [all...] |
H A D | LinkedTransferQueue.java | 193 * retaining values held in other Node fields.) However, doing so 418 static final class Node { class in class:LinkedTransferQueue 421 volatile Node next; 425 final boolean casNext(Node cmp, Node val) { 430 // assert cmp == null || cmp.getClass() != Node.class; 438 Node(Object item, boolean isData) { method in class:LinkedTransferQueue.Node 515 Class<?> k = Node.class; 529 transient volatile Node head; 532 private transient volatile Node tai [all...] |
H A D | ConcurrentHashMap.java | 118 * key-value mapping is held in a Node. Most nodes are instances 119 * of the basic Node class with hash, key, value, and next 135 * list of Nodes (most often, the list has only zero or one Node). 141 * We use the top (sign) bit of Node hash fields for control 429 * Encodings for Node hash fields. See above for explanation. 452 * in bulk tasks. Subclasses of Node with a negative hash field 456 static class Node<K,V> implements Map.Entry<K,V> { class in class:ConcurrentHashMap 460 Node<K,V> next; 462 Node(int hash, K key, V val, Node< method in class:ConcurrentHashMap.Node [all...] |
H A D | ConcurrentSkipListMap.java | 285 * Node: b, n, f for predecessor, node, successor 354 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null), 374 static final class Node<K,V> { class in class:ConcurrentSkipListMap 377 volatile Node<K,V> next; 382 Node(K key, Object value, Node<K,V> next) { method in class:ConcurrentSkipListMap.Node 395 Node(Node<K,V> next) { method in class:ConcurrentSkipListMap.Node 411 boolean casNext(Node<K,V> cmp, Node< [all...] |
/libcore/luni/src/main/java/org/w3c/dom/ |
H A D | Node.java | 16 * The <code>Node</code> interface is the primary datatype for the entire 18 * While all objects implementing the <code>Node</code> interface expose 20 * <code>Node</code> interface may have children. For example, 136 public interface Node { interface 227 public Node getParentNode(); 240 public Node getFirstChild(); 246 public Node getLastChild(); 252 public Node getPreviousSibling(); 258 public Node getNextSibling(); 309 public Node insertBefor [all...] |
/libcore/luni/src/main/java/java/util/ |
H A D | TreeMap.java | 77 Node<K, V> root; 196 Node<K, V> node = removeInternalByKey(key); 240 Node<K, V> created = find(key, Relation.CREATE); 251 Node<K, V> find(K key, Relation relation) { 257 root = new Node<K, V>(null, key); 275 Node<K, V> nearest = root; 298 Node<K, V> child = (comparison < 0) ? nearest.left : nearest.right; 320 Node<K, V> created = new Node<K, V>(nearest, key); 338 Node< 733 static class Node<K, V> implements Map.Entry<K, V> { class in class:TreeMap 741 Node(Node<K, V> parent, K key) { method in class:TreeMap.Node [all...] |
/libcore/luni/src/main/java/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 130 static final class Node { class in class:AbstractQueuedLongSynchronizer 132 static final Node SHARED = new Node(); 134 static final Node EXCLUSIVE = null; 195 volatile Node prev; 210 volatile Node next; 228 Node nextWaiter; 244 final Node predecessor() throws NullPointerException { 245 Node p = prev; 252 Node() { // Use method in class:AbstractQueuedLongSynchronizer.Node 255 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedLongSynchronizer.Node 260 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedLongSynchronizer.Node [all...] |
H A D | AbstractQueuedSynchronizer.java | 356 static final class Node { class in class:AbstractQueuedSynchronizer 358 static final Node SHARED = new Node(); 360 static final Node EXCLUSIVE = null; 421 volatile Node prev; 436 volatile Node next; 454 Node nextWaiter; 470 final Node predecessor() throws NullPointerException { 471 Node p = prev; 478 Node() { // Use method in class:AbstractQueuedSynchronizer.Node 481 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedSynchronizer.Node 486 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedSynchronizer.Node [all...] |