| /src/external/lgpl3/gmp/dist/tests/mpn/ |
| t-toom8h.c | 11 (MAX(GMP_NUMB_BITS <= 9*3 ? (an*7)/ 9 : \
12 GMP_NUMB_BITS <= 10*3 ? (an*6)/10 : \
13 GMP_NUMB_BITS <= 11*3 ? (an*5)/11 : \
14 GMP_NUMB_BITS <= 12*3 ? (an*4)/12 : \
|
| t-get_d.c | 43 GMP_NUMB_BITS - 2, GMP_NUMB_BITS - 1,
44 GMP_NUMB_BITS,
45 GMP_NUMB_BITS + 1, GMP_NUMB_BITS + 2,
46 2 * GMP_NUMB_BITS - 2, 2 * GMP_NUMB_BITS - 1,
47 2 * GMP_NUMB_BITS,
48 2 * GMP_NUMB_BITS + 1, 2 * GMP_NUMB_BITS + 2
[all...] |
| /src/external/lgpl3/mpfr/dist/src/ |
| eq.c | 81 if ((unsigned long) vsize * GMP_NUMB_BITS < n_bits)
83 /* check if low min(PREC(u), n_bits) - (vsize * GMP_NUMB_BITS)
85 unsigned long remains = n_bits - (vsize * GMP_NUMB_BITS);
87 while (k >= 0 && remains >= GMP_NUMB_BITS && !up[k])
90 remains -= GMP_NUMB_BITS;
93 or remains < GMP_NUMB_BITS: check high bits from up[k]
95 if (k >= 0 && (((remains < GMP_NUMB_BITS) &&
96 (up[k] >> (GMP_NUMB_BITS - remains))) ||
97 (remains >= GMP_NUMB_BITS && up[k])))
111 Otherwise, if n_bits > size * GMP_NUMB_BITS, reduce n_bits t
[all...] |
| constant.c | 32 #elif GMP_NUMB_BITS == 8
34 #elif GMP_NUMB_BITS == 16
36 #elif GMP_NUMB_BITS == 32
38 #elif GMP_NUMB_BITS == 64
40 #elif GMP_NUMB_BITS == 96
42 #elif GMP_NUMB_BITS == 128
44 #elif GMP_NUMB_BITS == 256
52 #elif GMP_NUMB_BITS == 8
54 #elif GMP_NUMB_BITS == 16
56 #elif GMP_NUMB_BITS == 3
[all...] |
| get_str.c | 100 MPFR_ASSERTN(f > (-n * GMP_NUMB_BITS));
114 the exponent of R is: f + n*GMP_NUMB_BITS
115 we must have e + f == f + n*GMP_NUMB_BITS - err
116 err = n*GMP_NUMB_BITS - e
119 n * GMP_NUMB_BITS + f */
121 if (exact || mpfr_round_p (r, n, n * GMP_NUMB_BITS - e,
122 n * GMP_NUMB_BITS + f + (rnd == MPFR_RNDN)))
127 i0 = (-f) / GMP_NUMB_BITS;
128 j0 = (-f) % GMP_NUMB_BITS;
130 ret = mpfr_round_raw (r + i0, r, n * GMP_NUMB_BITS, 0
[all...] |
| min_prec.c | 32 return MPFR_LIMB_SIZE (x) * GMP_NUMB_BITS - mpn_scan1 (MPFR_MANT (x), 0);
|
| odd_p.c | 56 prec = MPFR_PREC2LIMBS (prec) * GMP_NUMB_BITS - expo;
59 yn = prec / GMP_NUMB_BITS;
64 /* if expo is a multiple of GMP_NUMB_BITS, t is bit 0 */
65 if (expo % GMP_NUMB_BITS == 0 ? (yp[yn] & 1) == 0
66 : MPFR_LIMB_LSHIFT(yp[yn], (expo % GMP_NUMB_BITS) - 1) != MPFR_LIMB_HIGHBIT)
|
| round_p.c | 78 err = (mpfr_prec_t) bn * GMP_NUMB_BITS;
83 k = prec / GMP_NUMB_BITS;
84 s = GMP_NUMB_BITS - prec % GMP_NUMB_BITS;
85 n = err / GMP_NUMB_BITS - k;
93 mask = s == GMP_NUMB_BITS ? MPFR_LIMB_MAX : MPFR_LIMB_MASK (s);
99 s = GMP_NUMB_BITS - err % GMP_NUMB_BITS;
100 MPFR_ASSERTD (s < GMP_NUMB_BITS);
112 s = GMP_NUMB_BITS - err % GMP_NUMB_BITS
[all...] |
| set_d.c | 29 /* Extracts the bits of |d| in rp[0..n-1] where n=ceil(53/GMP_NUMB_BITS).
41 /* FIXME: Generalize to handle GMP_NUMB_BITS < 16. */
57 #if GMP_NUMB_BITS >= 64
58 man[0] = ((MPFR_LIMB_ONE << (GMP_NUMB_BITS - 1)) |
59 ((mp_limb_t) x.s.manh << (GMP_NUMB_BITS - 21)) |
60 ((mp_limb_t) x.s.manl << (GMP_NUMB_BITS - 53)));
61 #elif GMP_NUMB_BITS == 32
64 #elif GMP_NUMB_BITS == 16
65 MPFR_STAT_STATIC_ASSERT (GMP_NUMB_BITS == 16);
71 MPFR_STAT_STATIC_ASSERT (GMP_NUMB_BITS == 8)
[all...] |
| isinteger.c | 47 xn = (mp_size_t) ((prec - 1) / GMP_NUMB_BITS); /* index of last limb */
48 xn -= (mp_size_t) (expo / GMP_NUMB_BITS);
53 if (MPFR_LIMB_LSHIFT(xp[xn], expo % GMP_NUMB_BITS) != 0)
|
| set_prc_raw.c | 29 MPFR_ASSERTN (p <= (mpfr_prec_t) MPFR_GET_ALLOC_SIZE(x) * GMP_NUMB_BITS);
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| random2.c | 39 #if GMP_NUMB_BITS < 32
40 #define BITS_PER_RANDCALL GMP_NUMB_BITS
60 bit_pos = ran % GMP_NUMB_BITS;
62 gmp_rrandomb (rp, rstate, n * GMP_NUMB_BITS - bit_pos);
75 rp[i] = GMP_NUMB_MAX >> (GMP_NUMB_BITS - (nbits % GMP_NUMB_BITS)) % GMP_NUMB_BITS;
94 rp[bi / GMP_NUMB_BITS] ^= CNST_LIMB (1) << bi % GMP_NUMB_BITS;
100 mpn_incr_u (rp + bi / GMP_NUMB_BITS, CNST_LIMB (1) << bi % GMP_NUMB_BITS)
[all...] |
| scan0.c | 47 starting_word = starting_bit / GMP_NUMB_BITS;
52 alimb &= - (mp_limb_t) 1 << (starting_bit % GMP_NUMB_BITS);
58 return (p - up - 1) * GMP_NUMB_BITS + cnt;
|
| scan1.c | 47 starting_word = starting_bit / GMP_NUMB_BITS;
52 alimb &= - (mp_limb_t) 1 << (starting_bit % GMP_NUMB_BITS);
58 return (p - up - 1) * GMP_NUMB_BITS + cnt;
|
| random.c | 45 _gmp_rand (ptr, rands, size * GMP_NUMB_BITS);
49 _gmp_rand (&ptr[size-1], rands, GMP_NUMB_BITS);
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| rrandomb.c | 56 #if GMP_NUMB_BITS < 32
57 #define BITS_PER_RANDCALL GMP_NUMB_BITS
72 rp[i] = GMP_NUMB_MAX >> (GMP_NUMB_BITS - (nbits % GMP_NUMB_BITS)) % GMP_NUMB_BITS;
91 rp[bi / GMP_NUMB_BITS] ^= CNST_LIMB (1) << bi % GMP_NUMB_BITS;
97 mpn_incr_u (rp + bi / GMP_NUMB_BITS, CNST_LIMB (1) << bi % GMP_NUMB_BITS);
|
| set_ui.c | 42 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
46 PTR (dest)[1] = val >> GMP_NUMB_BITS;
|
| random.c | 36 mpz_urandomb (x, RANDS, (unsigned long) (ABS (size) * GMP_NUMB_BITS));
|
| iset_ui.c | 39 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
44 PTR (dest)[1] = val >> GMP_NUMB_BITS;
|
| /src/external/lgpl3/gmp/dist/mpf/ |
| set_ui.c | 41 #if BITS_PER_ULONG > GMP_NUMB_BITS
42 val >>= GMP_NUMB_BITS;
|
| urandomb.c | 51 nbits = nlimbs * GMP_NUMB_BITS;
56 /* If nbits isn't a multiple of GMP_NUMB_BITS, shift up. */
57 if (nbits % GMP_NUMB_BITS != 0)
58 mpn_lshift (rp, rp, nlimbs, GMP_NUMB_BITS - nbits % GMP_NUMB_BITS);
|
| get_d_2exp.c | 54 *expptr = EXP(src) * GMP_NUMB_BITS - cnt;
55 return mpn_get_d (ptr, abs_size, size, -(abs_size * GMP_NUMB_BITS - cnt));
|
| iset_ui.c | 44 #if BITS_PER_ULONG > GMP_NUMB_BITS
45 val >>= GMP_NUMB_BITS;
|
| set_si.c | 44 #if BITS_PER_ULONG > GMP_NUMB_BITS
45 vl >>= GMP_NUMB_BITS;
|
| /src/external/lgpl3/mpfr/dist/tests/ |
| random2.c | 26 #if GMP_NUMB_BITS < 16
32 #if GMP_NUMB_BITS < 32
33 #define BITS_PER_RANDCALL GMP_NUMB_BITS
78 bit_pos = GMP_NUMB_BITS - 1;
79 ran >>= MPFR_LOG2_GMP_NUMB_BITS; /* Ideally log2(GMP_NUMB_BITS) */
80 ran_nbits = BITS_PER_RANDCALL - MPFR_LOG2_GMP_NUMB_BITS; /* Ideally - log2(GMP_NUMB_BITS) */
100 MPFR_ASSERTN (bit_pos < GMP_NUMB_BITS);
105 bit_pos += GMP_NUMB_BITS;
122 bit_pos += GMP_NUMB_BITS;
146 mpfr_rand_raw (&elimb, RANDS, GMP_NUMB_BITS);
[all...] |
