| /src/external/lgpl3/gmp/dist/mpz/ |
| limbs_finish.c | 36 mp_size_t xn = ABS(xs); local
37 MPN_NORMALIZE (PTR (x), xn); local
38 SIZ (x) = xs < 0 ? -xn : xn;
|
| roinit_n.c | 36 mp_size_t xn = ABS(xs); local
37 MPN_NORMALIZE (xp, xn);
40 SIZ (x) = xs < 0 ? -xn : xn;
|
| powm_ui.c | 127 mp_size_t xn, tn, mn, bn; local
194 xn = bn;
206 mpn_sqr (tp, xp, xn);
207 tn = 2 * xn; tn -= tp[tn - 1] == 0;
211 xn = tn;
217 xn = mn;
222 mpn_mul (tp, xp, xn, bp, bn);
223 tn = xn + bn; tn -= tp[tn - 1] == 0;
227 xn = tn;
233 xn = mn
268 MPN_COPY (PTR(r), xp, xn); local
[all...] |
| aorsmul_i.c | 208 mp_size_t xn; local
211 xn = SIZ (x);
212 if (xn == 0) return;
213 MPZ_TMP_INIT (t, ABS (xn) + 1);
216 MPN_COPY (tp + 1, PTR(x), ABS (xn));
217 SIZ(t) = xn >= 0 ? xn + 1 : xn - 1;
220 SIZ(t) = xn;
237 mp_size_t xn; local
[all...] |
| /src/external/lgpl3/mpfr/dist/src/ |
| powerof2.c | 42 mpfr_powerof2_raw2 (const mp_limb_t *xp, mp_size_t xn)
44 if (xp[--xn] != MPFR_LIMB_HIGHBIT)
46 while (xn > 0)
47 if (xp[--xn] != 0)
|
| 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);
|
| 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 (MPFR_LIMB_LSHIFT(xp[xn], expo % GMP_NUMB_BITS) != 0)
55 while (--xn >= 0)
56 if (xp[xn] != 0)
|
| setmax.c | 30 mp_size_t xn, i; local
35 xn = MPFR_LIMB_SIZE (x);
36 sh = (mpfr_prec_t) xn * GMP_NUMB_BITS - MPFR_PREC(x);
39 for (i = 1; i < xn; i++)
|
| set_si_2exp.c | 39 mp_size_t xn; local
57 xn = (MPFR_PREC (x) - 1) / GMP_NUMB_BITS;
62 xp[xn] = ai << cnt;
63 /* Zero the xn lower limbs. */
64 MPN_ZERO(xp, xn);
72 MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, i < 0,
76 xp[xn] = MPFR_LIMB_HIGHBIT;
|
| set_ui_2exp.c | 40 mp_size_t xn; local
57 xn = (MPFR_PREC (x) - 1) / GMP_NUMB_BITS;
62 xp[xn] = ((mp_limb_t) i) << cnt;
63 /* Zero the xn lower limbs. */
64 MPN_ZERO(xp, xn);
71 MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, 0,
75 xp[xn] = MPFR_LIMB_HIGHBIT;
|
| next.c | 64 mp_size_t xn; local
68 xn = MPFR_LIMB_SIZE (x);
71 mpn_sub_1 (xp, xp, xn, MPFR_LIMB_ONE << sh);
72 if (MPFR_UNLIKELY (MPFR_LIMB_MSB (xp[xn-1]) == 0))
81 /* The following is valid whether xn = 1 or xn > 1. */
82 xp[xn-1] |= MPFR_LIMB_HIGHBIT;
98 mp_size_t xn; local
102 xn = MPFR_LIMB_SIZE (x);
105 if (MPFR_UNLIKELY (mpn_add_1 (xp, xp, xn, MPFR_LIMB_ONE << sh))
[all...] |
| mul_ui.c | 78 mp_size_t xn; local
83 xn = MPFR_LIMB_SIZE (x);
85 MPFR_ASSERTD (xn < MP_SIZE_T_MAX);
87 yp = MPFR_TMP_LIMBS_ALLOC (xn + 1);
90 yp[xn] = mpn_mul_1 (yp, MPFR_MANT (x), xn, u);
92 /* x * u is stored in yp[xn], ..., yp[0] */
95 yp[xn] >= 1 since x was msb-normalized */
96 MPFR_ASSERTD (yp[xn] != 0);
97 if (MPFR_LIKELY (MPFR_LIMB_MSB (yp[xn]) == 0)
[all...] |
| rec_sqrt.c | 215 mp_size_t xn, rn, th, ln, tn, sn, ahn, un; local
225 xn = LIMB_SIZE(h); /* limb size of the recursive Xh */
227 ln = n - xn; /* remaining limbs to be computed */
254 /* compared to Algorithm 3.9 of [1], we have {x+ln,xn} = X_h */
258 un = xn + (tn - th);
259 /* We use the same temporary buffer to store r and u: r needs 2*xn
260 limbs where u needs xn+(tn-th) limbs. Since tn can store at least
262 thus tn - th >= xn, and reserving the space for u is enough. */
263 MPFR_ASSERTD(2 * xn <= un);
265 if (2 * h <= GMP_NUMB_BITS) /* xn=rn=1, and since p <= 2h-3, n=1
[all...] |
| /src/external/lgpl3/gmp/dist/mpf/ |
| random2.c | 39 mp_size_t xn; local
43 xn = ABS (xs);
46 if (xn == 0)
53 if (xn > prec + 1)
54 xn = prec + 1;
57 mpn_random2 (PTR(x), xn); local
65 SIZ(x) = xs < 0 ? -xn : xn;
|
| /src/lib/libm/src/ |
| e_sqrtl.c | 91 long double lo, xn; local
133 xn = sqrt(ux.extu_ld); /* 53-bit estimate of sqrtl(x). */
135 xn = (xn + (ux.extu_ld / xn)) * 0.5; /* 106-bit estimate. */
139 lo = (lo - ux.extu_ld) / xn; /* Low bits divided by xn. */
140 xn = xn + (ux.extu_ld / xn); /* High portion of estimate. *
[all...] |
| /src/external/lgpl3/mpfr/dist/tests/ |
| random2.c | 43 mp_size_t xn, k, ri; local
65 xn = MPFR_LIMB_SIZE (x);
67 if (size > xn)
68 size = xn;
69 k = xn - size;
85 ri = xn - 1;
131 /* xp[xn - 1] |= MPFR_LIMB_HIGHBIT; */
|
| trandom_deviate.c | 165 mpfr_t xn, xd, xu, xz, xa, t; local
173 mpfr_inits2 (prec, xn, xd, xu, xz, xa, t, (mpfr_ptr) 0);
181 inexn = mpfr_random_deviate_value (neg, n, u, xn, RANDS, MPFR_RNDN);
186 inext = mpfr_set (t, xn, MPFR_RNDN);
201 /* Check that x{d,u,z,a} == xn is the inexact flags match, else
203 if ( !( mpfr_equal_p(xd, SAME_SIGN(inexn, inexd) ? xn : t) &&
204 mpfr_equal_p(xu, SAME_SIGN(inexn, inexu) ? xn : t) &&
205 mpfr_equal_p(xz, SAME_SIGN(inexn, inexz) ? xn : t) &&
206 mpfr_equal_p(xa, SAME_SIGN(inexn, inexa) ? xn : t) ) )
211 mpfr_get_d (xn, MPFR_RNDN), mpfr_get_d (t, MPFR_RNDN)
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/x509/ |
| x509_r2x.c | 24 const X509_NAME *xn; local
44 xn = X509_REQ_get_subject_name(r);
45 if (X509_set_subject_name(ret, xn) == 0)
47 if (X509_set_issuer_name(ret, xn) == 0)
|
| /src/crypto/external/bsd/openssl/dist/crypto/x509/ |
| x509_r2x.c | 24 const X509_NAME *xn; local
44 xn = X509_REQ_get_subject_name(r);
45 if (X509_set_subject_name(ret, xn) == 0)
47 if (X509_set_issuer_name(ret, xn) == 0)
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/x509/ |
| x509_r2x.c | 24 X509_NAME *xn; local
44 xn = X509_REQ_get_subject_name(r);
45 if (X509_set_subject_name(ret, xn) == 0)
47 if (X509_set_issuer_name(ret, xn) == 0)
|
| /src/games/hack/ |
| hack.shknam.c | 180 const char *const *xn; member in struct:shk_nx
221 q = p->xn;
|
| /src/external/gpl2/gettext/dist/gettext-tools/tests/ |
| gettext-2 | 7 if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then
|
| /src/games/trek/ |
| 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;
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| perfpow.c | 39 /* Return non-zero if {np,nn} == {xp,xn} ^ k.
42 {xp,xn}^k. Stop if they don't match the s least significant limbs of
45 FIXME: Low xn limbs can be expected to always match, if computed as a mod
46 B^{xn} root. So instead of using mpn_powlo, compute an approximation of the
47 most significant (normalized) limb of {xp,xn} ^ k (and an error bound), and
52 mp_srcptr xp,mp_size_t xn,
62 ASSERT (xn > 0);
64 if (xn == 1 && xp[0] == 1)
75 /* Final check. Estimate the size of {xp,xn}^k before computing the power
77 accurate estimation of the logarithm of {xp,xn}, rather than using th
124 mp_size_t rn, xn; local
[all...] |
| /src/crypto/external/bsd/openssl/dist/ssl/ |
| ssl_cert.c | 634 X509_NAME *xn = NULL; local
664 if ((xn = X509_get_subject_name(x)) == NULL)
667 xn = X509_NAME_dup(xn);
668 if (xn == NULL)
670 if (lh_X509_NAME_retrieve(name_hash, xn) != NULL) {
672 X509_NAME_free(xn);
673 xn = NULL;
675 lh_X509_NAME_insert(name_hash, xn);
676 if (!sk_X509_NAME_push(ret, xn))
707 X509_NAME *xn = NULL; local
814 X509_NAME *xn = NULL; local
[all...] |
