| /third_party/boost/libs/math/reporting/performance/ |
| D | test_polynomial.cpp | 37 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_add() local
47 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_subtract() local
57 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_add_int() local
67 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_subtract_int() local
77 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_multiply() local
87 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_multiply_int() local
97 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_divide() local
107 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_divide_int() local
118 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_gcd() local
129 for (unsigned repeats = 0; repeats < max_reps; ++repeats) in test_inplace_add() local
[all …]
|
| D | performance.hpp | 102 unsigned repeats = 1; in exec_timed_test() local
106 for(unsigned count = 0; count < repeats; ++count) in exec_timed_test()
114 repeats *= 2; in exec_timed_test()
116 return t / (repeats * data.size()); in exec_timed_test()
|
| /third_party/boost/libs/fusion/example/performance/ |
| D | sequence_efficiency.cpp | 121 void measure(T const& seq, char const* info, long const repeats, double base) in measure() argument
123 double t = test::measure<accumulator<int> >(seq, repeats); in measure()
184 long repeats = 100; in main() local
186 while (measured < 2.0 && repeats <= 10000000) in main()
188 repeats *= 10; in main()
192 test::hammer<plain_accumulator<int> >(0, repeats); in main()
193 test::hammer<accumulator<int> >(vsmall, repeats); in main()
194 test::hammer<accumulator<int> >(lsmall, repeats); in main()
195 test::hammer<accumulator<int> >(vmedium, repeats); in main()
196 test::hammer<accumulator<int> >(lmedium, repeats); in main()
[all …]
|
| D | measure.hpp | 23 void hammer(Arg const& x, long const repeats) in hammer() argument
51 for (long iteration = 0; iteration < repeats; ++iteration) in hammer()
70 double measure(T const& x, long const repeats) in measure() argument
77 hammer<Accumulator>(x, repeats); in measure()
78 hammer<Accumulator>(x, repeats); in measure()
82 hammer<Accumulator>(x, repeats); // This time, we'll measure in measure()
83 return time.elapsed() / repeats; // return the time of one iteration in measure()
|
| D | zip_efficiency.cpp | 72 void measure(T const& seq, char const* info, long const repeats) in measure() argument
76 << test::measure<zip_accumulator<int> >(seq, repeats) in measure()
122 long repeats = 100; in main() local
124 while (measured < 2.0 && repeats <= 10000000) in main()
126 repeats *= 10; in main()
130 test::hammer<zip_accumulator<int> >(zip(vsmall_1, vsmall_2), repeats); in main()
131 test::hammer<zip_accumulator<int> >(zip(vmedium_1, vmedium_2), repeats); in main()
145 "small zip time: ", repeats); in main()
147 "medium zip time: ", repeats); in main()
|
| D | accumulate.cpp | 45 long long counter, repeats; in time_for_std_accumulate() local
65 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_for_std_accumulate()
120 long long counter, repeats; in time_for_fusion_accumulate() local
142 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_for_fusion_accumulate()
166 long long counter, repeats;
188 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats)
209 long long counter, repeats;
232 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats)
270 long long counter, repeats;
295 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats)
|
| D | inner_product.cpp | 80 long long counter, repeats; in time_for_std_inner_product() local
102 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_for_std_inner_product()
123 long long counter, repeats; in time_for_fusion_inner_product() local
146 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_for_fusion_inner_product()
|
| D | functional.cpp | 106 long long counter, repeats; in call_unfused() local
126 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in call_unfused()
149 long long counter, repeats; in call_fused_ra() local
174 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in call_fused_ra()
202 long long counter, repeats; in call_fused() local
227 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in call_fused()
|
| D | inner_product2.cpp | 80 long long counter, repeats; in time_for_std_inner_product() local
102 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_for_std_inner_product()
141 long long counter, repeats; in time_for_fusion_inner_product2() local
166 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_for_fusion_inner_product2()
|
| /third_party/boost/libs/parameter/test/ |
| D | efficiency.cpp | 97 void hammer(Arg const& x, long const repeats) in hammer() argument
122 for (long iteration = 0; iteration < repeats; ++iteration) in hammer()
140 double measure(T const& x, long const repeats) in measure() argument
146 test::hammer<Accumulator>(x, repeats); in measure()
147 test::hammer<Accumulator>(x, repeats); in measure()
151 test::hammer<Accumulator>(x, repeats); // This time, we'll measure. in measure()
159 long repeats = 100; in main() local
162 while (measured < 1.0 && repeats <= 10000000) in main()
164 repeats *= 10; in main()
168 test::hammer<test::plain_weight_running_total<double> >(.1, repeats); in main()
[all …]
|
| /third_party/boost/libs/spirit/workbench/ |
| D | measure.hpp | 31 void hammer(long const repeats) in hammer() argument
60 for (long iteration = 0; iteration < repeats; ++iteration) in hammer()
78 double measure(long const repeats) in measure() argument
85 hammer<Accumulator>(repeats); in measure()
86 hammer<Accumulator>(repeats); in measure()
90 hammer<Accumulator>(repeats); // This time, we'll measure in measure()
95 void report(char const* name, long const repeats) in report() argument
101 std::cout << std::fixed << test::measure<Accumulator>(repeats) << " [s] "; in report()
115 test::hammer<elem>(repeats);
119 test::report<elem>(BOOST_PP_STRINGIZE(elem), repeats); \
[all …]
|
| /third_party/boost/libs/xpressive/perf/ |
| D | time_boost.cpp | 24 int counter, repeats; in time_match() local
40 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_match()
69 int counter, repeats; in time_find_all() local
90 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_find_all()
|
| D | time_dynamic_xpressive.cpp | 26 int counter, repeats; in time_match() local
43 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_match()
69 int counter, repeats; in time_find_all() local
89 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_find_all()
|
| D | time_static_xpressive.cpp | 145 int counter, repeats; in time_match() local
162 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_match()
188 int counter, repeats; in time_find_all() local
208 for(repeats = 0; repeats < REPEAT_COUNT; ++repeats) in time_find_all()
|
| /third_party/glib/tests/ |
| D | slice-color.c | 40 guint64 repeats) in access_memory3() argument
44 for (i = 0; i < repeats; i++) in access_memory3()
49 for (i = 0; i < repeats; i++) in access_memory3()
58 guint64 repeats) in touch_mem() argument
80 accu = access_memory3 (mema, memb, memc, n, repeats); in touch_mem()
84 g_assert (accu / repeats == (2 + 3) * n / 2 + 4 * n / 2); in touch_mem()
108 guint64 block_size = 512, area_size = 1024 * 1024, n_blocks, repeats = 1000000; in main() local
120 repeats = parse_memsize (argv[3]); in main()
138 n_blocks, block_size, n_blocks * block_size, repeats, in main()
141 touch_mem (block_size, n_blocks, repeats); in main()
|
| /third_party/toybox/toys/posix/ |
| D | uniq.c | 33 long repeats;
53 if (TT.repeats ? FLAG(u) : FLAG(d)) return; in print_line()
54 if (FLAG(c)) fprintf(f, "%7lu ", TT.repeats + 1); in print_line()
90 if (!diff) TT.repeats++; in uniq_main()
94 TT.repeats = 0; in uniq_main()
|
| /third_party/pixman/test/ |
| D | scaling-crash-test.c | 123 static const repeat_info_t repeats[] = variable
140 for (j = 0; j < ARRAY_LENGTH (repeats); ++j) in do_test()
148 repeats[j].value) != 0) in do_test()
151 filters[i].name, repeats[j].name); in do_test()
162 repeats[j].value) != 0) in do_test()
165 filters[i].name, repeats[j].name); in do_test()
|
| /third_party/flutter/skia/third_party/externals/zlib/contrib/bench/ |
| D | zlib_bench.cc | 219 const int repeats = (10 * mega_byte + length) / (length + 1); in zlib_file() local
233 for (int r = 0; r < repeats; ++r) in zlib_file()
248 for (int r = 0; r < repeats; ++r) in zlib_file()
267 double deflate_rate_med = length * repeats / mega_byte / ctime[runs / 2]; in zlib_file()
268 double inflate_rate_med = length * repeats / mega_byte / utime[runs / 2]; in zlib_file()
269 double deflate_rate_max = length * repeats / mega_byte / ctime[0]; in zlib_file()
270 double inflate_rate_max = length * repeats / mega_byte / utime[0]; in zlib_file()
|
| /third_party/boost/libs/algorithm/minmax/example/ |
| D | minmax_timer.cpp | 56 int repeats = 10; variable
60 for (int i=0; i<repeats; ++i) { cmd ; } \
62 << (double)n*repeats/t.elapsed()/1.0E6 \
67 for (int i=0; i<repeats; ++i) { cmd ; } \
69 << (double)n*repeats/t.elapsed()/1.0E6 \
71 << " ("<< (count)/repeats << " vs " << opt << ")\n"
207 if (argc > 2) repeats = atoi(argv[2]); in main()
|
| /third_party/skia/third_party/externals/zlib/contrib/bench/ |
| D | zlib_bench.cc | 234 const int repeats = (10 * mega_byte + length) / (length + 1); in zlib_file() local
248 for (int r = 0; r < repeats; ++r) in zlib_file()
261 for (int r = 0; r < repeats; ++r) in zlib_file()
280 double deflate_rate_med = length * repeats / mega_byte / ctime[runs / 2]; in zlib_file()
281 double inflate_rate_med = length * repeats / mega_byte / utime[runs / 2]; in zlib_file()
282 double deflate_rate_max = length * repeats / mega_byte / ctime[0]; in zlib_file()
283 double inflate_rate_max = length * repeats / mega_byte / utime[0]; in zlib_file()
|
| /third_party/boost/libs/nowide/test/ |
| D | benchmark_fstream.cpp | 204 const int repeats = 5; in test_io_driver() local
205 std::vector<perf_data> results(repeats); in test_io_driver()
207 for(int i = 0; i < repeats; i++) in test_io_driver()
212 for(int i = 0; i < repeats; i++) in test_io_driver()
217 results[0].read[block_size] = read_speed / repeats; in test_io_driver()
218 results[0].write[block_size] = write_speed / repeats; in test_io_driver()
|
| /third_party/ffmpeg/libavcodec/ |
| D | acelp_vectors.c | 240 int x = in->x[i], repeats = !((in->no_repeat_mask >> i) & 1); in ff_set_fixed_vector() local
249 } while (x < size && repeats); in ff_set_fixed_vector()
258 int x = in->x[i], repeats = !((in->no_repeat_mask >> i) & 1); in ff_clear_fixed_vector() local
264 } while (x < size && repeats); in ff_clear_fixed_vector()
|
| /third_party/boost/libs/numeric/ublas/test/ |
| D | test_coordinate_vector_inplace_merge.cpp | 51 for (size_t repeats = 1; repeats < max_repeats; ++repeats ) { in BOOST_UBLAS_TEST_DEF() local
|
| D | test_coordinate_matrix_inplace_merge.cpp | 59 for (size_t repeats = 1; repeats < max_repeats; ++repeats ) { in BOOST_UBLAS_TEST_DEF() local
|
| /third_party/boost/libs/regex/performance/ |
| D | performance.cpp | 79 unsigned repeats = 1; in exec_timed_test() local
83 for(unsigned count = 0; count < repeats; ++count) in exec_timed_test()
91 repeats *= 2; in exec_timed_test()
93 return t / repeats; in exec_timed_test()
|