Searched refs:n_threads (Results 1 - 16 of 16) sorted by relevance

/external/compiler-rt/lib/tsan/benchmarks/
H A Dstart_many_threads.cc25 int n_threads; local
27 n_threads = 100;
29 n_threads = atoi(argv[1]);
31 printf("Usage: %s n_threads\n", argv[0]);
34 printf("%s: n_threads=%d\n", __FILE__, n_threads);
36 pthread_barrier_init(&all_threads_ready, NULL, n_threads + 1);
38 pthread_t *t = new pthread_t[n_threads];
39 for (int i = 0; i < n_threads; i++) {
45 for (int i = 0; i < n_threads;
[all...]
H A Dmini_bench_local.cc27 int n_threads = 0; local
29 n_threads = 4;
32 n_threads = atoi(argv[1]);
33 assert(n_threads > 0 && n_threads <= 32);
36 printf("%s: n_threads=%d len=%d iter=%d\n",
37 __FILE__, n_threads, len, kNumIter);
38 a = new int[n_threads * len];
39 pthread_t *t = new pthread_t[n_threads];
40 for (int i = 0; i < n_threads;
[all...]
H A Dvts_many_threads_bench.cc45 int n_threads, n_iterations; variable
62 int offset = idx * kNumMutexes / n_threads;
74 n_threads = 2;
78 n_threads = atoi(argv[1]);
79 assert(n_threads > 0 && n_threads <= 32);
84 printf("Usage: %s n_threads n_garbage_threads n_iterations\n", argv[0]);
87 printf("%s: n_threads=%d n_garbage_threads=%d n_iterations=%d\n",
88 __FILE__, n_threads, n_garbage_threads, n_iterations);
90 pthread_barrier_init(&all_threads_ready, NULL, n_garbage_threads + n_threads
[all...]
H A Dmini_bench_shared.cc27 int n_threads = 0; local
29 n_threads = 4;
32 n_threads = atoi(argv[1]);
33 assert(n_threads > 0 && n_threads <= 32);
36 printf("%s: n_threads=%d len=%d iter=%d\n",
37 __FILE__, n_threads, len, kNumIter);
41 pthread_t *t = new pthread_t[n_threads];
42 for (int i = 0; i < n_threads; i++) {
45 for (int i = 0; i < n_threads;
[all...]
/external/valgrind/drd/tests/
H A Dpth_spinlock.c37 const int n_threads = 10; local
38 pthread_t tid[n_threads];
43 pthread_barrier_init(&s_barrier, 0, n_threads);
45 for (i = 0; i < n_threads; i++)
47 for (i = 0; i < n_threads; i++)
51 if (s_counter == n_threads * s_iterations)
55 s_counter, n_threads * s_iterations);
H A Datomic_var.c55 const int n_threads = 2; local
56 pthread_t tid[n_threads];
61 for (i = 0; i < n_threads; i++)
H A Dtsan_thread_wrappers_pthread.h503 //! Create n_threads threads, but do not start.
504 explicit ThreadPool(int n_threads) argument
506 for (int i = 0; i < n_threads; i++) {
556 explicit Barrier(int n_threads) {CHECK(0 == pthread_barrier_init(&b_, 0, n_threads));} argument
H A Dtsan_unittest.cpp5978 const int n_threads = 3; member in namespace:test125
5980 int GLOB[n_threads];
5995 for (int i = 0; i < n_threads; i++) {
/external/libunwind/src/coredump/
H A D_UCD_create.c216 unsigned n_threads; local
229 n_threads = 0;
234 n_threads++;
239 ui->n_threads = n_threads;
240 ui->threads = malloc(sizeof (void *) * n_threads);
242 n_threads = 0;
247 ui->threads[n_threads++] = NOTE_DATA (note_hdr);
271 if (ui->n_threads == 0)
288 return ui->n_threads;
[all...]
H A D_UCD_internal.h94 int n_threads; member in struct:UCD_info
/external/libevent/
H A Devent_iocp.c105 h = CreateIoCompletionPort((HANDLE)fd, port->port, key, port->n_threads);
188 port->n_threads = n_cpus * 2;
189 port->threads = mm_calloc(port->n_threads, sizeof(HANDLE));
203 for (i=0; i<port->n_threads; ++i) {
239 for (i=0; i<port->n_threads; ++i) {
H A Diocp-internal.h81 short n_threads; member in struct:event_iocp_port
/external/compiler-rt/lib/asan/tests/
H A Dasan_noinst_test.cc172 const int n_threads = 3000; local
174 for (int i = 0; i < n_threads; i++) {
/external/google-benchmark/include/benchmark/
H A Dbenchmark_api.h224 State(size_t max_iters, bool has_x, int x, bool has_y, int y, int thread_i, int n_threads);
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl.cc137 uptr n_threads; local
139 ctx->thread_registry->GetNumberOfThreads(&n_threads, &n_running_threads);
141 WriteMemoryProfile(buf.data(), buf.size(), n_threads, n_running_threads);
/external/google-benchmark/src/
H A Dbenchmark.cc739 int thread_i, int n_threads)
745 threads(n_threads),
738 State(size_t max_iters, bool has_x, int x, bool has_y, int y, int thread_i, int n_threads) argument

Completed in 1355 milliseconds