/netbsd-6-1-5-RELEASE/external/lgpl3/mpfr/dist/ |
H A D | get_str.c | 95 MPFR_ASSERTN(f > (-n * GMP_NUMB_BITS)); 108 the exponent of R is: f + n*GMP_NUMB_BITS 109 we must have e + f == f + n*GMP_NUMB_BITS - err 110 err = n*GMP_NUMB_BITS - e 113 n * GMP_NUMB_BITS + f */ 116 n * GMP_NUMB_BITS - e, MPFR_RNDN, rnd, n * GMP_NUMB_BITS + f)) 121 i0 = (-f) / GMP_NUMB_BITS; 122 j0 = (-f) % GMP_NUMB_BITS; 124 ret = mpfr_round_raw (r + i0, r, n * GMP_NUMB_BITS, [all...] |
H A D | eq.c | 59 usize = (MPFR_PREC(u) - 1) / GMP_NUMB_BITS + 1; 60 vsize = (MPFR_PREC(v) - 1) / GMP_NUMB_BITS + 1; 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 [all...] |
H A D | round_p.c | 65 err = (mpfr_prec_t) bn * GMP_NUMB_BITS; 70 k = prec / GMP_NUMB_BITS; 71 s = GMP_NUMB_BITS - prec%GMP_NUMB_BITS; 72 n = err / GMP_NUMB_BITS - k; 80 mask = s == GMP_NUMB_BITS ? MP_LIMB_T_MAX : MPFR_LIMB_MASK (s); 86 s = GMP_NUMB_BITS - err % GMP_NUMB_BITS; 87 MPFR_ASSERTD (s < GMP_NUMB_BITS); 99 s = GMP_NUMB_BITS [all...] |
H A D | 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 (xp[xn] << (expo % GMP_NUMB_BITS) != 0)
|
H A D | min_prec.c | 43 res += GMP_NUMB_BITS; 54 * is not a multiple of GMP_NUMB_BITS, we must not count 56 i = px % GMP_NUMB_BITS; 58 res -= GMP_NUMB_BITS - i;
|
H A D | check.c | 50 MPFR_PREC(x) > ((mpfr_prec_t)s*GMP_NUMB_BITS)) 59 if ( ((xm[MPFR_LIMB_SIZE(x)-1])>>(GMP_NUMB_BITS-1)) == 0) 62 rw = (MPFR_PREC(x) % GMP_NUMB_BITS); 65 tmp = MPFR_LIMB_MASK (GMP_NUMB_BITS - rw);
|
H A D | int_ceil_log2.c | 40 return GMP_NUMB_BITS - b;
|
H A D | powerof2.c | 38 xn = (MPFR_PREC(x) - 1) / GMP_NUMB_BITS;
|
H A D | set_prc_raw.c | 29 MPFR_ASSERTN (p <= (mpfr_prec_t) MPFR_GET_ALLOC_SIZE(x) * GMP_NUMB_BITS);
|
H A D | mpn_exp.c | 34 a[0] + a[1]*B + ... + a[n-1]*B^(n-1) where B=2^GMP_NUMB_BITS 66 bits = GMP_NUMB_BITS - h; 76 f = h - (n - 1) * GMP_NUMB_BITS; 81 t = GMP_NUMB_BITS - t; /* number of bits of exponent e */ 83 error = t; /* error <= GMP_NUMB_BITS */ 91 bits = n * GMP_NUMB_BITS - mpn_scan1 (a, 0); 92 n1 = (n * GMP_NUMB_BITS - bits) / GMP_NUMB_BITS; 106 /* FIXME: Could f = 2*f + n * GMP_NUMB_BITS be used? */ 108 MPFR_SADD_OVERFLOW (f, f, n * GMP_NUMB_BITS, [all...] |
H A D | setmax.c | 35 xn = 1 + (MPFR_PREC(x) - 1) / GMP_NUMB_BITS; 36 sh = (mpfr_prec_t) xn * GMP_NUMB_BITS - MPFR_PREC(x);
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | random2.c | 30 #if GMP_NUMB_BITS < 32 31 #define BITS_PER_RANDCALL GMP_NUMB_BITS 51 bit_pos = ran % GMP_NUMB_BITS; 53 gmp_rrandomb (rp, rstate, n * GMP_NUMB_BITS - bit_pos); 65 i = (nbits + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS - 1; 66 rp[i] = GMP_NUMB_MAX >> (GMP_NUMB_BITS - (nbits % GMP_NUMB_BITS)) % GMP_NUMB_BITS; 85 rp[bi / GMP_NUMB_BITS] [all...] |
H A D | scan0.c | 37 starting_word = starting_bit / GMP_NUMB_BITS; 42 alimb &= - (mp_limb_t) 1 << (starting_bit % GMP_NUMB_BITS); 48 return (p - up - 1) * GMP_NUMB_BITS + cnt;
|
H A D | scan1.c | 37 starting_word = starting_bit / GMP_NUMB_BITS; 42 alimb &= - (mp_limb_t) 1 << (starting_bit % GMP_NUMB_BITS); 48 return (p - up - 1) * GMP_NUMB_BITS + cnt;
|
H A D | random.c | 35 _gmp_rand (ptr, rands, size * GMP_NUMB_BITS); 39 _gmp_rand (&ptr[size-1], rands, GMP_NUMB_BITS);
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpz/ |
H A D | rrandomb.c | 32 nl = (nbits + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS; 45 #if GMP_NUMB_BITS < 32 46 #define BITS_PER_RANDCALL GMP_NUMB_BITS 60 i = (nbits + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS - 1; 61 rp[i] = GMP_NUMB_MAX >> (GMP_NUMB_BITS - (nbits % GMP_NUMB_BITS)) % GMP_NUMB_BITS; 80 rp[bi / GMP_NUMB_BITS] [all...] |
H A D | set_ui.c | 32 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */ 36 dest->_mp_d[1] = val >> GMP_NUMB_BITS;
|
H A D | random.c | 26 mpz_urandomb (x, RANDS, (unsigned long) (ABS (size) * GMP_NUMB_BITS));
|
H A D | array_init.c | 31 nlimbs = (nbits + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS;
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/tests/mpn/ |
H A D | t-toom8h.c | 8 #if GMP_NUMB_BITS <= 10*3 11 #if GMP_NUMB_BITS <= 11*3 14 #if GMP_NUMB_BITS <= 12*3
|
H A D | t-get_d.c | 50 GMP_NUMB_BITS - 2, GMP_NUMB_BITS - 1, 51 GMP_NUMB_BITS, 52 GMP_NUMB_BITS + 1, GMP_NUMB_BITS + 2, 53 2 * GMP_NUMB_BITS - 2, 2 * GMP_NUMB_BITS - 1, 54 2 * GMP_NUMB_BITS, 55 2 * GMP_NUMB_BITS + 1, 2 * GMP_NUMB_BITS [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpf/ |
H A D | set_ui.c | 31 #if BITS_PER_ULONG > GMP_NUMB_BITS 32 val >>= GMP_NUMB_BITS; local
|
H A D | urandomb.c | 41 nbits = nlimbs * GMP_NUMB_BITS; 46 /* If nbits isn't a multiple of GMP_NUMB_BITS, shift up. */ 47 if (nbits % GMP_NUMB_BITS != 0) 48 mpn_lshift (rp, rp, nlimbs, GMP_NUMB_BITS - nbits % GMP_NUMB_BITS);
|
H A D | iset_ui.c | 35 #if BITS_PER_ULONG > GMP_NUMB_BITS 36 val >>= GMP_NUMB_BITS; local
|
H A D | set_si.c | 35 #if BITS_PER_ULONG > GMP_NUMB_BITS 36 vl >>= GMP_NUMB_BITS; local
|