Lines Matching defs:n_threads
1985 const int N_threads = 3;
1986 Barrier barrier(N_threads);
1994 CHECK(GLOB == N_threads);
2001 ThreadPool pool(N_threads);
2003 for (int i = 0; i < N_threads; i++) {
2106 int N_threads = 3;
5978 const int n_threads = 3;
5980 int GLOB[n_threads];
5995 for (int i = 0; i < n_threads; i++) {
7394 const int N_threads = 32;
7397 ProducerConsumerQueue *Q[N_threads];
7404 ProducerConsumerQueue &myQ = *Q[myId], &nextQ = *Q[(myId+1) % N_threads];
7413 for (int i = 0; i < N_threads; i++)
7422 for (int i = 0; i < N_threads; i++)
7427 ThreadPool pool(N_threads);
7429 for (int i = 0; i < N_threads; i++) {
7434 for (int i = 0; i < N_threads; i++)
7445 const int N_THREADS = 2,
7468 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS,
7469 upper_bound = ARRAY_SIZE * ( myId ) / N_THREADS;
7492 const int N_THREADS = 2,
7513 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS,
7514 upper_bound = ARRAY_SIZE * ( myId ) / N_THREADS;
7546 const int N_threads = 64,
7562 barrier[i] = new Barrier(N_threads);
7565 ThreadPool pool(N_threads);
7567 for (int i = 0; i < N_threads; i++) {
7571 CHECK(GLOB == N_threads * ITERATIONS);
7583 const int N_THREADS = 1,
7609 ThreadPool pool(N_THREADS);
7611 for (int i = 0; i < N_THREADS; i++) {
7622 const int N_THREADS = 1,
7648 ThreadPool pool(N_THREADS);
7650 for (int i = 0; i < N_THREADS; i++) {
7661 const int N_THREADS = 16,
7681 ThreadPool pool(N_THREADS);
7683 for (int i = 0; i < N_THREADS; i++) {
7694 const int N_THREADS = 16,
7711 ThreadPool pool(N_THREADS);
7713 for (int i = 0; i < N_THREADS; i++) {
7761 const int N_THREADS = 2,
7769 int array[N_THREADS][ARRAY_SIZE];
7773 Mutex mutex_arr[N_THREADS][MUTEX_ID_BITS];
7800 ThreadPool pool(N_THREADS);
7802 for (int i = 0; i < N_THREADS; i++) {
