Lines Matching refs:tail
67 unsigned int tail;
77 return (q->tail - q->head) & q->tab_mask;
97 if (q->head == q->tail)
102 /* Move tail pointer backwards to reuse holes */
106 q->tail = (q->tail - 1) & q->tab_mask;
107 if (q->head == q->tail)
109 } while (q->tab[q->tail] == NULL);
123 if (idx == q->tail)
177 * Will return NULL if queue is empty (q->head == q->tail)
205 if (q->head == q->tail)
268 q->tab[q->tail] = skb;
269 q->tail = (q->tail + 1) & q->tab_mask;
288 if (q->head == q->tail) {
308 while (q->head != q->tail) {
319 q->head = q->tail = 0;
380 unsigned int oqlen = sch->q.qlen, tail = 0;
383 while (q->head != q->tail) {
389 if (tail < mask) {
390 ntab[tail++] = skb;
400 q->tail = tail;
417 if (q->head == q->tail)
483 return (q->head != q->tail) ? q->tab[q->head] : NULL;