Lines Matching refs:head
129 uint32_t head, tail, size;
143 * update the "head" and "full" indicators on the individual containers
166 * Grab the current "head", "tail" and "size" fields before
172 head = container->wl_head;
175 while ((head != tail) || (container->wl_full)) {
177 curr = &container->wl_wre[head];
178 head = ((head + 1) & (size - 1));
193 * "head == tail" condition can only mean that the container
199 if (head == tail) {
215 /* Update the head index for the container */
216 container->wl_head = head;
235 * Update work queue header's "head" and "full" conditions to match
423 * tracking the head, tail, size, etc. for each container. The
571 uint32_t head;
575 * return zero. Note: the "head == tail" condition here can only
586 * We don't need to calculate the "next" head pointer here
587 * because "head" should already point to the next entry on
589 * dapli_tavor_wrid_find_match() - and moved the head index
592 head = wq->wq_wrid_poll->wl_head;
593 wre = &wq->wq_wrid_poll->wl_wre[head];