Lines Matching refs:head
105 uint32_t head, tail, next_tail, qsize_msk;
152 head = qp->qp_sq_wqhdr->wq_head;
212 if (next_tail == head) {
402 uint32_t head, tail, next_tail, qsize_msk;
456 head = qp->qp_rq_wqhdr->wq_head;
515 if (next_tail == head) {
2685 uint32_t head, tail, size;
2697 head = wq->wq_wrid_post->wl_head;
2720 * If the "tail" index has just wrapped over into the "head" index,
2723 * condition (where head and tail are also equal).
2725 if (head == tail) {
2866 uint32_t head, tail, size;
2882 * update the "head" and "full" indicators on the individual containers
2904 * Grab the current "head", "tail" and "size" fields before
2910 head = container->wl_head;
2913 while ((head != tail) || (container->wl_full)) {
2915 curr = &container->wl_wre[head];
2916 head = ((head + 1) & (size - 1));
2932 * "head == tail" condition can only mean that the container
2938 if (head == tail) {
2955 /* Update the head index for the container */
2956 container->wl_head = head;
2975 * Update work queue header's "head" and "full" conditions to match
3171 * tracking the head, tail, size, etc. for each container.
3431 uint32_t head;
3435 * return zero. Note: the "head == tail" condition here can only
3446 * We don't need to calculate the "next" head pointer here
3447 * because "head" should already point to the next entry on
3449 * tavor_wrid_find_match() - and moved the head index forward.)
3451 head = wq->wq_wrid_poll->wl_head;
3452 wre = &wq->wq_wrid_poll->wl_wre[head];