| /external/cronet/tot/third_party/google_benchmark/src/src/ |
| D | benchmark_runner.h | 44 IterationCount iters;
76 IterationCount GetIters() const { return iters; } in GetIters()
97 IterationCount iters; // preserved between repetitions!
105 IterationCount iters;
110 MemoryManager::Result* RunMemoryManager(IterationCount memory_iterations);
114 IterationCount PredictNumItersNeeded(const IterationResults& i) const;
120 void FinishWarmUp(const IterationCount& i);
|
| D | benchmark_runner.cc | 77 static constexpr IterationCount kMaxIterations = 1000000000000;
84 IterationCount memory_iterations, in CreateRunReport()
134 void RunInThread(const BenchmarkInstance* b, IterationCount iters, in RunInThread()
170 IterationCount ComputeIters(const benchmark::internal::BenchmarkInstance& b, in ComputeIters()
195 IterationCount num_iters = std::strtol(value.c_str(), &p_end, 10); in ParseBenchMinTime()
330 IterationCount BenchmarkRunner::PredictNumItersNeeded( in PredictNumItersNeeded()
344 const IterationCount max_next_iters = static_cast<IterationCount>( in PredictNumItersNeeded()
348 const IterationCount next_iters = std::min(max_next_iters, kMaxIterations); in PredictNumItersNeeded()
379 void BenchmarkRunner::FinishWarmUp(const IterationCount& i) { in FinishWarmUp()
394 const IterationCount i_backup = iters; in RunWarmUp()
[all …]
|
| D | complexity.cc | 32 return [](IterationCount n) -> double { return static_cast<double>(n); }; in FittingCurve()
34 return [](IterationCount n) -> double { return std::pow(n, 2); }; in FittingCurve()
36 return [](IterationCount n) -> double { return std::pow(n, 3); }; in FittingCurve()
38 return [](IterationCount n) -> double { in FittingCurve()
42 return [](IterationCount n) -> double { in FittingCurve()
47 return [](IterationCount) { return 1.0; }; in FittingCurve() argument
|
| D | benchmark_api_internal.h | 40 IterationCount iterations() const { return iterations_; } in iterations()
45 State Run(IterationCount iters, int thread_id, internal::ThreadTimer* timer,
68 IterationCount iterations_;
|
| /external/cronet/stable/third_party/google_benchmark/src/src/ |
| D | benchmark_runner.h | 44 IterationCount iters;
76 IterationCount GetIters() const { return iters; } in GetIters()
97 IterationCount iters; // preserved between repetitions!
105 IterationCount iters;
110 MemoryManager::Result* RunMemoryManager(IterationCount memory_iterations);
114 IterationCount PredictNumItersNeeded(const IterationResults& i) const;
120 void FinishWarmUp(const IterationCount& i);
|
| D | benchmark_runner.cc | 77 static constexpr IterationCount kMaxIterations = 1000000000000;
84 IterationCount memory_iterations, in CreateRunReport()
134 void RunInThread(const BenchmarkInstance* b, IterationCount iters, in RunInThread()
170 IterationCount ComputeIters(const benchmark::internal::BenchmarkInstance& b, in ComputeIters()
195 IterationCount num_iters = std::strtol(value.c_str(), &p_end, 10); in ParseBenchMinTime()
330 IterationCount BenchmarkRunner::PredictNumItersNeeded( in PredictNumItersNeeded()
344 const IterationCount max_next_iters = static_cast<IterationCount>( in PredictNumItersNeeded()
348 const IterationCount next_iters = std::min(max_next_iters, kMaxIterations); in PredictNumItersNeeded()
379 void BenchmarkRunner::FinishWarmUp(const IterationCount& i) { in FinishWarmUp()
394 const IterationCount i_backup = iters; in RunWarmUp()
[all …]
|
| D | complexity.cc | 32 return [](IterationCount n) -> double { return static_cast<double>(n); }; in FittingCurve()
34 return [](IterationCount n) -> double { return std::pow(n, 2); }; in FittingCurve()
36 return [](IterationCount n) -> double { return std::pow(n, 3); }; in FittingCurve()
38 return [](IterationCount n) -> double { in FittingCurve()
42 return [](IterationCount n) -> double { in FittingCurve()
47 return [](IterationCount) { return 1.0; }; in FittingCurve() argument
|
| D | benchmark_api_internal.h | 40 IterationCount iterations() const { return iterations_; } in iterations()
45 State Run(IterationCount iters, int thread_id, internal::ThreadTimer* timer,
68 IterationCount iterations_;
|
| /external/google-benchmark/src/ |
| D | benchmark_runner.h | 51 IterationCount iters;
83 IterationCount GetIters() const { return iters; } in GetIters()
104 IterationCount iters; // preserved between repetitions!
112 IterationCount iters;
117 MemoryManager::Result* RunMemoryManager(IterationCount memory_iterations);
121 IterationCount PredictNumItersNeeded(const IterationResults& i) const;
127 void FinishWarmUp(const IterationCount& i);
|
| D | benchmark_runner.cc | 69 static constexpr IterationCount kMaxIterations = 1000000000000;
76 IterationCount memory_iterations, in CreateRunReport()
126 void RunInThread(const BenchmarkInstance* b, IterationCount iters, in RunInThread()
162 IterationCount ComputeIters(const benchmark::internal::BenchmarkInstance& b, in ComputeIters()
187 IterationCount num_iters = std::strtol(value.c_str(), &p_end, 10); in ParseBenchMinTime()
313 IterationCount BenchmarkRunner::PredictNumItersNeeded( in PredictNumItersNeeded()
327 const IterationCount max_next_iters = static_cast<IterationCount>( in PredictNumItersNeeded()
331 const IterationCount next_iters = std::min(max_next_iters, kMaxIterations); in PredictNumItersNeeded()
362 void BenchmarkRunner::FinishWarmUp(const IterationCount& i) { in FinishWarmUp()
377 const IterationCount i_backup = iters; in RunWarmUp()
[all …]
|
| D | complexity.cc | 32 return [](IterationCount n) -> double { return static_cast<double>(n); }; in FittingCurve()
34 return [](IterationCount n) -> double { return std::pow(n, 2); }; in FittingCurve()
36 return [](IterationCount n) -> double { return std::pow(n, 3); }; in FittingCurve()
38 return [](IterationCount n) -> double { in FittingCurve()
42 return [](IterationCount n) -> double { in FittingCurve()
47 return [](IterationCount) { return 1.0; }; in FittingCurve() argument
|
| D | benchmark_api_internal.h | 40 IterationCount iterations() const { return iterations_; } in iterations()
45 State Run(IterationCount iters, int thread_id, internal::ThreadTimer* timer,
68 IterationCount iterations_;
|
| /external/pytorch/test/profiler/ |
| D | test_cpp_thread.py | 49 IterationCount = 5 variable
60 global KinetoProfiler, IterationCount
67 elif iteration == IterationCount - 1:
107 cpp.start_threads(1, IterationCount, False)
181 cpp.start_threads(self.ThreadCount, IterationCount, True)
195 cpp.start_threads(self.ThreadCount, IterationCount, False)
209 cpp.start_threads(self.ThreadCount, IterationCount, True)
|
| /external/cronet/stable/third_party/google_benchmark/src/test/ |
| D | complexity_test.cc | 76 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O1()
95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anonb0f94da10202() argument
125 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O_N()
150 ->Complexity([](benchmark::IterationCount n) -> double { in __anonb0f94da10302()
183 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O_N_log_N()
208 ->Complexity([](benchmark::IterationCount n) { in __anonb0f94da10402()
243 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_ComplexityCaptureArgs()
|
| D | benchmark_min_time_flag_iters_test.cc | 30 const std::vector<benchmark::IterationCount>& GetIters() const { in GetIters()
35 std::vector<benchmark::IterationCount> iter_nums_;
61 const std::vector<benchmark::IterationCount> iters = test_reporter.GetIters(); in main()
|
| D | basic_test.cc | 101 benchmark::IterationCount iter_count = 0; in BM_KeepRunning()
115 const benchmark::IterationCount batch_size = 1009; in BM_KeepRunningBatch()
117 static benchmark::IterationCount prior_iter_count = 0; in BM_KeepRunningBatch()
118 benchmark::IterationCount iter_count = 0; in BM_KeepRunningBatch()
137 benchmark::IterationCount iter_count = 0; in BM_RangedFor()
|
| /external/cronet/tot/third_party/google_benchmark/src/test/ |
| D | complexity_test.cc | 76 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O1()
95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anon1af13a3d0202() argument
125 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O_N()
150 ->Complexity([](benchmark::IterationCount n) -> double { in __anon1af13a3d0302()
183 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O_N_log_N()
208 ->Complexity([](benchmark::IterationCount n) { in __anon1af13a3d0402()
243 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_ComplexityCaptureArgs()
|
| D | benchmark_min_time_flag_iters_test.cc | 30 const std::vector<benchmark::IterationCount>& GetIters() const { in GetIters()
35 std::vector<benchmark::IterationCount> iter_nums_;
61 const std::vector<benchmark::IterationCount> iters = test_reporter.GetIters(); in main()
|
| D | basic_test.cc | 101 benchmark::IterationCount iter_count = 0; in BM_KeepRunning()
115 const benchmark::IterationCount batch_size = 1009; in BM_KeepRunningBatch()
117 static benchmark::IterationCount prior_iter_count = 0; in BM_KeepRunningBatch()
118 benchmark::IterationCount iter_count = 0; in BM_KeepRunningBatch()
137 benchmark::IterationCount iter_count = 0; in BM_RangedFor()
|
| /external/google-benchmark/test/ |
| D | complexity_test.cc | 76 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O1()
95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anonafa4c47b0202() argument
125 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O_N()
150 ->Complexity([](benchmark::IterationCount n) -> double { in __anonafa4c47b0302()
183 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_Complexity_O_N_log_N()
208 ->Complexity([](benchmark::IterationCount n) { in __anonafa4c47b0402()
243 for (benchmark::IterationCount i = 0; i < state.iterations(); ++i) { in BM_ComplexityCaptureArgs()
|
| D | benchmark_min_time_flag_iters_test.cc | 30 const std::vector<benchmark::IterationCount>& GetIters() const { in GetIters()
35 std::vector<benchmark::IterationCount> iter_nums_;
61 const std::vector<benchmark::IterationCount> iters = test_reporter.GetIters(); in main()
|
| D | basic_test.cc | 101 benchmark::IterationCount iter_count = 0; in BM_KeepRunning()
115 const benchmark::IterationCount batch_size = 1009; in BM_KeepRunningBatch()
117 static benchmark::IterationCount prior_iter_count = 0; in BM_KeepRunningBatch()
118 benchmark::IterationCount iter_count = 0; in BM_KeepRunningBatch()
137 benchmark::IterationCount iter_count = 0; in BM_RangedFor()
|
| /external/cronet/stable/third_party/boringssl/src/util/fipstools/acvp/acvptool/subprocess/ |
| D | pbkdf.go | 40 IterationCount uint32 `json:"iterationCount,omitempty"`
94 if test.IterationCount < 1 {
97 iterationCount := uint32le(test.IterationCount)
|
| /external/boringssl/src/util/fipstools/acvp/acvptool/subprocess/ |
| D | pbkdf.go | 40 IterationCount uint32 `json:"iterationCount,omitempty"`
94 if test.IterationCount < 1 {
97 iterationCount := uint32le(test.IterationCount)
|
| /external/cronet/tot/third_party/boringssl/src/util/fipstools/acvp/acvptool/subprocess/ |
| D | pbkdf.go | 40 IterationCount uint32 `json:"iterationCount,omitempty"`
94 if test.IterationCount < 1 {
97 iterationCount := uint32le(test.IterationCount)
|