674   kmp_uint32 *numPerLevel;  variable
687       numPerLevel[level] = max + 1;  in deriveLevels()
696     if (!uninitialized && numPerLevel) {  in fini()
697       __kmp_free(numPerLevel);  in fini()
698       numPerLevel = NULL;  in fini()
720     numPerLevel =  in init()
722     skipPerLevel = &(numPerLevel[maxLevels]);  in init()
725       numPerLevel[i] = 1;  in init()
735       numPerLevel[0] = maxLeaves;  in init()
736       numPerLevel[1] = num_addrs / maxLeaves;  in init()
738         numPerLevel[1]++;  in init()
744       if (numPerLevel[i] != 1 || depth > 1) // only count one top-level '1'  in init()
748     if (numPerLevel[0] == 1)  in init()
753       while (numPerLevel[d] > branch ||  in init()
754              (d == 0 && numPerLevel[d] > maxLeaves)) { // max 4 on level 0!  in init()
755         if (numPerLevel[d] & 1)  in init()
756           numPerLevel[d]++;  in init()
757         numPerLevel[d] = numPerLevel[d] >> 1;  in init()
758         if (numPerLevel[d + 1] == 1)  in init()
760         numPerLevel[d + 1] = numPerLevel[d + 1] << 1;  in init()
762       if (numPerLevel[0] == 1) {  in init()
770       skipPerLevel[i] = numPerLevel[i - 1] * skipPerLevel[i - 1];  in init()
798       numPerLevel[i - 1] *= 2;  in resize()
811       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
813       numPerLevel = skipPerLevel = NULL;  in resize()
814       numPerLevel =  in resize()
816       skipPerLevel = &(numPerLevel[maxLevels]);  in resize()
821         numPerLevel[i] = old_numPerLevel[i];  in resize()
828         numPerLevel[i] = 1;  in resize()