Home
last modified time | relevance | path

Searched refs:ITERS (Results 1 – 8 of 8) sorted by relevance

/external/llvm-project/openmp/runtime/test/worksharing/for/
Domp_nonmonotonic_dynamic1.c10 #define ITERS 100 macro
15 int i, ch, it[ITERS]; in main()
18 for (i = 0; i < ITERS; ++i) { in main()
22 for (ch = 0; ch < ITERS/CHUNK; ++ch) { in main()
/external/llvm-project/openmp/runtime/test/tasking/
Domp_taskloop_taskwait.c6 enum {ITERS = 500}; in main() enumerator
14 for(i=0; i<ITERS; i++) { in main()
20 if (r != ITERS) in main()
/external/rust/crates/crossbeam-epoch/src/sync/
Dlist.rs397 const ITERS: usize = 512; constant
414 let mut v = Vec::with_capacity(ITERS); in insert_delete_multi()
416 for _ in 0..ITERS { in insert_delete_multi()
456 let mut v = Vec::with_capacity(ITERS); in iter_multi()
458 for _ in 0..ITERS { in iter_multi()
467 for _ in 0..ITERS { in iter_multi()
/external/arm-optimized-routines/string/bench/
Dstrlen.c16 #define ITERS 2000 macro
146 strlen_size *= ITERS; in main()
150 for (int i = 0; i < ITERS; i++) in main()
Dmemcpy.c16 #define ITERS 5000 macro
173 size_t copy_size = init_copies (size) * ITERS; in main()
179 for (int i = 0; i < ITERS; i++) in main()
/external/guava/android/guava-tests/test/com/google/common/hash/
DHashingTest.java189 for (int i = 0; i < ITERS; i++) { in testConsistentHash_probabilities()
194 assertTrue(map.get(shard) <= 1.2 * ITERS / shard + 20); in testConsistentHash_probabilities()
209 private static final int ITERS = 10000; field in HashingTest
/external/guava/guava-tests/test/com/google/common/hash/
DHashingTest.java189 for (int i = 0; i < ITERS; i++) { in testConsistentHash_probabilities()
194 assertTrue(map.get(shard) <= 1.2 * ITERS / shard + 20); in testConsistentHash_probabilities()
209 private static final int ITERS = 10000; field in HashingTest
/external/rust/crates/bytes/tests/
Dtest_bytes.rs620 const ITERS: usize = if cfg!(miri) { 100 } else { 1_000 }; in stress() constant
622 for i in 0..ITERS { in stress()