Lines Matching defs:tail
68 unsigned int tail;
78 return (q->tail - q->head) & q->tab_mask;
98 if (q->head == q->tail)
103 /* Move tail pointer backwards to reuse holes */
107 q->tail = (q->tail - 1) & q->tab_mask;
108 if (q->head == q->tail)
110 } while (q->tab[q->tail] == NULL);
124 if (idx == q->tail)
178 * Will return NULL if queue is empty (q->head == q->tail)
206 if (q->head == q->tail)
269 q->tab[q->tail] = skb;
270 q->tail = (q->tail + 1) & q->tab_mask;
289 if (q->head == q->tail) {
309 while (q->head != q->tail) {
320 q->head = q->tail = 0;
381 unsigned int oqlen = sch->q.qlen, tail = 0;
384 while (q->head != q->tail) {
390 if (tail < mask) {
391 ntab[tail++] = skb;
401 q->tail = tail;
418 if (q->head == q->tail)
485 return (q->head != q->tail) ? q->tab[q->head] : NULL;