| /llvm-project-15.0.7/third-party/benchmark/test/ |
| H A D | internal_threading_test.cc | 51 ->Iterations(1)
56 ->Iterations(1)
66 ->Iterations(1)
71 ->Iterations(1)
94 ->Iterations(1)
99 ->Iterations(1)
109 ->Iterations(1)
114 ->Iterations(1)
135 ->Iterations(1)
139 ->Iterations(1)
[all …]
|
| H A D | benchmark_setup_teardown_test.cc | 38 ->Iterations(100)
68 ->Iterations(100)
106 ->Iterations(100);
127 ->Iterations(100)
|
| /llvm-project-15.0.7/libc/benchmarks/ |
| H A D | LibcBenchmark.h | 126 size_t Iterations = 0; member
137 assert(M.Iterations > 0); in update()
142 TotalIterations += M.Iterations; in update()
201 size_t Iterations = std::max(Options.InitialIterations, uint32_t(1)); variable
209 const auto &Batch = PP.generateBatch(Iterations);
223 const double ChangeRatio = REP.computeImprovement({Iterations, Elapsed});
234 else if (Iterations >= Options.MaxIterations)
242 BS.LastSampleIterations = Iterations;
254 Iterations * Options.ScalingFactor == Iterations)
259 Iterations *= Options.ScalingFactor;
|
| H A D | LibcMemoryBenchmarkTest.cpp | 92 for (size_t Iterations = 0; Iterations <= 10; ++Iterations) { in TEST() local
|
| /llvm-project-15.0.7/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 62 const unsigned Iterations; variable
67 : Sequence(S), Current(0U), Iterations(Iter ? Iter : DefaultIterations) {} in CircularSourceMgr()
71 unsigned getNumIterations() const { return Iterations; } in getNumIterations()
73 return Current < (Iterations * Sequence.size()); in hasNext()
|
| /llvm-project-15.0.7/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.h | 241 void pruneEdges(unsigned Iterations);
244 unsigned Iterations);
270 void finalizeGraph(unsigned Iterations) { in finalizeGraph() argument
272 pruneEdges(Iterations); in finalizeGraph()
274 propagateThroughEdges(RootSet, Iterations); in finalizeGraph()
292 unsigned Iterations; variable
329 ArrayRef<MCInst> Sequence, unsigned Iterations);
|
| H A D | SummaryView.cpp | 70 TempStream << "Iterations: " << DV.Iterations; in printView()
88 DV.Iterations = (LastInstructionIdx / DV.Instructions) + 1; in collectData()
89 DV.TotalInstructions = DV.Instructions * DV.Iterations; in collectData()
92 DV.TotalUOps = NumMicroOps * DV.Iterations; in collectData()
102 json::Object JO({{"Iterations", DV.Iterations}, in toJSON()
|
| H A D | TimelineView.cpp | 21 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations, in TimelineView() argument
27 assert(Iterations && "Invalid number of iterations specified!"); in TimelineView()
28 NumInstructions *= Iterations; in TimelineView()
288 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
289 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) { in printTimeline()
|
| H A D | BottleneckAnalysis.cpp | 169 void DependencyGraph::pruneEdges(unsigned Iterations) { in pruneEdges() argument
176 if (Edge.Frequency == Iterations) in pruneEdges()
178 double Factor = (double)Edge.Frequency / Iterations; in pruneEdges()
202 unsigned Iterations) { in propagateThroughEdges() argument
381 FOS << " [ probability: " << ((DE->Frequency * 100) / Iterations) in printCriticalSequence()
446 DG(S.size() * 3), Iterations(NumIter), TotalCycles(0), in BottleneckAnalysis()
536 if (IID == ((Iterations * Source.size()) - 1)) in onEvent()
537 DG.finalizeGraph(Iterations); in onEvent()
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/altera/ |
| H A D | UnrollLoopsCheck.cpp | 194 double Iterations; in hasLargeNumIterations() local
199 Iterations = EndValue - InitValue; in hasLargeNumIterations()
201 Iterations = InitValue - EndValue; in hasLargeNumIterations()
214 Iterations = ceil(float(EndValue - InitValue) / ConstantValue); in hasLargeNumIterations()
217 Iterations = ceil(float(InitValue - EndValue) / ConstantValue); in hasLargeNumIterations()
220 Iterations = 1 + (log(EndValue) - log(InitValue)) / log(ConstantValue); in hasLargeNumIterations()
223 Iterations = 1 + (log(InitValue) - log(EndValue)) / log(ConstantValue); in hasLargeNumIterations()
230 return Iterations > MaxLoopIterations; in hasLargeNumIterations()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/ |
| H A D | uop-queue.s | 17 # BTVER2-DEC-2: Iterations: 1500
27 # BTVER2-DEC-1: Iterations: 1500
32 # BTVER2-UOPQ-1: Iterations: 1500
37 # BTVER2-UOPQ-2: Iterations: 1500
42 # HASWELL-DEC-2: Iterations: 1500
47 # HASWELL-UOPQ-1: Iterations: 1500
52 # HASWELL-UOPQ-2: Iterations: 1500
57 # HASWELL-UOPQ-3: Iterations: 1500
62 # HASWELL-UOPQ-4: Iterations: 1500
|
| H A D | llvm-mca-markers-5.s | 18 # CHECK: Iterations: 1
41 # CHECK: Iterations: 1
64 # CHECK: Iterations: 1
|
| H A D | default-iterations.s | 8 # CUSTOM: Iterations: 1
13 # DEFAULT: Iterations: 100
|
| H A D | llvm-mca-markers-10.s | 16 # CHECK: Iterations: 100
65 # CHECK: Iterations: 100
|
| H A D | llvm-mca-markers-9.s | 16 # CHECK: Iterations: 100
67 # CHECK: Iterations: 100
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/BtVer2/ |
| H A D | int-to-fpu-forwarding-2.s | 30 # CHECK: Iterations: 500
77 # CHECK: Iterations: 500
124 # CHECK: Iterations: 500
171 # CHECK: Iterations: 500
218 # CHECK: Iterations: 500
265 # CHECK: Iterations: 500
|
| H A D | int-to-fpu-forwarding-1.s | 28 # CHECK: Iterations: 500
77 # CHECK: Iterations: 500
126 # CHECK: Iterations: 500
175 # CHECK: Iterations: 500
|
| H A D | cmpxchg-read-advance.s | 50 # CHECK: Iterations: 1
117 # CHECK: Iterations: 1
184 # CHECK: Iterations: 1
251 # CHECK: Iterations: 1
318 # CHECK: Iterations: 1
389 # CHECK: Iterations: 1
460 # CHECK: Iterations: 1
531 # CHECK: Iterations: 1
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 143 int Iterations = -1; member
151 Iterations = -1; in reset()
502 ReuseCandidate.Iterations = Iters; in findValueToReuse()
526 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
532 for (int i = 0; i < Iterations; ++i) { in reuseValue()
558 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/Barcelona/ |
| H A D | int-to-fpu-forwarding-2.s | 22 # CHECK: Iterations: 500
63 # CHECK: Iterations: 500
104 # CHECK: Iterations: 500
145 # CHECK: Iterations: 500
|
| H A D | int-to-fpu-forwarding-1.s | 26 # CHECK: Iterations: 500
69 # CHECK: Iterations: 500
112 # CHECK: Iterations: 500
155 # CHECK: Iterations: 500
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/X86/BdVer2/ |
| H A D | int-to-fpu-forwarding-2.s | 30 # CHECK: Iterations: 500
86 # CHECK: Iterations: 500
142 # CHECK: Iterations: 500
198 # CHECK: Iterations: 500
254 # CHECK: Iterations: 500
310 # CHECK: Iterations: 500
|
| H A D | int-to-fpu-forwarding-1.s | 26 # CHECK: Iterations: 500
84 # CHECK: Iterations: 500
142 # CHECK: Iterations: 500
200 # CHECK: Iterations: 500
|
| /llvm-project-15.0.7/third-party/benchmark/docs/ |
| H A D | tools.md | 43 Benchmark Time CPU Iterations
59 Benchmark Time CPU Iterations
108 Benchmark Time CPU Iterations
119 Benchmark Time CPU Iterations
159 Benchmark Time CPU Iterations
170 Benchmark Time CPU Iterations
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-mca/AArch64/Cortex/IPC/ |
| H A D | A55-9-fabs.s | 7 # CHECK: Iterations: 1000
|