| /freebsd/sys/netpfil/ipfw/test/ |
| H A D | main.c | 35 int flows; /* number of flows */ member
37 int wsum; /* sum of weights of all flows */
90 double *q_wfi; /* (byte) Worst-case Fair Index of the flows */
252 for (i=0; i < c->flows; i++) { in dump()
310 * weight:maxlen:flows
311 * indicating how many flows are hooked to that fs.
313 * The first pass (fs != NULL) justs count the number of flowsets and flows,
325 DX(3, "--- pass %d flows %d flowsets %d", pass, c->flows, c->flowsets); in parse_flowsets()
342 int flows; in parse_flowsets() local
354 flows = getnum(strsep(&cur, ":"), NULL, "flows"); in parse_flowsets()
[all …]
|
| /freebsd/sys/netpfil/ipfw/ |
| H A D | dn_sched_fq_codel.c | 73 * because fq_codel use different flows (sub-queues) structure and
146 SYSCTL_UINT(_net_inet_ip_dummynet_fqcodel, OID_AUTO, flows,
307 drop = codel_enqueue(&si->flows[idx], m, si); in fq_codel_enqueue()
314 * new flows list, initialize and activate it. in fq_codel_enqueue()
316 if (!si->flows[idx].active ) { in fq_codel_enqueue()
317 STAILQ_INSERT_TAIL(&si->newflows, &si->flows[idx], flowchain); in fq_codel_enqueue()
318 si->flows[idx].deficit = param->quantum; in fq_codel_enqueue()
319 si->flows[idx].cst.dropping = false; in fq_codel_enqueue()
320 si->flows[idx].cst.first_above_time = 0; in fq_codel_enqueue()
321 si->flows[idx].active = 1; in fq_codel_enqueue()
[all …]
|
| H A D | dn_sched_fq_pie.c | 90 uint32_t flows_cnt; /* number of flows */
122 * sub-queues and the flows array pointer even after the scheduler instance
129 struct fq_pie_flow *flows; /* array of flows (queues) */ member
149 * flows=1024, limit=10240, quantum =1514
273 SYSCTL_UINT(_net_inet_ip_dummynet_fqpie, OID_AUTO, flows,
567 * callout function to destroy PIE lock, and free fq_pie flows and fq_pie si
585 /* when all sub-queues are destroyed, free flows fq_pie extra vars memory */ in fqpie_callout_cleanup()
587 free(psi_extra->flows, M_DUMMYNET); in fqpie_callout_cleanup()
870 struct fq_pie_flow *flows; in fq_pie_enqueue() local
875 flows = si->si_extra->flows; in fq_pie_enqueue()
[all …]
|
| H A D | dn_sched_fq_codel.h | 44 uint32_t flows_cnt; /* number of flows */
78 struct fq_codel_flow *flows; /* array of flows (queues) */ member
|
| /freebsd/sys/contrib/dev/iwlwifi/ |
| H A D | iwl-drv.h | 30 * DOC: Driver system flows - drv component
32 * This component implements the system flows such as bus enumeration, bus
33 * removal. Bus dependent parts of system flows (such as iwl_pci_probe) are in
38 * the wifi flows: it will allow to have several fw API implementation. These
63 * specific system flows implementations. For example, the bus specific probe
74 * Stop the driver. This should be called by bus specific system flows
|
| /freebsd/share/man/man4/ |
| H A D | pflow.4 | 60 flows.
62 flows in the packet, a unique sequence number, system time, and an engine
80 IP address and port must be defined to enable the export of flows.
119 pretends such flows were created or expired when the machine came up.
|
| H A D | tcp_bbr.4 | 84 Total number of software paced flows.
86 Total number of hardware paced flows.
88 Total number of enobufs for non-hardware paced flows.
90 Total number of enobufs for hardware paced flows.
|
| H A D | ng_netflow.4 | 42 node listens for incoming traffic and identifies unique flows in it.
43 Flows are distinguished by endpoint IP addresses, TCP/UDP port numbers,
45 Expired flows are exported out of the node in NetFlow version 5/9 UDP datagrams.
52 Flows cannot live more than the specified period of time.
|
| H A D | cc_chd.4 | 39 coexistence with traditional loss-based TCP flows, especially when the
57 competing with loss-based TCP flows.
|
| H A D | siftr.4 | 410 A CSV list of TCP flows that triggered data log messages to be generated since
673 There is no way to filter which TCP flows you wish to capture data for.
674 Post processing is required to separate out data belonging to particular flows
687 The hash table used within the code is sized to hold 65536 flows.
694 unique flows handled in a module enable/disable cycle approaches and surpasses
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | SarifDiagnostics.cpp | 131 SmallVector<ThreadFlow, 8> Flows; in createThreadFlows() local
140 Flows.push_back(Flow); in createThreadFlows()
142 return Flows; in createThreadFlows()
176 SmallVector<ThreadFlow, 8> Flows = createThreadFlows(Diag, LO); in createResult() local
182 .setThreadFlows(Flows); in createResult()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | LoopVersioning.h | 70 /// Returns the versioned loop. Control flows here if pointers in the
75 /// Returns the fall-back loop. Control flows here if pointers in the
113 /// control flows here if pointers in the loop don't alias.
115 /// The fall-back loop. I.e. control flows here if pointers in the
|
| /freebsd/lib/libpmc/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."
|
| /freebsd/usr.sbin/flowctl/ |
| H A D | flowctl.8 | 65 would extract only IPv4 or IPv6 flows respectively.
72 parameter can be specify to show selected flows in human-readable format.
|
| /freebsd/tests/sys/netinet/libalias/ |
| H A D | 3_natin.c | 272 p->ip_p = 253; /* new flows */
276 p->ip_p = 252; /* new flows */
282 p->ip_p = 251; /* new flows */
289 p->ip_p = 250; /* new flows */
292 p->ip_p = 249; /* new flows */
|
| /freebsd/sys/netinet/cc/ |
| H A D | cc_chd.c | 104 * functionality aids coexistence with loss-based TCP flows which may be
286 * loss based flows. in chd_ack_received()
293 * not competing with loss based flows at the moment. in chd_ack_received()
365 * tcp flows and restore window from any unnecessary backoffs, in chd_cong_signal()
408 * competing with loss based flows from the start. in chd_conn_init()
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/tremontx/ |
| H A D | pipeline.json | 372 …ue slots blocked during this recovery window including relevant microcode flows and while uops are…
662 …"BriefDescription": "Counts the number of uops that are from complex flows issued by the micro-seq…
670 …mplex flows issued by the Microcode Sequencer (MS). This includes uops from flows due to complex i…
675 "BriefDescription": "Counts the number of x87 uops retired, includes those in MS flows.",
|
| /freebsd/contrib/ofed/libibverbs/man/ |
| H A D | ibv_create_flow.3 | 105 …der on which flow specs are tested for matches. Flows with higher priorities will be tested before…
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/elkhartlake/ |
| H A D | pipeline.json | 284 …ue slots blocked during this recovery window including relevant microcode flows and while uops are…
518 …"BriefDescription": "Counts the number of uops that are from complex flows issued by the micro-seq…
526 …mplex flows issued by the Microcode Sequencer (MS). This includes uops from flows due to complex i…
|
| /freebsd/sys/netinet/ |
| H A D | ip_dummynet.h | 138 * A flowset, which is a template for flows. Contains parameters
241 A QUEUE defines a classifier, which groups packets into flows
244 and passes flows to a scheduler:
|
| /freebsd/sbin/ipfw/ |
| H A D | dummynet.c | 107 { "flows", TOK_FLOWS},
299 " quantum %jd limit %jd flows %jd", in get_extra_parms()
316 " quantum %jd limit %jd flows %jd", in get_extra_parms()
390 /* print a mask and header for the subsequent list of flows */
436 /* XXX: Should check for IPv4 flows */ in list_flow()
451 /* Print IPv6 flows */ in list_flow()
521 printf("q%05d %s%s %d flows (%d buckets) sched %d " in print_flowset_parms()
1040 * 3- quantum, 4- limit, 5- flows in process_extra_parms()
1096 errx(EX_DATAERR, "flows is not for codel\n"); in process_extra_parms()
1098 errx(EX_DATAERR, "flows need in process_extra_parms()
[all...] |
| H A D | ipfw.8 | 2517 create rules for specific flows when packets that
2628 are first grouped into flows according to a mask on the 5-tuple.
2629 Flows are then passed to the scheduler associated to the
2636 and arbitrates the link's bandwidth among backlogged flows according to
2644 can be used to determine how different flows share the available bandwidth.
2647 flows, schedulers and links is below.
2669 The SCHED_MASK is used to assign flows to one or more
2676 packets into flows.
2681 In turn, flows for each /24
2886 Specifies the weight to be used for flows matching this queue.
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/mfd/ |
| H A D | stmfx.txt | 5 MCU IDD measurement (IDD is the amount of current that flows through VDD) and
|
| /freebsd/contrib/file/magic/Magdir/ |
| H A D | nitpicker | 13 >22 belong x Flows: %u
|
| /freebsd/usr.sbin/cxgbetool/ |
| H A D | cxgbetool.8 | 744 All of the "flows" bound to the scheduling class will be held to aggregate scheduling constraints.
747 Each of the "flows" bound to the scheduling class will be held to the scheduling constraints.
752 mode, all of the "flows" bound to the class would be limited to an
755 mode, each of the "flows" bound to the scheduling class would be limited to 10Mb/s.
|