Home
last modified time | relevance | path

Searched refs:flows (Results 1 – 25 of 59) sorted by relevance

123

/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 = kvzalloc_objs(fq->flows[0], fq->flows_cnt); 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.h57 u32 flows; member
69 struct fq_flow *flows; member
/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
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()
205 flow = &q->flows[id in fq_codel_enqueue()
[all...]
H A Dsch_fq_pie.c22 * - Packets are classified on flows.
23 * - This is a Stochastic model (as we use a hash, several flows might
27 * so that new flows have priority on old ones.
58 struct fq_pie_flow *flows; member
152 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
307 if (q->flows) { in fq_pie_change()
309 "Number of flows cannot be changed"); in fq_pie_change()
315 "Number of flows must range in [1..65536]"); in fq_pie_change()
399 /* Limit this expensive loop to 2048 flows per round. */ in fq_pie_timer()
403 &q->flows[ in fq_pie_timer()
[all...]
H A Dsch_cake.c29 * flows from each other. This prevents a burst on one flow from increasing
34 * Codel and Blue AQM algorithms. This serves flows fairly, and signals
152 struct cake_flow flows[CAKE_QUEUES]; member
279 * obtain the best features of each. Codel is excellent on flows which
281 * unresponsive flows.
806 q->flows[reduced_hash].set)) { in cake_hash()
824 if (!q->flows[outer_hash + k].set) { in cake_hash()
839 if (!q->flows[outer_hash + k].set) { in cake_hash()
854 if (q->flows[outer_hash + k].set == CAKE_SET_BULK) { in cake_hash()
855 cake_dec_srchost_bulk_flow_count(q, &q->flows[outer_has in cake_hash()
[all...]
H A Dsch_fq.c13 * They are also part of one Round Robin 'queues' (new or old flows)
27 * dequeue() : serves flows in Round Robin
138 struct rb_root delayed; /* for rate limited flows */
143 u32 flows; member
299 q->flows -= fcnt;
326 * scheduled in the future (ie no flows are eligible) in fq_fastpath_check()
329 if (q->flows != q->inactive_flows + q->throttled_flows) in fq_fastpath_check()
338 /* Ordering invariants fall apart if some delayed flows in fq_fastpath_check()
460 q->flows++;
888 q->flows in fq_resize()
[all...]
/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 ] ; d
[all...]
/linux/drivers/crypto/allwinner/sun8i-ss/
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()
H A Dsun8i-ss-hash.c295 ss->flows[flow].stat_req++; in sun8i_ss_run_hash_task()
328 reinit_completion(&ss->flows[flow].complete); in sun8i_ss_run_hash_task()
329 ss->flows[flow].status = 0; in sun8i_ss_run_hash_task()
334 wait_for_completion_interruptible_timeout(&ss->flows[flow].complete, in sun8i_ss_run_hash_task()
336 if (ss->flows[flow].status == 0) { in sun8i_ss_run_hash_task()
412 engine = ss->flows[e].engine; in sun8i_ss_hash_digest()
511 result = ss->flows[rctx->flow].result; in sun8i_ss_hash_run()
512 pad = ss->flows[rctx->flow].pad; in sun8i_ss_hash_run()
/linux/drivers/infiniband/hw/hfi1/
H A Dtid_rdma.c757 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()
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()
1612 kfree(req->flows); in hfi1_kern_exp_rcv_free_flows()
1613 req->flows = NULL; in hfi1_kern_exp_rcv_free_flows()
1634 struct tid_rdma_flow *flows; in hfi1_kern_exp_rcv_alloc_flows() local
[all …]
/linux/Documentation/networking/
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
H A Dpktgen.rst97 flows: 0 flowlen: 0
112 flows: 0
286 pgset "flows 1"
391 flows
/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
/linux/drivers/net/ethernet/mellanox/mlx5/core/
H A Den_rep.h183 struct list_head flows; member
208 struct list_head flows; member
H A Deswitch_offloads.c59 /* There are two match-all miss flows, one for unicast dst mac and
358 /* Indirect table is supported only for flows with in_port uplink in esw_is_indir_table()
1191 struct mlx5_flow_handle **flows; in esw_add_fdb_peer_miss_rules()
1209 flows = kvzalloc_objs(*flows, peer_esw->total_vports); in esw_add_fdb_peer_miss_rules()
1210 if (!flows) { in esw_add_fdb_peer_miss_rules()
1232 flows[peer_vport->index] = flow; in esw_add_fdb_peer_miss_rules()
1245 flows[peer_vport->index] = flow; in esw_add_fdb_peer_miss_rules()
1257 flows[peer_vport->index] = flow; in esw_add_fdb_peer_miss_rules()
1270 flows[peer_vpor in esw_add_fdb_peer_miss_rules()
1189 struct mlx5_flow_handle **flows; esw_add_fdb_peer_miss_rules() local
1319 struct mlx5_flow_handle **flows; esw_del_fdb_peer_miss_rules() local
[all...]
/linux/Documentation/admin-guide/pm/
H A Dsystem-wide.rst11 suspend-flows
H A Dsuspend-flows.rst25 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/Documentation/admin-guide/blockdev/drbd/
H A Dfigures.rst5 Data flows that Relate some functions, and write packets
/linux/net/mctp/test/
H A Droute-test.c1028 struct mctp_flow *flows[2];
1052 flows[0] = skb_ext_find(tx_skbs[0], SKB_EXT_MCTP); in mctp_test_fragment_flow()
1053 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, flows[0]); in mctp_test_fragment_flow()
1054 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, flows[0]->key); in mctp_test_fragment_flow()
1055 KUNIT_ASSERT_PTR_EQ(test, flows[0]->key->sk, sock->sk); in mctp_test_fragment_flow()
1057 flows[1] = skb_ext_find(tx_skbs[1], SKB_EXT_MCTP); in mctp_test_fragment_flow()
1058 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, flows[1]); in mctp_test_fragment_flow()
1059 KUNIT_ASSERT_PTR_EQ(test, flows[1]->key, flows[0]->key); in mctp_test_fragment_flow()
1034 struct mctp_flow *flows[2]; mctp_test_fragment_flow() local
/linux/drivers/net/ethernet/ti/
H A Dam65-cpsw-nuss.c513 flow = &rx_chn->flows[id]; in am65_cpsw_destroy_rxq()
573 flow = &rx_chn->flows[id]; in am65_cpsw_create_rxq()
789 am65_cpsw_put_page(&rx_chn->flows[flow_id], page, false); in am65_cpsw_nuss_rx_cleanup()
2356 struct am65_cpsw_rx_flow *flows; in am65_cpsw_nuss_remove_rx_chns()
2360 flows = rx_chn->flows; in am65_cpsw_nuss_remove_rx_chns()
2363 if (!(flows[i].irq < 0)) in am65_cpsw_nuss_remove_rx_chns()
2364 devm_free_irq(dev, flows[i].irq, &flows[i]); in am65_cpsw_nuss_remove_rx_chns()
2365 netif_napi_del(&flows[ in am65_cpsw_nuss_remove_rx_chns()
2358 struct am65_cpsw_rx_flow *flows; am65_cpsw_nuss_remove_rx_chns() local
[all...]
/linux/drivers/cache/
H A DKconfig40 These drivers implement cache management for flows where it is necessary
/linux/net/dccp/ccids/
H A DKconfig
/linux/net/ethtool/
H A Drss.c754 struct nlattr *flows[ETHTOOL_A_FLOW_MAX + 1]; in ethnl_set_rss_fields()
767 ret = nla_parse_nested(flows, ARRAY_SIZE(ethnl_rss_flows_policy) - 1, in ethnl_set_rss_fields()
778 if (!flows[i]) in ethnl_set_rss_fields()
781 fields.data = nla_get_u32(flows[i]); in ethnl_set_rss_fields()
786 NL_SET_ERR_MSG_ATTR(info->extack, flows[i], in ethnl_set_rss_fields()
758 struct nlattr *flows[ETHTOOL_A_FLOW_MAX + 1]; ethnl_set_rss_fields() local
/linux/arch/arm/boot/dts/ti/keystone/
H A Dkeystone-k2g-netcp.dtsi85 <0x4013000 0x400>; /* 32 Rx flows */

123