HomeSort by: relevance | last modified time | path
    Searched defs:expx (Results 1 - 15 of 15) sorted by relevancy

  /src/external/lgpl3/mpfr/dist/src/
acosu.c 33 mpfr_exp_t expx; local
102 expx = MPFR_GET_EXP(x);
103 if (expx <= -64 && expx <= - (mpfr_exp_t) prec - 3)
atanu.c 33 mpfr_exp_t expx; local
104 expx = MPFR_GET_EXP(x);
105 if (expx >= 65 && expx - 1 >= MPFR_PREC(y) + 2)
110 /* since expx >= 65, we have emax >= 65, thus u is representable here,
exp.c 38 mpfr_exp_t expx; local
131 expx = MPFR_GET_EXP (x);
135 if (MPFR_UNLIKELY (expx < 0 && (mpfr_uexp_t) (-expx) > precy))
sin.c 41 mpfr_exp_t expx, err1, err; local
68 expx = MPFR_GET_EXP (x);
69 err1 = -2 * expx;
86 any failure in Ziv's strategy, thus we take into account expx too */
87 m = precy + MPFR_INT_CEIL_LOG2 (MAX(precy,expx)) + 8;
91 about -2*expx bits if expx < 0 */
92 if (expx < 0)
102 if (expx >= 2)
104 mpfr_init2 (c, expx + m - 1)
    [all...]
log2p1.c 56 mpfr_exp_t expx = MPFR_GET_EXP(x); local
57 mpfr_exp_t k = expx - 1, expk;
68 if (2 - expx >= expk - MPFR_PREC(y) - 1)
pow_z.c 232 mpfr_exp_t expx = MPFR_EXP (x); /* warning: x and y may be the same local
239 mpz_mul_si (tmp, z, expx - 1);
sinu.c 39 mpfr_exp_t expx, expt, err; local
108 expx = MPFR_GET_EXP (xp);
110 any failure in Ziv's strategy, thus we take into account expx too. */
111 prec = precy + MAX(expx, MPFR_INT_CEIL_LOG2 (precy)) + 8;
tanu.c 33 mpfr_exp_t expx, expt, err; local
103 expx = MPFR_GET_EXP (xp);
105 any failure in Ziv's strategy, thus we take into account expx too. */
106 prec = precy + MAX(expx,MPFR_INT_CEIL_LOG2(precy)) + 8;
cos.c 138 mpfr_exp_t exps, cancel = 0, expx; local
165 expx = MPFR_GET_EXP (x);
166 MPFR_SMALL_INPUT_AFTER_SAVE_EXPO (y, __gmpfr_one, -2 * expx,
181 if (expx >= 3)
184 /* As expx + m - 1 will silently be converted into mpfr_prec_t
187 MPFR_ASSERTN (expx + m - 1 <= MPFR_PREC_MAX);
188 mpfr_init2 (c, expx + m - 1);
286 mpfr_set_prec (c, expx + m - 1);
cosu.c 33 mpfr_exp_t expx, expt, err, log2u, erra, errb; local
106 expx = MPFR_GET_EXP (xp);
109 erra = -2 * expx;
128 any failure in Ziv's strategy, thus we take into account expx too. */
129 prec = precy + MAX(expx,MPFR_INT_CEIL_LOG2 (precy)) + 8;
digamma.c 120 mpfr_exp_t e1, expv, expx, q; local
132 expx = MPFR_GET_EXP (x);
133 if (expx < 0)
134 q = MPFR_PREC(x) + 1 - expx;
135 else if (expx <= MPFR_PREC(x))
138 q = expx;
pow_si.c 83 mpfr_exp_t expx = MPFR_EXP (x) - 1, expy; local
85 /* Warning: n * expx may overflow!
99 * - If n = -1, then n * expx = - expx, which is representable
101 * - If expx = 0, then n * expx = 0, which is representable.
102 * - If n < -1 and expx > 0:
103 * + If expx > (__gmpfr_emin - 1) / n, then
104 * expx >= (__gmpfr_emin - 1) / n + 1
107 * n * expx < __gmpfr_emin - 1
    [all...]
exp_2.c 81 mpfr_exp_t exps, expx; local
94 expx = MPFR_GET_EXP (x);
104 if (MPFR_UNLIKELY(expx <= -2))
163 if (expx > 0)
164 q += expx;
pow.c 679 mpfr_exp_t err, expx, logt; local
683 expx = cmp_x_1 > 0 ? MPFR_EXP(x) : 1 - MPFR_EXP(x);
685 expx = mpfr_cmp_si (x, -1) > 0 ? 1 - MPFR_EXP(x) : MPFR_EXP(x);
686 MPFR_ASSERTD(expx >= 0);
687 /* now |log(x)| < expx */
688 logt = MPFR_INT_CEIL_LOG2 (expx);
689 /* now expx <= 2^logt */
sin_cos.c 35 mpfr_exp_t err, expx; local
72 expx = MPFR_GET_EXP (x);
79 if (expx < 0)
90 y, x, -2 * expx, 2, 0, rnd_mode,
98 z, __gmpfr_one, -2 * expx, 1, 0, rnd_mode,
111 z, __gmpfr_one, -2 * expx, 1, 0, rnd_mode,
119 y, x, -2 * expx, 2, 0, rnd_mode,
125 m += 2 * (-expx);
141 if (expx >= 2) /* reduce the argument */
144 MPFR_ASSERTN (expx + m - 1 <= MPFR_PREC_MAX)
    [all...]

Completed in 19 milliseconds