1985 const int N_threads = 3;  variable
1986 Barrier barrier(N_threads);
1994   CHECK(GLOB == N_threads);  in Worker()
2001     ThreadPool pool(N_threads);  in Run()
2003     for (int i = 0; i < N_threads; i++) {  in Run()
2106 int N_threads = 3;  variable
7394 const int N_threads = 32;  variable
7397 ProducerConsumerQueue *Q[N_threads];
7404    ProducerConsumerQueue &myQ = *Q[myId], &nextQ = *Q[(myId+1) % N_threads];  in Worker()
7413          for (int i = 0; i < N_threads; i++)  in Worker()
7422    for (int i = 0; i < N_threads; i++)  in Run()
7427       ThreadPool pool(N_threads);  in Run()
7429       for (int i = 0; i < N_threads; i++) {  in Run()
7434    for (int i = 0; i < N_threads; i++)  in Run()
7546 const int N_threads = 64,  variable
7562      barrier[i] = new Barrier(N_threads);  in Run()
7565     ThreadPool pool(N_threads);  in Run()
7567     for (int i = 0; i < N_threads; i++) {  in Run()
7571   CHECK(GLOB == N_threads * ITERATIONS);  in Run()