Lines Matching defs:head
265 int head = consumer_head++;
279 while (likely(head >= r->consumer_tail))
280 r->queue[head--] = NULL;
515 int head;
527 head = r->consumer_head - 1;
528 while (likely(head >= r->consumer_tail))
529 r->queue[head--] = NULL;
533 * Go over entries in batch, start moving head back and copy entries.
537 head = r->consumer_head - 1;
538 if (head < 0)
539 head = r->size - 1;
540 if (r->queue[head]) {
544 r->queue[head] = batch[--n];
545 r->consumer_tail = head;
547 WRITE_ONCE(r->consumer_head, head);