109 	struct sfq_head dep; /* anchor in dep[] chains */  member
136 	struct sfq_head	dep[SFQ_MAX_DEPTH + 1];  member
155 		return &q->slots[val].dep;  in sfq_dep_head()
156 	return &q->dep[val - SFQ_MAX_FLOWS];  in sfq_dep_head()
232 	n = q->dep[qlen].next;  in sfq_link()
234 	slot->dep.next = n;  in sfq_link()
235 	slot->dep.prev = p;  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;	\
244 		p = q->slots[x].dep.prev;	\
325 		x = q->dep[d].next;  in sfq_drop()
391 		x = q->dep[0].next; /* get a free slot */  in sfq_enqueue()
587 			x = q->dep[0].next; /* get a free slot */  in sfq_rehash()
742 		q->dep[i].next = i + SFQ_MAX_FLOWS;  in sfq_init()
743 		q->dep[i].prev = i + SFQ_MAX_FLOWS;  in sfq_init()