Lines Matching refs:n_th
4586 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4587 for (f = 1; f < n_th; f++) { in __kmp_partition_places()
4607 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4614 if (n_th <= n_places) { in __kmp_partition_places()
4616 for (f = 1; f < n_th; f++) { in __kmp_partition_places()
4642 S = n_th / n_places; in __kmp_partition_places()
4644 rem = n_th - (S * n_places); in __kmp_partition_places()
4648 for (f = 0; f < n_th; f++) { in __kmp_partition_places()
4699 int n_th = team->t.t_nproc; in __kmp_partition_places() local
4707 if (n_th <= n_places) { in __kmp_partition_places()
4711 int S = n_places / n_th; in __kmp_partition_places()
4715 rem = n_places - n_th * S; in __kmp_partition_places()
4716 gap = rem ? n_th / rem : 1; in __kmp_partition_places()
4718 thidx = n_th; in __kmp_partition_places()
4777 (static_cast<double>(n_places + 1) / static_cast<double>(n_th)); in __kmp_partition_places()
4781 thidx = n_th + 1; in __kmp_partition_places()
4793 KMP_DEBUG_ASSERT(f == n_th); in __kmp_partition_places()
4797 KMP_DEBUG_ASSERT(f == (n_th - 1)); in __kmp_partition_places()
4801 KMP_DEBUG_ASSERT(f == n_th); in __kmp_partition_places()
4811 if (f < n_th) { in __kmp_partition_places()
4838 S = n_th / n_places; in __kmp_partition_places()
4840 rem = n_th - (S * n_places); in __kmp_partition_places()
4844 thidx = n_th; in __kmp_partition_places()