Lines Matching refs:tail

44  (2) A 'tail' index - the point at which the consumer finds the next item in
47 Typically when the tail pointer is equal to the head pointer, the buffer is
48 empty; and the buffer is full when the head pointer is one less than the tail
51 The head index is incremented when items are added, and the tail index when
52 items are removed.  The tail index should never jump the head index, and both
118      moving the tail index.
124      will return a lower bound as the consumer controls the tail index, but the
164 	unsigned long tail = ACCESS_ONCE(buffer->tail);
166 	if (CIRC_SPACE(head, tail, buffer->size) >= 1) {
205 	unsigned long tail = buffer->tail;
207 	if (CIRC_CNT(head, tail, buffer->size) >= 1) {
210 		struct item *item = buffer[tail];
214 		/* Finish reading descriptor before incrementing tail. */
215 		smp_store_release(buffer->tail,
216 				  (tail + 1) & (buffer->size - 1));
223 before it writes the new tail pointer, which will erase the item.