1203   uintmax_t a_prim, one, ni;  in prime_p()  local
1221   addmod (a_prim, one, one, n); /* i.e., redcify a = 2 */  in prime_p()
1224   if (!millerrabin (n, ni, a_prim, q, k, one))  in prime_p()
1243                 = powm (a_prim, (n - 1) / factors.p[i], n, ni, one) != one;  in prime_p()
1264           a_prim = s0 % n;  in prime_p()
1268             udiv_qrnnd (dummy, a_prim, s1, s0, n);  in prime_p()
1272       if (!millerrabin (n, ni, a_prim, q, k, one))  in prime_p()
1283   uintmax_t a_prim[2];  in prime2_p()  local
1312   addmod2 (a_prim[1], a_prim[0], one[1], one[0], one[1], one[0], n1, n0);  in prime2_p()
1318   if (!millerrabin2 (na, ni, a_prim, q, k, one))  in prime2_p()
1343               y[0] = powm2 (&y[1], a_prim, e, na, ni, one);  in prime2_p()
1355               y[0] = powm2 (&y[1], a_prim, e, na, ni, one);  in prime2_p()
1369       redcify2 (a_prim[1], a_prim[0], a, n1, n0);  in prime2_p()
1371       if (!millerrabin2 (na, ni, a_prim, q, k, one))  in prime2_p()