Lines Matching defs:tail
68 if (unlikely(next == wc->tail)) {
135 u32 tail;
146 tail = wc->tail;
147 if (tail > (u32) cq->ibcq.cqe)
148 tail = (u32) cq->ibcq.cqe;
150 if (tail == wc->head)
153 *entry = wc->kqueue[tail];
154 if (tail >= cq->ibcq.cqe)
155 tail = 0;
157 tail++;
159 wc->tail = tail;
223 * Allocate the completion queue entries and head/tail pointers.
289 wc->tail = 0;
357 cq->queue->head != cq->queue->tail)
376 u32 head, tail, n;
410 * Make sure head and tail are sane since they
417 tail = old_wc->tail;
418 if (tail > (u32) cq->ibcq.cqe)
419 tail = (u32) cq->ibcq.cqe;
420 if (head < tail)
421 n = cq->ibcq.cqe + 1 + head - tail;
423 n = head - tail;
428 for (n = 0; tail != head; n++) {
430 wc->uqueue[n] = old_wc->uqueue[tail];
432 wc->kqueue[n] = old_wc->kqueue[tail];
433 if (tail == (u32) cq->ibcq.cqe)
434 tail = 0;
436 tail++;
440 wc->tail = 0;