Lines Matching defs:tail
68 if (unlikely(next == wc->tail)) {
133 u32 tail;
144 tail = wc->tail;
145 if (tail > (u32) cq->ibcq.cqe)
146 tail = (u32) cq->ibcq.cqe;
148 if (tail == wc->head)
151 *entry = wc->kqueue[tail];
152 if (tail >= cq->ibcq.cqe)
153 tail = 0;
155 tail++;
157 wc->tail = tail;
229 * Allocate the completion queue entries and head/tail pointers.
295 wc->tail = 0;
363 cq->queue->head != cq->queue->tail)
382 u32 head, tail, n;
416 * Make sure head and tail are sane since they
423 tail = old_wc->tail;
424 if (tail > (u32) cq->ibcq.cqe)
425 tail = (u32) cq->ibcq.cqe;
426 if (head < tail)
427 n = cq->ibcq.cqe + 1 + head - tail;
429 n = head - tail;
434 for (n = 0; tail != head; n++) {
436 wc->uqueue[n] = old_wc->uqueue[tail];
438 wc->kqueue[n] = old_wc->kqueue[tail];
439 if (tail == (u32) cq->ibcq.cqe)
440 tail = 0;
442 tail++;
446 wc->tail = 0;