Lines Matching refs:head

83      * If head exists, its waitStatus is guaranteed not to be
86 private transient volatile Node head;
187 * Sets head of queue to be node, thus dequeuing. Called only by
194 head = node;
234 * to calling unparkSuccessor of head if it needs signal.)
240 * way of trying to unparkSuccessor of head if it needs
249 Node h = head;
261 if (h == head) // loop if head changed
267 * Sets head of queue, and checks if successor may be waiting
275 Node h = head; // Record old head for check below
294 (h = head) == null || h.waitStatus < 0) {
337 if (pred != head &&
428 if (p == head && tryAcquire(arg)) {
453 if (p == head && tryAcquire(arg)) {
484 if (p == head && tryAcquire(arg)) {
516 if (p == head) {
546 if (p == head) {
580 if (p == head) {
820 Node h = head;
920 return head != tail;
933 return head != null;
949 return (head == tail) ? null : fullGetFirstQueuedThread();
957 * The first node is normally head.next. Try to get its
959 * field is nulled out or s.prev is no longer head, then
966 if (((h = head) != null && (s = h.next) != null &&
967 s.prev == head && (st = s.thread) != null) ||
968 ((h = head) != null && (s = h.next) != null &&
969 s.prev == head && (st = s.thread) != null))
976 * traversing from tail back to head to find first,
981 for (Node p = tail; p != null && p != head; p = p.prev) {
1019 return (h = head) != null &&
1065 * is at the head of the queue or the queue is empty
1069 // The correctness of this depends on head being initialized
1070 // before tail and on head.next being accurate if the current
1073 Node h = head;
1832 (AbstractQueuedLongSynchronizer.class.getDeclaredField("head"));
1845 * Initializes head and tail fields on first contention.