/netbsd-6-1-5-RELEASE/external/lgpl3/mpfr/dist/ |
H A D | powerof2.c | 31 mp_size_t xn; local 38 xn = (MPFR_PREC(x) - 1) / GMP_NUMB_BITS; 39 /*if (NOT_POW2(xp[xn]))*/ 40 if (xp[xn] != MPFR_LIMB_HIGHBIT) 42 while (xn > 0) 43 if (xp[--xn] != 0)
|
H A D | setmin.c | 30 mp_size_t xn; local 34 xn = (MPFR_PREC(x) - 1) / GMP_NUMB_BITS; 36 xp[xn] = MPFR_LIMB_HIGHBIT; 37 MPN_ZERO(xp, xn);
|
H A D | isinteger.c | 31 mp_size_t xn; local 47 xn = (mp_size_t) ((prec - 1) / GMP_NUMB_BITS); /* index of last limb */ 48 xn -= (mp_size_t) (expo / GMP_NUMB_BITS); 52 MPFR_ASSERTN(xn >= 0); 53 if (xp[xn] << (expo % GMP_NUMB_BITS) != 0) 55 while (--xn >= 0) 56 if (xp[xn] != 0)
|
H A D | setmax.c | 30 mp_size_t xn, i; local 35 xn = 1 + (MPFR_PREC(x) - 1) / GMP_NUMB_BITS; 36 sh = (mpfr_prec_t) xn * GMP_NUMB_BITS - MPFR_PREC(x); 39 for (i = 1; i < xn; i++)
|
H A D | set_ui_2exp.c | 39 mp_size_t xn; local 48 xn = (MPFR_PREC (x) - 1) / GMP_NUMB_BITS; 53 xp[xn] = ((mp_limb_t) i) << cnt; 54 /* Zero the xn lower limbs. */ 55 MPN_ZERO(xp, xn); 62 MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, 0, 66 xp[xn] = MPFR_LIMB_HIGHBIT;
|
H A D | set_si_2exp.c | 38 mp_size_t xn; local 48 xn = (MPFR_PREC (x) - 1) / GMP_NUMB_BITS; 53 xp[xn] = ai << cnt; 54 /* Zero the xn lower limbs. */ 55 MPN_ZERO(xp, xn); 63 MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, i < 0, 67 xp[xn] = MPFR_LIMB_HIGHBIT;
|
H A D | mul_ui.c | 31 mp_size_t xn; local 79 xn = MPFR_LIMB_SIZE (x); 81 MPFR_ASSERTD (xn < MP_SIZE_T_MAX); 83 yp = (mpfr_limb_ptr) MPFR_TMP_ALLOC ((size_t) (xn + 1) * BYTES_PER_MP_LIMB); 86 yp[xn] = mpn_mul_1 (yp, MPFR_MANT (x), xn, u); 88 /* x * u is stored in yp[xn], ..., yp[0] */ 91 yp[xn] >= 1 since x was msb-normalized */ 92 MPFR_ASSERTD (yp[xn] != 0); 93 if (MPFR_LIKELY (MPFR_LIMB_MSB (yp[xn]) [all...] |
H A D | next.c | 41 mp_size_t xn; local 45 xn = MPFR_LIMB_SIZE (x); 48 mpn_sub_1 (xp, xp, xn, MPFR_LIMB_ONE << sh); 49 if (MPFR_UNLIKELY( MPFR_LIMB_MSB(xp[xn-1]) == 0) ) 59 for (i = 1; i < xn; i++) 75 mp_size_t xn; local 79 xn = MPFR_LIMB_SIZE (x); 82 if (MPFR_UNLIKELY( mpn_add_1 (xp, xp, xn, MPFR_LIMB_ONE << sh)) ) 91 xp[xn-1] = MPFR_LIMB_HIGHBIT;
|
H A D | rec_sqrt.c | 196 mp_size_t xn, rn, th, ln, tn, sn, ahn, un; local 203 xn = LIMB_SIZE(h); /* limb size of the recursive Xh */ 205 ln = n - xn; /* remaining limbs to be computed */ 226 un = xn + (tn - th); 227 /* We use the same temporary buffer to store r and u: r needs 2*xn 228 limbs where u needs xn+(tn-th) limbs. Since tn can store at least 230 thus tn - th >= xn, and reserving the space for u is enough. */ 231 MPFR_ASSERTD(2 * xn <= un); 233 if (2 * h <= GMP_NUMB_BITS) /* xn=rn=1, and since p <= 2h-3, n=1, 241 else if (xn [all...] |
H A D | div_ui.c | 32 mp_size_t xn, yn, dif; local 85 xn = MPFR_LIMB_SIZE (x); 92 dif = yn + 1 - xn; 94 /* we need to store yn+1 = xn + dif limbs of the quotient */ 101 c = mpn_divrem_1 (tmp, dif, xp, xn, c); /* used all the dividend */ 102 else /* dif < 0 i.e. xn > yn, don't use the (-dif) low limbs from x */ 131 If the high limb of the result is 0 (xp[xn-1] < u), remove it. 168 { /* this happens only if u == 1 and xp[xn-1] >=
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpf/ |
H A D | random2.c | 29 mp_size_t xn; local 33 xn = ABS (xs); 36 if (xn == 0) 43 if (xn > prec + 1) 44 xn = prec + 1; 47 mpn_random2 (PTR(x), xn); local 55 SIZ(x) = xs < 0 ? -xn : xn;
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpz/ |
H A D | powm_ui.c | 46 mp_size_t xn, tn, mn, bn; local 107 xn = bn; 122 if (xn == mn && mpn_cmp (xp, mp, mn) >= 0) 129 mpn_sqr (tp, xp, xn); 130 tn = 2 * xn; tn -= tp[tn - 1] == 0; 134 xn = tn; 139 xn = mn; 144 mpn_mul (tp, xp, xn, bp, bn); 145 tn = xn + bn; tn -= tp[tn - 1] == 0; 149 xn 192 MPN_COPY (PTR(r), xp, xn); local [all...] |
H A D | aorsmul_i.c | 200 mp_size_t xn; local 203 xn = SIZ (x); 204 MPZ_TMP_INIT (t, ABS (xn) + 1); 207 MPN_COPY (tp + 1, PTR(x), ABS (xn)); 208 SIZ(t) = xn >= 0 ? xn + 1 : xn - 1; 211 SIZ(t) = xn; 228 mp_size_t xn; local 231 xn [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/mpfr/dist/tests/ |
H A D | random2.c | 37 mp_size_t xn, k, ri; local 59 xn = MPFR_LIMB_SIZE (x); 61 if (size > xn) 62 size = xn; 63 k = xn - size; 79 ri = xn - 1; 124 /* xp[xn - 1] |= MPFR_LIMB_HIGHBIT; */
|
H A D | trandom.c | 33 int *tab, size_tab, k, sh, xn; local 46 xn = 1 + (prec - 1) / mp_bits_per_limb; 47 sh = xn * mp_bits_per_limb - prec;
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/x509/ |
H A D | x509_r2x.c | 72 X509_NAME *xn; local 91 xn=X509_REQ_get_subject_name(r); 92 if (X509_set_subject_name(ret,X509_NAME_dup(xn)) == 0) 94 if (X509_set_issuer_name(ret,X509_NAME_dup(xn)) == 0)
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | perfpow.c | 30 Returns non-zero if {np,nn} == {xp,xn} ^ k. 33 limbs of {xp,xn}^k. Stop if they don't match the s least 38 mp_srcptr xp,mp_size_t xn, 51 ASSERT (xn > 0); 53 if (xn == 1 && xp[0] == 1) 66 /* Final check. Estimate the size of {xp,xn}^k before computing 69 the logarithm of {xp,xn}, rather than using the index of the MSB. 72 count_leading_zeros (count, xp[xn - 1]); 73 y = xn * GMP_LIMB_BITS - count - 1; /* msb_index (xp, xn) */ 37 pow_equals(mp_srcptr np, mp_size_t nn, mp_srcptr xp,mp_size_t xn, mp_limb_t k, mp_bitcnt_t f, mp_ptr tp) argument 209 mp_size_t i, rn, xn; local 325 mp_size_t ncn, s, pn, xn; local [all...] |
/netbsd-6-1-5-RELEASE/games/hack/ |
H A D | hack.shknam.c | 180 const char *const *xn; member in struct:shk_nx 218 q = p->xn;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gettext/gettext-tools/tests/ |
H A D | gettext-2 | 7 if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
|
H A D | msgfilter-1 | 10 if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
|
H A D | msgfilter-2 | 10 if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
|
H A D | msgfilter-3 | 10 if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
|
H A D | msgfmt-2 | 7 if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
|
/netbsd-6-1-5-RELEASE/games/trek/ |
H A D | move.c | 92 double xn; local 139 xn = NSECTS * dist * bigger; 140 n = xn + 0.5; 143 printf("dx = %.2f, dy = %.2f, xn = %.2f, n = %d\n", 144 dx, dy, xn, n); 158 dx = Ship.quadx * NSECTS + Ship.sectx + dx * xn; 159 dy = Ship.quady * NSECTS + Ship.secty + dy * xn;
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/ssl/ |
H A D | ssl_cert.c | 676 X509_NAME *xn=NULL; local 705 if ((xn=X509_get_subject_name(x)) == NULL) goto err; 707 xn=X509_NAME_dup(xn); 708 if (xn == NULL) goto err; 709 if (sk_X509_NAME_find(sk,xn) >= 0) 710 X509_NAME_free(xn); 713 sk_X509_NAME_push(sk,xn); 714 sk_X509_NAME_push(ret,xn); 747 X509_NAME *xn local [all...] |