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
|
/* mpfr_fits_intmax_p -- test whether an mpfr fits an intmax_t.
Copyright 2004, 2006-2021 Free Software Foundation, Inc.
Contributed by the AriC and Caramba projects, INRIA.
This file is part of the GNU MPFR Library.
The GNU 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 3 of the License, or (at your
option) any later version.
The GNU 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 GNU MPFR Library; see the file COPYING.LESSER. If not, see
https://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
#define MPFR_NEED_INTMAX_H
#include "mpfr-impl.h"
#ifdef _MPFR_H_HAVE_INTMAX_T
/* We can't use fits_s.h as it uses mpfr_cmp_si */
int
mpfr_fits_intmax_p (mpfr_srcptr f, mpfr_rnd_t rnd)
{
mpfr_flags_t saved_flags;
mpfr_exp_t e;
int prec;
mpfr_t x, y;
int neg;
int res;
if (MPFR_UNLIKELY (MPFR_IS_SINGULAR (f)))
/* Zero always fit */
return MPFR_IS_ZERO (f) ? 1 : 0;
/* now it fits if either
(a) MINIMUM <= f <= MAXIMUM
(b) or MINIMUM <= round(f, prec(slong), rnd) <= MAXIMUM */
e = MPFR_EXP (f);
if (e < 1)
return 1; /* |f| < 1: always fits */
neg = MPFR_IS_NEG (f);
/* let EXTREMUM be MAXIMUM if f > 0, and MINIMUM if f < 0 */
/* first compute prec(EXTREMUM), this could be done at configure time,
but the result can depend on neg (the loop is moved inside the "if"
to give the compiler a better chance to compute prec statically) */
if (neg)
{
uintmax_t s;
/* In C90, the division on negative integers isn't well-defined. */
s = SAFE_ABS (uintmax_t, INTMAX_MIN);
for (prec = 0; s != 0; s /= 2, prec ++);
}
else
{
intmax_t s;
s = INTMAX_MAX;
for (prec = 0; s != 0; s /= 2, prec ++);
}
/* EXTREMUM needs prec bits, i.e. 2^(prec-1) <= |EXTREMUM| < 2^prec */
/* if e <= prec - 1, then f < 2^(prec-1) <= |EXTREMUM| */
if (e <= prec - 1)
return 1;
/* if e >= prec + 1, then f >= 2^prec > |EXTREMUM| */
if (e >= prec + 1)
return 0;
MPFR_ASSERTD (e == prec);
/* hard case: first round to prec bits, then check */
saved_flags = __gmpfr_flags;
mpfr_init2 (x, prec);
/* for RNDF, it is necessary and sufficient to check it fits when rounding
away from zero */
mpfr_set (x, f, (rnd == MPFR_RNDF) ? MPFR_RNDA : rnd);
if (neg)
{
mpfr_init2 (y, prec);
mpfr_set_sj (y, INTMAX_MIN, MPFR_RNDN);
res = mpfr_cmp (x, y) >= 0;
mpfr_clear (y);
}
else
{
/* Warning! Due to the rounding, x can be an infinity. Here we use
the fact that singular numbers have a special exponent field,
thus well-defined and different from e, in which case this means
that the number does not fit. That's why we use MPFR_EXP, not
MPFR_GET_EXP. */
res = MPFR_EXP (x) == e;
}
mpfr_clear (x);
__gmpfr_flags = saved_flags;
return res;
}
#endif
|
