Lines Matching refs:head
70 * characters '[' and ']' are added to mark the entries that hold the head
145 * - Iterator to the head of a queue of capacity 4 with 2 elems.
288 * if it is pointing to the head element, unless the queue is full
290 * the iterator round equals the cq round unless the head is at the
296 return _cq && !(_idx == _cq->head() &&
439 * - head is small than tail and:
440 * - It is greater than both head and tail.
442 * - It is less than both head and tail.
444 * - It is greater than the tail and not than the head.
464 * - head <= index
466 * - head > tail
475 * - index >= head. If index < head, that would be BTB:
477 * - head > tail. If head <= tail, that would be BTB:
493 uint32_t head() const { return _head; }
517 /** Circularly increase the head pointer.
518 * By increasing the head pointer we are removing elements from
581 * A queue is full if the head is the 0^{th} element and the tail is
582 * the (size-1)^{th} element, or if the head is the n^{th} element and