Lines Matching refs:n_th
4752 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4753 for (f = 1; f < n_th; f++) { in __kmp_partition_places()
4773 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4780 if (n_th <= n_places) { in __kmp_partition_places()
4782 for (f = 1; f < n_th; f++) { in __kmp_partition_places()
4808 S = n_th / n_places; in __kmp_partition_places()
4810 rem = n_th - (S * n_places); in __kmp_partition_places()
4814 for (f = 0; f < n_th; f++) { in __kmp_partition_places()
4865 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4873 if (n_th <= n_places) { in __kmp_partition_places()
4877 int S = n_places / n_th; in __kmp_partition_places()
4881 rem = n_places - n_th * S; in __kmp_partition_places()
4882 gap = rem ? n_th / rem : 1; in __kmp_partition_places()
4884 thidx = n_th; in __kmp_partition_places()
4943 (static_cast<double>(n_places + 1) / static_cast<double>(n_th)); in __kmp_partition_places()
4947 thidx = n_th + 1; in __kmp_partition_places()
4959 KMP_DEBUG_ASSERT(f == n_th); in __kmp_partition_places()
4963 KMP_DEBUG_ASSERT(f == (n_th - 1)); in __kmp_partition_places()
4967 KMP_DEBUG_ASSERT(f == n_th); in __kmp_partition_places()
4977 if (f < n_th) { in __kmp_partition_places()
5004 S = n_th / n_places; in __kmp_partition_places()
5006 rem = n_th - (S * n_places); in __kmp_partition_places()
5010 thidx = n_th; in __kmp_partition_places()