4608     int n_places;  in __kmp_partition_places()  local
4610       n_places = last_place - first_place + 1;  in __kmp_partition_places()
4612       n_places = __kmp_affinity_num_masks - first_place + last_place + 1;  in __kmp_partition_places()
4614     if (n_th <= n_places) {  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()
4645       gap = rem > 0 ? n_places / rem : n_places;  in __kmp_partition_places()
4700     int n_places;  in __kmp_partition_places()  local
4703       n_places = last_place - first_place + 1;  in __kmp_partition_places()
4705       n_places = __kmp_affinity_num_masks - first_place + last_place + 1;  in __kmp_partition_places()
4707     if (n_th <= n_places) {  in __kmp_partition_places()
4710       if (n_places != static_cast<int>(__kmp_affinity_num_masks)) {  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()
4777             (static_cast<double>(n_places + 1) / static_cast<double>(n_th));  in __kmp_partition_places()
4788           if (first >= n_places) {  in __kmp_partition_places()
4790               first -= n_places;  in __kmp_partition_places()
4791               last -= n_places;  in __kmp_partition_places()
4806           if (last >= n_places) {  in __kmp_partition_places()
4807             last = (n_places - 1);  in __kmp_partition_places()
4813             KMP_DEBUG_ASSERT(n_places > first);  in __kmp_partition_places()
4815             KMP_DEBUG_ASSERT(n_places > last);  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()
4841       gap = rem > 0 ? n_places / rem : n_places;  in __kmp_partition_places()