71 	unsigned int	 head;  member
82 	return (q->tail - q->head) & q->tab_mask;  in choke_len()
101 		q->head = (q->head + 1) & q->tab_mask;  in choke_zap_head_holes()
102 		if (q->head == q->tail)  in choke_zap_head_holes()
104 	} while (q->tab[q->head] == NULL);  in choke_zap_head_holes()
112 		if (q->head == q->tail)  in choke_zap_tail_holes()
125 	if (idx == q->head)  in choke_drop_by_idx()
235 		*pidx = (q->head + prandom_u32_max(choke_len(q))) & q->tab_mask;  in choke_peek_random()
241 	return q->tab[*pidx = q->head];  in choke_peek_random()
254 	if (q->head == q->tail)  in choke_match_random()
352 	if (q->head == q->tail) {  in choke_dequeue()
358 	skb = q->tab[q->head];  in choke_dequeue()
359 	q->tab[q->head] = NULL;  in choke_dequeue()
388 	while (q->head != q->tail) {  in choke_reset()
389 		struct sk_buff *skb = q->tab[q->head];  in choke_reset()
391 		q->head = (q->head + 1) & q->tab_mask;  in choke_reset()
400 	q->head = q->tail = 0;  in choke_reset()
461 			while (q->head != q->tail) {  in choke_change()
462 				struct sk_buff *skb = q->tab[q->head];  in choke_change()
464 				q->head = (q->head + 1) & q->tab_mask;  in choke_change()
477 			q->head = 0;  in choke_change()
495 	if (q->head == q->tail)  in choke_change()
562 	return (q->head != q->tail) ? q->tab[q->head] : NULL;  in choke_peek_head()