Home
last modified time | relevance | path

Searched full:flows (Results 1 – 25 of 376) sorted by relevance

12345678910>>...16

/openbmc/linux/samples/pktgen/
H A Dpktgen_sample04_many_flows.sh4 # 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"
/openbmc/linux/tools/testing/selftests/tc-testing/tc-tests/qdiscs/
H A Dfq_codel.json18 …"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 …]
H A Dfq_pie.json4 "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",
/openbmc/linux/include/net/
H A Dfq_impl.h36 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 …]
H A Dfq.h43 * 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
/openbmc/linux/net/sched/
H A Dsch_fq_codel.c29 * 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 …]
H A Dsch_fq_pie.c21 * - 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 …]
H A Dsch_sfq.c53 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 */
120 struct sfq_slot *slots; /* Flows table ('maxflows' entries) */
128 * dep[0] : list of unused flows
129 * dep[1] : list of flows with 1 packet
130 * dep[X] : list of flows with X packets
133 unsigned int maxflows; /* number of flows in flows array */
448 * but we could endup servicing new flows only, and freeze old ones. in sfq_enqueue()
451 /* We could use a bigger initial quantum for new flows */ in sfq_enqueue()
[all …]
H A Dsch_fq.c12 * 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 …]
/openbmc/linux/drivers/crypto/allwinner/sun8i-ss/
H A Dsun8i-ss-core.c76 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 …]
H A Dsun8i-ss-prng.c134 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_prng_generate()
135 ss->flows[flow].status = 0; in sun8i_ss_prng_generate()
141 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_prng_generate()
143 if (ss->flows[flow].status == 0) { in sun8i_ss_prng_generate()
/openbmc/linux/drivers/net/wireless/intel/iwlwifi/
H A Diwl-drv.h29 * 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
/openbmc/linux/samples/bpf/
H A Ddo_hbm_test.sh18 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 …]
/openbmc/linux/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dtc_priv.h83 /* 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 */
/openbmc/linux/Documentation/networking/
H A Dscaling.rst31 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 …]
H A Dnf_flowtable.rst33 specifies what flows are placed into the flowtable. Hence, packets follow the
34 classic IP forwarding path unless the user explicitly instruct flows to use this
111 You can identify offloaded flows through the [OFFLOAD] tag when listing your
130 instead the real device is sufficient for the flowtable to track your flows.
198 There is a workqueue that adds the flows to the hardware. Note that a few
202 You can identify hardware offloaded flows through the [HW_OFFLOAD] tag when
H A Dopenvswitch.rst16 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
/openbmc/linux/drivers/net/ethernet/marvell/mvpp2/
H A Dmvpp2_cls.c26 /* 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 …]
/openbmc/linux/drivers/net/ethernet/netronome/nfp/flower/
H A Dconntrack.h50 * @tc_merge_tb: The table of merged tc flows
56 * @nft_merge_tb: The table of merged tc+nft flows
121 * @children: List of tc_merge flows this flow forms part of
148 * struct nfp_fl_ct_tc_merge - Merge of two flows from tc
170 * struct nfp_fl_nft_tc_merge - Merge of tc_merge flows with nft flow
283 * nfp_fl_ct_stats() - Handle flower stats callbacks for ct flows
/openbmc/linux/drivers/dma/ti/
H A Dk3-udma-glue.c84 struct k3_udma_glue_rx_flow *flows; member
620 * req.rxcq_qnum = k3_ringacc_get_ring_id(rx_chn->flows[0].ringrx); in k3_udma_glue_cfg_rx_chn()
645 struct k3_udma_glue_rx_flow *flow = &rx_chn->flows[flow_num]; in k3_udma_glue_release_rx_flow()
665 struct k3_udma_glue_rx_flow *flow = &rx_chn->flows[flow_idx]; in k3_udma_glue_cfg_rx_flow()
962 rx_chn->flows = devm_kcalloc(dev, rx_chn->flow_num, in k3_udma_glue_request_rx_chn_priv()
963 sizeof(*rx_chn->flows), GFP_KERNEL); in k3_udma_glue_request_rx_chn_priv()
964 if (!rx_chn->flows) { in k3_udma_glue_request_rx_chn_priv()
974 rx_chn->flows[i].udma_rflow_id = rx_chn->flow_id_base + i; in k3_udma_glue_request_rx_chn_priv()
1018 * Linux can only request and manipulate by dedicated RX flows in k3_udma_glue_request_remote_rx_chn()
1043 rx_chn->flows = devm_kcalloc(dev, rx_chn->flow_num, in k3_udma_glue_request_remote_rx_chn()
[all …]
/openbmc/linux/include/uapi/linux/
H A Dpkt_sched.h62 classes (or flows) have major equal to parent qdisc major, and
218 unsigned flows; /* Maximal number of flows */ member
784 __u32 penalty_rate; /* inelastic flows are rate limited to 'rate' pps */
883 __u32 new_flows_len; /* count of flows in new list */
884 __u32 old_flows_len; /* count of flows in old list */
958 __u32 flows; member
1048 __u32 new_flow_count; /* count of new flows created by packets */
1049 __u32 new_flows_len; /* count of flows in new list */
1050 __u32 old_flows_len; /* count of flows in old list */
/openbmc/linux/drivers/media/platform/amphion/
H A Dvpu_dbg.c193 for (i = 0; i < ARRAY_SIZE(inst->flows); i++) { in vpu_dbg_instance()
194 u32 idx = (inst->flow_idx + i) % (ARRAY_SIZE(inst->flows)); in vpu_dbg_instance()
196 if (!inst->flows[idx]) in vpu_dbg_instance()
199 inst->flows[idx] >= VPU_MSG_ID_NOOP ? "M" : "C", in vpu_dbg_instance()
200 vpu_id_name(inst->flows[idx])); in vpu_dbg_instance()
492 inst->flows[inst->flow_idx] = flow; in vpu_inst_record_flow()
493 inst->flow_idx = (inst->flow_idx + 1) % (ARRAY_SIZE(inst->flows)); in vpu_inst_record_flow()
/openbmc/linux/tools/perf/pmu-events/arch/arm64/fujitsu/a64fx/
H A Dpipeline.json141 … the number of times where 2 elements of the gather instructions became 2 flows because 2 elements…
144 … the number of times where 2 elements of the gather instructions became 2 flows because 2 elements…
159 "PublicDescription": "This event counts the number of flows of the scatter instructions.",
162 "BriefDescription": "This event counts the number of flows of the scatter instructions."
/openbmc/linux/Documentation/userspace-api/media/mediactl/
H A Dmedia-controller-model.rst26 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
/openbmc/linux/drivers/infiniband/hw/hfi1/
H A Dtid_rdma.c47 /* Reserved generation value to set to unused flows for kernel contexts */
757 u32 generation = rcd->flows[flow_idx].generation; in kern_setup_hw_flow()
775 rcd->flows[flow_idx].generation = in kern_clear_hw_flow()
776 kern_flow_generation_next(rcd->flows[flow_idx].generation); in kern_clear_hw_flow()
804 rcd->flows[fs->index].generation = fs->generation; in hfi1_kern_setup_hw_flow()
853 rcd->flows[i].generation = mask_generation(get_random_u32()); in hfi1_kern_init_ctxt_generations()
1436 * (6) Reserves and programs HW flows.
1443 * invocation of function call. With flow = &req->flows[req->flow_idx],
1465 struct tid_rdma_flow *flow = &req->flows[req->setup_head]; in hfi1_kern_exp_rcv_setup()
1556 struct tid_rdma_flow *flow = &req->flows[req->clear_tail]; in hfi1_kern_exp_rcv_clear()
[all …]

12345678910>>...16