1018   static const kmp_uint32 maxLeaves = 4;
1019   static const kmp_uint32 minBranch = 4;
1025   kmp_uint32 maxLevels;
1031   kmp_uint32 depth;
1032   kmp_uint32 base_num_threads;
1042   kmp_uint32 *numPerLevel;
1043   kmp_uint32 *skipPerLevel;
1081         (kmp_uint32 *)__kmp_allocate(maxLevels * 2 * sizeof(kmp_uint32));  in init()
1083     for (kmp_uint32 i = 0; i < maxLevels;  in init()
1105     kmp_uint32 branch = minBranch;  in init()
1110     for (kmp_uint32 d = 0; d < depth - 1; ++d) { // optimize hierarchy width  in init()
1127     for (kmp_uint32 i = 1; i < depth; ++i)  in init()
1130     for (kmp_uint32 i = depth; i < maxLevels; ++i)  in init()
1137   void resize(kmp_uint32 nproc) {  in resize()
1151     kmp_uint32 old_sz = skipPerLevel[depth - 1];  in resize()
1152     kmp_uint32 incs = 0, old_maxLevels = maxLevels;  in resize()
1154     for (kmp_uint32 i = depth; i < maxLevels && nproc > old_sz; ++i) {  in resize()
1169       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
1170       kmp_uint32 *old_skipPerLevel = skipPerLevel;  in resize()
1173           (kmp_uint32 *)__kmp_allocate(maxLevels * 2 * sizeof(kmp_uint32));  in resize()
1177       for (kmp_uint32 i = 0; i < old_maxLevels; ++i) {  in resize()
1184       for (kmp_uint32 i = old_maxLevels; i < maxLevels; ++i) {  in resize()
1195     for (kmp_uint32 i = old_maxLevels; i < maxLevels; ++i)  in resize()