1042   kmp_uint32 *numPerLevel;  variable
1048       numPerLevel[level] = __kmp_topology->get_ratio(i);  in deriveLevels()
1056     if (!uninitialized && numPerLevel) {  in fini()
1057       __kmp_free(numPerLevel);  in fini()
1058       numPerLevel = NULL;  in fini()
1080     numPerLevel =  in init()
1082     skipPerLevel = &(numPerLevel[maxLevels]);  in init()
1085       numPerLevel[i] = 1;  in init()
1093       numPerLevel[0] = maxLeaves;  in init()
1094       numPerLevel[1] = num_addrs / maxLeaves;  in init()
1096         numPerLevel[1]++;  in init()
1102       if (numPerLevel[i] != 1 || depth > 1) // only count one top-level '1'  in init()
1106     if (numPerLevel[0] == 1)  in init()
1111       while (numPerLevel[d] > branch ||  in init()
1112              (d == 0 && numPerLevel[d] > maxLeaves)) { // max 4 on level 0!  in init()
1113         if (numPerLevel[d] & 1)  in init()
1114           numPerLevel[d]++;  in init()
1115         numPerLevel[d] = numPerLevel[d] >> 1;  in init()
1116         if (numPerLevel[d + 1] == 1)  in init()
1118         numPerLevel[d + 1] = numPerLevel[d + 1] << 1;  in init()
1120       if (numPerLevel[0] == 1) {  in init()
1128       skipPerLevel[i] = numPerLevel[i - 1] * skipPerLevel[i - 1];  in init()
1156       numPerLevel[i - 1] *= 2;  in resize()
1169       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
1171       numPerLevel = skipPerLevel = NULL;  in resize()
1172       numPerLevel =  in resize()
1174       skipPerLevel = &(numPerLevel[maxLevels]);  in resize()
1179         numPerLevel[i] = old_numPerLevel[i];  in resize()
1186         numPerLevel[i] = 1;  in resize()