Home
last modified time | relevance | path

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

123

/Linux-v4.19/include/net/
Dfq_impl.h123 flow = &fq->flows[idx]; in fq_flow_classify()
132 tin->flows++; in fq_flow_classify()
315 fq->flows = kcalloc(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 kfree(fq->flows); in fq_reset()
334 fq->flows = NULL; in fq_reset()
Dfq.h55 u32 flows; member
69 struct fq_flow *flows; member
/Linux-v4.19/net/sched/
Dsch_fq_codel.c59 struct fq_codel_flow *flows; /* Flows table [flows_cnt] */ member
170 flow = &q->flows[idx]; in fq_codel_drop()
209 flow = &q->flows[idx]; in fq_codel_enqueue()
271 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb); in dequeue_func()
356 struct fq_codel_flow *flow = q->flows + i; in fq_codel_reset()
395 if (q->flows) in fq_codel_change()
459 kvfree(q->flows); in fq_codel_destroy()
491 if (!q->flows) { in fq_codel_init()
492 q->flows = kvcalloc(q->flows_cnt, in fq_codel_init()
495 if (!q->flows) { in fq_codel_init()
[all …]
Dsch_atm.c65 struct list_head flows; /* NB: "link" is also on this member
77 list_for_each_entry(flow, &p->flows, list) { in lookup_flow()
353 list_for_each_entry(flow, &p->flows, list) { in atm_tc_walk()
391 list_for_each_entry(flow, &p->flows, list) { in atm_tc_enqueue()
475 list_for_each_entry(flow, &p->flows, list) { in sch_atm_dequeue()
546 INIT_LIST_HEAD(&p->flows); in atm_tc_init()
548 list_add(&p->link.list, &p->flows); in atm_tc_init()
574 list_for_each_entry(flow, &p->flows, list) in atm_tc_reset()
585 list_for_each_entry(flow, &p->flows, list) { in atm_tc_destroy()
590 list_for_each_entry_safe(flow, tmp, &p->flows, list) { in atm_tc_destroy()
Dsch_fq.c103 u32 flows; member
220 q->flows -= fcnt; in fq_gc()
263 if (q->flows >= (2U << q->fq_trees_log) && in fq_classify()
264 q->inactive_flows > q->flows/2) in fq_classify()
309 q->flows++; in fq_classify()
598 q->flows = 0; in fq_reset()
643 q->flows -= fcnt; in fq_rehash()
882 st.flows = q->flows; in fq_dump_stats()
Dsch_cake.c150 struct cake_flow flows[CAKE_QUEUES]; member
704 q->flows[reduced_hash].set)) { in cake_hash()
722 if (!q->flows[outer_hash + k].set) { in cake_hash()
737 if (!q->flows[outer_hash + k].set) { in cake_hash()
749 q->hosts[q->flows[reduced_hash].srchost].srchost_refcnt--; in cake_hash()
750 q->hosts[q->flows[reduced_hash].dsthost].dsthost_refcnt--; in cake_hash()
777 q->flows[reduced_hash].srchost = srchost_idx; in cake_hash()
799 q->flows[reduced_hash].dsthost = dsthost_idx; in cake_hash()
1478 flow = &b->flows[idx]; in cake_drop()
1641 flow = &b->flows[idx]; in cake_enqueue()
[all …]
Dsch_sfq.c656 if (ctl->flows) in sfq_change()
657 q->maxflows = min_t(u32, ctl->flows, SFQ_MAX_FLOWS); in sfq_change()
793 opt.v0.flows = q->maxflows; in sfq_dump()
/Linux-v4.19/Documentation/media/uapi/mediactl/
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-v4.19/net/core/
Dpktgen.c405 struct flow_state *flows; member
2208 return !!(pkt_dev->flows[flow].flags & F_INIT); in f_seen()
2216 if (pkt_dev->flows[flow].count >= pkt_dev->lflow) { in f_pick()
2218 pkt_dev->flows[flow].count = 0; in f_pick()
2219 pkt_dev->flows[flow].flags = 0; in f_pick()
2228 if (pkt_dev->flows[flow].count > pkt_dev->lflow) { in f_pick()
2229 pkt_dev->flows[flow].count = 0; in f_pick()
2230 pkt_dev->flows[flow].flags = 0; in f_pick()
2245 struct xfrm_state *x = pkt_dev->flows[flow].x; in get_ipsec_sa()
2264 pkt_dev->flows[flow].x = x; in get_ipsec_sa()
[all …]
/Linux-v4.19/Documentation/networking/
Dscaling.txt27 of logical flows. Packets for each flow are steered to a separate receive
170 to the same CPU is CPU load imbalance if flows vary in packet rate.
176 Flow Limit is an optional RPS feature that prioritizes small flows
177 during CPU contention by dropping packets from large flows slightly
178 ahead of those from small flows. It is active only when an RPS or RFS
184 new packet is dropped. Packets from other flows are still only
188 even large flows maintain connectivity.
204 identification of large flows and fewer false positives. The default
239 flows to the CPUs where those flows are being processed. The flow hash
244 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-v4.19/drivers/net/ethernet/mellanox/mlx5/core/
Den_rep.h125 struct list_head flows; member
Den_tc.c130 struct list_head flows; member
147 struct list_head flows; member
220 INIT_LIST_HEAD(&mh->flows); in mlx5e_attach_mod_hdr()
235 list_add(&flow->mod_hdr, &mh->flows); in mlx5e_attach_mod_hdr()
258 mh = list_entry(next, struct mlx5e_mod_hdr_entry, flows); in mlx5e_detach_mod_hdr()
602 INIT_LIST_HEAD(&hpe->flows); in mlx5e_hairpin_flow_add()
646 list_add(&flow->hairpin, &hpe->flows); in mlx5e_hairpin_flow_add()
666 hpe = list_entry(next, struct mlx5e_hairpin_entry, flows); in mlx5e_hairpin_flow_del()
942 list_for_each_entry(flow, &e->flows, encap) { in mlx5e_tc_encap_flows_add()
974 list_for_each_entry(flow, &e->flows, encap) { in mlx5e_tc_encap_flows_del()
[all …]
/Linux-v4.19/net/dccp/ccids/
DKconfig19 be reasonably fair when competing for bandwidth with TCP-like flows,
/Linux-v4.19/Documentation/ABI/testing/
Dsysfs-platform-kim8 The device name flows down to architecture specific board
Dsysfs-class-net-queues16 Number of Receive Packet Steering flows being currently
/Linux-v4.19/arch/arm/boot/dts/
Dkeystone-k2g-netcp.dtsi85 <0x4013000 0x400>; /* 32 Rx flows */
/Linux-v4.19/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-v4.19/include/uapi/linux/
Dpkt_sched.h217 unsigned flows; /* Maximal number of flows */ member
881 __u32 flows; member
/Linux-v4.19/net/ipv4/
DKconfig529 other Reno and H-TCP flows.
572 can coexist safely is when the CA flows have RTTs << CC flows RTTs.
639 - Low latency (short flows, queries),
661 o Coexist with flows that use loss-based congestion control.
678 modem links. It can coexist with flows that use loss-based congestion
/Linux-v4.19/Documentation/devicetree/bindings/soc/ti/
Dkeystone-navigator-dma.txt5 channels and flows for the QMSS(Queue Manager SubSystem) who triggers
/Linux-v4.19/drivers/net/
Dtun.c238 struct hlist_head flows[TUN_NUM_FLOW_ENTRIES]; member
463 hlist_for_each_entry_safe(e, n, &tun->flows[i], hash_link) in tun_flow_flush()
478 hlist_for_each_entry_safe(e, n, &tun->flows[i], hash_link) { in tun_flow_delete_by_queue()
501 hlist_for_each_entry_safe(e, n, &tun->flows[i], hash_link) { in tun_flow_cleanup()
531 head = &tun->flows[tun_hashfn(rxhash)]; in tun_flow_update()
583 e = tun_flow_find(&tun->flows[tun_hashfn(txq)], txq); in tun_automq_select_queue()
1053 e = tun_flow_find(&tun->flows[tun_hashfn(rxhash)], in tun_automq_xmit()
1341 INIT_HLIST_HEAD(&tun->flows[i]); in tun_flow_init()
/Linux-v4.19/Documentation/media/kapi/
Dmc-core.rst27 flows from the entity's output to one or more entity inputs. Pads should
31 on the same entity or on different entities. Data flows from a source

123