| /external/google-benchmark/test/ |
| D | internal_threading_test.cc | 45 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1);
46 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseRealTime();
47 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseManualTime();
48 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->MeasureProcessCPUTime();
50 ->Iterations(1)
55 ->Iterations(1)
60 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2);
61 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseRealTime();
62 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseManualTime();
63 BENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->MeasureProcessCPUTime();
[all …]
|
| /external/XNNPACK/eval/ |
| D | f32-sigmoid-ulp.cc | 144 ->Iterations(1);
149 ->Iterations(1);
154 ->Iterations(1);
159 ->Iterations(1);
164 ->Iterations(1);
169 ->Iterations(1);
174 ->Iterations(1);
179 ->Iterations(1);
184 ->Iterations(1);
189 ->Iterations(1);
[all …]
|
| D | f32-expm1minus-ulp.cc | 118 ->Iterations(1);
123 ->Iterations(1);
129 ->Iterations(1);
134 ->Iterations(1);
142 ->Iterations(1);
147 ->Iterations(1);
153 ->Iterations(1);
158 ->Iterations(1);
163 ->Iterations(1);
168 ->Iterations(1);
[all …]
|
| D | f32-sqrt-ulp.cc | 118 ->Iterations(1);
123 ->Iterations(1);
128 ->Iterations(1);
133 ->Iterations(1);
138 ->Iterations(1);
144 ->Iterations(1);
149 ->Iterations(1);
154 ->Iterations(1);
162 ->Iterations(1);
167 ->Iterations(1);
[all …]
|
| D | f32-exp-ulp.cc | 138 ->Iterations(1);
143 ->Iterations(1);
151 ->Iterations(1);
156 ->Iterations(1);
161 ->Iterations(1);
166 ->Iterations(1);
171 ->Iterations(1);
176 ->Iterations(1);
182 ->Iterations(1);
187 ->Iterations(1);
[all …]
|
| D | f32-expminus-ulp.cc | 118 ->Iterations(1);
123 ->Iterations(1);
128 ->Iterations(1);
136 ->Iterations(1);
142 ->Iterations(1);
148 ->Iterations(1);
152 ->Iterations(1);
156 ->Iterations(1);
|
| /external/llvm-project/libc/benchmarks/ |
| D | LibcBenchmark.h | 129 size_t Iterations = 0; member
140 assert(M.Iterations > 0); in update()
145 TotalIterations += M.Iterations; in update()
204 size_t Iterations = std::max(Options.InitialIterations, uint32_t(1)); variable
212 const auto &Batch = PP.generateBatch(Iterations);
226 const double ChangeRatio = REP.computeImprovement({Iterations, Elapsed});
237 else if (Iterations >= Options.MaxIterations)
245 BS.LastSampleIterations = Iterations;
257 Iterations * Options.ScalingFactor == Iterations)
262 Iterations *= Options.ScalingFactor;
|
| D | LibcMemoryBenchmarkTest.cpp | 105 for (size_t Iterations = 0; Iterations <= 10; ++Iterations) { in TEST() local
|
| /external/ImageMagick/Magick++/demo/ |
| D | smile_anim.miff | 6 Scene=0 Iterations=0 Delay=10 Dispose=3
15 Scene=1 Iterations=1 Delay=10 Dispose=3
23 Scene=2 Iterations=1 Delay=10 Dispose=3
31 Scene=3 Iterations=1 Delay=10 Dispose=3
39 Scene=4 Iterations=1 Delay=10 Dispose=3
47 Scene=5 Iterations=1 Delay=10 Dispose=3
|
| /external/llvm-project/llvm/include/llvm/MCA/ |
| D | SourceMgr.h | 32 const unsigned Iterations; variable
37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {} in SourceMgr()
39 unsigned getNumIterations() const { return Iterations; } in getNumIterations()
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } in hasNext()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/ |
| D | SourceMgr.h | 32 const unsigned Iterations; variable
37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {} in SourceMgr()
39 unsigned getNumIterations() const { return Iterations; } in getNumIterations()
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } in hasNext()
|
| /external/llvm-project/llvm/tools/llvm-mca/Views/ |
| D | BottleneckAnalysis.h | 240 void pruneEdges(unsigned Iterations);
242 void propagateThroughEdges(SmallVectorImpl<unsigned> &RootSet, unsigned Iterations);
268 void finalizeGraph(unsigned Iterations) { in finalizeGraph() argument
270 pruneEdges(Iterations); in finalizeGraph()
272 propagateThroughEdges(RootSet, Iterations); in finalizeGraph()
290 unsigned Iterations; variable
327 ArrayRef<MCInst> Sequence, unsigned Iterations);
|
| D | SummaryView.cpp | 71 TempStream << "Iterations: " << DV.Iterations; in printView()
89 DV.Iterations = (LastInstructionIdx / DV.Instructions) + 1; in collectData()
90 DV.TotalInstructions = DV.Instructions * DV.Iterations; in collectData()
93 DV.TotalUOps = NumMicroOps * DV.Iterations; in collectData()
|
| 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()
284 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
285 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) { in printTimeline()
|
| D | BottleneckAnalysis.cpp | 171 void DependencyGraph::pruneEdges(unsigned Iterations) { in pruneEdges() argument
178 if (Edge.Frequency == Iterations) in pruneEdges()
180 double Factor = (double)Edge.Frequency / Iterations; in pruneEdges()
204 SmallVectorImpl<unsigned> &RootSet, unsigned Iterations) { in propagateThroughEdges() argument
383 FOS << " [ probability: " << ((DE->Frequency * 100) / Iterations) in printCriticalSequence()
448 DG(S.size() * 3), Iterations(NumIter), TotalCycles(0), in BottleneckAnalysis()
538 if (IID == ((Iterations * Source.size()) - 1)) in onEvent()
539 DG.finalizeGraph(Iterations); in onEvent()
|
| /external/llvm-project/llvm/test/tools/llvm-mca/X86/ |
| 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
|
| D | llvm-mca-markers-5.s | 18 # CHECK: Iterations: 1
41 # CHECK: Iterations: 1
64 # CHECK: Iterations: 1
|
| D | default-iterations.s | 8 # CUSTOM: Iterations: 1
13 # DEFAULT: Iterations: 100
|
| /external/swiftshader/third_party/marl/tools/bench/ |
| D | bench.go | 34 Iterations uint member
113 Iterations: uint(iterations),
124 Iterations uint `json:"iterations"`
143 Iterations: test.Iterations,
|
| /external/llvm-project/llvm/test/tools/llvm-mca/X86/BtVer2/ |
| 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
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonVectorLoopCarriedReuse.cpp | 244 int Iterations = -1; member
252 Iterations = -1; in reset()
584 ReuseCandidate.Iterations = Iters; in findValueToReuse()
608 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
614 for (int i = 0; i < Iterations; ++i) { in reuseValue()
640 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
|
| /external/llvm-project/llvm/test/tools/llvm-mca/X86/Barcelona/ |
| D | int-to-fpu-forwarding-2.s | 22 # CHECK: Iterations: 500
63 # CHECK: Iterations: 500
104 # CHECK: Iterations: 500
145 # CHECK: Iterations: 500
|
| D | int-to-fpu-forwarding-1.s | 26 # CHECK: Iterations: 500
69 # CHECK: Iterations: 500
112 # CHECK: Iterations: 500
155 # CHECK: Iterations: 500
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonVectorLoopCarriedReuse.cpp | 143 int Iterations = -1; member
151 Iterations = -1; in reset()
505 ReuseCandidate.Iterations = Iters; in findValueToReuse()
529 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
535 for (int i = 0; i < Iterations; ++i) { in reuseValue()
561 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
|
| /external/llvm-project/llvm/utils/benchmark/docs/ |
| D | tools.md | 47 Benchmark Time CPU Iterations
57 Benchmark Time CPU Iterations
98 Benchmark Time CPU Iterations
114 Benchmark Time CPU Iterations
163 Benchmark Time CPU Iterations
174 Benchmark Time CPU Iterations
214 Benchmark Time CPU Iterations
225 Benchmark Time CPU Iterations
|