Lines Matching refs:next
71 * mechanical sense that when a shared mode acquire succeeds, the next
342 * <p>We also use "next" links to implement blocking mechanics.
344 * predecessor signals the next node to wake up by traversing
345 * next link to determine which thread it is. Determination of
347 * the "next" fields of their predecessors. This is solved
350 * (Or, said differently, the next-links are an optimization
393 * waitStatus value to indicate the next acquireShared should
452 * assign next field of a predecessor until after attachment,
453 * so seeing a null next field does not necessarily mean that
454 * node is at end of queue. However, if a next field appears
456 * double-check. The next field of cancelled nodes is set to
460 volatile Node next;
469 * Link to next node waiting on condition, or the special
592 t.next = node;
612 pred.next = node;
650 * just the next node. But if cancelled or apparently null,
654 Node s = node.next;
712 * Try to signal next queued node if:
718 * The next node is waiting in shared mode,
727 Node s = node.next;
755 Node predNext = pred.next;
766 // If successor needs signal, try to set pred's next-link
773 Node next = node.next;
774 if (next != null && next.waitStatus <= 0)
775 compareAndSetNext(pred, predNext, next);
780 node.next = node; // help GC
809 pred.next = node;
863 p.next = null; // help GC
890 p.next = null; // help GC
921 p.next = null; // help GC
957 p.next = null; // help GC
989 p.next = null; // help GC
1024 p.next = null; // help GC
1398 * The first node is normally head.next. Try to get its
1407 if (((h = head) != null && (s = h.next) != null &&
1409 ((h = head) != null && (s = h.next) != null &&
1414 * Head's next field might not have been set yet, or may have
1463 (s = h.next) != null &&
1513 // before tail and on head.next being accurate if the current
1519 ((s = h.next) == null || s.thread != Thread.currentThread());
1633 if (node.next != null) // If has successor, it must be on queue
1888 Node next = first.nextWaiter;
1891 first = next;
1913 Node next = t.nextWaiter;
1917 firstWaiter = next;
1919 trail.nextWaiter = next;
1920 if (next == null)
1925 t = next;
2293 (Node.class.getDeclaredField("next"));
2323 * CAS next field of a node.