Lines Matching defs:num_avail

3183                                                      unsigned num_avail,
3193   for (unsigned i = 0; i < num_avail; ++i) {
3316   unsigned num_avail = __kmp_xproc;
3384         if (num_set >= num_avail) {
3398   unsigned num_avail = 0;
3412         // If there is valid data in threadInfo[num_avail], then fake
3416           if (threadInfo[num_avail][i] != UINT_MAX) {
3469         if (threadInfo[num_avail][osIdIndex] != UINT_MAX)
3475           num_avail++;
3479         threadInfo[num_avail][osIdIndex] = val;
3485             threadInfo[num_avail][osIdIndex]);
3486         __kmp_read_from_file(path, "%u", &threadInfo[num_avail][pkgIdIndex]);
3493                      threadInfo[num_avail][osIdIndex]);
3495         threadInfo[num_avail][pkgIdIndex] |= (book_id << 8);
3500                      threadInfo[num_avail][osIdIndex]);
3502         threadInfo[num_avail][pkgIdIndex] |= (drawer_id << 16);
3507                      threadInfo[num_avail][osIdIndex]);
3508         __kmp_read_from_file(path, "%u", &threadInfo[num_avail][coreIdIndex]);
3519         if (threadInfo[num_avail][pkgIdIndex] != UINT_MAX)
3521         threadInfo[num_avail][pkgIdIndex] = val;
3531         if (threadInfo[num_avail][coreIdIndex] != UINT_MAX)
3533         threadInfo[num_avail][coreIdIndex] = val;
3544         if (threadInfo[num_avail][threadIdIndex] != UINT_MAX)
3546         threadInfo[num_avail][threadIdIndex] = val;
3560         if (threadInfo[num_avail][nodeIdIndex + level] != UINT_MAX)
3562         threadInfo[num_avail][nodeIdIndex + level] = val;
3582       if ((int)num_avail == __kmp_xproc) {
3590       if (threadInfo[num_avail][osIdIndex] == UINT_MAX) {
3598           !KMP_CPU_ISSET(threadInfo[num_avail][osIdIndex],
3600         INIT_PROC_INFO(threadInfo[num_avail]);
3606       num_avail++;
3607       KMP_ASSERT(num_avail <= num_records);
3608       INIT_PROC_INFO(threadInfo[num_avail]);
3626   for (i = 0; i < num_avail; ++i) {
3628       if (!__kmp_package_id_from_core_siblings_list(threadInfo, num_avail, i)) {
3645   KMP_ASSERT(num_avail > 0);
3646   KMP_ASSERT(num_avail <= num_records);
3649   qsort(threadInfo, num_avail, sizeof(*threadInfo),
3696   for (i = 1; i < num_avail; i++) {
3811   KMP_DEBUG_ASSERT(num_avail == (unsigned)__kmp_avail_proc);
3854   __kmp_topology = kmp_topology_t::allocate(num_avail, depth, types);
3856   for (i = 0; i < num_avail; ++i) {