99 	sfq_index	next;  member
107 	sfq_index	next; /* next slot in sfq RR chain */  member
209 	n = q->dep[qlen].next;  in sfq_link()
211 	slot->dep.next = n;  in sfq_link()
214 	q->dep[qlen].next = x;		/* sfq_dep_head(q, p)->next = x */  in sfq_link()
220 		n = q->slots[x].dep.next;	\
222 		sfq_dep_head(q, p)->next = n;	\
261 	skb->prev->next = (struct sk_buff *)slot;  in slot_dequeue_tail()
262 	skb->next = skb->prev = NULL;  in slot_dequeue_tail()
271 	slot->skblist_next = skb->next;  in slot_dequeue_head()
272 	skb->next->prev = (struct sk_buff *)slot;  in slot_dequeue_head()
273 	skb->next = skb->prev = NULL;  in slot_dequeue_head()
287 	skb->next = (struct sk_buff *)slot;  in slot_queue_add()
288 	slot->skblist_prev->next = skb;  in slot_queue_add()
302 		x = q->dep[d].next;  in sfq_drop()
318 		x = q->tail->next;  in sfq_drop()
320 		q->tail->next = slot->next;  in sfq_drop()
368 		x = q->dep[0].next; /* get a free slot */  in sfq_enqueue()
447 			slot->next = x;  in sfq_enqueue()
449 			slot->next = q->tail->next;  in sfq_enqueue()
450 			q->tail->next = x;  in sfq_enqueue()
489 	a = q->tail->next;  in sfq_dequeue()
505 		next_a = slot->next;  in sfq_dequeue()
510 		q->tail->next = next_a;  in sfq_dequeue()
565 			x = q->dep[0].next; /* get a free slot */  in sfq_rehash()
589 				slot->next = x;  in sfq_rehash()
591 				slot->next = q->tail->next;  in sfq_rehash()
592 				q->tail->next = x;  in sfq_rehash()
721 		q->dep[i].next = i + SFQ_MAX_FLOWS;  in sfq_init()