Lines Matching refs:head
31 i_assert(aqueue->full && aqueue->head == aqueue->tail);
39 count = I_MIN(aqueue->area_size - orig_area_size, aqueue->head);
42 aqueue->head = orig_area_size + count;
45 aqueue->head - count);
46 aqueue->head -= count;
49 i_assert(aqueue->head != aqueue->tail);
60 array_idx_set_i(aqueue->arr, aqueue->head, data);
61 aqueue->head = (aqueue->head + 1) % aqueue->area_size;
62 aqueue->full = aqueue->head == aqueue->tail;
78 /* optimized deletion from head */
79 aqueue->head = (aqueue->head + aqueue->area_size - 1) %
85 if ((n < count/2 || idx > aqueue->head) && idx > aqueue->tail) {
87 ..tail##idx##head.. or ##head..tail##idx## */
94 /* move head backward.
95 ..tail##idx##head.. or ##idx##head..tail## */
96 i_assert(idx < aqueue->head);
99 aqueue->head - idx);
100 aqueue->head = (aqueue->head + aqueue->area_size - 1) %
103 i_assert(aqueue->head < aqueue->area_size &&
104 aqueue->head != aqueue->tail);
114 aqueue->head = aqueue->tail = 0;
123 (area_size - aqueue->tail + aqueue->head) % area_size;