| /kernel/linux/linux-5.10/samples/pktgen/ |
| D | pktgen_sample04_many_flows.sh | 4 # Script example for many flows testing
6 # Number of simultaneous flows limited by variable $FLOWS
33 # Limiting the number of concurrent flows ($FLOWS)
36 [ -z "$FLOWS" ] && FLOWS="8000"
85 # Limit number of flows (max 65535)
86 pg_set $dev "flows $FLOWS"
|
| /kernel/linux/linux-6.6/samples/pktgen/ |
| D | pktgen_sample04_many_flows.sh | 4 # Script example for many flows testing
6 # Number of simultaneous flows limited by variable $FLOWS
37 # Limiting the number of concurrent flows ($FLOWS)
40 [ -z "$FLOWS" ] && FLOWS="8000"
88 # Limit number of flows (max 65535)
89 pg_set $dev "flows $FLOWS"
|
| /kernel/linux/linux-6.6/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
| D | fq_codel.json | 18 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
41 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 1000p flows 1024 quantum.*target 5ms i…
64 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
87 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 2ms …
110 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
133 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum 9000 target …
156 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
179 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
202 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
222 …"cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_codel limit 1000 flows 256 drop_batch …
[all …]
|
| D | fq_pie.json | 4 "name": "Create FQ-PIE with invalid number of flows",
12 "cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_pie flows 65536",
15 "matchPattern": "qdisc fq_pie 1: root refcnt 2 limit 10240p flows 65536",
|
| /kernel/linux/linux-5.10/include/net/ |
| D | fq.h | 23 * fat flows and efficient head-dropping if packet limit is reached
42 * pull interleaved packets out of the associated flows.
54 u32 flows; member
62 * @backlogs: linked to fq_flows. Used to maintain fat flows for efficient
64 * @limit: max number of packets that can be queued across all flows
65 * @backlog: number of packets queued across all flows
68 struct fq_flow *flows; member
|
| D | fq_impl.h | 125 flow = &fq->flows[idx]; in fq_flow_classify()
133 tin->flows++; in fq_flow_classify()
315 fq->flows = kvcalloc(fq->flows_cnt, sizeof(fq->flows[0]), GFP_KERNEL); in fq_init()
316 if (!fq->flows) in fq_init()
320 fq_flow_init(&fq->flows[i]); in fq_init()
331 fq_flow_reset(fq, &fq->flows[i], free_func); in fq_reset()
333 kvfree(fq->flows); in fq_reset()
334 fq->flows = NULL; in fq_reset()
|
| /kernel/linux/linux-6.6/include/net/ |
| D | fq_impl.h | 36 idx = flow - fq->flows; in __fq_adjust_removal()
152 flow = &fq->flows[idx]; in fq_flow_classify()
160 tin->flows++; in fq_flow_classify()
173 struct fq_flow *cur = &fq->flows[i]; in fq_find_fattest_flow()
361 fq->flows = kvcalloc(fq->flows_cnt, sizeof(fq->flows[0]), GFP_KERNEL); in fq_init()
362 if (!fq->flows) in fq_init()
367 kvfree(fq->flows); in fq_init()
368 fq->flows = NULL; in fq_init()
373 fq_flow_init(&fq->flows[i]); in fq_init()
384 fq_flow_reset(fq, &fq->flows[i], free_func); in fq_reset()
[all …]
|
| D | fq.h | 43 * pull interleaved packets out of the associated flows.
57 u32 flows; member
65 * @limit: max number of packets that can be queued across all flows
66 * @backlog: number of packets queued across all flows
69 struct fq_flow *flows; member
|
| /kernel/linux/linux-6.6/net/sched/ |
| D | sch_fq_codel.c | 29 * Packets are classified (internal classifier or external) on flows.
30 * This is a Stochastic model (as we use a hash, several flows
33 * Flows are linked onto two (Round Robin) lists,
34 * so that new flows have priority on old ones.
53 struct fq_codel_flow *flows; /* Flows table [flows_cnt] */ member
55 u32 flows_cnt; /* number of flows */
66 struct list_head new_flows; /* list of new flows */
67 struct list_head old_flows; /* list of old flows */
148 * This might sound expensive, but with 1024 flows, we scan in fq_codel_drop()
164 flow = &q->flows[idx]; in fq_codel_drop()
[all …]
|
| D | sch_fq_pie.c | 21 * - Packets are classified on flows.
22 * - This is a Stochastic model (as we use a hash, several flows might
25 * - Flows are linked onto two (Round Robin) lists,
26 * so that new flows have priority on old ones.
57 struct fq_pie_flow *flows; member
150 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
305 if (q->flows) { in fq_pie_change()
307 "Number of flows cannot be changed"); in fq_pie_change()
313 "Number of flows must range in [1..65536]"); in fq_pie_change()
388 /* Limit this expensive loop to 2048 flows per round. */ in fq_pie_timer()
[all …]
|
| /kernel/linux/linux-5.10/net/sched/ |
| D | sch_fq_codel.c | 29 * Packets are classified (internal classifier or external) on flows.
30 * This is a Stochastic model (as we use a hash, several flows
33 * Flows are linked onto two (Round Robin) lists,
34 * so that new flows have priority on old ones.
53 struct fq_codel_flow *flows; /* Flows table [flows_cnt] */ member
55 u32 flows_cnt; /* number of flows */
66 struct list_head new_flows; /* list of new flows */
67 struct list_head old_flows; /* list of old flows */
148 * This might sound expensive, but with 1024 flows, we scan in fq_codel_drop()
164 flow = &q->flows[idx]; in fq_codel_drop()
[all …]
|
| D | sch_fq_pie.c | 21 * - Packets are classified on flows.
22 * - This is a Stochastic model (as we use a hash, several flows might
25 * - Flows are linked onto two (Round Robin) lists,
26 * so that new flows have priority on old ones.
57 struct fq_pie_flow *flows; member
150 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
308 if (q->flows) { in fq_pie_change()
310 "Number of flows cannot be changed"); in fq_pie_change()
316 "Number of flows must range in [1..65536]"); in fq_pie_change()
390 /* Limit this expensive loop to 2048 flows per round. */ in fq_pie_timer()
[all …]
|
| /kernel/linux/linux-5.10/drivers/crypto/allwinner/sun8i-ss/ |
| D | sun8i-ss-core.c | 74 ss->flows[flow].stat_req++; in sun8i_ss_run_task()
130 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_run_task()
131 ss->flows[flow].status = 0; in sun8i_ss_run_task()
136 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_run_task()
138 if (ss->flows[flow].status == 0) { in sun8i_ss_run_task()
157 ss->flows[flow].status = 1; in ss_irq_handler()
158 complete(&ss->flows[flow].complete); in ss_irq_handler()
422 seq_printf(seq, "Channel %d: nreq %lu\n", i, ss->flows[i].stat_req); in sun8i_ss_debugfs_show()
457 crypto_engine_exit(ss->flows[i].engine); in sun8i_ss_free_flows()
469 ss->flows = devm_kcalloc(ss->dev, MAXFLOW, sizeof(struct sun8i_ss_flow), in allocate_flows()
[all …]
|
| /kernel/linux/linux-6.6/drivers/crypto/allwinner/sun8i-ss/ |
| D | sun8i-ss-core.c | 76 ss->flows[flow].stat_req++; in sun8i_ss_run_task()
132 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_run_task()
133 ss->flows[flow].status = 0; in sun8i_ss_run_task()
138 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_run_task()
140 if (ss->flows[flow].status == 0) { in sun8i_ss_run_task()
159 ss->flows[flow].status = 1; in ss_irq_handler()
160 complete(&ss->flows[flow].complete); in ss_irq_handler()
483 ss->flows[i].stat_req); in sun8i_ss_debugfs_show()
541 crypto_engine_exit(ss->flows[i].engine); in sun8i_ss_free_flows()
553 ss->flows = devm_kcalloc(ss->dev, MAXFLOW, sizeof(struct sun8i_ss_flow), in allocate_flows()
[all …]
|
| /kernel/linux/linux-6.6/drivers/net/wireless/intel/iwlwifi/ |
| D | iwl-drv.h | 29 * DOC: Driver system flows - drv component
31 * This component implements the system flows such as bus enumeration, bus
32 * removal. Bus dependent parts of system flows (such as iwl_pci_probe) are in
37 * the wifi flows: it will allow to have several fw API implementation. These
62 * specific system flows implementations. For example, the bus specific probe
73 * Stop the driver. This should be called by bus specific system flows
|
| /kernel/linux/linux-5.10/samples/bpf/ |
| D | do_hbm_test.sh | 18 echo " [-f=<#flows>|--flows=<#flows>] [-h] [-i=<id>|--id=<id >]"
34 echo " -f or --flows number of concurrent flows (default=1)"
38 echo " -l do not limit flows using loopback"
78 flows=1
140 -f=*|--flows=*)
141 flows="${i#*=}"
267 while [ $flow_cnt -le $flows ] ; do
309 while [ $flow_cnt -le $flows ] ; do
335 iperf3 -c $host -p $port -i 0 -P $flows -f m -t $dur > iperf.$id
355 while [ $flow_cnt -le $flows ] ; do
[all …]
|
| /kernel/linux/linux-6.6/samples/bpf/ |
| D | do_hbm_test.sh | 18 echo " [-f=<#flows>|--flows=<#flows>] [-h] [-i=<id>|--id=<id >]"
34 echo " -f or --flows number of concurrent flows (default=1)"
38 echo " -l do not limit flows using loopback"
78 flows=1
150 -f=*|--flows=*)
151 flows="${i#*=}"
278 while [ $flow_cnt -le $flows ] ; do
320 while [ $flow_cnt -le $flows ] ; do
346 iperf3 -c $host -p $port -i 0 -P $flows -f m -t $dur > iperf.$id
366 while [ $flow_cnt -le $flows ] ; do
[all …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
| D | fq_pie.json | 4 "name": "Create FQ-PIE with invalid number of flows",
12 "cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_pie flows 65536",
15 "matchPattern": "qdisc fq_pie 1: root refcnt 2 limit 10240p flows 65536",
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/en/ |
| D | tc_priv.h | 83 /* flows sharing the same reformat object - currently mpls decap */
87 /* flows sharing same route entry */
98 struct list_head hairpin; /* flows sharing the same hairpin */
99 struct list_head peer[MLX5_MAX_PORTS]; /* flows with peer flow */
100 struct list_head unready; /* flows not ready to be offloaded (e.g
103 struct list_head peer_flows; /* flows on peer */
|
| /kernel/linux/linux-5.10/drivers/dma/ti/ |
| D | k3-udma-glue.c | 79 struct k3_udma_glue_rx_flow *flows; member
511 * req.rxcq_qnum = k3_ringacc_get_ring_id(rx_chn->flows[0].ringrx); in k3_udma_glue_cfg_rx_chn()
533 struct k3_udma_glue_rx_flow *flow = &rx_chn->flows[flow_num]; in k3_udma_glue_release_rx_flow()
553 struct k3_udma_glue_rx_flow *flow = &rx_chn->flows[flow_idx]; in k3_udma_glue_cfg_rx_flow()
786 rx_chn->flows = devm_kcalloc(dev, rx_chn->flow_num, in k3_udma_glue_request_rx_chn_priv()
787 sizeof(*rx_chn->flows), GFP_KERNEL); in k3_udma_glue_request_rx_chn_priv()
788 if (!rx_chn->flows) { in k3_udma_glue_request_rx_chn_priv()
798 rx_chn->flows[i].udma_rflow_id = rx_chn->flow_id_base + i; in k3_udma_glue_request_rx_chn_priv()
855 * Linux can only request and manipulate by dedicated RX flows in k3_udma_glue_request_remote_rx_chn()
880 rx_chn->flows = devm_kcalloc(dev, rx_chn->flow_num, in k3_udma_glue_request_remote_rx_chn()
[all …]
|
| /kernel/linux/linux-5.10/drivers/net/wireless/intel/iwlwifi/ |
| D | iwl-drv.h | 84 * DOC: Driver system flows - drv component
86 * This component implements the system flows such as bus enumeration, bus
87 * removal. Bus dependent parts of system flows (such as iwl_pci_probe) are in
92 * the wifi flows: it will allow to have several fw API implementation. These
117 * specific system flows implementations. For example, the bus specific probe
128 * Stop the driver. This should be called by bus specific system flows
|
| /kernel/linux/linux-6.6/Documentation/networking/ |
| D | scaling.rst | 31 of logical flows. Packets for each flow are steered to a separate receive
188 to the same CPU is CPU load imbalance if flows vary in packet rate.
194 Flow Limit is an optional RPS feature that prioritizes small flows
195 during CPU contention by dropping packets from large flows slightly
196 ahead of those from small flows. It is active only when an RPS or RFS
202 new packet is dropped. Packets from other flows are still only
206 even large flows maintain connectivity.
224 identification of large flows and fewer false positives. The default
261 flows to the CPUs where those flows are being processed. The flow hash
266 same CPU. Indeed, with many flows and few CPUs, it is very likely that
[all …]
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | scaling.rst | 31 of logical flows. Packets for each flow are steered to a separate receive
188 to the same CPU is CPU load imbalance if flows vary in packet rate.
194 Flow Limit is an optional RPS feature that prioritizes small flows
195 during CPU contention by dropping packets from large flows slightly
196 ahead of those from small flows. It is active only when an RPS or RFS
202 new packet is dropped. Packets from other flows are still only
206 even large flows maintain connectivity.
224 identification of large flows and fewer false positives. The default
261 flows to the CPUs where those flows are being processed. The flow hash
266 same CPU. Indeed, with many flows and few CPUs, it is very likely that
[all …]
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/marvell/mvpp2/ |
| D | mvpp2_cls.c | 26 /* TCP over IPv4 flows, Not fragmented, no vlan tag */
45 /* TCP over IPv4 flows, Not fragmented, with vlan tag */
61 /* TCP over IPv4 flows, fragmented, no vlan tag */
80 /* TCP over IPv4 flows, fragmented, with vlan tag */
96 /* UDP over IPv4 flows, Not fragmented, no vlan tag */
115 /* UDP over IPv4 flows, Not fragmented, with vlan tag */
131 /* UDP over IPv4 flows, fragmented, no vlan tag */
150 /* UDP over IPv4 flows, fragmented, with vlan tag */
166 /* TCP over IPv6 flows, not fragmented, no vlan tag */
179 /* TCP over IPv6 flows, not fragmented, with vlan tag */
[all …]
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/marvell/mvpp2/ |
| D | mvpp2_cls.c | 26 /* TCP over IPv4 flows, Not fragmented, no vlan tag */
45 /* TCP over IPv4 flows, Not fragmented, with vlan tag */
61 /* TCP over IPv4 flows, fragmented, no vlan tag */
80 /* TCP over IPv4 flows, fragmented, with vlan tag */
99 /* UDP over IPv4 flows, Not fragmented, no vlan tag */
118 /* UDP over IPv4 flows, Not fragmented, with vlan tag */
134 /* UDP over IPv4 flows, fragmented, no vlan tag */
153 /* UDP over IPv4 flows, fragmented, with vlan tag */
172 /* TCP over IPv6 flows, not fragmented, no vlan tag */
185 /* TCP over IPv6 flows, not fragmented, with vlan tag */
[all …]
|