Lines Matching refs:n_threads
1981 const int N_threads = 3;
1982 Barrier barrier(N_threads);
1990 CHECK(GLOB == N_threads);
1997 ThreadPool pool(N_threads);
1999 for (int i = 0; i < N_threads; i++) {
2102 int N_threads = 3;
5974 const int n_threads = 3;
5976 int GLOB[n_threads];
5991 for (int i = 0; i < n_threads; i++) {
7390 const int N_threads = 32;
7393 ProducerConsumerQueue *Q[N_threads];
7400 ProducerConsumerQueue &myQ = *Q[myId], &nextQ = *Q[(myId+1) % N_threads];
7409 for (int i = 0; i < N_threads; i++)
7418 for (int i = 0; i < N_threads; i++)
7423 ThreadPool pool(N_threads);
7425 for (int i = 0; i < N_threads; i++) {
7430 for (int i = 0; i < N_threads; i++)
7441 const int N_THREADS = 2,
7464 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS,
7465 upper_bound = ARRAY_SIZE * ( myId ) / N_THREADS;
7488 const int N_THREADS = 2,
7509 int lower_bound = ARRAY_SIZE * (myId-1) / N_THREADS,
7510 upper_bound = ARRAY_SIZE * ( myId ) / N_THREADS;
7542 const int N_threads = 64,
7558 barrier[i] = new Barrier(N_threads);
7561 ThreadPool pool(N_threads);
7563 for (int i = 0; i < N_threads; i++) {
7567 CHECK(GLOB == N_threads * ITERATIONS);
7579 const int N_THREADS = 1,
7605 ThreadPool pool(N_THREADS);
7607 for (int i = 0; i < N_THREADS; i++) {
7618 const int N_THREADS = 1,
7644 ThreadPool pool(N_THREADS);
7646 for (int i = 0; i < N_THREADS; i++) {
7657 const int N_THREADS = 16,
7677 ThreadPool pool(N_THREADS);
7679 for (int i = 0; i < N_THREADS; i++) {
7690 const int N_THREADS = 16,
7707 ThreadPool pool(N_THREADS);
7709 for (int i = 0; i < N_THREADS; i++) {
7757 const int N_THREADS = 2,
7765 int array[N_THREADS][ARRAY_SIZE];
7769 Mutex mutex_arr[N_THREADS][MUTEX_ID_BITS];
7796 ThreadPool pool(N_THREADS);
7798 for (int i = 0; i < N_THREADS; i++) {
