Lines Matching defs:next
121 * - There is exactly one (last) Node with a null next reference,
180 volatile Node<E> next;
215 (k.getDeclaredField("next"));
228 * - (tmp = head).next != tmp || tmp != head
238 * node with node.next == null) can be reached in O(1) time.
246 * - tail.next may or may not be self-pointing to tail.
309 * Returns the successor of p, or the head node if p.next has been
314 Node<E> next = p.next;
315 return (p == next) ? head : next;
330 Node<E> q = p.next;
341 // Lost CAS race to another thread; re-read next
365 updateHead(h, ((q = p.next) != null) ? q : p);
368 else if ((q = p.next) == null) {
385 if (item != null || (q = p.next) == null) {
410 if (hasItem || (q = p.next) == null) {
494 Node<E> next = succ(p);
495 if (pred != null && next != null)
496 pred.casNext(p, next);
538 Node<E> q = p.next;
548 if (last.next == null)
553 // Lost CAS race to another thread; re-read next
679 * the following next() call even if it was in the process of
694 * Moves to next valid node and returns item to return for
695 * next(), or null if no such.
723 Node<E> next = succ(p);
724 if (pred != null && next != null)
725 pred.casNext(p, next);
726 p = next;
735 public E next() {