Home
last modified time | relevance | path

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

12345678910>>...12

/OK3568_Linux_fs/buildroot/dl/sox/git/src/
H A Deffects.c112 if (imin > sox_globals.bufsiz / effp->flows) { in lsx_effect_set_imin()
151 effp->flows = in sox_add_effect()
195 lsx_calloc(effp->flows, sizeof(chain->effects[chain->length][0])); in sox_add_effect()
198 for (f = 1; f < effp->flows; ++f) { in sox_add_effect()
221 * each of several channels separately (flows > 1), the layout is
227 * bufsiz/flows each, starting at offsets 0, bufsiz/flows,
228 * 2*(bufsiz/flows) etc. Within the channel buffers, the data starts
229 * at position obeg/flows and ends before oend/flows. In case bufsiz
230 * is not evenly divisible by flows, there will be an unused area at
235 static void interleave(size_t flows, size_t length, sox_sample_t *from,
[all …]
H A Dgain.c81 effp->flows = 1; /* essentially a conditional SOX_EFF_MCHAN */ in start()
152 for (i = 0; i < effp->flows; ++i) { in start_drain()
157 for (i = 0; i < effp->flows; ++i) { in start_drain()
166 for (i = 0; i < effp->flows; ++i) { in start_drain()
171 for (i = 0; i < effp->flows; ++i) { in start_drain()
178 for (i = 0; i < effp->flows; ++i) { in start_drain()
/OK3568_Linux_fs/kernel/samples/pktgen/
H A Dpktgen_sample04_many_flows.sh4 # 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"
/OK3568_Linux_fs/kernel/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
149 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
301 if (q->flows) { in fq_pie_change()
303 "Number of flows cannot be changed"); in fq_pie_change()
309 "Number of flows must range in [1..65536]"); in fq_pie_change()
383 pie_calculate_probability(&q->p_params, &q->flows[idx].vars, 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 */
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 …]
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 …]
H A Dsch_atm.c66 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()
586 list_for_each_entry(flow, &p->flows, list) { in atm_tc_destroy()
591 list_for_each_entry_safe(flow, tmp, &p->flows, list) { in atm_tc_destroy()
/OK3568_Linux_fs/kernel/include/net/
H A Dfq.h23 * 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
H A Dfq_impl.h125 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()
/OK3568_Linux_fs/kernel/drivers/crypto/allwinner/sun8i-ss/
H A Dsun8i-ss-core.c74 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 …]
H A Dsun8i-ss-hash.c208 ss->flows[flow].stat_req++; in sun8i_ss_run_hash_task()
241 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_run_hash_task()
242 ss->flows[flow].status = 0; in sun8i_ss_run_hash_task()
247 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_run_hash_task()
249 if (ss->flows[flow].status == 0) { in sun8i_ss_run_hash_task()
310 engine = ss->flows[e].engine; in sun8i_ss_hash_digest()
344 result = ss->flows[rctx->flow].result; in sun8i_ss_hash_run()
345 pad = ss->flows[rctx->flow].pad; in sun8i_ss_hash_run()
H A Dsun8i-ss-prng.c131 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_prng_generate()
132 ss->flows[flow].status = 0; in sun8i_ss_prng_generate()
138 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_prng_generate()
140 if (ss->flows[flow].status == 0) { in sun8i_ss_prng_generate()
/OK3568_Linux_fs/kernel/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
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 …]
/OK3568_Linux_fs/kernel/drivers/dma/ti/
H A Dk3-udma-glue.c79 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 …]
/OK3568_Linux_fs/kernel/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 */
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 …]
/OK3568_Linux_fs/kernel/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 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
H A Dpktgen.rst97 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
/OK3568_Linux_fs/kernel/drivers/net/wireless/intel/iwlwifi/
H A Diwl-drv.h84 * 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
/OK3568_Linux_fs/kernel/tools/testing/selftests/tc-testing/tc-tests/qdiscs/
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",
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rkwifi/bcmdhd/
H A Ddhd_linux_sock_qos.c4 * Defines a socket flow and maintains a table of socket flows
48 /* Maximum number of Socket Flows supported */
114 /* Table of Socket Flows */
116 /* maximum number for socket flows supported */
122 /* List in which active Socket Flows live */
129 * Keep track of number of flows upgraded.
139 * when no more flows are in upgraded state, so that
377 * Check the bound to control the number of flows getting upgraded in __dhd_upgrade_sock_flow()
388 /* if no flows upgraded till now, and this is the in __dhd_upgrade_sock_flow()
455 DHD_ERROR_RLMT(("%s(): FATAL ! no upgraded flows !\n", in __dhd_downgrade_sock_flow()
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/bcmdhd/
H A Ddhd_linux_sock_qos.c4 * Defines a socket flow and maintains a table of socket flows
48 /* Maximum number of Socket Flows supported */
114 /* Table of Socket Flows */
116 /* maximum number for socket flows supported */
122 /* List in which active Socket Flows live */
129 * Keep track of number of flows upgraded.
139 * when no more flows are in upgraded state, so that
377 * Check the bound to control the number of flows getting upgraded in __dhd_upgrade_sock_flow()
388 /* if no flows upgraded till now, and this is the in __dhd_upgrade_sock_flow()
455 DHD_ERROR_RLMT(("%s(): FATAL ! no upgraded flows !\n", in __dhd_downgrade_sock_flow()
[all …]
/OK3568_Linux_fs/kernel/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
766 __u32 penalty_rate; /* inelastic flows are rate limited to 'rate' pps */
863 __u32 new_flows_len; /* count of flows in new list */
864 __u32 old_flows_len; /* count of flows in old list */
938 __u32 flows; member
1028 __u32 new_flow_count; /* count of new flows created by packets */
1029 __u32 new_flows_len; /* count of flows in new list */
1030 __u32 old_flows_len; /* count of flows in old list */
/OK3568_Linux_fs/kernel/drivers/infiniband/hw/hfi1/
H A Dtid_rdma.c47 /* 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 …]

12345678910>>...12