Home
last modified time | relevance | path

Searched refs:iterations (Results 1 - 25 of 292) sorted by relevance

12345678910>>...12

/third_party/lz4/examples/
H A Dcompress_functions.c99 printf("Usage: ./argPerformanceTesting <iterations>\n"); in usage()
112 const int iterations, in bench()
138 for (int i=1; i<=iterations; i++) in bench()
151 for (int i=1; i<=iterations; i++) in bench()
164 for (int i=1; i<=iterations; i++) in bench()
181 // for (int i=1; i<=iterations; i++) { in bench()
197 for (int i=1; i<=iterations; i++) in bench()
210 for (int i=1; i<=iterations; i++) in bench()
237 // Get and verify options. There's really only 1: How many iterations to run. in main()
238 int iterations in main() local
109 bench( const char *known_good_dst, const int function_id, const int iterations, const char *src, char *dst, const size_t src_size, const size_t max_dst_size, const size_t comp_size ) bench() argument
[all...]
/third_party/node/test/fixtures/wpt/WebCryptoAPI/derive_bits_keys/
H A Dpbkdf2.js27 // and number of iterations. The derivations object is structured in
32 Object.keys(derivations[passwordSize][saltSize][hashName]).forEach(function(iterations) {
33 var testName = passwordSize + " password, " + saltSize + " salt, " + hashName + ", with " + iterations + " iterations";
37 return subtle.deriveBits({name: "PBKDF2", salt: salts[saltSize], hash: hashName, iterations: parseInt(iterations)}, baseKeys[passwordSize], 256)
39 assert_true(equalBuffers(derivation, derivations[passwordSize][saltSize][hashName][iterations]), "Derived correct key");
52 testName += " using " + passwordSize + " password, " + saltSize + " salt, " + hashName + ", with " + iterations + " iterations";
56 return subtle.deriveKey({name: "PBKDF2", salt: salts[saltSize], hash: hashName, iterations
[all...]
/third_party/musl/Benchmark/musl/
H A Dlibc_stdio.cpp282 state.SetBytesProcessed(state.iterations()); in Bm_function_Fdopen()
296 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_str()
309 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_int()
322 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_float()
335 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_longdouble()
348 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_unsigned()
361 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_long()
374 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_short()
387 state.SetBytesProcessed(state.iterations()); in Bm_function_Vfprintf_char()
401 state.SetBytesProcessed(state.iterations()); in Bm_function_Fprintf_str()
[all...]
H A Dlibc_ctype.cpp34 state.SetItemsProcessed(state.iterations()); in Bm_function_Tolower_a()
43 state.SetItemsProcessed(state.iterations()); in Bm_function_Tolower_A()
53 state.SetItemsProcessed(state.iterations()); in Bm_function_Tolower_all_ascii()
61 state.SetItemsProcessed(state.iterations()); in Bm_function_Isspace_space()
71 state.SetItemsProcessed(state.iterations()); in Bm_function_Isspace_all_ascii()
79 state.SetItemsProcessed(state.iterations()); in Bm_function_Isalnum_a()
87 state.SetItemsProcessed(state.iterations()); in Bm_function_Isalnum_A()
95 state.SetItemsProcessed(state.iterations()); in Bm_function_Isalnum_0()
105 state.SetItemsProcessed(state.iterations()); in Bm_function_Isalnum_all_ascii()
147 state.SetItemsProcessed(state.iterations()); in Bm_function_Towupper_a()
[all...]
H A Dlibc_errno.cpp30 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_noerror()
39 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_enoent()
48 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_enomem()
57 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_eacces()
66 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_eexist()
75 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_einval()
84 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_erofs()
93 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_etimeout()
103 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_r_noerror()
112 state.SetItemsProcessed(state.iterations()); in Bm_function_Strerror_r_enoent()
[all...]
H A Dlibc_fcntl.cpp43 state.SetItemsProcessed(state.iterations()); in Bm_function_Fcntl_getfl()
67 state.SetItemsProcessed(state.iterations()); in Bm_function_Fcntl_setfl()
95 state.SetItemsProcessed(state.iterations()); in Bm_function_Fcntl_setlkw()
115 state.SetItemsProcessed(state.iterations()); in Bm_function_Fcntl_dupfd()
143 state.SetBytesProcessed(state.iterations()); in Bm_function_Fcntl_setlk()
167 state.SetBytesProcessed(state.iterations()); in Bm_function_Fcntl_getlk()
184 state.SetBytesProcessed(state.iterations()); in Bm_function_Fcntl_getfd()
215 state.SetBytesProcessed(state.iterations()); in Bm_function_Fcntl_setfd()
231 state.SetItemsProcessed(state.iterations()); in Bm_function_Open_rdonly()
247 state.SetItemsProcessed(state.iterations()); in Bm_function_Open_rdwr()
[all...]
H A Dlibc_locale.cpp46 state.SetBytesProcessed(state.iterations()); in Bm_function_Setlocale_All()
54 state.SetBytesProcessed(state.iterations()); in Bm_function_Setlocale_All1()
62 state.SetBytesProcessed(state.iterations()); in Bm_function_Setlocale_All2()
70 state.SetBytesProcessed(state.iterations()); in Bm_function_Setlocale_Collate()
78 state.SetBytesProcessed(state.iterations()); in Bm_function_Setlocale_Ctype()
86 state.SetBytesProcessed(state.iterations()); in Bm_function_Setlocale_Time()
111 state.SetBytesProcessed(state.iterations()); in Bm_function_Uselocale()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/util/
H A DTimer.java24 private int iterations; field in Timer
50 return iterations; in getIterations()
76 public String toString(long iterations) { in toString() argument
77 return nf.format(getDuration()/iterations) + "\tns"; in toString()
80 public String toString(long iterations, long other) { in toString() argument
81 return nf.format(getDuration()/iterations) + "\tns\t" + pf.format((double)getDuration()/other - 1D) + ""; in toString()
99 // The current strategy is to warm up once, then time it until we reach the timingPeriod (eg 5 seconds), increasing the iterations each time in timeIterations()
100 // At first, we double the iterations. in timeIterations()
108 iterations = 1; in timeIterations()
113 loop.time(iterations); in timeIterations()
[all...]
/third_party/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/
H A DTimer.java21 private int iterations; field in Timer
47 return iterations; in getIterations()
73 public String toString(long iterations) { in toString() argument
74 return nf.format(getDuration()/iterations) + "\tns"; in toString()
77 public String toString(long iterations, long other) { in toString() argument
78 return nf.format(getDuration()/iterations) + "\tns\t" + pf.format((double)getDuration()/other - 1D) + ""; in toString()
96 // The current strategy is to warm up once, then time it until we reach the timingPeriod (eg 5 seconds), increasing the iterations each time in timeIterations()
97 // At first, we double the iterations. in timeIterations()
105 iterations = 1; in timeIterations()
110 loop.time(iterations); in timeIterations()
[all...]
/third_party/node/lib/internal/crypto/
H A Dpbkdf2.js33 function pbkdf2(password, salt, iterations, keylen, digest, callback) {
39 ({ password, salt, iterations, keylen, digest } =
40 check(password, salt, iterations, keylen, digest));
48 iterations,
65 function pbkdf2Sync(password, salt, iterations, keylen, digest) {
66 ({ password, salt, iterations, keylen, digest } =
67 check(password, salt, iterations, keylen, digest));
73 iterations,
86 function check(password, salt, iterations, keylen, digest) {
93 validateInt32(iterations, 'iteration
[all...]
/third_party/node/test/pummel/
H A Dtest-webcrypto-derivebits-pbkdf2.js418 iterations) {
423 iterations,
431 kDerivations[size][saltSize][hash][iterations]);
439 iterations) {
443 iterations,
475 iterations) {
477 const algorithm = { name: 'PBKDF2', salt, iterations };
507 iterations) {
511 iterations,
527 iterations,
[all...]
/third_party/vixl/benchmarks/aarch32/
H A Dbench-branch-link-masm.cc45 void benchmark(int iterations, InstructionSet isa) { in benchmark() argument
56 for (int i = 0; i < iterations; i++) { in benchmark()
60 for (int i = 0; i < iterations; i++) { in benchmark()
64 for (int i = 0; i < iterations; i++) { in benchmark()
68 for (int i = 0; i < iterations; i++) { in benchmark()
78 printf("%s: time for %d iterations: %gs\n", in benchmark()
80 iterations, in benchmark()
86 int iterations = 0; in main() local
90 iterations = kDefaultIterationsCount; in main()
93 iterations in main()
[all...]
H A Dbench-literal.cc45 void benchmark(int iterations, int literals, InstructionSet isa) { in benchmark() argument
55 // Load a number of distinct literals, for a number of iterations, forcing in benchmark()
57 for (int i = 0; i < iterations; i++) { in benchmark()
68 printf("%s: time for %d iterations: %gs\n", in benchmark()
70 iterations, in benchmark()
76 int iterations = 0; in main() local
81 iterations = kDefaultIterationCount; in main()
85 iterations = atoi(argv[1]); in main()
89 iterations = atoi(argv[1]); in main()
93 printf("Usage: %s [#iterations] [#literal in main()
[all...]
H A Dbench-branch-masm.cc44 void benchmark(int iterations, InstructionSet isa) { in benchmark() argument
54 for (int i = 0; i < iterations; i++) { in benchmark()
68 printf("%s: time for %d iterations: %gs\n", in benchmark()
70 iterations, in benchmark()
76 int iterations = 0; in main() local
80 iterations = kDefaultIterationCount; in main()
83 iterations = atoi(argv[1]); in main()
86 printf("Usage: %s [#iterations]\n", argv[0]); in main()
91 benchmark(iterations, A32); in main()
94 benchmark(iterations, T3 in main()
[all...]
/third_party/ltp/testcases/realtime/func/sched_latency/
H A Dsched_latency.c69 static int iterations = 0; variable
86 printf(" -iITERATIONS number of iterations (default %d)\n", in usage()
102 iterations = atoi(v); in parse_args()
140 for (i = 0; i < iterations; i++) { in periodic_thread()
205 if (i != iterations) { in periodic_thread()
259 if (iterations == 0) in main()
260 iterations = DEFAULT_ITERATIONS; in main()
261 if (iterations < MIN_ITERATIONS) { in main()
263 ("Too few iterations (%d), use min iteration instead (%d)\n", in main()
264 iterations, MIN_ITERATION in main()
[all...]
/third_party/ltp/testcases/realtime/func/gtod_latency/
H A Dgtod_latency.c89 static unsigned int iterations = ITERATIONS; variable
96 " -[lt|latency-trace] -[i|iterations]}" " -[help] \n"); in stats_cmdline_help()
203 if (!strcmp(flag, "i") || !strcmp(flag, "iterations")) { in stats_cmdline()
208 iterations = strtoull(argv[++i], NULL, 0); in stats_cmdline()
245 if (iterations < MIN_ITERATION) { in main()
246 iterations = MIN_ITERATION; in main()
247 printf("user \"iterations\" value is too small (use: %d)\n", in main()
248 iterations); in main()
251 stats_container_init(&dat, iterations); in main()
253 stats_quantiles_init(&quantiles, (int)log10(iterations)); in main()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dmemutil_benchmark.cc102 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_Memmem()
111 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_MemmemMedium()
121 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_MemmemPathological()
130 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_Memcasemem()
139 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_MemcasememMedium()
149 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_MemcasememPathological()
163 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_Search()
173 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_SearchMedium()
183 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_SearchPathological()
193 state.SetBytesProcessed(kHaystackSize64 * state.iterations()); in BM_Searchcase()
[all...]
/third_party/ltp/testcases/realtime/func/periodic_cpu_load/
H A Dperiodic_cpu_load.c71 static int iterations = ITERATIONS; variable
79 (" -iITERATIONS number of iterations to calculate the average over\n"); in usage()
88 iterations = atoi(v); in parse_args()
102 int iterations; member
133 while (i < parg->iterations) { in periodic_thread()
173 if (iterations < 100) { in main()
182 printf("Running %d iterations per thread\n", iterations); in main()
198 stats_container_init(&dat[i], iterations); in main()
199 stats_quantiles_init(&quantiles[i], (int)log10(iterations)); in main()
[all...]
H A Dperiodic_cpu_load_single.c59 static int iterations = DEFAULT_ITERATIONS; variable
68 (" -iITERATIONS number of iterations to calculate the average over\n"); in usage()
86 int periodic_thread(nsec_t period, int iterations, int loops) in periodic_thread() argument
100 stats_container_init(&dat, iterations); in periodic_thread()
102 stats_quantiles_init(&quantiles, (int)log10(iterations)); in periodic_thread()
115 while (i < iterations) { in periodic_thread()
180 iterations = atoi(v); in parse_args()
204 if (iterations < 100) { in main()
205 printf("Number of iterations cannot be less than 100\n"); in main()
219 printf("Running %d iterations\ in main()
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/util/
H A DTestUtilities.java33 int iterations = 1000; in TestCollectionUtilitySpeed()
44 timeAndCompare(ts1, ts2, iterations, true, .75); in TestCollectionUtilitySpeed()
47 timeAndCompare(ts1, ts2, iterations, true, .75); in TestCollectionUtilitySpeed()
48 timeAndCompare(ts2, ts1, iterations*100, false, 1.05); in TestCollectionUtilitySpeed()
51 private void timeAndCompare(TreeSet ts1, TreeSet ts2, int iterations, boolean expected, double factorOfStandard) { in timeAndCompare() argument
52 double utilityTimeSorted = timeUtilityContainsAll(iterations, ts1, ts2, expected)/(double)iterations; in timeAndCompare()
53 double standardTimeSorted = timeStandardContainsAll(iterations, ts1, ts2, expected)/(double)iterations; in timeAndCompare()
62 private long timeStandardContainsAll(int iterations, Se argument
81 timeUtilityContainsAll(int iterations, Set hs1, Set hs2, boolean expected) timeUtilityContainsAll() argument
[all...]
/third_party/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/
H A DTestUtilities.java30 int iterations = 1000; in TestCollectionUtilitySpeed()
41 timeAndCompare(ts1, ts2, iterations, true, .75); in TestCollectionUtilitySpeed()
44 timeAndCompare(ts1, ts2, iterations, true, .75); in TestCollectionUtilitySpeed()
45 timeAndCompare(ts2, ts1, iterations*100, false, 1.05); in TestCollectionUtilitySpeed()
48 private void timeAndCompare(TreeSet ts1, TreeSet ts2, int iterations, boolean expected, double factorOfStandard) { in timeAndCompare() argument
49 double utilityTimeSorted = timeUtilityContainsAll(iterations, ts1, ts2, expected)/(double)iterations; in timeAndCompare()
50 double standardTimeSorted = timeStandardContainsAll(iterations, ts1, ts2, expected)/(double)iterations; in timeAndCompare()
59 private long timeStandardContainsAll(int iterations, Se argument
78 timeUtilityContainsAll(int iterations, Set hs1, Set hs2, boolean expected) timeUtilityContainsAll() argument
[all...]
/third_party/benchmark/test/
H A Duser_counters_test.cc29 state.counters["bar"] = 2 * static_cast<double>(state.iterations()); in BM_Counters_Simple()
42 {"\"iterations\": %int,$", MR_Next},
70 auto iterations = state.iterations(); in BM_Counters_WithBytesAndItemsPSec() local
71 benchmark::DoNotOptimize(iterations); in BM_Counters_WithBytesAndItemsPSec()
91 {"\"iterations\": %int,$", MR_Next},
122 auto iterations = state.iterations(); in BM_Counters_Rate() local
123 benchmark::DoNotOptimize(iterations); in BM_Counters_Rate()
141 {"\"iterations\"
166 auto iterations = state.iterations(); BM_Invert() local
207 auto iterations = state.iterations(); BM_Counters_InvertedRate() local
336 auto iterations = state.iterations(); BM_Counters_AvgThreadsRate() local
424 auto iterations = state.iterations(); BM_Counters_kIsIterationInvariantRate() local
516 auto iterations = state.iterations(); BM_Counters_kAvgIterationsRate() local
[all...]
/third_party/icu/icu4c/source/test/perf/normperf/
H A Dsimplenormperf.cpp189 virtual double call(int32_t iterations, int32_t pieceLength) = 0;
203 // Increase the number of iterations until we use at least one second. in measure()
204 int32_t iterations = 1; in measure() local
206 double seconds = op.call(iterations, pieceLength); in measure()
208 if (iterations > 1) { in measure()
209 return seconds / (iterations * pieceLength); in measure()
212 return op.call(1, pieceLength) / (iterations * pieceLength); in measure()
216 iterations *= 10; in measure()
218 iterations *= 1.1 / seconds; in measure()
220 iterations * in measure()
251 call(int32_t iterations, int32_t pieceLength) call() argument
288 call(int32_t iterations, int32_t pieceLength) call() argument
[all...]
/third_party/ltp/testcases/realtime/func/matrix_mult/
H A Dmatrix_mult.c43 static int iterations = ITERATIONS; variable
62 printf(" -i# #: number of iterations\n"); in usage()
70 iterations = atoi(v); in parse_args()
184 if (stats_container_init(&sdat, iterations) || in main_thread()
186 stats_container_init(&cdat, iterations) || in main_thread()
207 curdat->index = iterations - 1; in main_thread()
210 for (i = 0; i < iterations; i++) in main_thread()
215 savg = delta / iterations; /* don't use the stats record, use the total time recorded */ in main_thread()
239 curdat->index = iterations - 1; in main_thread()
260 cavg = delta / iterations; /* do in main_thread()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/
H A Dmutex_test.cc68 int iterations; member
94 for (int i = 0; i != cxt->iterations; i++) { in TestMu()
103 for (int i = 0; i != cxt->iterations; i++) { in TestTry()
115 for (int i = 0; i != cxt->iterations; i++) { in TestR20ms()
124 for (int i = 0; i != cxt->iterations; i++) { in TestRW()
132 for (int i = 0; i != cxt->iterations; i++) { in TestRW()
148 return cxt->g0 == this->target || cxt->g0 == cxt->iterations; in MyTurn()
157 while (cxt->g0 < cxt->iterations) { in TestAwait()
161 if (cxt->g0 < cxt->iterations) { in TestAwait()
173 while (cxt->g0 < cxt->iterations) { in TestSignalAll()
356 RunTestCommon(TestContext *cxt, void (*test)(TestContext *cxt, int), int threads, int iterations, int operations) RunTestCommon() argument
381 RunTest(void (*test)(TestContext *cxt, int), int threads, int iterations, int operations) RunTest() argument
392 RunTestWithInvariantDebugging(void (*test)(TestContext *cxt, int), int threads, int iterations, int operations, void (*invariant)(void *)) RunTestWithInvariantDebugging() argument
1616 int iterations = ScaleIterations(10000000) / threads; global() local
1630 int iterations = 1000000 / threads; global() local
1644 int iterations = 100; global() local
1651 int iterations = ScaleIterations(20000000) / threads; global() local
1665 int iterations = ScaleIterations(500000); global() local
1672 int iterations = 200000 / threads; global() local
1680 int iterations = 200000; global() local
1687 int iterations = 1000; global() local
1695 int iterations = 1; global() local
1697 threads * iterations); global() local
1702 int iterations = 1; global() local
1703 EXPECT_EQ(RunTest(&TestMuTime, threads, iterations, 1), threads * iterations); global() local
[all...]

Completed in 13 milliseconds

12345678910>>...12