671 #define P(a,b,c,d) a,  macro
676 #undef P
681 #define P(a,b,c,d) b,  macro
686 #undef P
693 #define P(a,b,c,d) {c,d},  macro
698 #undef P
1464   uintmax_t x, z, y, P, t, ni, g;  in factor_using_pollard_rho()  local
1469   redcify (P, 1, n);  in factor_using_pollard_rho()
1470   addmod (x, P, P, n);          /* i.e., redcify(2) */  in factor_using_pollard_rho()
1487               P = mulredc (P, t, n, ni);  in factor_using_pollard_rho()
1491                   if (gcd_odd (P, n) != 1)  in factor_using_pollard_rho()
1674   mpz_t x, z, y, P;  in mp_factor_using_pollard_rho()  local
1683   mpz_init_set_ui (P, 1);  in mp_factor_using_pollard_rho()
1699               mpz_mul (t2, P, t);  in mp_factor_using_pollard_rho()
1700               mpz_mod (P, t2, n);  in mp_factor_using_pollard_rho()
1704                   mpz_gcd (t, P, n);  in mp_factor_using_pollard_rho()
1759   mpz_clears (P, t2, t, z, x, y, nullptr);  in mp_factor_using_pollard_rho()
1985   struct { uintmax_t Q; uintmax_t P; } queue[QUEUE_SIZE];  in factor_using_squfof()  member
2025       uintmax_t S, Dh, Dl, Q1, Q, P, L, L1, B;  in factor_using_squfof()  local
2061       P = S;  in factor_using_squfof()
2064       Q = Dl - P * P;  in factor_using_squfof()
2077           div_smallq (q, rem, S + P, Q);  in factor_using_squfof()
2101                   queue[qpos].P = P % g;  in factor_using_squfof()
2108           t = Q1 + q * (P - P1);  in factor_using_squfof()
2111           P = P1;  in factor_using_squfof()
2127                           if (P >= queue[j].P)  in factor_using_squfof()
2128                             t = P - queue[j].P;  in factor_using_squfof()
2130                             t = queue[j].P - P;  in factor_using_squfof()
2146                   affirm (S >= P); /* What signs are possible?  */  in factor_using_squfof()
2147                   P += r * ((S - P) / r);  in factor_using_squfof()
2154                   umul_ppmm (hi, lo, P, P);  in factor_using_squfof()
2166                       div_smallq (q, rem, S + P, Q);  in factor_using_squfof()
2173                       if (P == P1)  in factor_using_squfof()
2175                       t = Q1 + q * (P - P1);  in factor_using_squfof()
2178                       P = P1;  in factor_using_squfof()