Home
last modified time | relevance | path

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

12

/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.h240 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);
H A DSummaryView.cpp71 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()
103 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()
287 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
288 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) { in printTimeline()
H A DBottleneckAnalysis.cpp171 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
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()
H A DSummaryView.h51 unsigned Iterations; member
H A DTimelineView.h166 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations,
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/MCA/
H A DSourceMgr.h32 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()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp143 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()
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/docs/
H A Dtools.md47 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
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/docs/
H A Dtools.md39 Benchmark Time CPU Iterations
55 Benchmark Time CPU Iterations
104 Benchmark Time CPU Iterations
115 Benchmark Time CPU Iterations
155 Benchmark Time CPU Iterations
166 Benchmark Time CPU Iterations
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp2538 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations; in banerjeeMIVtest()
2737 if (Bound[K].Iterations) { in findBoundsALL()
2740 Bound[K].Iterations); in findBoundsALL()
2743 Bound[K].Iterations); in findBoundsALL()
2776 if (Bound[K].Iterations) { in findBoundsEQ()
2780 SE->getMulExpr(NegativePart, Bound[K].Iterations); in findBoundsEQ()
2783 SE->getMulExpr(PositivePart, Bound[K].Iterations); in findBoundsEQ()
2816 if (Bound[K].Iterations) { in findBoundsLT()
2818 Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType())); in findBoundsLT()
2860 if (Bound[K].Iterations) { in findBoundsGT()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/test/
H A Doptions_test.cc63 BENCHMARK(BM_explicit_iteration_count)->Iterations(42);
H A Dskip_with_error_test.cc131 BENCHMARK(BM_error_during_running_ranged_for)->Arg(1)->Arg(2)->Iterations(5);
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/test/
H A Doptions_test.cc63 BENCHMARK(BM_explicit_iteration_count)->Iterations(42);
H A Dskip_with_error_test.cc130 BENCHMARK(BM_error_during_running_ranged_for)->Arg(1)->Arg(2)->Iterations(5);
H A Dreporter_output_test.cc519 ->Iterations(5)
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h358 const SCEV *Iterations; member
362 const SCEV *Iterations; member
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-mca/
H A Dllvm-mca.cpp113 static cl::opt<unsigned> Iterations("iterations", variable
526 mca::SourceMgr S(LoweredSequence, PrintInstructionTables ? 1 : Iterations); in main()
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/
H A DREADME.md736 Benchmark Time CPU Iterations UserCounters...
764 Benchmark Time CPU Iterations Bar Bat Baz Foo
775 Benchmark Time CPU Iterations
843 Benchmark Time CPU Iterations
882 Benchmark Time(ns) CPU(ns) Iterations
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/
H A DREADME.md698 Benchmark Time CPU Iterations UserCounters...
726 Benchmark Time CPU Iterations Bar Bat Baz Foo
737 Benchmark Time CPU Iterations
805 Benchmark Time CPU Iterations
823 Benchmark Time(ns) CPU(ns) Iterations
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/
H A Dbenchmark_register.cc363 Benchmark* Benchmark::Iterations(size_t n) { in Iterations() function in benchmark::internal::Benchmark
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/src/
H A Dbenchmark_register.cc358 Benchmark* Benchmark::Iterations(size_t n) { in Iterations() function in benchmark::internal::Benchmark
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/include/benchmark/
H A Dbenchmark.h826 Benchmark* Iterations(size_t n);
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/include/benchmark/
H A Dbenchmark.h861 Benchmark* Iterations(size_t n);
/netbsd-src/external/apache2/argon2/dist/phc-winner-argon2/
H A DREADME.md79 Iterations: 2

12