| /llvm-project-15.0.7/third-party/benchmark/src/ |
| H A D | benchmark_runner.cc | 64 static constexpr IterationCount kMaxIterations = 1000000000;
69 IterationCount memory_iterations, in CreateRunReport()
118 void RunInThread(const BenchmarkInstance* b, IterationCount iters, in RunInThread()
231 IterationCount BenchmarkRunner::PredictNumItersNeeded( in PredictNumItersNeeded()
245 const IterationCount max_next_iters = static_cast<IterationCount>( in PredictNumItersNeeded()
249 const IterationCount next_iters = std::min(max_next_iters, kMaxIterations); in PredictNumItersNeeded()
308 IterationCount memory_iterations = 0; in DoOneRepetition()
317 memory_iterations = std::min<IterationCount>(16, iters); in DoOneRepetition()
|
| H A D | complexity.cc | 33 return [](IterationCount n) -> double { return static_cast<double>(n); }; in FittingCurve()
35 return [](IterationCount n) -> double { return std::pow(n, 2); }; in FittingCurve()
37 return [](IterationCount n) -> double { return std::pow(n, 3); }; in FittingCurve()
41 [](IterationCount n) { return kLog2E * log(static_cast<double>(n)); }; in FittingCurve()
44 return [](IterationCount n) { in FittingCurve()
49 return [](IterationCount) { return 1.0; }; in FittingCurve() argument
|
| H A D | benchmark_runner.h | 81 IterationCount iters; // preserved between repetitions!
90 IterationCount iters;
95 IterationCount PredictNumItersNeeded(const IterationResults& i) const;
|
| H A D | benchmark_api_internal.h | 39 IterationCount iterations() const { return iterations_; } in iterations()
44 State Run(IterationCount iters, int thread_id, internal::ThreadTimer* timer,
65 IterationCount iterations_;
|
| H A D | counter.cc | 20 double Finish(Counter const& c, IterationCount iterations, double cpu_time, in Finish()
42 void Finish(UserCounters* l, IterationCount iterations, double cpu_time, in Finish()
|
| H A D | counter.h | 24 void Finish(UserCounters* l, IterationCount iterations, double time,
|
| H A D | thread_manager.h | 40 IterationCount iterations = 0;
|
| H A D | benchmark_api_internal.cc | 87 IterationCount iters, int thread_id, internal::ThreadTimer* timer, in Run()
|
| H A D | statistics.cc | 110 const IterationCount run_iterations = reports.front().iterations; in ComputeStats()
|
| H A D | json_reporter.cc | 92 std::string FormatKV(std::string const& key, IterationCount value) { in FormatKV()
|
| H A D | benchmark_register.cc | 351 Benchmark* Benchmark::Iterations(IterationCount n) { in Iterations()
|
| H A D | benchmark.cc | 136 State::State(IterationCount max_iters, const std::vector<int64_t>& ranges, in State()
|
| /llvm-project-15.0.7/third-party/benchmark/test/ |
| H A D | basic_test.cc | 100 benchmark::IterationCount iter_count = 0; in BM_KeepRunning()
114 const benchmark::IterationCount batch_size = 1009; in BM_KeepRunningBatch()
116 static benchmark::IterationCount prior_iter_count = 0; in BM_KeepRunningBatch()
117 benchmark::IterationCount iter_count = 0; in BM_KeepRunningBatch()
136 benchmark::IterationCount iter_count = 0; in BM_RangedFor()
|
| H A D | complexity_test.cc | 82 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anon456a40700202() argument
135 ->Complexity([](benchmark::IterationCount n) -> double { in __anon456a40700302()
176 ->Complexity([](benchmark::IterationCount n) { in __anon456a40700402()
|
| H A D | cxx03_test.cc | 17 volatile benchmark::IterationCount x = state.iterations(); in BM_empty()
|
| /llvm-project-15.0.7/third-party/benchmark/include/benchmark/ |
| H A D | benchmark.h | 519 typedef uint64_t IterationCount; typedef
525 typedef double(BigOFunc)(IterationCount);
601 bool KeepRunningBatch(IterationCount n);
751 IterationCount iterations() const { in iterations()
762 IterationCount total_iterations_;
767 IterationCount batch_leftover_;
770 const IterationCount max_iterations;
880 IterationCount cached_;
1009 Benchmark* Iterations(IterationCount n);
1111 IterationCount iterations_;
[all …]
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 2301 const SCEV *IterationCount = SE.getAddExpr(One, BackedgeTakenCount); in OptimizeMax() local
2302 if (IterationCount != SE.getSCEV(Sel)) return Cond; in OptimizeMax()
2312 } else if (const SCEVSMaxExpr *S = dyn_cast<SCEVSMaxExpr>(IterationCount)) { in OptimizeMax()
2315 } else if (const SCEVUMaxExpr *U = dyn_cast<SCEVUMaxExpr>(IterationCount)) { in OptimizeMax()
6108 const SCEVDbgValueBuilder &IterationCount, in createIterCountExpr()
6130 clone(IterationCount); in createIterCountExpr()
|
| /llvm-project-15.0.7/third-party/benchmark/docs/ |
| H A D | user_guide.md | 483 ->Range(1<<10, 1<<18)->Complexity([](benchmark::IterationCount n)->double{return n; });
|