Lines Matching +full:dont +full:- +full:validate
1 // SPDX-License-Identifier: GPL-2.0-or-later
34 "Interworking: Research and Experience", v.2, 1991, p.113-131.
44 processes queues in round-robin order.
48 - It is very cheap. Both CPU and memory requirements are minimal.
52 - "Stochastic" -> It is not 100% fair.
55 - "Round-robin" -> It introduces larger delays than virtual clock
57 traffic from non-interactive. It means, that this scheduler
67 - maximal queue length per flow to 127 packets.
68 - max mtu to 2^18-1;
69 - max 65408 flows,
70 - number of hash buckets to 65536.
76 #define SFQ_MAX_FLOWS (0x10000 - SFQ_MAX_DEPTH - 1) /* max number of flows */
84 * We dont use pointers to save space.
85 * Small indexes [0 ... SFQ_MAX_FLOWS - 1] are 'pointers' to slots[] array
146 return &q->slots[val].dep; in sfq_dep_head()
147 return &q->dep[val - SFQ_MAX_FLOWS]; in sfq_dep_head()
153 return skb_get_hash_perturb(skb, &q->perturbation) & (q->divisor - 1); in sfq_hash()
164 if (TC_H_MAJ(skb->priority) == sch->handle && in sfq_classify()
165 TC_H_MIN(skb->priority) > 0 && in sfq_classify()
166 TC_H_MIN(skb->priority) <= q->divisor) in sfq_classify()
167 return TC_H_MIN(skb->priority); in sfq_classify()
169 fl = rcu_dereference_bh(q->filter_list); in sfq_classify()
187 if (TC_H_MIN(res.classid) <= q->divisor) in sfq_classify()
194 * x : slot number [0 .. SFQ_MAX_FLOWS - 1]
199 struct sfq_slot *slot = &q->slots[x]; in sfq_link()
200 int qlen = slot->qlen; in sfq_link()
203 n = q->dep[qlen].next; in sfq_link()
205 slot->dep.next = n; in sfq_link()
206 slot->dep.prev = p; 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()
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; \
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()
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()
252 struct sk_buff *skb = slot->skblist_prev; in slot_dequeue_tail()
254 slot->skblist_prev = skb->prev; in slot_dequeue_tail()
255 skb->prev->next = (struct sk_buff *)slot; in slot_dequeue_tail()
256 skb->next = skb->prev = NULL; in slot_dequeue_tail()
263 struct sk_buff *skb = slot->skblist_next; in slot_dequeue_head()
265 slot->skblist_next = skb->next; in slot_dequeue_head()
266 skb->next->prev = (struct sk_buff *)slot; in slot_dequeue_head()
267 skb->next = skb->prev = NULL; in slot_dequeue_head()
274 slot->skblist_prev = slot->skblist_next = (struct sk_buff *)slot; in slot_queue_init()
280 skb->prev = slot->skblist_prev; in slot_queue_add()
281 skb->next = (struct sk_buff *)slot; in slot_queue_add()
282 slot->skblist_prev->next = skb; in slot_queue_add()
283 slot->skblist_prev = skb; in slot_queue_add()
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()
301 slot->backlog -= len; 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()
313 q->tail->next = slot->next; in sfq_drop()
314 q->ht[slot->hash] = SFQ_EMPTY_SLOT; in sfq_drop()
324 return q->flags & TC_RED_ECN; in sfq_prob_mark()
330 return (q->flags & (TC_RED_ECN | TC_RED_HARDDROP)) == TC_RED_ECN; in sfq_hard_mark()
335 return q->headdrop; in sfq_headdrop()
356 hash--; in sfq_enqueue()
358 x = q->ht[hash]; in sfq_enqueue()
359 slot = &q->slots[x]; in sfq_enqueue()
361 x = q->dep[0].next; /* get a free slot */ in sfq_enqueue()
364 q->ht[hash] = x; in sfq_enqueue()
365 slot = &q->slots[x]; in sfq_enqueue()
366 slot->hash = hash; in sfq_enqueue()
367 slot->backlog = 0; /* should already be 0 anyway... */ in sfq_enqueue()
368 red_set_vars(&slot->vars); in sfq_enqueue()
371 if (q->red_parms) { in sfq_enqueue()
372 slot->vars.qavg = red_calc_qavg_no_idle_time(q->red_parms, in sfq_enqueue()
373 &slot->vars, in sfq_enqueue()
374 slot->backlog); in sfq_enqueue()
375 switch (red_action(q->red_parms, in sfq_enqueue()
376 &slot->vars, in sfq_enqueue()
377 slot->vars.qavg)) { in sfq_enqueue()
386 INET_ECN_set_ce(slot->skblist_next)) { in sfq_enqueue()
387 q->stats.prob_mark_head++; in sfq_enqueue()
391 q->stats.prob_mark++; in sfq_enqueue()
395 q->stats.prob_drop++; in sfq_enqueue()
403 INET_ECN_set_ce(slot->skblist_next)) { in sfq_enqueue()
404 q->stats.forced_mark_head++; in sfq_enqueue()
408 q->stats.forced_mark++; in sfq_enqueue()
412 q->stats.forced_drop++; in sfq_enqueue()
417 if (slot->qlen >= q->maxdepth) { in sfq_enqueue()
424 delta = qdisc_pkt_len(head) - qdisc_pkt_len(skb); in sfq_enqueue()
425 sch->qstats.backlog -= delta; in sfq_enqueue()
426 slot->backlog -= delta; in sfq_enqueue()
436 slot->backlog += qdisc_pkt_len(skb); in sfq_enqueue()
439 if (slot->qlen == 1) { /* The flow is new */ in sfq_enqueue()
440 if (q->tail == NULL) { /* It is the first flow */ in sfq_enqueue()
441 slot->next = x; in sfq_enqueue()
443 slot->next = q->tail->next; in sfq_enqueue()
444 q->tail->next = x; in sfq_enqueue()
450 q->tail = slot; in sfq_enqueue()
452 slot->allot = q->quantum; in sfq_enqueue()
454 if (++sch->q.qlen <= q->limit) in sfq_enqueue()
457 qlen = slot->qlen; in sfq_enqueue()
462 if (qlen != slot->qlen) { in sfq_enqueue()
463 qdisc_tree_reduce_backlog(sch, 0, dropped - qdisc_pkt_len(skb)); in sfq_enqueue()
481 if (q->tail == NULL) in sfq_dequeue()
485 a = q->tail->next; in sfq_dequeue()
486 slot = &q->slots[a]; in sfq_dequeue()
487 if (slot->allot <= 0) { in sfq_dequeue()
488 q->tail = slot; in sfq_dequeue()
489 slot->allot += q->quantum; in sfq_dequeue()
495 sch->q.qlen--; in sfq_dequeue()
497 slot->backlog -= qdisc_pkt_len(skb); in sfq_dequeue()
499 if (slot->qlen == 0) { in sfq_dequeue()
500 q->ht[slot->hash] = SFQ_EMPTY_SLOT; in sfq_dequeue()
501 next_a = slot->next; in sfq_dequeue()
503 q->tail = NULL; /* no more active slots */ in sfq_dequeue()
506 q->tail->next = next_a; in sfq_dequeue()
508 slot->allot -= qdisc_pkt_len(skb); in sfq_dequeue()
523 * When q->perturbation is changed, we rehash all queued skbs
525 * We dont use sfq_dequeue()/sfq_enqueue() because we dont want to change
540 for (i = 0; i < q->maxflows; i++) { in sfq_rehash()
541 slot = &q->slots[i]; in sfq_rehash()
542 if (!slot->qlen) in sfq_rehash()
544 while (slot->qlen) { in sfq_rehash()
549 slot->backlog = 0; in sfq_rehash()
550 red_set_vars(&slot->vars); in sfq_rehash()
551 q->ht[slot->hash] = SFQ_EMPTY_SLOT; in sfq_rehash()
553 q->tail = NULL; in sfq_rehash()
557 sfq_index x = q->ht[hash]; in sfq_rehash()
559 slot = &q->slots[x]; in sfq_rehash()
561 x = q->dep[0].next; /* get a free slot */ in sfq_rehash()
570 q->ht[hash] = x; in sfq_rehash()
571 slot = &q->slots[x]; in sfq_rehash()
572 slot->hash = hash; in sfq_rehash()
574 if (slot->qlen >= q->maxdepth) in sfq_rehash()
577 if (q->red_parms) in sfq_rehash()
578 slot->vars.qavg = red_calc_qavg(q->red_parms, in sfq_rehash()
579 &slot->vars, in sfq_rehash()
580 slot->backlog); in sfq_rehash()
581 slot->backlog += qdisc_pkt_len(skb); in sfq_rehash()
583 if (slot->qlen == 1) { /* The flow is new */ in sfq_rehash()
584 if (q->tail == NULL) { /* It is the first flow */ in sfq_rehash()
585 slot->next = x; in sfq_rehash()
587 slot->next = q->tail->next; in sfq_rehash()
588 q->tail->next = x; in sfq_rehash()
590 q->tail = slot; in sfq_rehash()
591 slot->allot = q->quantum; in sfq_rehash()
594 sch->q.qlen -= dropped; in sfq_rehash()
601 struct Qdisc *sch = q->sch; in sfq_perturbation()
610 q->perturbation = nkey; in sfq_perturbation()
611 if (!q->filter_list && q->tail) in sfq_perturbation()
615 /* q->perturb_period can change under us from in sfq_perturbation()
618 period = READ_ONCE(q->perturb_period); in sfq_perturbation()
620 mod_timer(&q->perturb_timer, jiffies + period); in sfq_perturbation()
644 if (opt->nla_len < nla_attr_size(sizeof(*ctl))) in sfq_change()
645 return -EINVAL; in sfq_change()
646 if (opt->nla_len >= nla_attr_size(sizeof(*ctl_v1))) in sfq_change()
648 if (ctl->divisor && in sfq_change()
649 (!is_power_of_2(ctl->divisor) || ctl->divisor > 65536)) in sfq_change()
650 return -EINVAL; in sfq_change()
652 if ((int)ctl->quantum < 0) { in sfq_change()
654 return -EINVAL; in sfq_change()
656 if (ctl_v1 && !red_check_params(ctl_v1->qth_min, ctl_v1->qth_max, in sfq_change()
657 ctl_v1->Wlog, ctl_v1->Scell_log, NULL)) in sfq_change()
658 return -EINVAL; in sfq_change()
659 if (ctl_v1 && ctl_v1->qth_min) { in sfq_change()
662 return -ENOMEM; in sfq_change()
667 limit = q->limit; in sfq_change()
668 divisor = q->divisor; in sfq_change()
669 headdrop = q->headdrop; in sfq_change()
670 maxdepth = q->maxdepth; in sfq_change()
671 maxflows = q->maxflows; in sfq_change()
672 perturb_period = q->perturb_period; in sfq_change()
673 quantum = q->quantum; in sfq_change()
674 flags = q->flags; in sfq_change()
676 /* update and validate configuration */ in sfq_change()
677 if (ctl->quantum) in sfq_change()
678 quantum = ctl->quantum; in sfq_change()
679 perturb_period = ctl->perturb_period * HZ; in sfq_change()
680 if (ctl->flows) in sfq_change()
681 maxflows = min_t(u32, ctl->flows, SFQ_MAX_FLOWS); in sfq_change()
682 if (ctl->divisor) { in sfq_change()
683 divisor = ctl->divisor; in sfq_change()
687 if (ctl_v1->depth) in sfq_change()
688 maxdepth = min_t(u32, ctl_v1->depth, SFQ_MAX_DEPTH); in sfq_change()
691 ctl_v1->qth_min, ctl_v1->qth_max, in sfq_change()
692 ctl_v1->Wlog, in sfq_change()
693 ctl_v1->Plog, ctl_v1->Scell_log, in sfq_change()
695 ctl_v1->max_P); in sfq_change()
697 flags = ctl_v1->flags; in sfq_change()
698 headdrop = ctl_v1->headdrop; in sfq_change()
700 if (ctl->limit) { in sfq_change()
701 limit = min_t(u32, ctl->limit, maxdepth * maxflows); in sfq_change()
708 return -EINVAL; in sfq_change()
712 q->limit = limit; in sfq_change()
713 q->divisor = divisor; in sfq_change()
714 q->headdrop = headdrop; in sfq_change()
715 q->maxdepth = maxdepth; in sfq_change()
716 q->maxflows = maxflows; in sfq_change()
717 WRITE_ONCE(q->perturb_period, perturb_period); in sfq_change()
718 q->quantum = quantum; in sfq_change()
719 q->flags = flags; in sfq_change()
721 swap(q->red_parms, p); in sfq_change()
723 qlen = sch->q.qlen; in sfq_change()
724 while (sch->q.qlen > q->limit) { in sfq_change()
731 qdisc_tree_reduce_backlog(sch, qlen - sch->q.qlen, dropped); in sfq_change()
733 del_timer(&q->perturb_timer); in sfq_change()
734 if (q->perturb_period) { in sfq_change()
735 mod_timer(&q->perturb_timer, jiffies + q->perturb_period); in sfq_change()
736 get_random_bytes(&q->perturbation, sizeof(q->perturbation)); in sfq_change()
757 tcf_block_put(q->block); in sfq_destroy()
758 WRITE_ONCE(q->perturb_period, 0); in sfq_destroy()
759 del_timer_sync(&q->perturb_timer); in sfq_destroy()
760 sfq_free(q->ht); in sfq_destroy()
761 sfq_free(q->slots); in sfq_destroy()
762 kfree(q->red_parms); in sfq_destroy()
772 q->sch = sch; in sfq_init()
773 timer_setup(&q->perturb_timer, sfq_perturbation, TIMER_DEFERRABLE); in sfq_init()
775 err = tcf_block_get(&q->block, &q->filter_list, sch, extack); in sfq_init()
780 q->dep[i].next = i + SFQ_MAX_FLOWS; in sfq_init()
781 q->dep[i].prev = i + SFQ_MAX_FLOWS; in sfq_init()
784 q->limit = SFQ_MAX_DEPTH; in sfq_init()
785 q->maxdepth = SFQ_MAX_DEPTH; in sfq_init()
786 q->cur_depth = 0; in sfq_init()
787 q->tail = NULL; in sfq_init()
788 q->divisor = SFQ_DEFAULT_HASH_DIVISOR; in sfq_init()
789 q->maxflows = SFQ_DEFAULT_FLOWS; in sfq_init()
790 q->quantum = psched_mtu(qdisc_dev(sch)); in sfq_init()
791 q->perturb_period = 0; in sfq_init()
792 get_random_bytes(&q->perturbation, sizeof(q->perturbation)); in sfq_init()
800 q->ht = sfq_alloc(sizeof(q->ht[0]) * q->divisor); in sfq_init()
801 q->slots = sfq_alloc(sizeof(q->slots[0]) * q->maxflows); in sfq_init()
802 if (!q->ht || !q->slots) { in sfq_init()
804 return -ENOMEM; in sfq_init()
807 for (i = 0; i < q->divisor; i++) in sfq_init()
808 q->ht[i] = SFQ_EMPTY_SLOT; in sfq_init()
810 for (i = 0; i < q->maxflows; i++) { in sfq_init()
811 slot_queue_init(&q->slots[i]); in sfq_init()
814 if (q->limit >= 1) in sfq_init()
815 sch->flags |= TCQ_F_CAN_BYPASS; in sfq_init()
817 sch->flags &= ~TCQ_F_CAN_BYPASS; in sfq_init()
826 struct red_parms *p = q->red_parms; in sfq_dump()
829 opt.v0.quantum = q->quantum; in sfq_dump()
830 opt.v0.perturb_period = q->perturb_period / HZ; in sfq_dump()
831 opt.v0.limit = q->limit; in sfq_dump()
832 opt.v0.divisor = q->divisor; in sfq_dump()
833 opt.v0.flows = q->maxflows; in sfq_dump()
834 opt.depth = q->maxdepth; in sfq_dump()
835 opt.headdrop = q->headdrop; in sfq_dump()
838 opt.qth_min = p->qth_min >> p->Wlog; in sfq_dump()
839 opt.qth_max = p->qth_max >> p->Wlog; in sfq_dump()
840 opt.Wlog = p->Wlog; in sfq_dump()
841 opt.Plog = p->Plog; in sfq_dump()
842 opt.Scell_log = p->Scell_log; in sfq_dump()
843 opt.max_P = p->max_P; in sfq_dump()
845 memcpy(&opt.stats, &q->stats, sizeof(opt.stats)); in sfq_dump()
846 opt.flags = q->flags; in sfq_dump()
851 return skb->len; in sfq_dump()
855 return -1; in sfq_dump()
885 return q->block; in sfq_tcf_block()
891 tcm->tcm_handle |= TC_H_MIN(cl); in sfq_dump_class()
899 sfq_index idx = q->ht[cl - 1]; in sfq_dump_class_stats()
904 const struct sfq_slot *slot = &q->slots[idx]; in sfq_dump_class_stats()
906 xstats.allot = slot->allot; in sfq_dump_class_stats()
907 qs.qlen = slot->qlen; in sfq_dump_class_stats()
908 qs.backlog = slot->backlog; in sfq_dump_class_stats()
911 return -1; in sfq_dump_class_stats()
920 if (arg->stop) in sfq_walk()
923 for (i = 0; i < q->divisor; i++) { in sfq_walk()
924 if (q->ht[i] == SFQ_EMPTY_SLOT) { in sfq_walk()
925 arg->count++; in sfq_walk()