Lines Matching refs:xn
39 /* Return non-zero if {np,nn} == {xp,xn} ^ k.
42 {xp,xn}^k. Stop if they don't match the s least significant limbs of
45 FIXME: Low xn limbs can be expected to always match, if computed as a mod
46 B^{xn} root. So instead of using mpn_powlo, compute an approximation of the
47 most significant (normalized) limb of {xp,xn} ^ k (and an error bound), and
52 mp_srcptr xp,mp_size_t xn,
62 ASSERT (xn > 0);
64 if (xn == 1 && xp[0] == 1)
75 /* Final check. Estimate the size of {xp,xn}^k before computing the power
77 accurate estimation of the logarithm of {xp,xn}, rather than using the
80 MPN_SIZEINBASE_2EXP(y, xp, xn, 1);
81 y -= 1; /* msb_index (xp, xn) */
102 i = mpn_pow_1 (tp, xp, xn, k, tp2);
124 mp_size_t rn, xn;
137 xn = rn;
138 MPN_NORMALIZE (rp, xn);
139 if (pow_equals (np, n, rp, xn, k, f, tp) != 0)
Indexes created Tue May 05 00:25:04 UTC 2026