567       pr->u.p.parm2 = ntc; // save number of chunks  in __kmp_dispatch_init_algorithm()
679         pr->u.p.parm2 = guided_int_param * nproc * (chunk + 1);  in __kmp_dispatch_init_algorithm()
795         pr->u.p.parm2 = cross;  in __kmp_dispatch_init_algorithm()
841     pr->u.p.parm2 = (tc / pr->u.p.parm1) + (tc % pr->u.p.parm1 ? 1 : 0);  in __kmp_dispatch_init_algorithm()
849     T parm1, parm2, parm3, parm4;  in __kmp_dispatch_init_algorithm()  local
857     parm2 = (tc / (2 * nproc));  in __kmp_dispatch_init_algorithm()
859     if (parm2 < 1) {  in __kmp_dispatch_init_algorithm()
860       parm2 = 1;  in __kmp_dispatch_init_algorithm()
867     } else if (parm1 > parm2) {  in __kmp_dispatch_init_algorithm()
868       parm1 = parm2;  in __kmp_dispatch_init_algorithm()
872     parm3 = (parm2 + parm1);  in __kmp_dispatch_init_algorithm()
881     parm4 = (parm2 - parm1) / parm4;  in __kmp_dispatch_init_algorithm()
889     pr->u.p.parm2 = parm2;  in __kmp_dispatch_init_algorithm()
1158                   pr->u.p.parm2, pr->u.p.parm3, pr->u.p.parm4));  in __kmp_dispatch_init()
1371     UT nchunks = pr->u.p.parm2;  in __kmp_dispatch_next_algorithm()
1753     UT nchunks = pr->u.p.parm2;  in __kmp_dispatch_next_algorithm()
1814           pr->u.p.parm2) { // compare with K*nproc*(chunk+1), K=2 by default  in __kmp_dispatch_next_algorithm()
1883       if ((T)remaining < pr->u.p.parm2) {  in __kmp_dispatch_next_algorithm()
1960       if (chunkIdx >= (UT)pr->u.p.parm2) {  in __kmp_dispatch_next_algorithm()
2036     T parm2 = pr->u.p.parm2;  in __kmp_dispatch_next_algorithm()  local
2045     init = (index * ((2 * parm2) - (index - 1) * parm4)) / 2;  in __kmp_dispatch_next_algorithm()
2055       limit = ((index + 1) * (2 * parm2 - index * parm4)) / 2 - 1;  in __kmp_dispatch_next_algorithm()