1282   kmp_uint32 *numPerLevel;  variable
1288       numPerLevel[level] = __kmp_topology->get_ratio(i);  in deriveLevels()
1296     if (!uninitialized && numPerLevel) {  in fini()
1297       __kmp_free(numPerLevel);  in fini()
1298       numPerLevel = NULL;  in fini()
1320     numPerLevel =  in init()
1322     skipPerLevel = &(numPerLevel[maxLevels]);  in init()
1325       numPerLevel[i] = 1;  in init()
1333       numPerLevel[0] = maxLeaves;  in init()
1334       numPerLevel[1] = num_addrs / maxLeaves;  in init()
1336         numPerLevel[1]++;  in init()
1342       if (numPerLevel[i] != 1 || depth > 1) // only count one top-level '1'  in init()
1346     if (numPerLevel[0] == 1)  in init()
1351       while (numPerLevel[d] > branch ||  in init()
1352              (d == 0 && numPerLevel[d] > maxLeaves)) { // max 4 on level 0!  in init()
1353         if (numPerLevel[d] & 1)  in init()
1354           numPerLevel[d]++;  in init()
1355         numPerLevel[d] = numPerLevel[d] >> 1;  in init()
1356         if (numPerLevel[d + 1] == 1)  in init()
1358         numPerLevel[d + 1] = numPerLevel[d + 1] << 1;  in init()
1360       if (numPerLevel[0] == 1) {  in init()
1368       skipPerLevel[i] = numPerLevel[i - 1] * skipPerLevel[i - 1];  in init()
1396       numPerLevel[i - 1] *= 2;  in resize()
1409       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
1411       numPerLevel = skipPerLevel = NULL;  in resize()
1412       numPerLevel =  in resize()
1414       skipPerLevel = &(numPerLevel[maxLevels]);  in resize()
1419         numPerLevel[i] = old_numPerLevel[i];  in resize()
1426         numPerLevel[i] = 1;  in resize()