68 	unsigned int	 tail;  member
78 	return (q->tail - q->head) & q->tab_mask;  in choke_len()
98 		if (q->head == q->tail)  in choke_zap_head_holes()
103 /* Move tail pointer backwards to reuse holes */
107 		q->tail = (q->tail - 1) & q->tab_mask;  in choke_zap_tail_holes()
108 		if (q->head == q->tail)  in choke_zap_tail_holes()
110 	} while (q->tab[q->tail] == NULL);  in choke_zap_tail_holes()
124 	if (idx == q->tail)  in choke_drop_by_idx()
178  * Will return NULL if queue is empty (q->head == q->tail)
206 	if (q->head == q->tail)  in choke_match_random()
269 		q->tab[q->tail] = skb;  in choke_enqueue()
270 		q->tail = (q->tail + 1) & q->tab_mask;  in choke_enqueue()
289 	if (q->head == q->tail) {  in choke_dequeue()
309 	while (q->head != q->tail) {  in choke_reset()
322 	q->head = q->tail = 0;  in choke_reset()
383 			unsigned int oqlen = sch->q.qlen, tail = 0;  in choke_change()  local
386 			while (q->head != q->tail) {  in choke_change()
392 				if (tail < mask) {  in choke_change()
393 					ntab[tail++] = skb;  in choke_change()
403 			q->tail = tail;  in choke_change()
420 	if (q->head == q->tail)  in choke_change()
487 	return (q->head != q->tail) ? q->tab[q->head] : NULL;  in choke_peek_head()