diff options
| author | vlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4> | 2003-05-22 21:39:40 +0000 |
|---|---|---|
| committer | vlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4> | 2003-05-22 21:39:40 +0000 |
| commit | 44b4dd94bb98c8d9e7850ae401232bd1b2ea3028 (patch) | |
| tree | 9670f0ef8017d42ad2a2062dc08c63c022e450c8 /sub_one_ulp.c | |
| parent | 2f3cb289a102043a22bd32c5950db37199fb3fd2 (diff) | |
| download | mpfr-44b4dd94bb98c8d9e7850ae401232bd1b2ea3028.tar.gz | |
Macros MPFR_EXP_INVALID (invalid exponent value) and MPFR_EXP_CHECK
added. Code update to use MPFR_GET_EXP and MPFR_SET_EXP instead of
MPFR_EXP to allow more bug detection related to special values.
Macros MPFR_SET_NAN, MPFR_SET_INF, MPFR_SET_ZERO and MPFR_INIT set
the exponent of the number to MPFR_EXP_INVALID if MPFR_EXP_CHECK
is defined. Compile with -DMPFR_EXP_CHECK and make check to see
the potential problems; currently, 40 of 76 tests fail.
git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/trunk@2301 280ebfd0-de03-0410-8827-d642c229c3f4
Diffstat (limited to 'sub_one_ulp.c')
| -rw-r--r-- | sub_one_ulp.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/sub_one_ulp.c b/sub_one_ulp.c index a14b35867..47b1e4bc8 100644 --- a/sub_one_ulp.c +++ b/sub_one_ulp.c @@ -1,6 +1,6 @@ /* mpfr_sub_one_ulp -- subtract one unit in last place -Copyright 1999, 2001, 2002 Free Software Foundation, Inc. +Copyright 1999, 2001, 2002, 2003 Free Software Foundation, Inc. This file is part of the MPFR Library. @@ -46,7 +46,7 @@ mpfr_sub_one_ulp(mpfr_ptr x, mp_rnd_t rnd_mode) mpn_sub_1 (xp, xp, xn, MP_LIMB_T_ONE << sh); if (xp[xn-1] >> (BITS_PER_MP_LIMB - 1) == 0) { /* was an exact power of two: not normalized any more */ - mp_exp_t exp = MPFR_EXP(x); + mp_exp_t exp = MPFR_GET_EXP (x); /* Note: In case of underflow and rounding to the nearest mode, x won't be changed. Beware of infinite loops! */ if (exp == __gmpfr_emin) @@ -54,7 +54,7 @@ mpfr_sub_one_ulp(mpfr_ptr x, mp_rnd_t rnd_mode) else { mp_size_t i; - MPFR_EXP(x)--; + MPFR_SET_EXP (x, exp - 1); xp[0] = (sh + 1 == BITS_PER_MP_LIMB) ? 0 : MP_LIMB_T_MAX << (sh + 1); for (i = 1; i < xn; i++) xp[i] = MP_LIMB_T_MAX; |