68 	if (unlikely(next == wc->tail)) {  in ipath_cq_enter()
135 	u32 tail;  in ipath_poll_cq()  local
146 	tail = wc->tail;  in ipath_poll_cq()
147 	if (tail > (u32) cq->ibcq.cqe)  in ipath_poll_cq()
148 		tail = (u32) cq->ibcq.cqe;  in ipath_poll_cq()
150 		if (tail == wc->head)  in ipath_poll_cq()
153 		*entry = wc->kqueue[tail];  in ipath_poll_cq()
154 		if (tail >= cq->ibcq.cqe)  in ipath_poll_cq()
155 			tail = 0;  in ipath_poll_cq()
157 			tail++;  in ipath_poll_cq()
159 	wc->tail = tail;  in ipath_poll_cq()
289 	wc->tail = 0;  in ipath_create_cq()
357 	    cq->queue->head != cq->queue->tail)  in ipath_req_notify_cq()
376 	u32 head, tail, n;  in ipath_resize_cq()  local
417 	tail = old_wc->tail;  in ipath_resize_cq()
418 	if (tail > (u32) cq->ibcq.cqe)  in ipath_resize_cq()
419 		tail = (u32) cq->ibcq.cqe;  in ipath_resize_cq()
420 	if (head < tail)  in ipath_resize_cq()
421 		n = cq->ibcq.cqe + 1 + head - tail;  in ipath_resize_cq()
423 		n = head - tail;  in ipath_resize_cq()
428 	for (n = 0; tail != head; n++) {  in ipath_resize_cq()
430 			wc->uqueue[n] = old_wc->uqueue[tail];  in ipath_resize_cq()
432 			wc->kqueue[n] = old_wc->kqueue[tail];  in ipath_resize_cq()
433 		if (tail == (u32) cq->ibcq.cqe)  in ipath_resize_cq()
434 			tail = 0;  in ipath_resize_cq()
436 			tail++;  in ipath_resize_cq()
440 	wc->tail = 0;  in ipath_resize_cq()