Home
last modified time | relevance | path

Searched defs:Iterations (Results 1 – 25 of 29) sorted by relevance

12

/external/llvm-project/llvm/include/llvm/MCA/
DSourceMgr.h32 const unsigned Iterations; variable
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/
DSourceMgr.h32 const unsigned Iterations; variable
/external/swiftshader/third_party/marl/tools/bench/
Dbench.go34 Iterations uint member
/external/llvm-project/llvm/tools/llvm-mca/Views/
DTimelineView.cpp21 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations, in TimelineView()
284 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
DSummaryView.h51 unsigned Iterations; member
DBottleneckAnalysis.h268 void finalizeGraph(unsigned Iterations) { in finalizeGraph()
290 unsigned Iterations; variable
DBottleneckAnalysis.cpp171 void DependencyGraph::pruneEdges(unsigned Iterations) { in pruneEdges()
204 SmallVectorImpl<unsigned> &RootSet, unsigned Iterations) { in propagateThroughEdges()
/external/google-benchmark/test/
Dbenchmark_name_gtest.cc35 TEST(BenchmarkNameTest, Iterations) { in TEST() argument
/external/llvm-project/libc/benchmarks/
DLibcBenchmark.h129 size_t Iterations = 0; member
204 size_t Iterations = std::max(Options.InitialIterations, uint32_t(1)); variable
DLibcMemoryBenchmarkTest.cpp105 for (size_t Iterations = 0; Iterations <= 10; ++Iterations) { in TEST() local
DLibcMemoryBenchmark.h132 CircularArrayRef<ParameterType> generateBatch(size_t Iterations) { in generateBatch()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DDependenceAnalysis.h357 const SCEV *Iterations; member
361 const SCEV *Iterations; member
/external/llvm/include/llvm/Analysis/
DDependenceAnalysis.h364 const SCEV *Iterations; member
368 const SCEV *Iterations; member
/external/llvm-project/llvm/include/llvm/Analysis/
DDependenceAnalysis.h358 const SCEV *Iterations; member
362 const SCEV *Iterations; member
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonVectorLoopCarriedReuse.cpp244 int Iterations = -1; member
608 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
/external/llvm-project/llvm/lib/Target/Hexagon/
DHexagonVectorLoopCarriedReuse.cpp143 int Iterations = -1; member
529 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
/external/llvm-project/llvm/tools/llvm-mca/
Dllvm-mca.cpp108 static cl::opt<unsigned> Iterations("iterations", variable
/external/llvm-project/llvm/utils/benchmark/src/
Dbenchmark_register.cc358 Benchmark* Benchmark::Iterations(size_t n) { in Iterations() function in benchmark::internal::Benchmark
/external/llvm-project/libcxx/utils/google-benchmark/src/
Dbenchmark_register.cc363 Benchmark* Benchmark::Iterations(size_t n) { in Iterations() function in benchmark::internal::Benchmark
/external/libcxx/utils/google-benchmark/src/
Dbenchmark_register.cc363 Benchmark* Benchmark::Iterations(size_t n) { in Iterations() function in benchmark::internal::Benchmark
/external/google-benchmark/src/
Dbenchmark_register.cc390 Benchmark* Benchmark::Iterations(IterationCount n) { in Iterations() function in benchmark::internal::Benchmark
/external/ltp/testcases/kernel/fs/doio/
Diogen.c151 int Iterations; /* # requests to generate (0 --> infinite) */ variable
/external/OpenCL-CTS/test_conformance/c11_atomics/
Dcommon.h408 cl_int Iterations() {return _iterations;} in Iterations() function
/external/llvm-project/polly/lib/CodeGen/
DPPCGCodeGeneration.cpp3341 auto Iterations = approxPointsInSet(Stmt.getDomain().release(), Build); in approxDynamicInst() local
3391 auto Iterations = getNumberOfIterations(S, Build); in createSufficientComputeCheck() local
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp14530 unsigned Iterations = 0; in BuildReciprocalEstimate() local
14573 unsigned Iterations, in buildSqrtNROneConst()
14617 unsigned Iterations, in buildSqrtNRTwoConst()
14670 unsigned Iterations = 0; in buildSqrtEstimateImpl() local

12