/linux/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
H A D | fq_codel.json | 17 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms … 38 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 1000p flows 1024 quantum.*target 5ms i… 59 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms … 80 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 2ms … 101 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms … 122 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum 9000 target … 143 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms … 164 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms … 185 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms … 203 …"cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_codel limit 1000 flows 256 drop_batch … [all …]
|
H A D | fq_pie.json | 4 "name": "Create FQ-PIE with invalid number of flows", 14 "cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_pie flows 65536", 17 "matchPattern": "qdisc fq_pie 1: root refcnt 2 limit 10240p flows 65536",
|
H A D | sfq.json | 109 "name": "Create SFQ with flows setting", 119 "cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root sfq flows 20", 234 "name": "Check that a derived limit of 1 is rejected (limit 2 depth 1 flows 1)", 243 "cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root sfq limit 2 depth 1 flows 1",
|
/linux/samples/pktgen/ |
H A D | pktgen_sample04_many_flows.sh | 4 # 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"
|
/linux/net/sched/ |
H A D | sch_fq_codel.c | 29 * 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 D | sch_fq_pie.c | 22 * - Packets are classified on flows. 23 * - This is a Stochastic model (as we use a hash, several flows might 26 * - Flows are linked onto two (Round Robin) lists, 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() [all …]
|
H A D | sch_sfq.c | 53 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 */ 451 * but we could endup servicing new flows only, and freeze old ones. in sfq_enqueue() 454 /* We could use a bigger initial quantum for new flows */ in sfq_enqueue() [all …]
|
H A D | sch_fq.c | 12 * 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 138 struct rb_root delayed; /* for rate limited flows */ 143 u32 flows; member 144 u32 inactive_flows; /* Flows with no packet to send. */ 248 /* limit number of collected flows per round */ 295 q->flows -= fcnt; in fq_gc() 324 * scheduled in the future (ie no flows are eligible) in fq_fastpath_check() 327 if (q->flows != q->inactive_flows + q->throttled_flows) in fq_fastpath_check() [all …]
|
/linux/include/net/ |
H A D | fq_impl.h | 36 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 D | fq.h | 43 * 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
|
/linux/samples/bpf/ |
H A D | do_hbm_test.sh | 18 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 …]
|
/linux/drivers/net/ethernet/mellanox/mlx5/core/en/ |
H A D | tc_priv.h | 83 /* 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 */
|
/linux/drivers/net/ethernet/marvell/mvpp2/ |
H A D | mvpp2_cls.c | 26 /* 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 …]
|
/linux/Documentation/networking/ |
H A D | scaling.rst | 31 of logical flows. Packets for each flow are steered to a separate receive 50 applications that monitor TCP/IP flows (IDS, firewalls, ...etc) and need 252 to the same CPU is CPU load imbalance if flows vary in packet rate. 258 Flow Limit is an optional RPS feature that prioritizes small flows 259 during CPU contention by dropping packets from large flows slightly 260 ahead of those from small flows. It is active only when an RPS or RFS 266 new packet is dropped. Packets from other flows are still only 270 even large flows maintain connectivity. 288 identification of large flows and fewer false positives. The default 325 flows to the CPUs where those flows are being processed. The flow hash [all …]
|
H A D | nf_flowtable.rst | 33 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 D | openvswitch.rst | 16 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
|
/linux/drivers/net/ethernet/netronome/nfp/flower/ |
H A D | conntrack.h | 50 * @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
|
/linux/drivers/crypto/allwinner/sun8i-ss/ |
H A D | sun8i-ss-prng.c | 134 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()
|
/linux/drivers/infiniband/hw/hfi1/ |
H A D | tid_rdma.c | 47 /* 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 …]
|
/linux/tools/perf/pmu-events/arch/arm64/fujitsu/a64fx/ |
H A D | pipeline.json | 141 … 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."
|
/linux/include/uapi/linux/ |
H A D | pkt_sched.h | 62 classes (or flows) have major equal to parent qdisc major, and 218 unsigned flows; /* Maximal number of flows */ member 675 __u32 penalty_rate; /* inelastic flows are rate limited to 'rate' pps */ 774 __u32 new_flows_len; /* count of flows in new list */ 775 __u32 old_flows_len; /* count of flows in old list */ 858 __u32 flows; member 952 __u32 new_flow_count; /* count of new flows created by packets */ 953 __u32 new_flows_len; /* count of flows in new list */ 954 __u32 old_flows_len; /* count of flows in old list */
|
/linux/Documentation/admin-guide/pm/ |
H A D | suspend-flows.rst | 5 System Suspend Code Flows 25 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/userspace-api/media/mediactl/ |
H A D | media-controller-model.rst | 26 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/broadcom/bnxt/ |
H A D | bnxt_tc.h | 147 * This table is used to maintain a list of flows that use 180 /* a linked list of flows that share the same l2 key */ 183 /* number of flows/tunnels sharing the l2 key */
|
/linux/tools/include/uapi/linux/ |
H A D | pkt_sched.h | 61 classes (or flows) have major equal to parent qdisc major, and 217 unsigned flows; /* Maximal number of flows */ member 638 __u32 penalty_rate; /* inelastic flows are rate limited to 'rate' pps */ 733 __u32 new_flows_len; /* count of flows in new list */ 734 __u32 old_flows_len; /* count of flows in old list */ 802 __u32 flows; member
|