Lines Matching refs:q
143 static inline struct sfq_head *sfq_dep_head(struct sfq_sched_data *q, sfq_index val) in sfq_dep_head() argument
146 return &q->slots[val].dep; in sfq_dep_head()
147 return &q->dep[val - SFQ_MAX_FLOWS]; in sfq_dep_head()
150 static unsigned int sfq_hash(const struct sfq_sched_data *q, in sfq_hash() argument
153 return skb_get_hash_perturb(skb, &q->perturbation) & (q->divisor - 1); in sfq_hash()
159 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_classify() local
166 TC_H_MIN(skb->priority) <= q->divisor) in sfq_classify()
169 fl = rcu_dereference_bh(q->filter_list); in sfq_classify()
171 return sfq_hash(q, skb) + 1; in sfq_classify()
187 if (TC_H_MIN(res.classid) <= q->divisor) in sfq_classify()
196 static inline void sfq_link(struct sfq_sched_data *q, sfq_index x) in sfq_link() argument
199 struct sfq_slot *slot = &q->slots[x]; in sfq_link()
203 n = q->dep[qlen].next; in sfq_link()
208 q->dep[qlen].next = x; /* sfq_dep_head(q, p)->next = x */ in sfq_link()
209 sfq_dep_head(q, n)->prev = x; in sfq_link()
212 #define sfq_unlink(q, x, n, p) \ argument
214 n = q->slots[x].dep.next; \
215 p = q->slots[x].dep.prev; \
216 sfq_dep_head(q, p)->next = n; \
217 sfq_dep_head(q, n)->prev = p; \
221 static inline void sfq_dec(struct sfq_sched_data *q, sfq_index x) in sfq_dec() argument
226 sfq_unlink(q, x, n, p); in sfq_dec()
228 d = q->slots[x].qlen--; in sfq_dec()
229 if (n == p && q->cur_depth == d) in sfq_dec()
230 q->cur_depth--; in sfq_dec()
231 sfq_link(q, x); in sfq_dec()
234 static inline void sfq_inc(struct sfq_sched_data *q, sfq_index x) in sfq_inc() argument
239 sfq_unlink(q, x, n, p); in sfq_inc()
241 d = ++q->slots[x].qlen; in sfq_inc()
242 if (q->cur_depth < d) in sfq_inc()
243 q->cur_depth = d; in sfq_inc()
244 sfq_link(q, x); in sfq_inc()
288 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_drop() local
289 sfq_index x, d = q->cur_depth; in sfq_drop()
296 x = q->dep[d].next; in sfq_drop()
297 slot = &q->slots[x]; in sfq_drop()
299 skb = q->headdrop ? slot_dequeue_head(slot) : slot_dequeue_tail(slot); in sfq_drop()
302 sfq_dec(q, x); in sfq_drop()
303 sch->q.qlen--; in sfq_drop()
311 x = q->tail->next; in sfq_drop()
312 slot = &q->slots[x]; in sfq_drop()
314 q->tail = NULL; /* no more active slots */ in sfq_drop()
316 q->tail->next = slot->next; in sfq_drop()
317 q->ht[slot->hash] = SFQ_EMPTY_SLOT; in sfq_drop()
325 static int sfq_prob_mark(const struct sfq_sched_data *q) in sfq_prob_mark() argument
327 return q->flags & TC_RED_ECN; in sfq_prob_mark()
331 static int sfq_hard_mark(const struct sfq_sched_data *q) in sfq_hard_mark() argument
333 return (q->flags & (TC_RED_ECN | TC_RED_HARDDROP)) == TC_RED_ECN; in sfq_hard_mark()
336 static int sfq_headdrop(const struct sfq_sched_data *q) in sfq_headdrop() argument
338 return q->headdrop; in sfq_headdrop()
344 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_enqueue() local
361 x = q->ht[hash]; in sfq_enqueue()
362 slot = &q->slots[x]; in sfq_enqueue()
364 x = q->dep[0].next; /* get a free slot */ in sfq_enqueue()
367 q->ht[hash] = x; in sfq_enqueue()
368 slot = &q->slots[x]; in sfq_enqueue()
374 if (q->red_parms) { in sfq_enqueue()
375 slot->vars.qavg = red_calc_qavg_no_idle_time(q->red_parms, in sfq_enqueue()
378 switch (red_action(q->red_parms, in sfq_enqueue()
386 if (sfq_prob_mark(q)) { in sfq_enqueue()
388 if (sfq_headdrop(q) && in sfq_enqueue()
390 q->stats.prob_mark_head++; in sfq_enqueue()
394 q->stats.prob_mark++; in sfq_enqueue()
398 q->stats.prob_drop++; in sfq_enqueue()
403 if (sfq_hard_mark(q)) { in sfq_enqueue()
405 if (sfq_headdrop(q) && in sfq_enqueue()
407 q->stats.forced_mark_head++; in sfq_enqueue()
411 q->stats.forced_mark++; in sfq_enqueue()
415 q->stats.forced_drop++; in sfq_enqueue()
420 if (slot->qlen >= q->maxdepth) { in sfq_enqueue()
422 if (!sfq_headdrop(q)) in sfq_enqueue()
441 sfq_inc(q, x); in sfq_enqueue()
443 if (q->tail == NULL) { /* It is the first flow */ in sfq_enqueue()
446 slot->next = q->tail->next; in sfq_enqueue()
447 q->tail->next = x; in sfq_enqueue()
453 q->tail = slot; in sfq_enqueue()
455 slot->allot = q->quantum; in sfq_enqueue()
457 if (++sch->q.qlen <= q->limit) in sfq_enqueue()
478 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_dequeue() local
484 if (q->tail == NULL) in sfq_dequeue()
488 a = q->tail->next; in sfq_dequeue()
489 slot = &q->slots[a]; in sfq_dequeue()
491 q->tail = slot; in sfq_dequeue()
492 slot->allot += q->quantum; in sfq_dequeue()
496 sfq_dec(q, a); in sfq_dequeue()
498 sch->q.qlen--; in sfq_dequeue()
503 q->ht[slot->hash] = SFQ_EMPTY_SLOT; in sfq_dequeue()
506 q->tail = NULL; /* no more active slots */ in sfq_dequeue()
509 q->tail->next = next_a; in sfq_dequeue()
533 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_rehash() local
543 for (i = 0; i < q->maxflows; i++) { in sfq_rehash()
544 slot = &q->slots[i]; in sfq_rehash()
549 sfq_dec(q, i); in sfq_rehash()
554 q->ht[slot->hash] = SFQ_EMPTY_SLOT; in sfq_rehash()
556 q->tail = NULL; in sfq_rehash()
559 unsigned int hash = sfq_hash(q, skb); in sfq_rehash()
560 sfq_index x = q->ht[hash]; in sfq_rehash()
562 slot = &q->slots[x]; in sfq_rehash()
564 x = q->dep[0].next; /* get a free slot */ in sfq_rehash()
573 q->ht[hash] = x; in sfq_rehash()
574 slot = &q->slots[x]; in sfq_rehash()
577 if (slot->qlen >= q->maxdepth) in sfq_rehash()
580 if (q->red_parms) in sfq_rehash()
581 slot->vars.qavg = red_calc_qavg(q->red_parms, in sfq_rehash()
585 sfq_inc(q, x); in sfq_rehash()
587 if (q->tail == NULL) { /* It is the first flow */ in sfq_rehash()
590 slot->next = q->tail->next; in sfq_rehash()
591 q->tail->next = x; in sfq_rehash()
593 q->tail = slot; in sfq_rehash()
594 slot->allot = q->quantum; in sfq_rehash()
597 sch->q.qlen -= dropped; in sfq_rehash()
603 struct sfq_sched_data *q = timer_container_of(q, t, perturb_timer); in sfq_perturbation() local
604 struct Qdisc *sch = q->sch; in sfq_perturbation()
613 q->perturbation = nkey; in sfq_perturbation()
614 if (!q->filter_list && q->tail) in sfq_perturbation()
621 period = READ_ONCE(q->perturb_period); in sfq_perturbation()
623 mod_timer(&q->perturb_timer, jiffies + period); in sfq_perturbation()
630 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_change() local
678 limit = q->limit; in sfq_change()
679 divisor = q->divisor; in sfq_change()
680 headdrop = q->headdrop; in sfq_change()
681 maxdepth = q->maxdepth; in sfq_change()
682 maxflows = q->maxflows; in sfq_change()
683 quantum = q->quantum; in sfq_change()
684 flags = q->flags; in sfq_change()
721 q->limit = limit; in sfq_change()
722 q->divisor = divisor; in sfq_change()
723 q->headdrop = headdrop; in sfq_change()
724 q->maxdepth = maxdepth; in sfq_change()
725 q->maxflows = maxflows; in sfq_change()
726 WRITE_ONCE(q->perturb_period, perturb_period); in sfq_change()
727 q->quantum = quantum; in sfq_change()
728 q->flags = flags; in sfq_change()
730 swap(q->red_parms, p); in sfq_change()
732 qlen = sch->q.qlen; in sfq_change()
733 while (sch->q.qlen > q->limit) { in sfq_change()
740 qdisc_tree_reduce_backlog(sch, qlen - sch->q.qlen, dropped); in sfq_change()
742 timer_delete(&q->perturb_timer); in sfq_change()
743 if (q->perturb_period) { in sfq_change()
744 mod_timer(&q->perturb_timer, jiffies + q->perturb_period); in sfq_change()
745 get_random_bytes(&q->perturbation, sizeof(q->perturbation)); in sfq_change()
764 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_destroy() local
766 tcf_block_put(q->block); in sfq_destroy()
767 WRITE_ONCE(q->perturb_period, 0); in sfq_destroy()
768 timer_delete_sync(&q->perturb_timer); in sfq_destroy()
769 sfq_free(q->ht); in sfq_destroy()
770 sfq_free(q->slots); in sfq_destroy()
771 kfree(q->red_parms); in sfq_destroy()
777 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_init() local
781 q->sch = sch; in sfq_init()
782 timer_setup(&q->perturb_timer, sfq_perturbation, TIMER_DEFERRABLE); in sfq_init()
784 err = tcf_block_get(&q->block, &q->filter_list, sch, extack); in sfq_init()
789 q->dep[i].next = i + SFQ_MAX_FLOWS; in sfq_init()
790 q->dep[i].prev = i + SFQ_MAX_FLOWS; in sfq_init()
793 q->limit = SFQ_MAX_DEPTH; in sfq_init()
794 q->maxdepth = SFQ_MAX_DEPTH; in sfq_init()
795 q->cur_depth = 0; in sfq_init()
796 q->tail = NULL; in sfq_init()
797 q->divisor = SFQ_DEFAULT_HASH_DIVISOR; in sfq_init()
798 q->maxflows = SFQ_DEFAULT_FLOWS; in sfq_init()
799 q->quantum = psched_mtu(qdisc_dev(sch)); in sfq_init()
800 q->perturb_period = 0; in sfq_init()
801 get_random_bytes(&q->perturbation, sizeof(q->perturbation)); in sfq_init()
809 q->ht = sfq_alloc(sizeof(q->ht[0]) * q->divisor); in sfq_init()
810 q->slots = sfq_alloc(sizeof(q->slots[0]) * q->maxflows); in sfq_init()
811 if (!q->ht || !q->slots) { in sfq_init()
816 for (i = 0; i < q->divisor; i++) in sfq_init()
817 q->ht[i] = SFQ_EMPTY_SLOT; in sfq_init()
819 for (i = 0; i < q->maxflows; i++) { in sfq_init()
820 slot_queue_init(&q->slots[i]); in sfq_init()
821 sfq_link(q, i); in sfq_init()
823 if (q->limit >= 1) in sfq_init()
832 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_dump() local
835 struct red_parms *p = q->red_parms; in sfq_dump()
838 opt.v0.quantum = q->quantum; in sfq_dump()
839 opt.v0.perturb_period = q->perturb_period / HZ; in sfq_dump()
840 opt.v0.limit = q->limit; in sfq_dump()
841 opt.v0.divisor = q->divisor; in sfq_dump()
842 opt.v0.flows = q->maxflows; in sfq_dump()
843 opt.depth = q->maxdepth; in sfq_dump()
844 opt.headdrop = q->headdrop; in sfq_dump()
854 memcpy(&opt.stats, &q->stats, sizeof(opt.stats)); in sfq_dump()
855 opt.flags = q->flags; in sfq_dump()
883 static void sfq_unbind(struct Qdisc *q, unsigned long cl) in sfq_unbind() argument
890 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_tcf_block() local
894 return q->block; in sfq_tcf_block()
907 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_dump_class_stats() local
908 sfq_index idx = q->ht[cl - 1]; in sfq_dump_class_stats()
913 const struct sfq_slot *slot = &q->slots[idx]; in sfq_dump_class_stats()
926 struct sfq_sched_data *q = qdisc_priv(sch); in sfq_walk() local
932 for (i = 0; i < q->divisor; i++) { in sfq_walk()
933 if (q->ht[i] == SFQ_EMPTY_SLOT) { in sfq_walk()