Lines Matching refs:tail
72 unsigned int tail;
82 return (q->tail - q->head) & q->tab_mask;
102 if (q->head == q->tail)
107 /* Move tail pointer backwards to reuse holes */
111 q->tail = (q->tail - 1) & q->tab_mask;
112 if (q->head == q->tail)
114 } while (q->tab[q->tail] == NULL);
127 if (idx == q->tail)
232 * Will return NULL if queue is empty (q->head == q->tail)
260 if (q->head == q->tail)
332 q->tab[q->tail] = skb;
333 q->tail = (q->tail + 1) & q->tab_mask;
358 if (q->head == q->tail) {
451 unsigned int oqlen = sch->q.qlen, tail = 0;
453 while (q->head != q->tail) {
459 if (tail < mask) {
460 ntab[tail++] = skb;
469 q->tail = tail;
486 if (q->head == q->tail)
612 return (q->head != q->tail) ? q->tab[q->head] : NULL;