Lines Matching refs:next
155 * first unmatched node on match and CASing the next field of the
206 * pointer updates: Threads may sometimes shortcut the "next" link
212 * of costly-to-reclaim garbage caused by the sequential "next"
220 * pointer, we set the "next" link of the previous head to point
224 * adds some further complexity to traversal: If any "next"
353 * to be removed, we can unsplice s by CASing the next field of
358 * (i.e., with null next), then it is pinned as the target node
451 volatile Node next;
549 (k.getDeclaredField("next"));
620 Node n = q.next; // update by 2 unless singleton
626 (q = h.next) == null || !q.isMatched())
633 Node n = p.next;
661 Node n, u; // temps for reads of next & tail
668 else if ((n = p.next) != null) // not last; keep traversing
672 p = p.next; // re-read on CAS failure
677 (s = t.next) != null && // advance and retry
678 (s = s.next) != null && s != t);
759 * Returns the successor of p, or the head node if p.next has been
764 Node next = p.next;
765 return (p == next) ? head : next;
810 Node n = p.next;
822 private Node nextNode; // next node to return item for
828 * Moves to next node after prev, or first node if prev null.
843 lastPred = r; // next lastPred is old lastRet
847 Node s, n; // help with removal of lastPred.next
848 while ((s = b.next) != null &&
850 (n = s.next) != null && n != s)
857 s = (p == null) ? head : p.next;
877 else if ((n = s.next) == null)
896 public final E next() {
933 if (pred != null && pred != s && pred.next == s) {
934 Node n = s.next;
943 Node hn = h.next;
949 if (pred.next != pred && s.next != s) { // recheck if offlist
971 for (Node p = head, s, n; p != null && (s = p.next) != null; ) {
975 else if ((n = s.next) == null) // trailing node is pinned
1002 if ((p = p.next) == pred) { // stale