406       pr->u.p.parm2 = ntc; // save number of chunks  in __kmp_dispatch_init_algorithm()
518         pr->u.p.parm2 = guided_int_param * nproc * (chunk + 1);  in __kmp_dispatch_init_algorithm()
634         pr->u.p.parm2 = cross;  in __kmp_dispatch_init_algorithm()
680     pr->u.p.parm2 = (tc / pr->u.p.parm1) + (tc % pr->u.p.parm1 ? 1 : 0);  in __kmp_dispatch_init_algorithm()
688     T parm1, parm2, parm3, parm4;  in __kmp_dispatch_init_algorithm()  local
696     parm2 = (tc / (2 * nproc));  in __kmp_dispatch_init_algorithm()
698     if (parm2 < 1) {  in __kmp_dispatch_init_algorithm()
699       parm2 = 1;  in __kmp_dispatch_init_algorithm()
706     } else if (parm1 > parm2) {  in __kmp_dispatch_init_algorithm()
707       parm1 = parm2;  in __kmp_dispatch_init_algorithm()
711     parm3 = (parm2 + parm1);  in __kmp_dispatch_init_algorithm()
720     parm4 = (parm2 - parm1) / parm4;  in __kmp_dispatch_init_algorithm()
728     pr->u.p.parm2 = parm2;  in __kmp_dispatch_init_algorithm()
997                   pr->u.p.parm2, pr->u.p.parm3, pr->u.p.parm4));  in __kmp_dispatch_init()
1209     UT nchunks = pr->u.p.parm2;  in __kmp_dispatch_next_algorithm()
1591     UT nchunks = pr->u.p.parm2;  in __kmp_dispatch_next_algorithm()
1652           pr->u.p.parm2) { // compare with K*nproc*(chunk+1), K=2 by default  in __kmp_dispatch_next_algorithm()
1721       if ((T)remaining < pr->u.p.parm2) {  in __kmp_dispatch_next_algorithm()
1798       if (chunkIdx >= (UT)pr->u.p.parm2) {  in __kmp_dispatch_next_algorithm()
1874     T parm2 = pr->u.p.parm2;  in __kmp_dispatch_next_algorithm()  local
1883     init = (index * ((2 * parm2) - (index - 1) * parm4)) / 2;  in __kmp_dispatch_next_algorithm()
1893       limit = ((index + 1) * (2 * parm2 - index * parm4)) / 2 - 1;  in __kmp_dispatch_next_algorithm()