Lines Matching refs:SFQ_DEPTH
79 #define SFQ_DEPTH 128
82 /* This type should contain at least SFQ_DEPTH*2 values */
106 sfq_index next[SFQ_DEPTH]; /* Active slots link */
107 short allot[SFQ_DEPTH]; /* Current allotment per slot */
108 unsigned short hash[SFQ_DEPTH]; /* Hash value indexed by slots */
109 struct sk_buff_head qs[SFQ_DEPTH]; /* Slot queue */
110 struct sfq_head dep[SFQ_DEPTH*2]; /* Linked list of slots, indexed by depth */
207 int d = q->qs[x].qlen + SFQ_DEPTH;
258 sfq_index x = q->dep[d + SFQ_DEPTH].next;
281 q->ht[q->hash[d]] = SFQ_DEPTH;
308 if (x == SFQ_DEPTH) {
309 q->ht[hash] = x = q->dep[SFQ_DEPTH].next;
324 if (q->tail == SFQ_DEPTH) { /* It is the first flow */
351 if (q->tail == SFQ_DEPTH)
366 if (q->tail == SFQ_DEPTH)
379 q->ht[q->hash[a]] = SFQ_DEPTH;
382 q->tail = SFQ_DEPTH;
428 q->limit = min_t(u32, ctl->limit, SFQ_DEPTH - 1);
454 q->ht[i] = SFQ_DEPTH;
456 for (i = 0; i < SFQ_DEPTH; i++) {
458 q->dep[i + SFQ_DEPTH].next = i + SFQ_DEPTH;
459 q->dep[i + SFQ_DEPTH].prev = i + SFQ_DEPTH;
462 q->limit = SFQ_DEPTH - 1;
464 q->tail = SFQ_DEPTH;
475 for (i = 0; i < SFQ_DEPTH; i++)
569 if (q->ht[i] == SFQ_DEPTH ||