Searched refs:GMP_NUMB_BITS (Results 101 - 125 of 311) sorted by relevance
1234567891011>>
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpz/ |
H A D | cdiv_q_ui.c | 48 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */ 62 dp[1] = divisor >> GMP_NUMB_BITS; 64 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
|
H A D | fdiv_q_ui.c | 47 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */ 61 dp[1] = divisor >> GMP_NUMB_BITS; 63 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
|
H A D | tdiv_q_ui.c | 47 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */ 60 dp[1] = divisor >> GMP_NUMB_BITS; 62 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
|
H A D | tdiv_r_ui.c | 44 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */ 65 dp[1] = divisor >> GMP_NUMB_BITS; 69 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
|
H A D | import.c | 49 zsize = (count * (8*size - nail) + GMP_NUMB_BITS-1) / GMP_NUMB_BITS; 117 ASSERT (lbits < GMP_NUMB_BITS); \ 122 if (lbits >= GMP_NUMB_BITS) \ 125 lbits -= GMP_NUMB_BITS; \ 152 ASSERT (lbits <= GMP_NUMB_BITS);
|
H A D | tdiv_qr_ui.c | 49 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */ 69 dp[1] = divisor >> GMP_NUMB_BITS; 71 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
|
H A D | inp_raw.c | 85 abs_xsize = (abs_csize*8 + GMP_NUMB_BITS-1) / GMP_NUMB_BITS; 135 if (bits >= GMP_NUMB_BITS) 139 bits -= GMP_NUMB_BITS;
|
H A D | realloc.c | 36 if (UNLIKELY (new_alloc > ULONG_MAX / GMP_NUMB_BITS))
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/tests/mpf/ |
H A D | t-set_ui.c | 38 #if GMP_NUMB_BITS >= BITS_PER_ULONG 43 ULONG_MAX >> GMP_NUMB_BITS } }, 45 ULONG_HIGHBIT >> GMP_NUMB_BITS } },
|
/netbsd-6-1-5-RELEASE/external/lgpl3/mpfr/dist/ |
H A D | set_q.c | 46 pf = s * GMP_NUMB_BITS - c; 105 if (MPFR_UNLIKELY (sn > MPFR_EMAX_MAX / GMP_NUMB_BITS)) 110 if (MPFR_UNLIKELY (sn < MPFR_EMIN_MIN / GMP_NUMB_BITS -1)) 119 shift = GMP_NUMB_BITS*sn+cn-cd; 120 MPFR_ASSERTD (shift == GMP_NUMB_BITS*sn+cn-cd);
|
H A D | set_z_exp.c | 46 /* compute en = floor(e/GMP_NUMB_BITS) */ 47 en = (e >= 0) ? e / GMP_NUMB_BITS : (e + 1) / GMP_NUMB_BITS - 1; 49 if (MPFR_UNLIKELY (zn + en > MPFR_EMAX_MAX / GMP_NUMB_BITS + 1)) 51 /* because zn + en >= MPFR_EMAX_MAX / GMP_NUMB_BITS + 2 52 implies (zn + en) * GMP_NUMB_BITS >= MPFR_EMAX_MAX + GMP_NUMB_BITS + 1 53 and exp = zn * GMP_NUMB_BITS + e - k 54 >= (zn + en) * GMP_NUMB_BITS - k > MPFR_EMAX_MAX */ 62 /* now zn + en <= MPFR_EMAX_MAX / GMP_NUMB_BITS [all...] |
H A D | mpfr-gmp.h | 56 /* Define GMP_NUMB_BITS 58 #if defined(GMP_NUMB_BITS) /* GMP 4.1.2 or above */ 59 #ifndef GMP_NUMB_BITS 60 # define GMP_NUMB_BITS (GMP_NUMB_BITS+GMP_NAIL_BITS) macro 63 # define GMP_NUMB_BITS __GMP_GMP_NUMB_BITS macro 64 # define GMP_NUMB_BITS GMP_NUMB_BITS macro 69 # error "Could not detect GMP_NUMB_BITS. Try with gmp internal files." 73 #define BYTES_PER_MP_LIMB (GMP_NUMB_BITS/CHAR_BI [all...] |
H A D | rec_sqrt.c | 39 where X = {x, n}/B^n, n = ceil(p/GMP_NUMB_BITS), 40 A = 2^(1+as)*{a, an}/B^an, as is 0 or 1, an = ceil(ap/GMP_NUMB_BITS), 41 where B = 2^GMP_NUMB_BITS. 51 If p is not a multiple of GMP_NUMB_BITS, the extra low bits of the input 55 The extra low bits of the output X (if p is not a multiple of GMP_NUMB_BITS) 63 (4) GMP_NUMB_BITS >= 12 and is even 66 including the case where ap <= GMP_NUMB_BITS, thus it can be used to 166 /* We should have enough bits in one limb and GMP_NUMB_BITS should be even. 168 MPFR_ASSERTN((GMP_NUMB_BITS >= 12) && ((GMP_NUMB_BITS [all...] |
H A D | set_d.c | 29 /* extracts the bits of d in rp[0..n-1] where n=ceil(53/GMP_NUMB_BITS). 33 /* e=0 iff GMP_NUMB_BITS=32 and rp has only one limb */ 37 #if GMP_NUMB_BITS == 32 44 3. Generalize to handle all GMP_NUMB_BITS. 61 #if GMP_NUMB_BITS >= 64 71 #if GMP_NUMB_BITS >= 64 120 #if GMP_NUMB_BITS >= 64 130 #if GMP_NUMB_BITS >= 64 245 MPFR_EXP(tmp) -= (mpfr_exp_t) (cnt + k * GMP_NUMB_BITS);
|
H A D | sub1.c | 149 (-cancel) % GMP_NUMB_BITS to the right */ 152 cancel1 = (cancel + shift_b) / GMP_NUMB_BITS; 172 (diff_exp-cancel) % GMP_NUMB_BITS to the right */ 174 if ((UINT_MAX % GMP_NUMB_BITS) == (GMP_NUMB_BITS-1) 175 && ((-(unsigned) 1)%GMP_NUMB_BITS > 0)) 176 shift_c = (diff_exp - cancel) % GMP_NUMB_BITS; 179 shift_c = diff_exp - (cancel % GMP_NUMB_BITS); 180 shift_c = (shift_c + GMP_NUMB_BITS) % GMP_NUMB_BITS; [all...] |
H A D | set_prec.c | 35 xsize = (p - 1) / GMP_NUMB_BITS + 1;
|
H A D | mul.c | 101 bn = (bq+GMP_NUMB_BITS-1)/GMP_NUMB_BITS; /* number of limbs of b */ 102 cn = (cq+GMP_NUMB_BITS-1)/GMP_NUMB_BITS; /* number of limbs of c */ 104 tn = (bq + cq + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS; 119 with tmp[k-1]>=2^(GMP_NUMB_BITS-2) */ 120 b1 >>= GMP_NUMB_BITS - 1; /* msb from the product */ 286 bn = (bq+GMP_NUMB_BITS-1)/GMP_NUMB_BITS; /* numbe [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | get_d.c | 146 if (UNLIKELY ((unsigned long) (GMP_NUMB_BITS * size) 157 exp += GMP_NUMB_BITS * size; 183 nbits += GMP_NUMB_BITS; 191 nbits += GMP_NUMB_BITS; 239 nbits += GMP_NUMB_BITS; 247 nbits += GMP_NUMB_BITS; 255 nbits += GMP_NUMB_BITS; 307 #define ONE_LIMB (GMP_LIMB_BITS == 64 && 2*GMP_NUMB_BITS >= 53) 308 #define TWO_LIMBS (GMP_LIMB_BITS == 32 && 3*GMP_NUMB_BITS >= 53) 340 m1 = (m1 << GMP_NAIL_BITS) | (m2 >> (GMP_NUMB_BITS [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/tests/mpz/ |
H A D | t-scan.c | 30 unsigned long z_bits = (unsigned long) ABSIZ(z) * GMP_NUMB_BITS; 85 if ((int) isize*GMP_NUMB_BITS < -o) 88 start = isize*GMP_NUMB_BITS + o;
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpf/ |
H A D | cmp_ui.c | 63 ulimb = (ulimb << GMP_NUMB_BITS) | up[usize - 2];
|
H A D | fits_s.h | 55 fl = (fl << GMP_NUMB_BITS);
|
H A D | fits_u.h | 54 fl = (fl << GMP_NUMB_BITS);
|
H A D | random2.c | 50 _gmp_rand (&elimb, RANDS, GMP_NUMB_BITS);
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpq/ |
H A D | set_si.c | 29 if (GMP_NUMB_BITS < BITS_PER_ULONG)
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/ |
H A D | randmui.c | 46 all (bits==0 arises when n==1), or if bits <= GMP_NUMB_BITS then it 62 ret = a[0] | (a[1] << GMP_NUMB_BITS);
|
Completed in 308 milliseconds
1234567891011>>