14a238c70SJohn Marino /* mpfr_fits_intmax_p -- test whether an mpfr fits an intmax_t.
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 /* We can't use fits_s.h <= mpfr_cmp_ui */
334a238c70SJohn Marino int
mpfr_fits_intmax_p(mpfr_srcptr f,mpfr_rnd_t rnd)344a238c70SJohn Marino mpfr_fits_intmax_p (mpfr_srcptr f, mpfr_rnd_t rnd)
354a238c70SJohn Marino {
364a238c70SJohn Marino mpfr_exp_t e;
374a238c70SJohn Marino int prec;
384a238c70SJohn Marino mpfr_t x, y;
394a238c70SJohn Marino int neg;
404a238c70SJohn Marino int res;
414a238c70SJohn Marino
424a238c70SJohn Marino if (MPFR_UNLIKELY (MPFR_IS_SINGULAR (f)))
434a238c70SJohn Marino /* Zero always fit */
444a238c70SJohn Marino return MPFR_IS_ZERO (f) ? 1 : 0;
454a238c70SJohn Marino
464a238c70SJohn Marino /* now it fits if either
474a238c70SJohn Marino (a) MINIMUM <= f <= MAXIMUM
484a238c70SJohn Marino (b) or MINIMUM <= round(f, prec(slong), rnd) <= MAXIMUM */
494a238c70SJohn Marino
504a238c70SJohn Marino e = MPFR_EXP (f);
514a238c70SJohn Marino if (e < 1)
524a238c70SJohn Marino return 1; /* |f| < 1: always fits */
534a238c70SJohn Marino
544a238c70SJohn Marino neg = MPFR_IS_NEG (f);
554a238c70SJohn Marino
564a238c70SJohn Marino /* let EXTREMUM be MAXIMUM if f > 0, and MINIMUM if f < 0 */
574a238c70SJohn Marino
584a238c70SJohn Marino /* first compute prec(EXTREMUM), this could be done at configure time,
594a238c70SJohn Marino but the result can depend on neg (the loop is moved inside the "if"
604a238c70SJohn Marino to give the compiler a better chance to compute prec statically) */
614a238c70SJohn Marino if (neg)
624a238c70SJohn Marino {
634a238c70SJohn Marino uintmax_t s;
644a238c70SJohn Marino /* In C89, the division on negative integers isn't well-defined. */
654a238c70SJohn Marino s = SAFE_ABS (uintmax_t, MPFR_INTMAX_MIN);
664a238c70SJohn Marino for (prec = 0; s != 0; s /= 2, prec ++);
674a238c70SJohn Marino }
684a238c70SJohn Marino else
694a238c70SJohn Marino {
704a238c70SJohn Marino intmax_t s;
714a238c70SJohn Marino s = MPFR_INTMAX_MAX;
724a238c70SJohn Marino for (prec = 0; s != 0; s /= 2, prec ++);
734a238c70SJohn Marino }
744a238c70SJohn Marino
754a238c70SJohn Marino /* EXTREMUM needs prec bits, i.e. 2^(prec-1) <= |EXTREMUM| < 2^prec */
764a238c70SJohn Marino
774a238c70SJohn Marino /* if e <= prec - 1, then f < 2^(prec-1) <= |EXTREMUM| */
784a238c70SJohn Marino if (e <= prec - 1)
794a238c70SJohn Marino return 1;
804a238c70SJohn Marino
814a238c70SJohn Marino /* if e >= prec + 1, then f >= 2^prec > |EXTREMUM| */
824a238c70SJohn Marino if (e >= prec + 1)
834a238c70SJohn Marino return 0;
844a238c70SJohn Marino
854a238c70SJohn Marino MPFR_ASSERTD (e == prec);
864a238c70SJohn Marino
874a238c70SJohn Marino /* hard case: first round to prec bits, then check */
884a238c70SJohn Marino mpfr_init2 (x, prec);
894a238c70SJohn Marino mpfr_set (x, f, rnd);
904a238c70SJohn Marino
914a238c70SJohn Marino if (neg)
924a238c70SJohn Marino {
934a238c70SJohn Marino mpfr_init2 (y, prec);
944a238c70SJohn Marino mpfr_set_sj (y, MPFR_INTMAX_MIN, MPFR_RNDN);
954a238c70SJohn Marino res = mpfr_cmp (x, y) >= 0;
964a238c70SJohn Marino mpfr_clear (y);
974a238c70SJohn Marino }
984a238c70SJohn Marino else
994a238c70SJohn Marino {
1004a238c70SJohn Marino res = MPFR_GET_EXP (x) == e;
1014a238c70SJohn Marino }
1024a238c70SJohn Marino
1034a238c70SJohn Marino mpfr_clear (x);
1044a238c70SJohn Marino return res;
1054a238c70SJohn Marino }
1064a238c70SJohn Marino
1074a238c70SJohn Marino #endif
108