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
|
/* mpfr_get_sj -- convert a MPFR number to a huge machine signed integer
Copyright 2004 Free Software Foundation, Inc.
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. */
#if HAVE_CONFIG_H
# include "config.h" /* for a build within gmp */
#endif
#ifdef HAVE_STDINT_H
# include <stdint.h>
#endif
#ifdef HAVE_INTTYPES_H
# include <inttypes.h>
#endif
#include "mpfr-impl.h"
#ifdef _MPFR_H_HAVE_INTMAX_T
intmax_t
mpfr_get_sj (mpfr_srcptr f, mpfr_rnd_t rnd)
{
intmax_t r;
mp_prec_t prec;
mpfr_t x;
/* determine the precision of intmax_t */
for (r = INTMAX_MIN, prec = 0; r != 0; r /= 2, prec++)
{ }
/* Note: though INTMAX_MAX would have been sufficient for the conversion,
we chose INTMAX_MIN so that INTMAX_MIN - 1 is always representable in
precision prec; this is useful to detect overflows in GMP_RNDZ (will
be needed later). */
/* Now, r = 0. */
mpfr_init2 (x, prec);
mpfr_rint (x, f, rnd);
MPFR_ASSERTN (MPFR_IS_FP (x));
if (MPFR_NOTZERO (x))
{
mp_limb_t *xp;
int sh, n; /* An int should be sufficient in this context. */
xp = MPFR_MANT (x);
sh = MPFR_GET_EXP (x);
MPFR_ASSERTN (sh <= prec);
if (INTMAX_MIN + INTMAX_MAX != 0 && MPFR_UNLIKELY (sh == prec))
{ /* 2's complement and x <= INTMAX_MIN: in the case mp_limb_t
has the same size as intmax_t, we cannot use the code in
the for loop since the operations would be performed in
unsigned arithmetic. */
MPFR_ASSERTN (MPFR_IS_NEG (x) && (mpfr_powerof2_raw (x)));
r = INTMAX_MIN;
}
else if (MPFR_IS_POS (x))
{
for (n = MPFR_LIMB_SIZE(x) - 1; n >= 0; n--)
{
sh -= BITS_PER_MP_LIMB;
r += sh >= 0 ? (intmax_t) xp[n] << sh
: (intmax_t) xp[n] >> (- sh);
}
}
else
{
for (n = MPFR_LIMB_SIZE(x) - 1; n >= 0; n--)
{
sh -= BITS_PER_MP_LIMB;
r -= sh >= 0 ? (intmax_t) xp[n] << sh
: (intmax_t) xp[n] >> (- sh);
}
}
}
mpfr_clear (x);
return r;
}
#endif
|
