| /third_party/benchmark/test/ |
| D | benchmark_name_gtest.cc | 31 name.min_time = "min_time:3.4s"; in TEST()
38 name.min_time = "min_time:3.4s"; in TEST()
46 name.min_time = "min_time:3.4s"; in TEST()
54 name.min_time = "min_time:3.4s"; in TEST()
62 name.min_time = "min_time:3.4s"; in TEST()
|
| /third_party/boost/libs/numeric/odeint/performance/ |
| D | odeint_rk4_array.cpp | 45 double min_time = 1E6; // something big in main() local
59 min_time = std::min( timer.elapsed() , min_time ); in main()
62 std::cout << "Minimal Runtime: " << min_time << std::endl; in main()
|
| D | c_lorenz.c | 23 double min_time = 1E6; in main() local
51 min_time = fmin(min_time, (double)(end-begin)/CLOCKS_PER_SEC); in main()
54 printf("Minimal Runtime: %f\n", min_time); in main()
|
| D | fortran_lorenz.f90 | 16 real(dp) :: min_time = 100.0 variable
24 min_time = min(time, min_time)
27 write (*,*) "Minimal Runtime:", min_time
|
| /third_party/boost/libs/multiprecision/performance/ |
| D | sf_performance.cpp | 59 double min_time = (std::numeric_limits<double>::max)(); in print_quickbook_tables() local
62 if (j->second.first < min_time) in print_quickbook_tables()
63 min_time = j->second.first; in print_quickbook_tables()
68 …std::cout << "[[" << j->first << "][" << t / min_time << " (" << t << "s)][" << j->second.second <… in print_quickbook_tables()
|
| D | miller_rabin_performance.hpp | 51 extern double min_time;
76 if (d < min_time) in test_miller_rabin()
77 min_time = d; in test_miller_rabin()
|
| D | miller_rabin_performance.cpp | 51 double min_time = (std::numeric_limits<double>::max)(); variable
61 double rel = i->second / min_time; in generate_quickbook()
|
| D | voronoi_performance.cpp | 143 double min_time = (std::numeric_limits<double>::max)(); variable
170 if (d < min_time) in test()
171 min_time = d; in test()
185 double rel = i->second / min_time; in generate_quickbook()
|
| /third_party/benchmark/src/ |
| D | benchmark_runner.cc | 149 min_time(!IsZero(b.min_time()) ? b.min_time() : FLAGS_benchmark_min_time), in BenchmarkRunner()
235 double multiplier = min_time * 1.4 / std::max(i.seconds, 1e-9); in PredictNumItersNeeded()
241 bool is_significant = (i.seconds / min_time) > 0.1; in PredictNumItersNeeded()
262 i.seconds >= min_time || // The elapsed time is large enough. in ShouldReportIterationResults()
266 ((i.results.real_time_used >= 5 * min_time) && !b.use_manual_time()); in ShouldReportIterationResults()
|
| /third_party/boost/libs/compute/perf/ |
| D | perf_accumulate.cpp | 44 return t.min_time(); in perf_accumulate()
61 double min_time = (std::numeric_limits<double>::max)(); in tune_accumulate() local
72 if(t < min_time){ in tune_accumulate()
75 min_time = t; in tune_accumulate()
|
| D | perf_sort.cpp | 46 return t.min_time(); in perf_sort()
62 double min_time = (std::numeric_limits<double>::max)(); in tune_sort() local
70 if(t < min_time){ in tune_sort()
72 min_time = t; in tune_sort()
|
| D | perf_saxpy.cpp | 61 return t.min_time(); in perf_saxpy()
80 double min_time = (std::numeric_limits<double>::max)(); in tune_saxpy() local
91 if(t < min_time){ in tune_saxpy()
94 min_time = t; in tune_saxpy()
|
| D | perf_random_number_engine.cpp | 49 std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl; in perf_random_number_engine()
50 std::cout << "rate: " << perf_rate<T>(size, t.min_time()) << " MB/s" << std::endl; in perf_random_number_engine()
|
| D | perf_copy_if.cpp | 55 std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl; in test_copy_if_odd()
106 std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl; in test_copy_if_in_sphere()
|
| D | perf_cart_to_polar.cpp | 123 std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl; in main()
132 std::cout << "host time: " << t.min_time() / 1e6 << " ms" << std::endl; in main()
|
| D | perf_tbb_sort.cpp | 32 std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl; in main()
|
| D | perf_stl_sort.cpp | 30 std::cout << "time: " << t.min_time() / 1e6 << " ms" << std::endl; in main()
|
| /third_party/boost/libs/math/example/ |
| D | root_finding_algorithms.cpp | 150 …boost::int_least64_t min_time = (std::numeric_limits<boost::int_least64_t>::max)(); // Used to nor… member
452 if (time < root_infos[type_no].min_time) in test_root()
454 root_infos[type_no].min_time = time; in test_root()
474 if (time < root_infos[type_no].min_time) in test_root()
476 root_infos[type_no].min_time = time; in test_root()
497 if (time < root_infos[type_no].min_time) in test_root()
499 root_infos[type_no].min_time = time; in test_root()
522 if (time < root_infos[type_no].min_time) in test_root()
524 root_infos[type_no].min_time = time; in test_root()
545 if (time < root_infos[type_no].min_time) in test_root()
[all …]
|
| D | root_n_finding_algorithms.cpp | 143 int min_time = (std::numeric_limits<int>::max)(); // Used to normalize times. member
485 if (time < root_infos[type_no].min_time) in test_root()
487 root_infos[type_no].min_time = time; in test_root()
507 if (time < root_infos[type_no].min_time) in test_root()
509 root_infos[type_no].min_time = time; in test_root()
531 if (time < root_infos[type_no].min_time) in test_root()
533 root_infos[type_no].min_time = time; in test_root()
552 if (time < root_infos[type_no].min_time) in test_root()
554 root_infos[type_no].min_time = time; in test_root()
564 …_times.push_back(static_cast<double>(root_infos[type_no].times[i]) / root_infos[type_no].min_time); in test_root()
|
| D | root_elliptic_finding.cpp | 142 int min_time = (std::numeric_limits<int>::max)(); // Used to normalize times. member
497 if (time < root_infos[type_no].min_time) in test_root()
499 root_infos[type_no].min_time = time; in test_root()
519 if (time < root_infos[type_no].min_time) in test_root()
521 root_infos[type_no].min_time = time; in test_root()
543 if (time < root_infos[type_no].min_time) in test_root()
545 root_infos[type_no].min_time = time; in test_root()
564 if (time < root_infos[type_no].min_time) in test_root()
566 root_infos[type_no].min_time = time; in test_root()
576 …_times.push_back(static_cast<double>(root_infos[type_no].times[i]) / root_infos[type_no].min_time); in test_root()
|
| /third_party/gstreamer/gstplugins_base/tests/check/elements/ |
| D | urisourcebin.c | 32 guint64 min_time, max_time, avg_time; in GST_START_TEST() local
55 "minimum-time-level", &min_time)); in GST_START_TEST()
56 fail_unless_equals_int (0, min_time); in GST_START_TEST()
|
| /third_party/json/benchmarks/thirdparty/benchmark/src/ |
| D | benchmark.cc | 234 const double min_time = in RunBenchmark() local
235 !IsZero(b.min_time) ? b.min_time : FLAGS_benchmark_min_time; in RunBenchmark()
243 || seconds >= min_time // the elapsed time is large enough in RunBenchmark()
247 || ((results.real_time_used >= 5 * min_time) && !b.use_manual_time); in RunBenchmark()
259 double multiplier = min_time * 1.4 / std::max(seconds, 1e-9); in RunBenchmark()
265 bool is_significant = (seconds / min_time) > 0.1; in RunBenchmark()
|
| /third_party/mindspore/mindspore/lite/src/runtime/kernel/opencl/ |
| D | opencl_kernel.cc | 295 double min_time = MAX_PROFILING_TIME_MILLI_SECOND; in Tune() local
305 if (current_time < min_time) { in Tune()
306 min_time = current_time; in Tune()
311 …) << "Tuning " << name() << " result: param (" << tuning_params[index] << ") exectime " << min_time in Tune()
|
| /third_party/mindspore/tests/perf_test/mind_expression_perf/ |
| D | generate_report.py | 59 min_file, min_time = times[0]
61 log["min_time"] = min_time
|
| /third_party/icu/icu4c/source/tools/tzcode/ |
| D | zic.c | 866 static const zic_t min_time = (zic_t) -1 << (TIME_T_BITS_IN_FILE - 1); variable
1244 z.z_untiltime > min_time && in inzsub()
1246 zones[nzones - 1].z_untiltime > min_time && in inzsub()
1326 if (dayoff < min_time / SECSPERDAY) { in inleap()
1626 while (fromi < timecnt && attypes[fromi].at < min_time) in writezone()
2360 usestart = i > 0 && (zp - 1)->z_untiltime > min_time; in outzone()
2362 if (useuntil && zp->z_untiltime <= min_time) in outzone()
2468 addtt(min_time, type); in outzone()
2521 if (jtime == min_time || in outzone()
2681 if (starttime <= min_time || in addtt()
[all …]
|