101 	sfq_index	prev;  member
233 	slot->dep.prev = p;  in sfq_link()
236 	sfq_dep_head(q, n)->prev = x;  in sfq_link()
241 	p = q->slots[x].dep.prev;		\
243 	sfq_dep_head(q, n)->prev = p
279 	slot->skblist_prev = skb->prev;  in slot_dequeue_tail()
280 	skb->prev->next = (struct sk_buff *)slot;  in slot_dequeue_tail()
281 	skb->next = skb->prev = NULL;  in slot_dequeue_tail()
291 	skb->next->prev = (struct sk_buff *)slot;  in slot_dequeue_head()
292 	skb->next = skb->prev = NULL;  in slot_dequeue_head()
305 	skb->prev = slot->skblist_prev;  in slot_queue_add()
748 		q->dep[i].prev = i + SFQ_MAX_FLOWS;  in sfq_init()