Lines Matching defs:consumer_head
33 int consumer_head ____cacheline_aligned_in_smp; /* next valid entry */
172 return READ_ONCE(r->queue[r->consumer_head]);
197 return !r->queue[READ_ONCE(r->consumer_head)];
261 /* Note: we must keep consumer_head valid at all times for __ptr_ring_empty
264 int consumer_head = r->consumer_head;
265 int head = consumer_head++;
272 if (unlikely(consumer_head - r->consumer_tail >= r->batch ||
273 consumer_head >= r->size)) {
281 r->consumer_tail = consumer_head;
283 if (unlikely(consumer_head >= r->size)) {
284 consumer_head = 0;
288 WRITE_ONCE(r->consumer_head, consumer_head);
494 r->producer = r->consumer_head = r->consumer_tail = 0;
527 head = r->consumer_head - 1;
530 r->consumer_tail = r->consumer_head;
537 head = r->consumer_head - 1;
547 WRITE_ONCE(r->consumer_head, head);
576 r->consumer_head = 0;