Lines Matching defs:prev
324 * +------+ prev +-----+ +-----+
337 * <p>The "prev" links (not used in original CLH locks), are mainly
447 volatile Node prev;
457 * to be null, we can scan prev's from the tail to
497 Node p = prev;
542 PREV = l.findVarHandle(Node.class, "prev", Node.class);
665 node.prev = null;
692 for (Node p = tail; p != node && p != null; p = p.prev)
785 Node pred = node.prev;
787 node.prev = pred = pred.prev;
824 * control in all acquire loops. Requires that pred == node.prev.
844 node.prev = pred = pred.prev;
1428 * field is nulled out or s.prev is no longer head, then
1436 s.prev == head && (st = s.thread) != null) ||
1438 s.prev == head && (st = s.thread) != null))
1450 for (Node p = tail; p != null && p != head; p = p.prev) {
1471 for (Node p = tail; p != null; p = p.prev)
1562 for (Node p = tail; p != null; p = p.prev) {
1582 for (Node p = tail; p != null; p = p.prev) {
1600 for (Node p = tail; p != null; p = p.prev) {
1620 for (Node p = tail; p != null; p = p.prev) {
1655 if (node.waitStatus == Node.CONDITION || node.prev == null)
1660 * node.prev can be non-null, but not yet on queue because
1684 p = p.prev;