Lines Matching refs:n_th
4843 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4844 for (f = 1; f < n_th; f++) { in __kmp_partition_places()
4858 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4865 if (n_th <= n_places) { in __kmp_partition_places()
4867 for (f = 1; f < n_th; f++) { in __kmp_partition_places()
4887 S = n_th / n_places; in __kmp_partition_places()
4889 rem = n_th - (S * n_places); in __kmp_partition_places()
4893 for (f = 0; f < n_th; f++) { in __kmp_partition_places()
4938 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4946 if (n_th <= n_places) { in __kmp_partition_places()
4950 int S = n_places / n_th; in __kmp_partition_places()
4954 rem = n_places - n_th * S; in __kmp_partition_places()
4955 gap = rem ? n_th / rem : 1; in __kmp_partition_places()
4957 thidx = n_th; in __kmp_partition_places()
5011 (static_cast<double>(n_places + 1) / static_cast<double>(n_th)); in __kmp_partition_places()
5015 thidx = n_th + 1; in __kmp_partition_places()
5027 KMP_DEBUG_ASSERT(f == n_th); in __kmp_partition_places()
5031 KMP_DEBUG_ASSERT(f == (n_th - 1)); in __kmp_partition_places()
5035 KMP_DEBUG_ASSERT(f == n_th); in __kmp_partition_places()
5045 if (f < n_th) { in __kmp_partition_places()
5066 S = n_th / n_places; in __kmp_partition_places()
5068 rem = n_th - (S * n_places); in __kmp_partition_places()
5072 thidx = n_th; in __kmp_partition_places()