SFQ_DEPTH 105 net/sched/sch_sfq.c sfq_index next[SFQ_DEPTH]; /* Active slots link */ SFQ_DEPTH 106 net/sched/sch_sfq.c short allot[SFQ_DEPTH]; /* Current allotment per slot */ SFQ_DEPTH 107 net/sched/sch_sfq.c unsigned short hash[SFQ_DEPTH]; /* Hash value indexed by slots */ SFQ_DEPTH 108 net/sched/sch_sfq.c struct sk_buff_head qs[SFQ_DEPTH]; /* Slot queue */ SFQ_DEPTH 109 net/sched/sch_sfq.c struct sfq_head dep[SFQ_DEPTH*2]; /* Linked list of slots, indexed by depth */ SFQ_DEPTH 195 net/sched/sch_sfq.c int d = q->qs[x].qlen + SFQ_DEPTH; SFQ_DEPTH 246 net/sched/sch_sfq.c sfq_index x = q->dep[d + SFQ_DEPTH].next; SFQ_DEPTH 269 net/sched/sch_sfq.c q->ht[q->hash[d]] = SFQ_DEPTH; SFQ_DEPTH 296 net/sched/sch_sfq.c if (x == SFQ_DEPTH) { SFQ_DEPTH 297 net/sched/sch_sfq.c q->ht[hash] = x = q->dep[SFQ_DEPTH].next; SFQ_DEPTH 312 net/sched/sch_sfq.c if (q->tail == SFQ_DEPTH) { /* It is the first flow */ SFQ_DEPTH 350 net/sched/sch_sfq.c if (x == SFQ_DEPTH) { SFQ_DEPTH 351 net/sched/sch_sfq.c q->ht[hash] = x = q->dep[SFQ_DEPTH].next; SFQ_DEPTH 373 net/sched/sch_sfq.c if (q->tail == SFQ_DEPTH) { /* It is the first flow */ SFQ_DEPTH 405 net/sched/sch_sfq.c if (q->tail == SFQ_DEPTH) SFQ_DEPTH 418 net/sched/sch_sfq.c q->ht[q->hash[a]] = SFQ_DEPTH; SFQ_DEPTH 421 net/sched/sch_sfq.c q->tail = SFQ_DEPTH; SFQ_DEPTH 467 net/sched/sch_sfq.c q->limit = min_t(u32, ctl->limit, SFQ_DEPTH - 1); SFQ_DEPTH 493 net/sched/sch_sfq.c q->ht[i] = SFQ_DEPTH; SFQ_DEPTH 495 net/sched/sch_sfq.c for (i = 0; i < SFQ_DEPTH; i++) { SFQ_DEPTH 497 net/sched/sch_sfq.c q->dep[i + SFQ_DEPTH].next = i + SFQ_DEPTH; SFQ_DEPTH 498 net/sched/sch_sfq.c q->dep[i + SFQ_DEPTH].prev = i + SFQ_DEPTH; SFQ_DEPTH 501 net/sched/sch_sfq.c q->limit = SFQ_DEPTH - 1; SFQ_DEPTH 503 net/sched/sch_sfq.c q->tail = SFQ_DEPTH; SFQ_DEPTH 514 net/sched/sch_sfq.c for (i = 0; i < SFQ_DEPTH; i++) SFQ_DEPTH 599 net/sched/sch_sfq.c if (q->ht[i] == SFQ_DEPTH ||