Home
last modified time | relevance | path

Searched refs:n_threads (Results 1 – 9 of 9) sorted by relevance

/llvm-project/compiler-rt/lib/tsan/benchmarks/
H A Dmini_bench_local.cpp27 int n_threads = 0; in main() local
29 n_threads = 4; in main()
32 n_threads = atoi(argv[1]); in main()
33 assert(n_threads > 0 && n_threads <= 32); in main()
37 __FILE__, n_threads, len, kNumIter); in main()
38 a = new int[n_threads * len]; in main()
39 pthread_t *t = new pthread_t[n_threads]; in main()
40 for (int i = 0; i < n_threads; i++) { in main()
43 for (int i = 0; i < n_threads; i++) { in main()
H A Dvts_many_threads_bench.cpp45 int n_threads, n_iterations; variable
62 int offset = idx * kNumMutexes / n_threads; in Thread()
74 n_threads = 2; in main()
78 n_threads = atoi(argv[1]); in main()
79 assert(n_threads > 0 && n_threads <= 32); in main()
88 __FILE__, n_threads, n_garbage_threads, n_iterations); in main()
90 pthread_barrier_init(&all_threads_ready, NULL, n_garbage_threads + n_threads + 1); in main()
91 pthread_barrier_init(&main_threads_ready, NULL, n_threads + 1); in main()
93 pthread_t *t = new pthread_t[n_threads]; in main()
100 for (int i = 0; i < n_threads; i++) { in main()
[all …]
H A Dmini_bench_shared.cpp27 int n_threads = 0; in main() local
29 n_threads = 4; in main()
32 n_threads = atoi(argv[1]); in main()
33 assert(n_threads > 0 && n_threads <= 32); in main()
37 __FILE__, n_threads, len, kNumIter); in main()
41 pthread_t *t = new pthread_t[n_threads]; in main()
42 for (int i = 0; i < n_threads; i++) { in main()
45 for (int i = 0; i < n_threads; i++) { in main()
H A Dstart_many_threads.cpp25 int n_threads; in main() local
27 n_threads = 100; in main()
29 n_threads = atoi(argv[1]); in main()
34 printf("%s: n_threads=%d\n", __FILE__, n_threads); in main()
36 pthread_barrier_init(&all_threads_ready, NULL, n_threads + 1); in main()
38 pthread_t *t = new pthread_t[n_threads]; in main()
39 for (int i = 0; i < n_threads; i++) { in main()
45 for (int i = 0; i < n_threads; i++) { in main()
/llvm-project/compiler-rt/test/asan/TestCases/Posix/
H A Dconcurrent_overflow.cpp21 const int n_threads = 8; in main() local
22 int i, counter = n_threads; in main()
23 pthread_t thread[n_threads]; in main()
25 for (i = 0; i < n_threads; ++i) in main()
27 for (i = 0; i < n_threads; ++i) in main()
/llvm-project/libc/test/src/math/exhaustive/
H A Dexhaustive_test.h148 int n_threads = std::thread::hardware_concurrency(); in test_full_range() local
155 for (int i = 0; i < n_threads; ++i) { in test_full_range()
/llvm-project/compiler-rt/lib/asan/tests/
H A Dasan_noinst_test.cpp182 const int n_threads = 3000; in TEST() local
184 for (int i = 0; i < n_threads; i++) { in TEST()
/llvm-project/third-party/benchmark/src/
H A Dbenchmark.cc161 const std::vector<int64_t>& ranges, int thread_i, int n_threads, in State() argument
174 threads_(n_threads), in State()
/llvm-project/third-party/benchmark/include/benchmark/
H A Dbenchmark.h985 const std::vector<int64_t>& ranges, int thread_i, int n_threads,