Lines Matching defs:next
135 * except that nodes that appear to be the next ones to become
231 volatile SNode next; // next node in stack
245 return cmp == next &&
293 (k.getDeclaredField("next"));
315 static SNode snode(SNode s, Object e, SNode next, int mode) {
318 s.next = next;
355 casHead(h, h.next); // pop cancelled node
364 if ((h = head) != null && h.next == s)
365 casHead(h, s.next); // help s's fulfiller
370 casHead(h, h.next); // pop and retry
373 SNode m = s.next; // m is s's match
376 s = null; // use new node next time
379 SNode mn = m.next;
388 SNode m = h.next; // m is h's match
392 SNode mn = m.next;
456 s.waiter = w; // establish waiter so can park next iter
485 * follow s. We use s.next unless it too is cancelled, in
491 SNode past = s.next;
493 past = past.next;
498 casHead(p, p.next);
502 SNode n = p.next;
504 p.casNext(n, n.next);
538 volatile QNode next; // next node in queue
549 return next == cmp &&
571 * because its next pointer has been forgotten due to
575 return next == this;
590 (k.getDeclaredField("next"));
616 * old head's next node to avoid garbage retention.
621 h.next = h; // forget old next
679 QNode tn = t.next;
709 QNode m = h.next; // node to fulfill
741 int spins = ((head.next == s) ?
782 while (pred.next == s) { // Return early if already unlinked
784 QNode hn = h.next; // Absorb cancelled first node as head
792 QNode tn = t.next;
800 QNode sn = s.next;
806 QNode d = dp.next;
812 (dn = d.next) != null && // has successor