Lines Matching full:nlog
1679 const int Nlog = 15;
1680 const int N = 1 << Nlog;
1689 n %= Nlog;
1701 std::vector<MyThread*> vec(Nlog);
1704 // Create and start Nlog threads
1705 for (int i = 0; i < Nlog; i++) {
1708 for (int i = 0; i < Nlog; i++) {
1712 for (int i = 0; i < Nlog; i++) {
1731 const int Nlog = 10;
1732 const int N = 1 << Nlog;
1734 static Mutex *MUs[Nlog];
1739 for (int j = 0; j < Nlog; j++) if (i & (1 << j)) MUs[j]->Lock();
1741 for (int j = 0; j < Nlog; j++) if (i & (1 << j)) MUs[j]->Unlock();
1748 for (int i = 0; i < Nlog; i++) {
1754 for (int i = 0; i < Nlog; i++) {
3455 // Instead of creating Nlog*N_iter threads,
3456 // we create Nlog threads and do N_iter barriers.
3459 const int Nlog = 16;
3460 const int N = 1 << Nlog;
3471 n %= Nlog;
3505 std::vector<MyThread*> vec(Nlog);
3508 barriers[i] = new Barrier(Nlog);
3510 // Create and start Nlog threads
3511 for (int i = 0; i < Nlog; i++) {
3517 for (int i = 0; i < Nlog; i++) {
3539 const int Nlog = 16;
3540 const int N = 1 << Nlog;
3562 n %= Nlog;
3597 std::vector<MyThread*> vec(Nlog);
3600 barriers[i] = new Barrier(Nlog);
3602 // Create and start Nlog threads
3603 for (int i = 0; i < Nlog; i++) {
3609 for (int i = 0; i < Nlog; i++) {
