1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/* mpfr_nextabove, mpfr_nextbelow, mpfr_nexttoward -- next representable
floating-point number
Copyright 1999, 2001, 2002, 2003 Free Software Foundation.
Contributed by the Spaces project, INRIA Lorraine.
This file is part of the MPFR Library.
The MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
The MPFR Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the MPFR Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include "gmp.h"
#include "gmp-impl.h"
#include "mpfr.h"
#include "mpfr-impl.h"
static void
mpfr_nexttozero (mpfr_ptr x)
{
if (MPFR_UNLIKELY(MPFR_IS_INF(x)))
{
MPFR_CLEAR_FLAGS(x);
mpfr_setmax (x, __gmpfr_emax);
return;
}
else if (MPFR_UNLIKELY( MPFR_IS_ZERO(x) ))
{
MPFR_CHANGE_SIGN(x);
mpfr_setmin (x, __gmpfr_emin);
}
else
{
mp_size_t xn;
int sh;
mp_limb_t *xp;
xn = 1 + (MPFR_PREC(x) - 1) / BITS_PER_MP_LIMB;
sh = (mp_prec_t) xn * BITS_PER_MP_LIMB - MPFR_PREC(x);
xp = MPFR_MANT(x);
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);
if (MPFR_UNLIKELY(exp == __gmpfr_emin))
MPFR_SET_ZERO(x);
else
{
mp_size_t i;
MPFR_SET_EXP (x, exp - 1);
xp[0] = MP_LIMB_T_MAX << sh;
for (i = 1; i < xn; i++)
xp[i] = MP_LIMB_T_MAX;
}
}
}
}
static void
mpfr_nexttoinf (mpfr_ptr x)
{
if (MPFR_UNLIKELY(MPFR_IS_INF(x)))
return;
else if (MPFR_UNLIKELY(MPFR_IS_ZERO(x)))
mpfr_setmin (x, __gmpfr_emin);
else
{
mp_size_t xn;
int sh;
mp_limb_t *xp;
xn = 1 + (MPFR_PREC(x) - 1) / BITS_PER_MP_LIMB;
sh = (mp_prec_t) xn * BITS_PER_MP_LIMB - MPFR_PREC(x);
xp = MPFR_MANT(x);
if (mpn_add_1 (xp, xp, xn, MP_LIMB_T_ONE << sh)) /* got 1.0000... */
{
mp_exp_t exp = MPFR_EXP (x);
if (MPFR_UNLIKELY(exp == __gmpfr_emax))
MPFR_SET_INF(x);
else
{
MPFR_SET_EXP (x, exp + 1);
xp[xn-1] = MPFR_LIMB_HIGHBIT;
}
}
}
}
void
mpfr_nextabove (mpfr_ptr x)
{
if (MPFR_UNLIKELY(MPFR_IS_NAN(x)))
{
__gmpfr_flags |= MPFR_FLAGS_NAN;
return;
}
if (MPFR_IS_NEG(x))
mpfr_nexttozero (x);
else
mpfr_nexttoinf (x);
}
void
mpfr_nextbelow (mpfr_ptr x)
{
if (MPFR_UNLIKELY(MPFR_IS_NAN(x)))
{
__gmpfr_flags |= MPFR_FLAGS_NAN;
return;
}
if (MPFR_IS_NEG(x))
mpfr_nexttoinf (x);
else
mpfr_nexttozero (x);
}
void
mpfr_nexttoward (mpfr_ptr x, mpfr_srcptr y)
{
int s;
if (MPFR_UNLIKELY(MPFR_IS_NAN(x) || MPFR_IS_NAN(y)))
{
__gmpfr_flags |= MPFR_FLAGS_NAN;
return;
}
s = mpfr_cmp (x, y);
if (s == 0)
return;
else if (s < 0)
mpfr_nextabove (x);
else
mpfr_nextbelow (x);
}
|
