Lines Matching refs:head
61 * <em>head</em> of the queue is the element that the first queued
164 * old head pointers), but references in Queue nodes must be
302 /** The head (top) of the stack */
303 volatile SNode head;
306 return h == head &&
314 * and CASes of head and to avoid surges of garbage when CASes
354 SNode h = head;
367 if ((h = head) != null && h.next == s)
422 * to be at the head of the stack, calls to park are
466 * Returns true if node s is at head or there is an active
470 SNode h = head;
496 // Absorb cancelled nodes at head
498 while ((p = head) != null && p != past && p.isCancelled())
517 (TransferStack.class.getDeclaredField("head"));
595 transient volatile QNode head;
607 head = h;
612 * Tries to cas nh as new head; if successful, unlink
613 * old head's next node to avoid garbage retention.
616 if (h == head &&
655 * advance head and tail on behalf of other stalled/slow
659 * seeing uninitialized head or tail values. This never
672 QNode h = head;
699 advanceHead(t, s); // unlink if head
708 if (t != tail || m == null || h != head)
739 int spins = (head.next == s)
780 QNode h = head;
781 QNode hn = h.next; // Absorb cancelled first node as head
827 (TransferQueue.class.getDeclaredField("head"));
913 * Retrieves and removes the head of this queue, waiting if necessary
916 * @return the head of this queue
928 * Retrieves and removes the head of this queue, waiting
932 * @return the head of this queue, or {@code null} if the
944 * Retrieves and removes the head of this queue, if another thread
947 * @return the head of this queue, or {@code null} if no