Searched defs:Node (Results 1 - 12 of 12) sorted by relevance

/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java92 * - There is exactly one (last) Node with a null next reference,
93 * which is CASed when enqueueing. This last Node can be
99 * reference of a Node to null atomically removes it from the
102 * head to advance. A dequeued Node may remain in use
107 * from a predecessor dequeued Node. That would cause two problems:
110 * a Node was tenured while live, which generational GCs have a
115 * linking a Node that has just been dequeued to itself. Such a
128 * CASing a Node's item reference to null atomically removes the
136 * When constructing a Node (before enqueuing it) we avoid paying
141 * Both head and tail may or may not point to a Node wit
149 private static class Node<E> { class in class:ConcurrentLinkedQueue
157 Node(E item) { method in class:ConcurrentLinkedQueue.Node
[all...]
H A DExchanger.java80 * a Node containing both an Item to offer and a "hole" waiting to
82 * slot is null, it CAS'es (compareAndSets) a Node there and waits
252 private static final class Node extends AtomicReference<Object> { class in class:Exchanger
263 public Node(Object item) { method in class:Exchanger.Node
310 Node me = new Node(item); // Create in case occupying
321 Node you = (Node)y; // Transfer item
336 me = new Node(item); // Throw away cancelled node
414 private static boolean tryCancel(Node nod
[all...]
H A DLinkedBlockingQueue.java70 * enqueued Node by either acquiring the putLock (via fullyLock)
75 * keep all Nodes GC-reachable from a predecessor dequeued Node.
79 * a Node was tenured while live, which generational GCs have a
84 * linking a Node that has just been dequeued to itself. Such a
91 static class Node<E> { class in class:LinkedBlockingQueue
96 * - the real successor Node
97 * - this Node, meaning the successor is head.next
100 Node<E> next;
102 Node(E x) { item = x; } method in class:LinkedBlockingQueue.Node
115 transient Node<
[all...]
H A DLinkedBlockingDeque.java54 * 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 DArrayBlockingQueue.java775 * Node in a linked list of weak iterator references.
777 private class Node extends WeakReference<Itr> { class in class:ArrayBlockingQueue.Itrs
778 Node next;
780 Node(Itr iterator, Node next) { method in class:ArrayBlockingQueue.Itrs.Node
790 private Node head;
793 private Node sweeper = null;
814 Node o, p;
815 final Node sweeper = this.sweeper;
837 final Node nex
[all...]
H A DConcurrentLinkedDeque.java90 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
237 private transient volatile Node<E> head;
251 private transient volatile Node<E> tail;
253 private static final Node<Object> PREV_TERMINATOR, NEXT_TERMINATOR;
256 Node<E> prevTerminator() {
257 return (Node<E>) PREV_TERMINATOR;
261 Node<E> nextTerminator() {
262 return (Node<E>) NEXT_TERMINATOR;
265 static final class Node< class in class:ConcurrentLinkedDeque
270 Node() { // default constructor for NEXT_TERMINATOR, PREV_TERMINATOR method in class:ConcurrentLinkedDeque.Node
277 Node(E item) { method in class:ConcurrentLinkedDeque.Node
[all...]
H A DLinkedTransferQueue.java195 * retaining values held in other Node fields.) However, doing so
420 static final class Node { class in class:LinkedTransferQueue
423 volatile Node next;
427 final boolean casNext(Node cmp, Node val) {
432 // assert cmp == null || cmp.getClass() != Node.class;
440 Node(Object item, boolean isData) { method in class:LinkedTransferQueue.Node
517 Class<?> k = Node.class;
531 transient volatile Node head;
534 private transient volatile Node tai
[all...]
H A DConcurrentSkipListMap.java283 * Node: b, n, f for predecessor, node, successor
344 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null),
364 static final class Node<K,V> { class in class:ConcurrentSkipListMap
367 volatile Node<K,V> next;
372 Node(K key, Object value, Node<K,V> next) { method in class:ConcurrentSkipListMap.Node
385 Node(Node<K,V> next) { method in class:ConcurrentSkipListMap.Node
401 boolean casNext(Node<K,V> cmp, Node<
[all...]
/libcore/luni/src/main/java/org/w3c/dom/
H A DNode.java16 * 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 DTreeMap.java77 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 DAbstractQueuedLongSynchronizer.java127 static final class Node { class in class:AbstractQueuedLongSynchronizer
129 static final Node SHARED = new Node();
131 static final Node EXCLUSIVE = null;
192 volatile Node prev;
207 volatile Node next;
225 Node nextWaiter;
241 final Node predecessor() throws NullPointerException {
242 Node p = prev;
249 Node() { // Use method in class:AbstractQueuedLongSynchronizer.Node
252 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedLongSynchronizer.Node
257 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedLongSynchronizer.Node
[all...]
H A DAbstractQueuedSynchronizer.java356 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...]

Completed in 1866 milliseconds