Home
last modified time | relevance | path

Searched full:counters (Results 1 – 25 of 1142) sorted by relevance

12345678910>>...46

/freebsd/contrib/ofed/infiniband-diags/man/
H A Dperfquery.833 .SH QUERY INFINIBAND PORT COUNTERS ON A SINGLE PORT
40 error counters), PortExtendedCounters, PortXmitDataSL, PortRcvDataSL,
43 aggregated counters for all ports of node. Finally it can, reset after read,
44 or just reset the counters.
58 show extended port counters rather than (basic) port counters.
59 Note that extended port counters attribute is optional.
77 show extended speeds port counters. This is an optional counter.
80 show Rcv Counters per Op code. This is an optional counter.
83 show flow control counters. This is an optional counter.
95 show ticks waiting to transmit counters per VL. This is an optional counter.
[all …]
H A Dibqueryerrors.85 IBQUERYERRORS \- query and report IB port counters
38 The default behavior is to report the port error counters which exceed a
51 Suppress some of the common "side effect" counters. These counters usually do
60 Include the optional transmit and receive data counters.
74 \fB\-\-clear\-errors \-k\fP Clear error counters after read.
76 \fB\-\-clear\-counts \-K\fP Clear data counters after read.
78 \fBCAUTION\fP clearing data or error counters will occur regardless of if they
79 are printed or not. See \fB\-\-counters\fP and \fB\-\-data\fP for details on
80 controling which counters are printed.
84 \fB\-\-counters\fP print data counters only
[all …]
/freebsd/sys/ofed/drivers/infiniband/core/
H A Dib_uverbs_std_types_counters.c44 struct ib_counters *counters = uobject->object; in uverbs_free_counters() local
47 ret = ib_destroy_usecnt(&counters->usecnt, why, uobject); in uverbs_free_counters()
51 return counters->device->destroy_counters(counters); in uverbs_free_counters()
60 struct ib_counters *counters; in UVERBS_HANDLER() local
71 counters = ib_dev->create_counters(ib_dev, attrs); in UVERBS_HANDLER()
72 if (IS_ERR(counters)) { in UVERBS_HANDLER()
73 ret = PTR_ERR(counters); in UVERBS_HANDLER()
77 counters->device = ib_dev; in UVERBS_HANDLER()
78 counters->uobject = uobj; in UVERBS_HANDLER()
79 uobj->object = counters; in UVERBS_HANDLER()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ProfileData/
H A DPGOCtxProfWriter.cpp26 cl::desc("Also write profiles with all-zero counters. "
59 DescribeRecord(PGOCtxProfileRecords::Counters, "Counters"); in PGOCtxProfileWriter()
64 DescribeRecord(PGOCtxProfileRecords::Counters, "Counters"); in PGOCtxProfileWriter()
69 DescribeRecord(PGOCtxProfileRecords::Counters, "Counters"); in PGOCtxProfileWriter()
78 void PGOCtxProfileWriter::writeCounters(ArrayRef<uint64_t> Counters) { in writeCounters() argument
80 Writer.EmitVBR(PGOCtxProfileRecords::Counters, VBREncodingBits); in writeCounters()
81 Writer.EmitVBR(Counters.size(), VBREncodingBits); in writeCounters()
82 for (uint64_t C : Counters) in writeCounters()
106 // A node with no counters is an error. We don't expect this to happen from in writeNode()
113 writeCounters({Node.counters(), Node.counters_size()}); in writeNode()
[all …]
H A DPGOCtxProfReader.cpp39 SmallVectorImpl<uint64_t> &&Counters) { in getOrEmplace() argument
41 Callsites[Index].insert({G, PGOCtxProfContext(G, std::move(Counters))}); in getOrEmplace()
97 std::optional<SmallVector<uint64_t, 16>> Counters; in readProfile() local
109 return Guid.has_value() && Counters.has_value() && in readProfile()
137 case PGOCtxProfileRecords::Counters: in readProfile()
138 Counters = std::move(RecordValues); in readProfile()
139 if (Counters->empty()) in readProfile()
140 return wrongValue("Empty counters. At least the entry counter (one " in readProfile()
165 PGOCtxProfContext Ret(*Guid, std::move(*Counters), TotalEntryCount, in readProfile()
230 if (!P.insert({Guid, std::move(E->second.counters())}).second) in loadFlatProfileList()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerDataFlowTrace.h56 const auto &Counters = It->second; in GetCounter() local
57 if (BasicBlockId < Counters.size()) in GetCounter()
58 return Counters[BasicBlockId]; in GetCounter()
65 const auto &Counters = It->second; in GetNumberOfBlocks() local
66 return static_cast<uint32_t>(Counters.size()); in GetNumberOfBlocks()
72 const auto &Counters = It->second; in GetNumberOfCoveredBlocks() local
74 for (auto Cnt: Counters) in GetNumberOfCoveredBlocks()
86 uint32_t NumberOfCoveredBlocks(const CoverageVector &Counters) const { in NumberOfCoveredBlocks() argument
88 for (auto Cnt : Counters) in NumberOfCoveredBlocks()
94 uint32_t NumberOfUncoveredBlocks(const CoverageVector &Counters) const { in NumberOfUncoveredBlocks() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/
H A DTargetPfmCounters.td1 //===- TargetPfmCounters.td - Target Pfm Counters -*- tablegen ----------*-===//
9 // This file defines the target-independent interfaces for performance counters.
13 // Definition of a hardware counters from libpfm identifiers.
17 // measured value is the sum of events on these counters.
21 // Issue counters can be tied to a ProcResource
32 // event that can be measured using performance counters that is interesting
68 // Processor can list mappings between validation events and real counters
73 // A binding of a set of counters to a CPU.
74 class PfmCountersBinding<string cpu_name, ProcPfmCounters counters> {
76 ProcPfmCounters Counters = counters;
[all …]
/freebsd/usr.sbin/pmcstudy/
H A Dpmcstudy.c165 struct counters { struct
166 struct counters *next_cpu; argument
174 extern struct counters *glob_cpu[MAX_CPU]; argument
175 struct counters *glob_cpu[MAX_CPU];
177 extern struct counters *cnts;
178 struct counters *cnts=NULL;
183 extern int (*expression)(struct counters *, int);
184 int (*expression)(struct counters *, int);
193 int (*func)(struct counters *, int);
448 static struct counters *
[all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/graniterapids/
H A Dcache.json323 … prefetch instructions of PREFETCHNTA or PREFETCHT0/1/2 or PREFETCHW. Available PDIST counters: 0",
333 "PublicDescription": "Counts all retired store instructions. Available PDIST counters: 0",
343 …ription": "Counts all retired memory instructions - loads and stores. Available PDIST counters: 0",
353 …icDescription": "Counts retired load instructions with locked access. Available PDIST counters: 0",
366 …nts retired load instructions that split across a cacheline boundary. Available PDIST counters: 0",
379 …ts retired store instructions that split across a cacheline boundary. Available PDIST counters: 0",
392 …tired load instructions with a clean hit in the 2nd-level TLB (STLB). Available PDIST counters: 0",
405 …r of retired store instructions that hit in the 2nd-level TLB (STLB). Available PDIST counters: 0",
418 …ed load instructions that (start a) miss in the 2nd-level TLB (STLB). Available PDIST counters: 0",
428 …d store instructions that (start a) miss in the 2nd-level TLB (STLB). Available PDIST counters: 0",
[all …]
H A Dmemory.json75 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
87 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
99 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
111 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
123 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
135 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
147 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
159 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
171 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
183 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
[all …]
H A Dfrontend.json44 …ANT) conditional retired branches (no BTB entry and not mispredicted) Available PDIST counters: 0",
55 …d DSB (Decode stream buffer i.e. the decoded instruction-cache) miss. Available PDIST counters: 0",
69 …eans stalls were exposed to the back-end as a result of the DSB miss. Available PDIST counters: 0",
80 …tired Instructions that experienced iTLB (Instruction TLB) true miss. Available PDIST counters: 0",
94 … retired Instructions who experienced Instruction L1 Cache true miss. Available PDIST counters: 0",
108 … retired Instructions who experienced Instruction L2 Cache true miss. Available PDIST counters: 0",
122 …od of at least 1 cycle which was not interrupted by a back-end stall. Available PDIST counters: 0",
133 …a period of 128 cycles which was not interrupted by a back-end stall. Available PDIST counters: 0",
144 … least 16 cycles. During this period the front-end delivered no uops. Available PDIST counters: 0",
155 …d of at least 2 cycles which was not interrupted by a back-end stall. Available PDIST counters: 0",
[all …]
/freebsd/lib/libpmc/
H A Dpmc.rapl.311 .Nd measurements using RAPL energy counters
24 class exposes these registers as read-only 64-bit counters that may
32 released; it reflects energy consumed since the counters began
39 The hardware counters are 32 bits wide and wrap frequently under load.
40 The RAPL PMC class instead provides virtual 64-bit counters that are
42 counters while at least one RAPL PMC is allocated.
67 RAPL counters measure package or core power domains, not individual
87 allocates one counter per domain, so package-scoped counters within
116 counters
H A Dpmc.329 .Nd library for accessing hardware performance monitoring counters
38 hardware performance counters to gather performance data about
45 Performance monitoring counters (PMCs) are represented by the library
76 The application needs to explicitly read these counters
220 Fixed function hardware counters presents in CPUs conforming to the
224 Programmable hardware counters present in CPUs conforming to the
229 Instruction Based Sampling (IBS) counters present in
233 Programmable hardware counters present in
237 RAPL energy counters present in
268 The ability to cascade counters.
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DPGOCtxProfReader.h85 /// during IPO passes. We generally expect a fraction of counters and
86 /// callsites to be populated. We continue to model counters as vectors, but
101 SmallVector<uint64_t, 16> Counters; variable
107 GlobalValue::GUID G, SmallVectorImpl<uint64_t> &&Counters,
110 : GUID(G), Counters(std::move(Counters)), RootEntryCount(RootEntryCount), in GUID()
117 SmallVectorImpl<uint64_t> &&Counters);
130 const SmallVectorImpl<uint64_t> &counters() const { return Counters; } in counters() function
131 SmallVectorImpl<uint64_t> &counters() { return Counters; } in counters() function
139 assert(!Counters.empty() && in getEntrycount()
142 return Counters[0]; in getEntrycount()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DDebugCounter.h9 /// This file provides an implementation of debug counters. Debug
10 /// counters are a tool that let you narrow down a miscompilation to a specific
81 // line option parsing. The main reason to register counters is to produce a
98 return instance().Counters[ID].IsSet; in isCounterSet()
106 // Return the state of a counter. This only works for set counters.
109 auto Result = Us.Counters.find(ID); in getCounterState()
110 assert(Result != Us.Counters.end() && "Asking about a non-set counter"); in getCounterState()
117 auto &Counter = Us.Counters[ID]; in setCounterState()
134 // Return the number of registered counters.
139 return std::make_pair(RegisteredCounters[ID], Counters.lookup(ID).Desc); in getCounterInfo()
[all …]
/freebsd/contrib/wpa/src/radius/
H A Dradius_server.c44 * struct radius_server_counters - RADIUS server statistics counters
111 struct radius_server_counters counters; member
174 * counters - Statistics counters for server operations
176 * These counters are the sum over all clients.
178 struct radius_server_counters counters; member
213 * account requests. Statistics counters will be incremented in any
1104 data->counters.access_rejects++; in radius_server_reject()
1105 client->counters.access_rejects++; in radius_server_reject()
1216 data->counters.dup_access_requests++; in radius_server_request()
1217 client->counters.dup_access_requests++; in radius_server_request()
[all …]
/freebsd/contrib/ofed/infiniband-diags/src/
H A Dperfquery.c118 /* Notes: IB semantics is to cap counters if count has exceeded limits.
119 * Therefore we must check for overflows and cap the counters if necessary.
253 printf("# Port counters: %s port %d (CapMask: 0x%02X)\n%s", in output_aggregate_perfcounters()
386 printf("# Port extended counters: %s port %d (CapMask: 0x%02X CapMask2: 0x%07X)\n%s", in output_aggregate_perfcounters_ext()
443 printf("# Port extended counters: %s port %d " in dump_perfcounters()
448 printf("# Port counters: %s port %d " in dump_perfcounters()
491 printf("# %s counters: %s port %d\n%s", name, in common_func()
819 {"extended", 'x', 0, NULL, "show extended port counters"}, in main()
820 {"xmtsl", 'X', 0, NULL, "show Xmt SL port counters"}, in main()
821 {"rcvsl", 'S', 0, NULL, "show Rcv SL port counters"}, in main()
[all …]
/freebsd/tests/sys/netpfil/pf/
H A Dcounters.sh55 atf_set descr 'Counters on match and pass rules'
63 # Thest counters for a statefull firewall. Expose the behaviour of
64 # increasing table counters if a table is used multiple times.
65 # The table "tbl_in" is used both in match and pass rule. It's counters
68 # Test source node counters for this simple scenario too.
108 grep -qE "${table_regexp}" ${table} || atf_fail "Bad counters for table ${table_name}"
133 atf_set descr 'Counters on match and pass rules without keep state'
141 # Test counters for a stateless firewall.
146 # "tbl_out_pass" will have their counters increased only once.
191 grep -qE "${table_regexp}" ${table} || atf_fail "Bad counters for table ${table_name}"
[all …]
H A Drules_counter.sh32 atf_set descr 'Test clearing rules counters on get rules'
50 # Ensure the rule matched packets, so we can verify non-zero counters
53 # Expect non-zero counters
64 # Expect zero counters
96 # Expect zero counters
101 # Ensure the rule matched packets, so we can verify non-zero counters
104 # Expect non-zero counters
109 # As we set the (same) rules again we'd expect the counters to return
118 # Increment rule counters
122 # counters
[all …]
H A Dfragmentation_pass.sh651 atf_test_case "counters" "cleanup"
654 atf_set descr 'Test fragment counters'
673 # All fragment counters are zero
674 counters=$(jexec alcatraz pfctl -si -v | grep -A 4 '^Fragments')
676 echo $counters
678 echo $counters
680 echo $counters
682 echo $counters
687 counters=$(jexec alcatraz pfctl -si -v | grep -A 4 '^Fragments')
689 echo $counters
[all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/meteorlake/
H A Dmemory.json210 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
223 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
236 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
249 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
262 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
275 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
288 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
301 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
314 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
327 …cycles. Reported latency may be longer than just the memory latency. Available PDIST counters: 0",
[all …]
/freebsd/sys/contrib/dev/iwlwifi/mld/
H A Dlow_latency.c44 struct iwl_mld_low_latency_packets_counters *counters = in iwl_mld_calc_low_latency() local
47 spin_lock_bh(&counters->lock); in iwl_mld_calc_low_latency()
49 total_vo_vi_pkts += counters->vo_vi[mac_id]; in iwl_mld_calc_low_latency()
52 counters->vo_vi[mac_id] = 0; in iwl_mld_calc_low_latency()
54 spin_unlock_bh(&counters->lock); in iwl_mld_calc_low_latency()
267 struct iwl_mld_low_latency_packets_counters *counters; in iwl_mld_low_latency_update_counters() local
275 if (WARN_ON_ONCE(fw_id >= ARRAY_SIZE(counters->vo_vi) || in iwl_mld_low_latency_update_counters()
285 counters = &mld->low_latency.pkts_counters[queue]; in iwl_mld_low_latency_update_counters()
287 spin_lock_bh(&counters->lock); in iwl_mld_low_latency_update_counters()
288 counters->vo_vi[fw_id]++; in iwl_mld_low_latency_update_counters()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DMisExpect.h28 /// checkBackendInstrumentation - compares PGO counters to the thresholds used
29 /// for llvm.expect and warns if the PGO counters are outside of the expected
40 /// checkFrontendInstrumentation - compares PGO counters to the thresholds used
41 /// for llvm.expect and warns if the PGO counters are outside of the expected
55 /// for llvm.expect and warns if the PGO counters are outside of the expected
64 /// checkExpectAnnotations - compares PGO counters to the thresholds used
65 /// for llvm.expect and warns if the PGO counters are outside of the expected
/freebsd/share/man/man4/
H A Dtimecounters.430 .Nd kernel time counters subsystem
33 time counters and event timers.
36 Time counters are responsible for tracking purposes, when the system is running.
41 Time counters are the lowest level of time tracking in the kernel.
55 The goal of the time counters subsystem is to provide a unified way to access
58 Each driver implementing time counters registers them with the subsystem.
59 It is possible to see the list of present time counters, via the
/freebsd/contrib/llvm-project/compiler-rt/lib/ctx_profile/
H A DCtxInstrContextNode.h41 /// [[declared fields][counters vector][vector of ptrs to subcontexts]]
43 /// See also documentation on the counters and subContexts members below.
86 // The counters vector starts right after the static header.
87 uint64_t *counters() { in counters() function
95 const uint64_t *counters() const { in counters() function
96 return const_cast<ContextNode *>(this)->counters(); in counters()
99 // The subcontexts vector starts right after the end of the counters vector.
101 return reinterpret_cast<ContextNode **>(&(counters()[NumCounters])); in subContexts()
113 uint64_t entrycount() const { return counters()[0]; } in entrycount()

12345678910>>...46