1231   kmp_uint32 *numPerLevel;  variable
1237       numPerLevel[level] = __kmp_topology->get_ratio(i);  in deriveLevels()
1245     if (!uninitialized && numPerLevel) {  in fini()
1246       __kmp_free(numPerLevel);  in fini()
1247       numPerLevel = NULL;  in fini()
1269     numPerLevel =  in init()
1271     skipPerLevel = &(numPerLevel[maxLevels]);  in init()
1274       numPerLevel[i] = 1;  in init()
1282       numPerLevel[0] = maxLeaves;  in init()
1283       numPerLevel[1] = num_addrs / maxLeaves;  in init()
1285         numPerLevel[1]++;  in init()
1291       if (numPerLevel[i] != 1 || depth > 1) // only count one top-level '1'  in init()
1295     if (numPerLevel[0] == 1)  in init()
1300       while (numPerLevel[d] > branch ||  in init()
1301              (d == 0 && numPerLevel[d] > maxLeaves)) { // max 4 on level 0!  in init()
1302         if (numPerLevel[d] & 1)  in init()
1303           numPerLevel[d]++;  in init()
1304         numPerLevel[d] = numPerLevel[d] >> 1;  in init()
1305         if (numPerLevel[d + 1] == 1)  in init()
1307         numPerLevel[d + 1] = numPerLevel[d + 1] << 1;  in init()
1309       if (numPerLevel[0] == 1) {  in init()
1317       skipPerLevel[i] = numPerLevel[i - 1] * skipPerLevel[i - 1];  in init()
1345       numPerLevel[i - 1] *= 2;  in resize()
1358       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
1360       numPerLevel = skipPerLevel = NULL;  in resize()
1361       numPerLevel =  in resize()
1363       skipPerLevel = &(numPerLevel[maxLevels]);  in resize()
1368         numPerLevel[i] = old_numPerLevel[i];  in resize()
1375         numPerLevel[i] = 1;  in resize()