100 	sfq_index	next;  member
108 	sfq_index	next; /* next slot in sfq RR chain */  member
232 	n = q->dep[qlen].next;  in sfq_link()
234 	slot->dep.next = n;  in sfq_link()
237 	q->dep[qlen].next = x;		/* sfq_dep_head(q, p)->next = x */  in sfq_link()
243 		n = q->slots[x].dep.next;	\
245 		sfq_dep_head(q, p)->next = n;	\
284 	skb->prev->next = (struct sk_buff *)slot;  in slot_dequeue_tail()
285 	skb->next = skb->prev = NULL;  in slot_dequeue_tail()
294 	slot->skblist_next = skb->next;  in slot_dequeue_head()
295 	skb->next->prev = (struct sk_buff *)slot;  in slot_dequeue_head()
296 	skb->next = skb->prev = NULL;  in slot_dequeue_head()
310 	skb->next = (struct sk_buff *)slot;  in slot_queue_add()
311 	slot->skblist_prev->next = skb;  in slot_queue_add()
325 		x = q->dep[d].next;  in sfq_drop()
341 		x = q->tail->next;  in sfq_drop()
343 		q->tail->next = slot->next;  in sfq_drop()
391 		x = q->dep[0].next; /* get a free slot */  in sfq_enqueue()
470 			slot->next = x;  in sfq_enqueue()
472 			slot->next = q->tail->next;  in sfq_enqueue()
473 			q->tail->next = x;  in sfq_enqueue()
512 	a = q->tail->next;  in sfq_dequeue()
528 		next_a = slot->next;  in sfq_dequeue()
533 		q->tail->next = next_a;  in sfq_dequeue()
587 			x = q->dep[0].next; /* get a free slot */  in sfq_rehash()
610 				slot->next = x;  in sfq_rehash()
612 				slot->next = q->tail->next;  in sfq_rehash()
613 				q->tail->next = x;  in sfq_rehash()
742 		q->dep[i].next = i + SFQ_MAX_FLOWS;  in sfq_init()