658   kmp_uint32 *numPerLevel;  variable
671       numPerLevel[level] = max + 1;  in deriveLevels()
680     if (!uninitialized && numPerLevel) {  in fini()
681       __kmp_free(numPerLevel);  in fini()
682       numPerLevel = NULL;  in fini()
704     numPerLevel =  in init()
706     skipPerLevel = &(numPerLevel[maxLevels]);  in init()
709       numPerLevel[i] = 1;  in init()
719       numPerLevel[0] = maxLeaves;  in init()
720       numPerLevel[1] = num_addrs / maxLeaves;  in init()
722         numPerLevel[1]++;  in init()
728       if (numPerLevel[i] != 1 || depth > 1) // only count one top-level '1'  in init()
732     if (numPerLevel[0] == 1)  in init()
737       while (numPerLevel[d] > branch ||  in init()
738              (d == 0 && numPerLevel[d] > maxLeaves)) { // max 4 on level 0!  in init()
739         if (numPerLevel[d] & 1)  in init()
740           numPerLevel[d]++;  in init()
741         numPerLevel[d] = numPerLevel[d] >> 1;  in init()
742         if (numPerLevel[d + 1] == 1)  in init()
744         numPerLevel[d + 1] = numPerLevel[d + 1] << 1;  in init()
746       if (numPerLevel[0] == 1) {  in init()
754       skipPerLevel[i] = numPerLevel[i - 1] * skipPerLevel[i - 1];  in init()
782       numPerLevel[i - 1] *= 2;  in resize()
795       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
797       numPerLevel = skipPerLevel = NULL;  in resize()
798       numPerLevel =  in resize()
800       skipPerLevel = &(numPerLevel[maxLevels]);  in resize()
805         numPerLevel[i] = old_numPerLevel[i];  in resize()
812         numPerLevel[i] = 1;  in resize()