Lines Matching refs:ring
25 * Basic ring buffer. 'head' is incremented in _queue(), and
27 * that we know if the ring is full or empty, when
28 * 'head' == 'tail'. 'entries' is the ring size, and
30 * modulus to get the remainder on ring increment.
123 struct aio_ring *ring = (struct aio_ring*) aio_ctx;
126 head = ring->head;
128 if (head == ring->tail) {
133 events[i] = ring->events[head];
135 ring->head = (head + 1) % ring->nr;
337 * care about the user ring. If that fails, the kernel is too old