| /llvm-project-15.0.7/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 62 const unsigned Iterations; variable
|
| /llvm-project-15.0.7/llvm/tools/llvm-mca/Views/ |
| H A D | SummaryView.h | 51 unsigned Iterations; member
|
| H A D | TimelineView.cpp | 21 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations, in TimelineView()
288 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
|
| H A D | BottleneckAnalysis.h | 270 void finalizeGraph(unsigned Iterations) { in finalizeGraph()
292 unsigned Iterations; variable
|
| H A D | BottleneckAnalysis.cpp | 169 void DependencyGraph::pruneEdges(unsigned Iterations) { in pruneEdges()
202 unsigned Iterations) { in propagateThroughEdges()
|
| /llvm-project-15.0.7/third-party/benchmark/test/ |
| H A D | benchmark_name_gtest.cc | 35 TEST(BenchmarkNameTest, Iterations) { in TEST() argument
|
| /llvm-project-15.0.7/libc/benchmarks/ |
| H A D | LibcBenchmark.h | 126 size_t Iterations = 0; member
201 size_t Iterations = std::max(Options.InitialIterations, uint32_t(1)); variable
|
| 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/Analysis/ |
| H A D | DependenceAnalysis.h | 355 const SCEV *Iterations; member
359 const SCEV *Iterations; member
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 143 int Iterations = -1; member
526 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/altera/ |
| H A D | UnrollLoopsCheck.cpp | 194 double Iterations; in hasLargeNumIterations() local
|
| /llvm-project-15.0.7/clang/lib/Analysis/FlowSensitive/ |
| H A D | TypeErasedDataflowAnalysis.cpp | 364 uint32_t Iterations = 0; in runTypeErasedDataflowAnalysis() local
|
| /llvm-project-15.0.7/llvm/tools/llvm-mca/ |
| H A D | llvm-mca.cpp | 113 static cl::opt<unsigned> Iterations("iterations", variable
|
| /llvm-project-15.0.7/third-party/benchmark/src/ |
| H A D | benchmark_register.cc | 351 Benchmark* Benchmark::Iterations(IterationCount n) { in Iterations() function in benchmark::internal::Benchmark
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | LongJmp.cpp | 620 uint32_t Iterations = 0; in runOnFunctions() local
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | SelectOptimize.cpp | 840 const unsigned Iterations = 2; in computeLoopCosts() local
|
| /llvm-project-15.0.7/polly/lib/CodeGen/ |
| H A D | PPCGCodeGeneration.cpp | 3369 auto Iterations = approxPointsInSet(Stmt.getDomain().release(), Build); in approxDynamicInst() local
3419 auto Iterations = getNumberOfIterations(S, Build); in createSufficientComputeCheck() local
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 3360 uint64_t Iterations = 0; in iterateTouchedInstructions() local
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 24400 int Iterations = TLI.getDivRefinementSteps(VT, MF); in BuildDivEstimate() local
24450 unsigned Iterations, in buildSqrtNROneConst()
24482 unsigned Iterations, in buildSqrtNRTwoConst()
24540 int Iterations = TLI.getSqrtRefinementSteps(VT, MF); in buildSqrtEstimateImpl() local
|