Home
last modified time | relevance | path

Searched refs:Iterations (Results 1 – 25 of 408) sorted by relevance

12345678910>>...17

/llvm-project/third-party/benchmark/test/
H A Dinternal_threading_test.cc46 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1);
47 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseRealTime();
48 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseManualTime();
49 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->MeasureProcessCPUTime();
51 ->Iterations(1)
56 ->Iterations(1)
61 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2);
62 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseRealTime();
63 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseManualTime();
64 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->MeasureProcessCPUTime();
[all …]
H A Dbenchmark_setup_teardown_test.cc38 ->Iterations(100)
68 ->Iterations(100)
106 ->Iterations(100);
127 ->Iterations(100)
/llvm-project/libc/benchmarks/
H A DLibcBenchmark.h126 size_t Iterations = 0; member
137 assert(M.Iterations > 0); in update()
142 TotalIterations += M.Iterations; in update()
186 // `Iterations` values to use as input for `foo`. The `value_type` of the
189 // `Container<ParameterType> generateBatch(size_t Iterations);`
190 // `const Container<ParameterType>& generateBatch(size_t Iterations);`
201 size_t Iterations = std::max(Options.InitialIterations, uint32_t(1)); variable
208 // Request a new Batch of size `Iterations`.
209 const auto &Batch = PP.generateBatch(Iterations);
223 const double ChangeRatio = REP.computeImprovement({Iterations, Elapse
[all...]
H A DLibcMemoryBenchmarkTest.cpp93 for (size_t Iterations = 0; Iterations <= 10; ++Iterations) { in TEST() local
/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.h241 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 DSummaryView.cpp70 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 DTimelineView.cpp21 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 DBottleneckAnalysis.cpp169 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
382 FOS << " [ probability: " << ((DE->Frequency * 100) / Iterations) in printCriticalSequence()
447 DG(S.size() * 3), Iterations(NumIter), TotalCycles(0), in BottleneckAnalysis()
537 if (IID == ((Iterations * Source.size()) - 1)) in onEvent()
538 DG.finalizeGraph(Iterations); in onEvent()
/llvm-project/clang-tools-extra/clang-tidy/altera/
H A DUnrollLoopsCheck.cpp191 double Iterations = 0.0; in hasLargeNumIterations() local
196 Iterations = EndValue - InitValue; in hasLargeNumIterations()
198 Iterations = InitValue - EndValue; in hasLargeNumIterations()
211 Iterations = ceil(float(EndValue - InitValue) / ConstantValue); in hasLargeNumIterations()
214 Iterations = ceil(float(InitValue - EndValue) / ConstantValue); in hasLargeNumIterations()
217 Iterations = 1 + (log((double)EndValue) - log((double)InitValue)) / in hasLargeNumIterations()
221 Iterations = 1 + (log((double)InitValue) - log((double)EndValue)) / in hasLargeNumIterations()
229 return Iterations > MaxLoopIterations; in hasLargeNumIterations()
/llvm-project/llvm/test/tools/llvm-mca/X86/
H A Duop-queue.s17 # 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 Dllvm-mca-markers-5.s18 # CHECK: Iterations: 1
41 # CHECK: Iterations: 1
64 # CHECK: Iterations: 1
H A Ddefault-iterations.s8 # CUSTOM: Iterations: 1
13 # DEFAULT: Iterations: 100
/llvm-project/llvm/include/llvm/MCA/
H A DSourceMgr.h62 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/llvm/test/tools/llvm-mca/X86/BtVer2/
H A Dint-to-fpu-forwarding-2.s30 # 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 Dint-to-fpu-forwarding-1.s28 # CHECK: Iterations: 500
77 # CHECK: Iterations: 500
126 # CHECK: Iterations: 500
175 # CHECK: Iterations: 500
H A Dcmpxchg-read-advance.s50 # 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/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp140 int Iterations = -1;
148 Iterations = -1; in reset()
499 ReuseCandidate.Iterations = Iters; in findValueToReuse()
523 int Iterations = ReuseCandidate.Iterations; in reuseValue()
529 for (int i = 0; i < Iterations; ++i) { in reuseValue()
555 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
143 int Iterations = -1; global() member
526 int Iterations = ReuseCandidate.Iterations; reuseValue() local
/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp226 PeelCounter Iterations = calculate(*Input); in calculate()
227 assert(IterationsToInvariance[Input] == Iterations && in calculate()
229 return (IterationsToInvariance[Phi] = addOne(Iterations)); in calculate()
254 unsigned Iterations = 0;
259 Iterations = std::max(Iterations, *ToInvariance); in calculateIterationsToPeel()
260 if (Iterations == MaxIterations) in calculateIterationsToPeel()
264 assert((Iterations <= MaxIterations) && "bad result in phi analysis"); in calculateIterationsToPeel()
265 return Iterations ? std::optional<unsigned>(Iterations) in calculateIterationsToPeel()
228 PeelCounter Iterations = calculate(*Input); calculate() local
256 unsigned Iterations = 0; calculateIterationsToPeel() local
[all...]
/llvm-project/llvm/test/tools/llvm-mca/X86/Barcelona/
H A Dint-to-fpu-forwarding-2.s22 # CHECK: Iterations: 500
63 # CHECK: Iterations: 500
104 # CHECK: Iterations: 500
145 # CHECK: Iterations: 500
H A Dint-to-fpu-forwarding-1.s26 # CHECK: Iterations: 500
69 # CHECK: Iterations: 500
112 # CHECK: Iterations: 500
155 # CHECK: Iterations: 500
/llvm-project/llvm/test/tools/llvm-mca/AArch64/HiSilicon/
H A Dtsv110-writeback.s721 # CHECK: Iterations: 100
757 # CHECK: Iterations: 100
793 # CHECK: Iterations: 100
829 # CHECK: Iterations: 100
865 # CHECK: Iterations: 100
901 # CHECK: Iterations: 100
937 # CHECK: Iterations: 100
973 # CHECK: Iterations: 100
1009 # CHECK: Iterations: 100
1045 # CHECK: Iterations: 100
[all …]
/llvm-project/llvm/test/tools/llvm-mca/AArch64/Neoverse/
H A DV2-writeback.s731 # CHECK: Iterations: 100
767 # CHECK: Iterations: 100
803 # CHECK: Iterations: 100
839 # CHECK: Iterations: 100
875 # CHECK: Iterations: 100
911 # CHECK: Iterations: 100
947 # CHECK: Iterations: 100
983 # CHECK: Iterations: 100
1019 # CHECK: Iterations: 100
1055 # CHECK: Iterations: 100
[all …]
H A DV2-forwarding.s313 # CHECK: Iterations: 100
351 # CHECK: Iterations: 100
389 # CHECK: Iterations: 100
433 # CHECK: Iterations: 100
471 # CHECK: Iterations: 100
509 # CHECK: Iterations: 100
547 # CHECK: Iterations: 100
585 # CHECK: Iterations: 100
623 # CHECK: Iterations: 100
661 # CHECK: Iterations: 100
[all …]
/llvm-project/llvm/test/tools/llvm-mca/X86/BdVer2/
H A Dint-to-fpu-forwarding-2.s30 # 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 Dint-to-fpu-forwarding-1.s26 # CHECK: Iterations: 500
84 # CHECK: Iterations: 500
142 # CHECK: Iterations: 500
200 # CHECK: Iterations: 500

12345678910>>...17