Home
last modified time | relevance | path

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

123

/Linux-v5.4/include/net/
Dfq_impl.h125 flow = &fq->flows[idx]; in fq_flow_classify()
133 tin->flows++; in fq_flow_classify()
316 fq->flows = kvcalloc(fq->flows_cnt, sizeof(fq->flows[0]), GFP_KERNEL); in fq_init()
317 if (!fq->flows) in fq_init()
321 fq_flow_init(&fq->flows[i]); in fq_init()
332 fq_flow_reset(fq, &fq->flows[i], free_func); in fq_reset()
334 kvfree(fq->flows); in fq_reset()
335 fq->flows = NULL; in fq_reset()
Dfq.h54 u32 flows; member
68 struct fq_flow *flows; member
/Linux-v5.4/samples/bpf/
Ddo_hbm_test.sh78 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
375 while [ $flow_cnt -le $flows ] ; do
/Linux-v5.4/net/sched/
Dsch_fq_codel.c54 struct fq_codel_flow *flows; /* Flows table [flows_cnt] */ member
165 flow = &q->flows[idx]; in fq_codel_drop()
205 flow = &q->flows[idx]; in fq_codel_enqueue()
266 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb); in dequeue_func()
344 struct fq_codel_flow *flow = q->flows + i; in fq_codel_reset()
383 if (q->flows) in fq_codel_change()
447 kvfree(q->flows); in fq_codel_destroy()
479 if (!q->flows) { in fq_codel_init()
480 q->flows = kvcalloc(q->flows_cnt, in fq_codel_init()
483 if (!q->flows) { in fq_codel_init()
[all …]
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()
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()
Dsch_fq.c113 u32 flows; member
230 q->flows -= fcnt; in fq_gc()
284 if (q->flows >= (2U << q->fq_trees_log) && in fq_classify()
285 q->inactive_flows > q->flows/2) in fq_classify()
332 q->flows++; in fq_classify()
649 q->flows = 0; in fq_reset()
694 q->flows -= fcnt; in fq_rehash()
950 st.flows = q->flows; in fq_dump_stats()
Dsch_cake.c150 struct cake_flow flows[CAKE_QUEUES]; member
707 q->flows[reduced_hash].set)) { in cake_hash()
725 if (!q->flows[outer_hash + k].set) { in cake_hash()
740 if (!q->flows[outer_hash + k].set) { in cake_hash()
752 if (q->flows[outer_hash + k].set == CAKE_SET_BULK) { in cake_hash()
753 q->hosts[q->flows[reduced_hash].srchost].srchost_bulk_flow_count--; in cake_hash()
754 q->hosts[q->flows[reduced_hash].dsthost].dsthost_bulk_flow_count--; in cake_hash()
781 if (q->flows[reduced_hash].set == CAKE_SET_BULK) in cake_hash()
783 q->flows[reduced_hash].srchost = srchost_idx; in cake_hash()
804 if (q->flows[reduced_hash].set == CAKE_SET_BULK) in cake_hash()
[all …]
Dsch_sfq.c654 if (ctl->flows) in sfq_change()
655 q->maxflows = min_t(u32, ctl->flows, SFQ_MAX_FLOWS); in sfq_change()
791 opt.v0.flows = q->maxflows; in sfq_dump()
/Linux-v5.4/drivers/infiniband/hw/hfi1/
Dtid_rdma.c752 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()
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()
1605 kfree(req->flows); in hfi1_kern_exp_rcv_free_flows()
1606 req->flows = NULL; in hfi1_kern_exp_rcv_free_flows()
1627 struct tid_rdma_flow *flows; in hfi1_kern_exp_rcv_alloc_flows() local
[all …]
/Linux-v5.4/drivers/net/ethernet/mellanox/mlx5/core/
Deswitch_offloads.c685 struct mlx5_flow_handle **flows; in esw_add_fdb_peer_miss_rules() local
699 flows = kvzalloc(nvports * sizeof(*flows), GFP_KERNEL); in esw_add_fdb_peer_miss_rules()
700 if (!flows) { in esw_add_fdb_peer_miss_rules()
719 flows[MLX5_VPORT_PF] = flow; in esw_add_fdb_peer_miss_rules()
730 flows[mlx5_eswitch_ecpf_idx(esw)] = flow; in esw_add_fdb_peer_miss_rules()
744 flows[i] = flow; in esw_add_fdb_peer_miss_rules()
747 esw->fdb_table.offloads.peer_miss_rules = flows; in esw_add_fdb_peer_miss_rules()
755 mlx5_del_flow_rules(flows[i]); in esw_add_fdb_peer_miss_rules()
758 mlx5_del_flow_rules(flows[mlx5_eswitch_ecpf_idx(esw)]); in esw_add_fdb_peer_miss_rules()
761 mlx5_del_flow_rules(flows[MLX5_VPORT_PF]); in esw_add_fdb_peer_miss_rules()
[all …]
Den_rep.h163 struct list_head flows; member
Den_tc.c175 struct list_head flows; member
200 struct list_head flows; member
335 WARN_ON(!list_empty(&mh->flows)); in mlx5e_mod_hdr_put()
391 INIT_LIST_HEAD(&mh->flows); in mlx5e_attach_mod_hdr()
412 list_add(&flow->mod_hdr, &mh->flows); in mlx5e_attach_mod_hdr()
729 WARN_ON(!list_empty(&hpe->flows)); in mlx5e_hairpin_put()
819 INIT_LIST_HEAD(&hpe->flows); in mlx5e_hairpin_flow_add()
872 list_add(&flow->hairpin, &hpe->flows); in mlx5e_hairpin_flow_add()
1414 list_for_each_entry(efi, &e->flows, list) { in mlx5e_take_all_encap_flows()
1510 list_for_each_entry_safe(efi, tmp, &e->flows, list) { in mlx5e_tc_update_neigh_used_value()
[all …]
/Linux-v5.4/Documentation/media/uapi/mediactl/
Dmedia-controller-model.rst33 by an entity flows from the entity's output to one or more entity
38 pads, either on the same entity or on different entities. Data flows
/Linux-v5.4/net/core/
Dpktgen.c399 struct flow_state *flows; member
2202 return !!(pkt_dev->flows[flow].flags & F_INIT); in f_seen()
2210 if (pkt_dev->flows[flow].count >= pkt_dev->lflow) { in f_pick()
2212 pkt_dev->flows[flow].count = 0; in f_pick()
2213 pkt_dev->flows[flow].flags = 0; in f_pick()
2222 if (pkt_dev->flows[flow].count > pkt_dev->lflow) { in f_pick()
2223 pkt_dev->flows[flow].count = 0; in f_pick()
2224 pkt_dev->flows[flow].flags = 0; in f_pick()
2239 struct xfrm_state *x = pkt_dev->flows[flow].x; in get_ipsec_sa()
2258 pkt_dev->flows[flow].x = x; in get_ipsec_sa()
[all …]
/Linux-v5.4/Documentation/networking/
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 …]
Dopenvswitch.txt13 table" that userspace populates with "flows" that map from keys based
101 A wildcarded flow can represent a group of exact match flows. Each '1' bit
105 by reduce the number of new flows need to be processed by the user space program.
117 two possible approaches: reactively install flows as they miss the kernel
127 The behavior when using overlapping wildcarded flows is undefined. It is the
130 performs best-effort detection of overlapping wildcarded flows and may reject
143 future operations. The kernel is not required to index flows by the original
Dpktgen.txt92 flows: 0 flowlen: 0
107 flows: 0
259 pktgen.conf-1-1-flows # 1 CPU 1 dev multiple flows.
277 pgset "flows 1"
371 flows
Dmac80211-auth-assoc-deauth.txt3 # deauthentication/disassociation flows.
/Linux-v5.4/Documentation/admin-guide/blockdev/drbd/
Dfigures.rst5 Data flows that Relate some functions, and write packets
/Linux-v5.4/Documentation/devicetree/bindings/mfd/
Dstmfx.txt5 MCU IDD measurement (IDD is the amount of current that flows through VDD) and
/Linux-v5.4/net/dccp/ccids/
DKconfig20 be reasonably fair when competing for bandwidth with TCP-like flows,
/Linux-v5.4/Documentation/ABI/testing/
Dsysfs-platform-kim8 The device name flows down to architecture specific board
/Linux-v5.4/arch/arm/boot/dts/
Dkeystone-k2g-netcp.dtsi85 <0x4013000 0x400>; /* 32 Rx flows */
/Linux-v5.4/Documentation/driver-api/
Dedac.rst55 only. E. g. if the data is 64 bits-wide, the data flows to the CPU using
64 bits with ECC), the data flows to the CPU using a 128 bits parallel
/Linux-v5.4/tools/include/uapi/linux/
Dpkt_sched.h217 unsigned flows; /* Maximal number of flows */ member
910 __u32 flows; member

123