Lines Matching refs:tail
71 * and tail of the circular queue respectively.
95 /** Counter for how many times the tail wraps around.
97 * expect to use it after inserting on the tail. To support this without
147 * - Iterator to the tail of a queue of capacity 4 with 2 elems.
203 * to work after growing the buffer on the tail, so we have to
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.
462 * - index <= tail (if index > tail, that would be PTE)
466 * - head > tail
471 * - index > tail. If index <= tail, that would be BTB:
477 * - head > tail. If head <= tail, that would be BTB:
494 uint32_t tail() const { return _tail; }
535 /** Circularly decrease the tail pointer. */
552 /** Increases the tail by one.
567 /** Increases the tail by a specified number of steps
581 * A queue is full if the head is the 0^{th} element and the tail is
583 * the tail the (n-1)^{th} element.