Home
last modified time | relevance | path

Searched refs:qdiscs (Results 1 – 14 of 14) sorted by relevance

/kernel/linux/linux-5.10/net/sched/
Dsch_mq.c21 struct Qdisc **qdiscs; member
60 if (!priv->qdiscs) in mq_destroy()
62 for (ntx = 0; ntx < dev->num_tx_queues && priv->qdiscs[ntx]; ntx++) in mq_destroy()
63 qdisc_put(priv->qdiscs[ntx]); in mq_destroy()
64 kfree(priv->qdiscs); in mq_destroy()
83 priv->qdiscs = kcalloc(dev->num_tx_queues, sizeof(priv->qdiscs[0]), in mq_init()
85 if (!priv->qdiscs) in mq_init()
96 priv->qdiscs[ntx] = qdisc; in mq_init()
114 qdisc = priv->qdiscs[ntx]; in mq_attach()
124 kfree(priv->qdiscs); in mq_attach()
[all …]
Dsch_skbprio.c34 struct sk_buff_head qdiscs[SKBPRIO_MAX_PRIORITY]; member
45 if (!skb_queue_empty(&q->qdiscs[prio])) in calc_new_high_prio()
58 if (!skb_queue_empty(&q->qdiscs[prio])) in calc_new_low_prio()
81 qdisc = &q->qdiscs[prio]; in skbprio_enqueue()
111 lp_qdisc = &q->qdiscs[lp]; in skbprio_enqueue()
142 struct sk_buff_head *hpq = &q->qdiscs[q->highest_prio]; in skbprio_dequeue()
187 __skb_queue_head_init(&q->qdiscs[prio]); in skbprio_init()
220 __skb_queue_purge(&q->qdiscs[prio]); in skbprio_reset()
233 __skb_queue_purge(&q->qdiscs[prio]); in skbprio_destroy()
Dsch_mqprio.c21 struct Qdisc **qdiscs; member
36 if (priv->qdiscs) { in mqprio_destroy()
38 ntx < dev->num_tx_queues && priv->qdiscs[ntx]; in mqprio_destroy()
40 qdisc_put(priv->qdiscs[ntx]); in mqprio_destroy()
41 kfree(priv->qdiscs); in mqprio_destroy()
221 priv->qdiscs = kcalloc(dev->num_tx_queues, sizeof(priv->qdiscs[0]), in mqprio_init()
223 if (!priv->qdiscs) in mqprio_init()
235 priv->qdiscs[i] = qdisc; in mqprio_init()
298 qdisc = priv->qdiscs[ntx]; in mqprio_attach()
305 kfree(priv->qdiscs); in mqprio_attach()
[all …]
Dsch_taprio.c63 struct Qdisc **qdiscs; member
426 child = q->qdiscs[queue]; in taprio_enqueue()
463 struct Qdisc *child = q->qdiscs[i]; in taprio_peek_soft()
497 struct Qdisc *child = q->qdiscs[i]; in taprio_peek_offload()
548 struct Qdisc *child = q->qdiscs[i]; in taprio_dequeue_soft()
622 struct Qdisc *child = q->qdiscs[i]; in taprio_dequeue_offload()
1621 if (q->qdiscs) { in taprio_reset()
1623 if (q->qdiscs[i]) in taprio_reset()
1624 qdisc_reset(q->qdiscs[i]); in taprio_reset()
1647 if (q->qdiscs) { in taprio_destroy()
[all …]
DKconfig430 qdiscs in one scheduler. ETS makes it easy to configure a set of
/kernel/linux/linux-5.10/drivers/net/ethernet/netronome/nfp/abm/
Dqdisc.c260 radix_tree_for_each_slot(slot, &alink->qdiscs, &iter, 0) { in nfp_abm_qdisc_offload_update()
269 radix_tree_for_each_slot(slot, &alink->qdiscs, &iter, 0) { in nfp_abm_qdisc_offload_update()
303 radix_tree_for_each_slot(slot, &alink->qdiscs, &iter, 0) { in nfp_abm_qdisc_clear_mq()
329 WARN_ON(radix_tree_delete(&alink->qdiscs, in nfp_abm_qdisc_free()
363 err = radix_tree_insert(&alink->qdiscs, TC_H_MAJ(qdisc->handle), qdisc); in nfp_abm_qdisc_alloc()
383 return radix_tree_lookup(&alink->qdiscs, TC_H_MAJ(handle)); in nfp_abm_qdisc_find()
Dmain.h222 struct radix_tree_root qdiscs; member
Dmain.c351 INIT_RADIX_TREE(&alink->qdiscs, GFP_KERNEL); in nfp_abm_vnic_alloc()
367 WARN(!radix_tree_empty(&alink->qdiscs), "left over qdiscs\n"); in nfp_abm_vnic_free()
/kernel/linux/linux-5.10/Documentation/networking/
Dmultiqueue.rst31 Currently two qdiscs are optimized for multiqueue devices. The first is the
51 qdiscs. To add the MULTIQ qdisc to your network device, assuming the device
Dtc-actions-env-rules.rst23 The "environmental" rules for callers of actions (qdiscs etc) are:
Dip-sysctl.rst905 (e.g.: qdiscs, CPU backlog, or device) hurting latency of other
906 flows, for typical pfifo_fast qdiscs. tcp_limit_output_bytes
/kernel/linux/linux-5.10/tools/bpf/bpftool/Documentation/
Dbpftool-net.rst52 all bpf programs attached to non clsact qdiscs, and finally all
/kernel/linux/linux-5.10/tools/testing/selftests/tc-testing/creating-testcases/
DAddingTestCases.txt66 this test was started: qdiscs deleted, actions flushed, etc.
/kernel/linux/linux-5.10/net/netfilter/
DKconfig791 the priority of a packet. Some qdiscs can use this value for