4543     int n_places;  in __kmp_partition_places()  local
4545       n_places = last_place - first_place + 1;  in __kmp_partition_places()
4547       n_places = __kmp_affinity_num_masks - first_place + last_place + 1;  in __kmp_partition_places()
4549     if (n_th <= n_places) {  in __kmp_partition_places()
4577       S = n_th / n_places;  in __kmp_partition_places()
4579       rem = n_th - (S * n_places);  in __kmp_partition_places()
4580       gap = rem > 0 ? n_places / rem : n_places;  in __kmp_partition_places()
4635     int n_places;  in __kmp_partition_places()  local
4638       n_places = last_place - first_place + 1;  in __kmp_partition_places()
4640       n_places = __kmp_affinity_num_masks - first_place + last_place + 1;  in __kmp_partition_places()
4642     if (n_th <= n_places) {  in __kmp_partition_places()
4645       if (n_places != static_cast<int>(__kmp_affinity_num_masks)) {  in __kmp_partition_places()
4646         int S = n_places / n_th;  in __kmp_partition_places()
4650         rem = n_places - n_th * S;  in __kmp_partition_places()
4712             (static_cast<double>(n_places + 1) / static_cast<double>(n_th));  in __kmp_partition_places()
4723           if (first >= n_places) {  in __kmp_partition_places()
4725               first -= n_places;  in __kmp_partition_places()
4726               last -= n_places;  in __kmp_partition_places()
4741           if (last >= n_places) {  in __kmp_partition_places()
4742             last = (n_places - 1);  in __kmp_partition_places()
4748             KMP_DEBUG_ASSERT(n_places > first);  in __kmp_partition_places()
4750             KMP_DEBUG_ASSERT(n_places > last);  in __kmp_partition_places()
4773       S = n_th / n_places;  in __kmp_partition_places()
4775       rem = n_th - (S * n_places);  in __kmp_partition_places()
4776       gap = rem > 0 ? n_places / rem : n_places;  in __kmp_partition_places()