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

/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java91 * - 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 DLinkedBlockingQueue.java69 * 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 DExchanger.java84 * place item in a Node;
216 * uses. Note that field Node.item is not declared as volatile
221 * slot CASes, it would also be legal for the write to Node.match
282 static final class Node { class in class:Exchanger
297 static final class Participant extends ThreadLocal<Node> {
298 public Node initialValue() { return new Node(); }
310 private volatile Node[] arena;
315 private volatile Node slot;
335 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.java787 * Node in a linked list of weak iterator references.
789 private class Node extends WeakReference<Itr> { class in class:ArrayBlockingQueue.Itrs
790 Node next;
792 Node(Itr iterator, Node next) { method in class:ArrayBlockingQueue.Itrs.Node
802 private Node head;
805 private Node sweeper = null;
826 Node o, p;
827 final Node sweeper = this.sweeper;
849 final Node nex
[all...]
H A DConcurrentLinkedDeque.java87 * 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 DLinkedTransferQueue.java194 * retaining values held in other Node fields.) However, doing so
419 static final class Node { class in class:LinkedTransferQueue
422 volatile Node next;
426 final boolean casNext(Node cmp, Node val) {
431 // assert cmp == null || cmp.getClass() != Node.class;
439 Node(Object item, boolean isData) { method in class:LinkedTransferQueue.Node
516 Class<?> k = Node.class;
530 transient volatile Node head;
533 private transient volatile Node tai
[all...]
H A DConcurrentHashMap.java117 * key-value mapping is held in a Node. Most nodes are instances
118 * of the basic Node class with hash, key, value, and next
134 * list of Nodes (most often, the list has only zero or one Node).
140 * We use the top (sign) bit of Node hash fields for control
397 * Encodings for Node hash fields. See above for explanation.
420 * in bulk tasks. Subclasses of Node with a negative hash field
424 static class Node<K,V> implements Map.Entry<K,V> { class in class:ConcurrentHashMap
428 Node<K,V> next;
430 Node(int hash, K key, V val, Node< method in class:ConcurrentHashMap.Node
[all...]
H A DConcurrentSkipListMap.java284 * Node: b, n, f for predecessor, node, successor
345 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null),
365 static final class Node<K,V> { class in class:ConcurrentSkipListMap
368 volatile Node<K,V> next;
373 Node(K key, Object value, Node<K,V> next) { method in class:ConcurrentSkipListMap.Node
386 Node(Node<K,V> next) { method in class:ConcurrentSkipListMap.Node
402 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.java129 static final class Node { class in class:AbstractQueuedLongSynchronizer
131 static final Node SHARED = new Node();
133 static final Node EXCLUSIVE = null;
194 volatile Node prev;
209 volatile Node next;
227 Node nextWaiter;
243 final Node predecessor() throws NullPointerException {
244 Node p = prev;
251 Node() { // Use method in class:AbstractQueuedLongSynchronizer.Node
254 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedLongSynchronizer.Node
259 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedLongSynchronizer.Node
[all...]
H A DAbstractQueuedSynchronizer.java359 static final class Node { class in class:AbstractQueuedSynchronizer
361 static final Node SHARED = new Node();
363 static final Node EXCLUSIVE = null;
424 volatile Node prev;
439 volatile Node next;
457 Node nextWaiter;
473 final Node predecessor() throws NullPointerException {
474 Node p = prev;
481 Node() { // Use method in class:AbstractQueuedSynchronizer.Node
484 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedSynchronizer.Node
489 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedSynchronizer.Node
[all...]

Completed in 227 milliseconds