1981 const int N_threads = 3;  variable
1982 Barrier barrier(N_threads);
1990   CHECK(GLOB == N_threads);  in Worker()
1997     ThreadPool pool(N_threads);  in Run()
1999     for (int i = 0; i < N_threads; i++) {  in Run()
2102 int N_threads = 3;  variable
7390 const int N_threads = 32;  variable
7393 ProducerConsumerQueue *Q[N_threads];
7400    ProducerConsumerQueue &myQ = *Q[myId], &nextQ = *Q[(myId+1) % N_threads];  in Worker()
7409          for (int i = 0; i < N_threads; i++)  in Worker()
7418    for (int i = 0; i < N_threads; i++)  in Run()
7423       ThreadPool pool(N_threads);  in Run()
7425       for (int i = 0; i < N_threads; i++) {  in Run()
7430    for (int i = 0; i < N_threads; i++)  in Run()
7542 const int N_threads = 64,  variable
7558      barrier[i] = new Barrier(N_threads);  in Run()
7561     ThreadPool pool(N_threads);  in Run()
7563     for (int i = 0; i < N_threads; i++) {  in Run()
7567   CHECK(GLOB == N_threads * ITERATIONS);  in Run()