Lines Matching defs:Node
101 * enqueued Node by either acquiring the putLock (via fullyLock)
106 * keep all Nodes GC-reachable from a predecessor dequeued Node.
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
122 static class Node<E> {
127 * - the real successor Node
128 * - this Node, meaning the successor is head.next
131 Node<E> next;
133 Node(E x) { item = x; }
146 transient Node<E> head;
152 private transient Node<E> last;
198 private void enqueue(Node<E> node) {
212 Node<E> h = head;
213 Node<E> first = h.next;
263 last = head = new Node<E>(null);
287 enqueue(new Node<E>(e));
336 Node<E> node = new Node<E>(e);
387 enqueue(new Node<E>(e));
416 Node<E> node = new Node<E>(e);
517 * Unlinks interior Node p with predecessor trail.
519 void unlink(Node<E> p, Node<E> trail) {
546 for (Node<E> trail = head, p = trail.next;
572 for (Node<E> p = head.next; p != null; p = p.next)
600 for (Node<E> p = head.next; p != null; p = p.next)
653 for (Node<E> p = head.next; p != null; p = p.next)
674 for (Node<E> p, h = head; (p = h.next) != null; h = p) {
716 Node<E> h = head;
720 Node<E> p = h.next;
763 private Node<E> current;
764 private Node<E> lastRet;
792 for (Node<E> p = current, q;; p = q) {
812 Node<E> node = lastRet;
814 for (Node<E> trail = head, p = trail.next;
832 Node<E> current; // current node; null until initialized
844 Node<E> h;
853 Node<E> p = current;
887 Node<E> p = current;
981 for (Node<E> p = head.next; p != null; p = p.next)
1004 last = head = new Node<E>(null);