14a238c70SJohn Marino /* mpfr_get_sj -- convert a MPFR number to a huge machine signed integer
24a238c70SJohn Marino
3*ab6d115fSJohn Marino Copyright 2004, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc.
4*ab6d115fSJohn Marino Contributed by the AriC and Caramel projects, INRIA.
54a238c70SJohn Marino
64a238c70SJohn Marino This file is part of the GNU MPFR Library.
74a238c70SJohn Marino
84a238c70SJohn Marino The GNU MPFR Library is free software; you can redistribute it and/or modify
94a238c70SJohn Marino it under the terms of the GNU Lesser General Public License as published by
104a238c70SJohn Marino the Free Software Foundation; either version 3 of the License, or (at your
114a238c70SJohn Marino option) any later version.
124a238c70SJohn Marino
134a238c70SJohn Marino The GNU MPFR Library is distributed in the hope that it will be useful, but
144a238c70SJohn Marino WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
154a238c70SJohn Marino or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
164a238c70SJohn Marino License for more details.
174a238c70SJohn Marino
184a238c70SJohn Marino You should have received a copy of the GNU Lesser General Public License
194a238c70SJohn Marino along with the GNU MPFR Library; see the file COPYING.LESSER. If not, see
204a238c70SJohn Marino http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
214a238c70SJohn Marino 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
224a238c70SJohn Marino
234a238c70SJohn Marino #ifdef HAVE_CONFIG_H
244a238c70SJohn Marino # include "config.h" /* for a build within gmp */
254a238c70SJohn Marino #endif
264a238c70SJohn Marino
274a238c70SJohn Marino #include "mpfr-intmax.h"
284a238c70SJohn Marino #include "mpfr-impl.h"
294a238c70SJohn Marino
304a238c70SJohn Marino #ifdef _MPFR_H_HAVE_INTMAX_T
314a238c70SJohn Marino
324a238c70SJohn Marino intmax_t
mpfr_get_sj(mpfr_srcptr f,mpfr_rnd_t rnd)334a238c70SJohn Marino mpfr_get_sj (mpfr_srcptr f, mpfr_rnd_t rnd)
344a238c70SJohn Marino {
354a238c70SJohn Marino intmax_t r;
364a238c70SJohn Marino mpfr_prec_t prec;
374a238c70SJohn Marino mpfr_t x;
384a238c70SJohn Marino
394a238c70SJohn Marino if (MPFR_UNLIKELY (!mpfr_fits_intmax_p (f, rnd)))
404a238c70SJohn Marino {
414a238c70SJohn Marino MPFR_SET_ERANGE ();
424a238c70SJohn Marino return MPFR_IS_NAN (f) ? 0 :
434a238c70SJohn Marino MPFR_IS_NEG (f) ? MPFR_INTMAX_MIN : MPFR_INTMAX_MAX;
444a238c70SJohn Marino }
454a238c70SJohn Marino
464a238c70SJohn Marino if (MPFR_IS_ZERO (f))
474a238c70SJohn Marino return (intmax_t) 0;
484a238c70SJohn Marino
494a238c70SJohn Marino /* determine the precision of intmax_t */
504a238c70SJohn Marino for (r = MPFR_INTMAX_MIN, prec = 0; r != 0; r /= 2, prec++)
514a238c70SJohn Marino { }
524a238c70SJohn Marino /* Note: though INTMAX_MAX would have been sufficient for the conversion,
534a238c70SJohn Marino we chose INTMAX_MIN so that INTMAX_MIN - 1 is always representable in
544a238c70SJohn Marino precision prec; this is useful to detect overflows in MPFR_RNDZ (will
554a238c70SJohn Marino be needed later). */
564a238c70SJohn Marino
574a238c70SJohn Marino /* Now, r = 0. */
584a238c70SJohn Marino
594a238c70SJohn Marino mpfr_init2 (x, prec);
604a238c70SJohn Marino mpfr_rint (x, f, rnd);
614a238c70SJohn Marino MPFR_ASSERTN (MPFR_IS_FP (x));
624a238c70SJohn Marino
634a238c70SJohn Marino if (MPFR_NOTZERO (x))
644a238c70SJohn Marino {
654a238c70SJohn Marino mp_limb_t *xp;
664a238c70SJohn Marino int sh, n; /* An int should be sufficient in this context. */
674a238c70SJohn Marino
684a238c70SJohn Marino xp = MPFR_MANT (x);
694a238c70SJohn Marino sh = MPFR_GET_EXP (x);
704a238c70SJohn Marino MPFR_ASSERTN ((mpfr_prec_t) sh <= prec);
714a238c70SJohn Marino if (MPFR_INTMAX_MIN + MPFR_INTMAX_MAX != 0
724a238c70SJohn Marino && MPFR_UNLIKELY ((mpfr_prec_t) sh == prec))
734a238c70SJohn Marino {
744a238c70SJohn Marino /* 2's complement and x <= INTMAX_MIN: in the case mp_limb_t
754a238c70SJohn Marino has the same size as intmax_t, we cannot use the code in
764a238c70SJohn Marino the for loop since the operations would be performed in
774a238c70SJohn Marino unsigned arithmetic. */
784a238c70SJohn Marino MPFR_ASSERTN (MPFR_IS_NEG (x) && (mpfr_powerof2_raw (x)));
794a238c70SJohn Marino r = MPFR_INTMAX_MIN;
804a238c70SJohn Marino }
814a238c70SJohn Marino else if (MPFR_IS_POS (x))
824a238c70SJohn Marino {
834a238c70SJohn Marino /* Note: testing the condition sh >= 0 is necessary to avoid
844a238c70SJohn Marino an undefined behavior on xp[n] >> S when S >= GMP_NUMB_BITS
854a238c70SJohn Marino (even though xp[n] == 0 in such a case). This can happen if
864a238c70SJohn Marino sizeof(mp_limb_t) < sizeof(intmax_t) and |x| is small enough
874a238c70SJohn Marino because of the trailing bits due to its normalization. */
884a238c70SJohn Marino for (n = MPFR_LIMB_SIZE (x) - 1; n >= 0 && sh >= 0; n--)
894a238c70SJohn Marino {
904a238c70SJohn Marino sh -= GMP_NUMB_BITS;
914a238c70SJohn Marino /* Note the concerning the casts below:
924a238c70SJohn Marino When sh >= 0, the cast must be performed before the shift
934a238c70SJohn Marino for the case sizeof(intmax_t) > sizeof(mp_limb_t).
944a238c70SJohn Marino When sh < 0, the cast must be performed after the shift
954a238c70SJohn Marino for the case sizeof(intmax_t) == sizeof(mp_limb_t), as
964a238c70SJohn Marino mp_limb_t is unsigned, therefore not representable as an
974a238c70SJohn Marino intmax_t when the MSB is 1 (this is the case here). */
984a238c70SJohn Marino MPFR_ASSERTD (sh < GMP_NUMB_BITS && -sh < GMP_NUMB_BITS);
994a238c70SJohn Marino r += (sh >= 0
1004a238c70SJohn Marino ? (intmax_t) xp[n] << sh
1014a238c70SJohn Marino : (intmax_t) (xp[n] >> (-sh)));
1024a238c70SJohn Marino }
1034a238c70SJohn Marino }
1044a238c70SJohn Marino else
1054a238c70SJohn Marino {
1064a238c70SJohn Marino /* See the comments for the case x positive. */
1074a238c70SJohn Marino for (n = MPFR_LIMB_SIZE (x) - 1; n >= 0 && sh >= 0; n--)
1084a238c70SJohn Marino {
1094a238c70SJohn Marino sh -= GMP_NUMB_BITS;
1104a238c70SJohn Marino MPFR_ASSERTD (sh < GMP_NUMB_BITS && -sh < GMP_NUMB_BITS);
1114a238c70SJohn Marino r -= (sh >= 0
1124a238c70SJohn Marino ? (intmax_t) xp[n] << sh
1134a238c70SJohn Marino : (intmax_t) (xp[n] >> (-sh)));
1144a238c70SJohn Marino }
1154a238c70SJohn Marino }
1164a238c70SJohn Marino }
1174a238c70SJohn Marino
1184a238c70SJohn Marino mpfr_clear (x);
1194a238c70SJohn Marino
1204a238c70SJohn Marino return r;
1214a238c70SJohn Marino }
1224a238c70SJohn Marino
1234a238c70SJohn Marino #endif
124