Lines Matching defs:bits
94 b (two bits each), d (one bit). Collected factors are (-1)^e. a and
95 b are the least significant bits of the current remainders. d
100 coded as only 13 distinct values in bits 1-4, according to the
124 #define JACOBI_A(bits) (decode_table[(bits)>>1].a)
125 #define JACOBI_B(bits) (decode_table[(bits)>>1].b)
161 mpn_jacobi_n (mp_ptr ap, mp_ptr bp, mp_size_t n, unsigned bits)
204 nn = mpn_hgcd_jacobi (ap + p, bp + p, n - p, &M, &bits,
216 n = mpn_gcd_subdiv_step (ap, bp, n, 0, jacobi_hook, &bits, tp);
220 return bits == BITS_FAIL ? 0 : mpn_jacobi_finish (bits);
251 if (mpn_hgcd2_jacobi (ah, al, bh, bl, &M, &bits))
261 n = mpn_gcd_subdiv_step (ap, bp, n, 0, &jacobi_hook, &bits, tp);
265 return bits == BITS_FAIL ? 0 : mpn_jacobi_finish (bits);
270 if (bits >= 16)
283 return 1 - 2*(bits & 1);
285 return mpn_jacobi_base (al, bl, bits << 1);
290 int res = mpn_jacobi_2 (ap, bp, bits & 1);