Lines Matching defs:dep
93 * are 'pointers' to dep[] array
105 struct sfq_head dep; /* anchor in dep[] chains */
133 struct sfq_head dep[SFQ_MAX_DEPTH + 1];
135 * dep[0] : list of unused flows
136 * dep[1] : list of flows with 1 packet
137 * dep[X] : list of flows with X packets
148 * sfq_head are either in a sfq_slot or in dep[] array
153 return &q->slots[val].dep;
154 return &q->dep[val - SFQ_MAX_FLOWS];
210 n = q->dep[qlen].next;
212 slot->dep.next = n;
213 slot->dep.prev = p;
215 q->dep[qlen].next = x; /* sfq_dep_head(q, p)->next = x */
221 n = q->slots[x].dep.next; \
222 p = q->slots[x].dep.prev; \
303 x = q->dep[d].next;
368 x = q->dep[0].next; /* get a free slot */
568 x = q->dep[0].next; /* get a free slot */
749 q->dep[i].next = i + SFQ_MAX_FLOWS;
750 q->dep[i].prev = i + SFQ_MAX_FLOWS;