105 	struct sfq_head dep; /* anchor in dep[] chains */  member
133 	struct sfq_head	dep[SFQ_MAX_DEPTH + 1];  member
153 		return &q->slots[val].dep;  in sfq_dep_head()
154 	return &q->dep[val - SFQ_MAX_FLOWS];  in sfq_dep_head()
210 	n = q->dep[qlen].next;  in sfq_link()
212 	slot->dep.next = n;  in sfq_link()
213 	slot->dep.prev = p;  in sfq_link()
215 	q->dep[qlen].next = x;		/* sfq_dep_head(q, p)->next = x */  in sfq_link()
221 		n = q->slots[x].dep.next;	\
222 		p = q->slots[x].dep.prev;	\
303 		x = q->dep[d].next;  in sfq_drop()
368 		x = q->dep[0].next; /* get a free slot */  in sfq_enqueue()
568 			x = q->dep[0].next; /* get a free slot */  in sfq_rehash()
749 		q->dep[i].next = i + SFQ_MAX_FLOWS;  in sfq_init()
750 		q->dep[i].prev = i + SFQ_MAX_FLOWS;  in sfq_init()