| /Linux-v5.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
31 # Limiting the number of concurrent flows ($FLOWS)
34 [ -z "$FLOWS" ] && FLOWS="8000"
83 # Limit number of flows (max 65535)
84 pg_set $dev "flows $FLOWS"
|
| /Linux-v5.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()
|
| /Linux-v5.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
141 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
294 if (q->flows) { in fq_pie_change()
296 "Number of flows cannot be changed"); in fq_pie_change()
302 "Number of flows must range in [1..65535]"); in fq_pie_change()
376 pie_calculate_probability(&q->p_params, &q->flows[idx].vars, in fq_pie_timer()
[all …]
|
| D | sch_sfq.c | 53 When hash collisions occur, several flows are considered as one.
69 - max 65408 flows,
76 #define SFQ_MAX_FLOWS (0x10000 - SFQ_MAX_DEPTH - 1) /* max number of flows */
127 struct sfq_slot *slots; /* Flows table ('maxflows' entries) */
135 * dep[0] : list of unused flows
136 * dep[1] : list of flows with 1 packet
137 * dep[X] : list of flows with X packets
140 unsigned int maxflows; /* number of flows in flows array */
455 * but we could endup servicing new flows only, and freeze old ones. in sfq_enqueue()
458 /* We could use a bigger initial quantum for new flows */ in sfq_enqueue()
[all …]
|
| D | sch_fq.c | 12 * Flows are dynamically allocated and stored in a hash table of RB trees
13 * They are also part of one Round Robin 'queues' (new or old flows)
27 * dequeue() : serves flows in Round Robin
101 struct rb_root delayed; /* for rate limited flows */
120 u32 flows; member
207 /* limit number of collected flows per round */
254 q->flows -= fcnt; in fq_gc()
304 if (q->flows >= (2U << q->fq_trees_log) && in fq_classify()
305 q->inactive_flows > q->flows/2) in fq_classify()
359 q->flows++; in fq_classify()
[all …]
|
| D | sch_atm.c | 66 struct list_head flows; /* NB: "link" is also on this member
78 list_for_each_entry(flow, &p->flows, list) { in lookup_flow()
355 list_for_each_entry(flow, &p->flows, list) { in atm_tc_walk()
393 list_for_each_entry(flow, &p->flows, list) { in atm_tc_enqueue()
477 list_for_each_entry(flow, &p->flows, list) { in sch_atm_dequeue()
548 INIT_LIST_HEAD(&p->flows); in atm_tc_init()
550 list_add(&p->link.list, &p->flows); in atm_tc_init()
576 list_for_each_entry(flow, &p->flows, list) in atm_tc_reset()
587 list_for_each_entry(flow, &p->flows, list) { in atm_tc_destroy()
592 list_for_each_entry_safe(flow, tmp, &p->flows, list) { in atm_tc_destroy()
|
| /Linux-v5.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 …]
|
| /Linux-v5.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 …]
|
| /Linux-v5.10/drivers/crypto/allwinner/sun8i-ss/ |
| D | sun8i-ss-core.c | 71 ss->flows[flow].stat_req++; in sun8i_ss_run_task()
128 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_run_task()
129 ss->flows[flow].status = 0; in sun8i_ss_run_task()
134 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_run_task()
136 if (ss->flows[flow].status == 0) { in sun8i_ss_run_task()
155 ss->flows[flow].status = 1; in ss_irq_handler()
156 complete(&ss->flows[flow].complete); in ss_irq_handler()
420 seq_printf(seq, "Channel %d: nreq %lu\n", i, ss->flows[i].stat_req); in sun8i_ss_debugfs_show()
455 crypto_engine_exit(ss->flows[i].engine); in sun8i_ss_free_flows()
467 ss->flows = devm_kcalloc(ss->dev, MAXFLOW, sizeof(struct sun8i_ss_flow), in allocate_flows()
[all …]
|
| D | sun8i-ss-prng.c | 130 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_prng_generate()
131 ss->flows[flow].status = 0; in sun8i_ss_prng_generate()
137 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_prng_generate()
139 if (ss->flows[flow].status == 0) { in sun8i_ss_prng_generate()
|
| D | sun8i-ss-hash.c | 207 ss->flows[flow].stat_req++; in sun8i_ss_run_hash_task()
240 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_run_hash_task()
241 ss->flows[flow].status = 0; in sun8i_ss_run_hash_task()
246 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_run_hash_task()
248 if (ss->flows[flow].status == 0) { in sun8i_ss_run_hash_task()
309 engine = ss->flows[e].engine; in sun8i_ss_hash_digest()
|
| /Linux-v5.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
|
| /Linux-v5.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 …]
|
| D | openvswitch.rst | 16 table" that userspace populates with "flows" that map from keys based
104 A wildcarded flow can represent a group of exact match flows. Each '1' bit
108 by reduce the number of new flows need to be processed by the user space program.
120 two possible approaches: reactively install flows as they miss the kernel
130 The behavior when using overlapping wildcarded flows is undefined. It is the
133 performs best-effort detection of overlapping wildcarded flows and may reject
146 future operations. The kernel is not required to index flows by the original
|
| D | pktgen.rst | 97 flows: 0 flowlen: 0
112 flows: 0
269 pktgen.conf-1-1-flows # 1 CPU 1 dev multiple flows.
287 pgset "flows 1"
381 flows
|
| /Linux-v5.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 …]
|
| /Linux-v5.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 root fq_pie flows 65536",
|
| /Linux-v5.10/Documentation/userspace-api/media/mediactl/ |
| D | media-controller-model.rst | 26 by an entity flows from the entity's output to one or more entity
31 pads, either on the same entity or on different entities. Data flows
|
| /Linux-v5.10/include/linux/ |
| D | kvm_types.h | 65 * Memory caches are used to preallocate memory ahead of various MMU flows,
67 * MMU flows is problematic, as is triggering reclaim, I/O, etc... while
|
| /Linux-v5.10/include/uapi/linux/ |
| D | pkt_sched.h | 62 classes (or flows) have major equal to parent qdisc major, and
218 unsigned flows; /* Maximal number of flows */ member
766 __u32 penalty_rate; /* inelastic flows are rate limited to 'rate' pps */
861 __u32 new_flows_len; /* count of flows in new list */
862 __u32 old_flows_len; /* count of flows in old list */
936 __u32 flows; member
1026 __u32 new_flow_count; /* count of new flows created by packets */
1027 __u32 new_flows_len; /* count of flows in new list */
1028 __u32 old_flows_len; /* count of flows in old list */
|
| /Linux-v5.10/drivers/infiniband/hw/hfi1/ |
| D | tid_rdma.c | 47 /* Reserved generation value to set to unused flows for kernel contexts */
752 u32 generation = rcd->flows[flow_idx].generation; in kern_setup_hw_flow()
770 rcd->flows[flow_idx].generation = in kern_clear_hw_flow()
771 kern_flow_generation_next(rcd->flows[flow_idx].generation); in kern_clear_hw_flow()
799 rcd->flows[fs->index].generation = fs->generation; in hfi1_kern_setup_hw_flow()
848 rcd->flows[i].generation = mask_generation(prandom_u32()); in hfi1_kern_init_ctxt_generations()
1429 * (6) Reserves and programs HW flows.
1436 * invocation of function call. With flow = &req->flows[req->flow_idx],
1458 struct tid_rdma_flow *flow = &req->flows[req->setup_head]; in hfi1_kern_exp_rcv_setup()
1549 struct tid_rdma_flow *flow = &req->flows[req->clear_tail]; in hfi1_kern_exp_rcv_clear()
[all …]
|
| /Linux-v5.10/Documentation/admin-guide/pm/ |
| D | suspend-flows.rst | 5 System Suspend Code Flows
25 The kernel code flows associated with the suspend and resume transitions for
27 significant differences between the :ref:`suspend-to-idle <s2idle>` code flows
28 and the code flows related to the :ref:`suspend-to-RAM <s2ram>` and
35 available. Apart from that, the suspend and resume code flows for these sleep
|
| /Linux-v5.10/drivers/net/ethernet/broadcom/bnxt/ |
| D | bnxt_tc.h | 147 * This table is used to maintain a list of flows that use
180 /* a linked list of flows that share the same l2 key */
183 /* number of flows/tunnels sharing the l2 key */
|
