374       pr->u.p.parm3 = KMP_MIN(small_chunk + extras, nproc);  in __kmp_dispatch_init_algorithm()
496         *(double *)&pr->u.p.parm3 =  in __kmp_dispatch_init_algorithm()
563               (((ptrdiff_t)&pr->u.p.parm3) & (natural_alignment)) == 0);  in __kmp_dispatch_init_algorithm()
568         *(DBL *)&pr->u.p.parm3 = x;  in __kmp_dispatch_init_algorithm()
613 #define GUIDED_ANALYTICAL_WORKAROUND (*(DBL *)&pr->u.p.parm3)  in __kmp_dispatch_init_algorithm()
655     T parm1, parm2, parm3, parm4;  in __kmp_dispatch_init_algorithm()  local
678     parm3 = (parm2 + parm1);  in __kmp_dispatch_init_algorithm()
679     parm3 = (2 * tc + parm3 - 1) / parm3;  in __kmp_dispatch_init_algorithm()
681     if (parm3 < 2) {  in __kmp_dispatch_init_algorithm()
682       parm3 = 2;  in __kmp_dispatch_init_algorithm()
686     parm4 = (parm3 - 1);  in __kmp_dispatch_init_algorithm()
696     pr->u.p.parm3 = parm3;  in __kmp_dispatch_init_algorithm()
970                   pr->u.p.parm2, pr->u.p.parm3, pr->u.p.parm4));  in __kmp_dispatch_init()
1222         int while_limit = pr->u.p.parm3;  in __kmp_dispatch_next_algorithm()
1321         int while_limit = pr->u.p.parm3;  in __kmp_dispatch_next_algorithm()
1567               (UT)(remaining * *(double *)&pr->u.p.parm3); // divide by K*nproc  in __kmp_dispatch_next_algorithm()
1636       UT span = remaining * (*(double *)&pr->u.p.parm3);  in __kmp_dispatch_next_algorithm()
1721               trip, *(DBL *)&pr->u.p.parm3, chunkIdx);  in __kmp_dispatch_next_algorithm()
1727                            trip, *(DBL *)&pr->u.p.parm3, chunkIdx + 1);  in __kmp_dispatch_next_algorithm()
1767     T parm3 = pr->u.p.parm3;  in __kmp_dispatch_next_algorithm()  local
1778     if ((status = ((T)index < parm3 && init <= trip)) == 0) {  in __kmp_dispatch_next_algorithm()