1258   static const kmp_uint32 maxLeaves = 4;
1259   static const kmp_uint32 minBranch = 4;
1265   kmp_uint32 maxLevels;
1271   kmp_uint32 depth;
1272   kmp_uint32 base_num_threads;
1282   kmp_uint32 *numPerLevel;
1283   kmp_uint32 *skipPerLevel;
1321         (kmp_uint32 *)__kmp_allocate(maxLevels * 2 * sizeof(kmp_uint32));  in init()
1323     for (kmp_uint32 i = 0; i < maxLevels;  in init()
1345     kmp_uint32 branch = minBranch;  in init()
1350     for (kmp_uint32 d = 0; d < depth - 1; ++d) { // optimize hierarchy width  in init()
1367     for (kmp_uint32 i = 1; i < depth; ++i)  in init()
1370     for (kmp_uint32 i = depth; i < maxLevels; ++i)  in init()
1377   void resize(kmp_uint32 nproc) {  in resize()
1391     kmp_uint32 old_sz = skipPerLevel[depth - 1];  in resize()
1392     kmp_uint32 incs = 0, old_maxLevels = maxLevels;  in resize()
1394     for (kmp_uint32 i = depth; i < maxLevels && nproc > old_sz; ++i) {  in resize()
1409       kmp_uint32 *old_numPerLevel = numPerLevel;  in resize()
1410       kmp_uint32 *old_skipPerLevel = skipPerLevel;  in resize()
1413           (kmp_uint32 *)__kmp_allocate(maxLevels * 2 * sizeof(kmp_uint32));  in resize()
1417       for (kmp_uint32 i = 0; i < old_maxLevels; ++i) {  in resize()
1424       for (kmp_uint32 i = old_maxLevels; i < maxLevels; ++i) {  in resize()
1435     for (kmp_uint32 i = old_maxLevels; i < maxLevels; ++i)  in resize()