Lines Matching refs:num_threads
1115 int num_threads = omp_get_num_threads();
1118 __gnu_parallel::_Settings::get().merge_oversampling * num_threads;
1140 for (int slab = 0; slab < num_threads; ++slab)
1150 samples[num_samples * k * slab / num_threads],
1156 if ((slab + 1) < num_threads)
1162 num_threads], comp)
1196 const int num_threads = omp_get_num_threads();
1200 new std::vector<RandomAccessIterator1>[num_threads];
1208 new difference_type[num_threads + 1];
1209 equally_split(length, num_threads, borders);
1211 for (int s = 0; s < (num_threads - 1); ++s)
1221 offsets[num_threads - 1].resize(k);
1224 offsets[num_threads - 1].begin(), comp);
1229 for (int slab = 0; slab < num_threads; ++slab)
1243 if (!tight || slab < (num_threads - 1))
1248 // slab == num_threads - 1
1292 thread_index_t num_threads)
1335 num_threads = static_cast<thread_index_t>
1336 (std::min<difference_type>(num_threads, total_length));
1338 # pragma omp parallel num_threads (num_threads)
1342 num_threads = omp_get_num_threads();
1345 std::pair<difference_type, difference_type> >[num_threads];
1346 for (int s = 0; s < num_threads; ++s)
1351 num_threads;
1392 (*raii).first += pieces[num_threads - 1][k++].second;
