14a238c70SJohn Marino /* mpfr_fits_*_p -- test whether an mpfr fits a C signed type.
24a238c70SJohn Marino
3*ab6d115fSJohn Marino Copyright 2003, 2004, 2005, 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 #include "mpfr-impl.h"
244a238c70SJohn Marino
254a238c70SJohn Marino /* The original version of this file came from GMP's mpf/fits_s.h;
264a238c70SJohn Marino it has been adapted for MPFR. In particular, the result can be
274a238c70SJohn Marino rounded away from zero. */
284a238c70SJohn Marino
294a238c70SJohn Marino int
FUNCTION(mpfr_srcptr f,mpfr_rnd_t rnd)304a238c70SJohn Marino FUNCTION (mpfr_srcptr f, mpfr_rnd_t rnd)
314a238c70SJohn Marino {
324a238c70SJohn Marino mpfr_exp_t e;
334a238c70SJohn Marino int prec;
344a238c70SJohn Marino mpfr_t x;
354a238c70SJohn Marino int neg;
364a238c70SJohn Marino int res;
374a238c70SJohn Marino
384a238c70SJohn Marino if (MPFR_UNLIKELY (MPFR_IS_SINGULAR (f)))
394a238c70SJohn Marino /* Zero always fit */
404a238c70SJohn Marino return MPFR_IS_ZERO (f) ? 1 : 0;
414a238c70SJohn Marino
424a238c70SJohn Marino /* now it fits if either
434a238c70SJohn Marino (a) MINIMUM <= f <= MAXIMUM
444a238c70SJohn Marino (b) or MINIMUM <= round(f, prec(slong), rnd) <= MAXIMUM */
454a238c70SJohn Marino
464a238c70SJohn Marino e = MPFR_GET_EXP (f);
474a238c70SJohn Marino if (e < 1)
484a238c70SJohn Marino return 1; /* |f| < 1: always fits */
494a238c70SJohn Marino
504a238c70SJohn Marino neg = MPFR_IS_NEG (f);
514a238c70SJohn Marino
524a238c70SJohn Marino /* let EXTREMUM be MAXIMUM if f > 0, and MINIMUM if f < 0 */
534a238c70SJohn Marino
544a238c70SJohn Marino /* first compute prec(EXTREMUM), this could be done at configure time,
554a238c70SJohn Marino but the result can depend on neg (the loop is moved inside the "if"
564a238c70SJohn Marino to give the compiler a better chance to compute prec statically) */
574a238c70SJohn Marino if (neg)
584a238c70SJohn Marino {
594a238c70SJohn Marino unsigned TYPE s;
604a238c70SJohn Marino /* In C89, the division on negative integers isn't well-defined. */
614a238c70SJohn Marino s = SAFE_ABS (unsigned TYPE, MINIMUM);
624a238c70SJohn Marino for (prec = 0; s != 0; s /= 2, prec ++);
634a238c70SJohn Marino }
644a238c70SJohn Marino else
654a238c70SJohn Marino {
664a238c70SJohn Marino TYPE s;
674a238c70SJohn Marino s = MAXIMUM;
684a238c70SJohn Marino for (prec = 0; s != 0; s /= 2, prec ++);
694a238c70SJohn Marino }
704a238c70SJohn Marino
714a238c70SJohn Marino /* EXTREMUM needs prec bits, i.e. 2^(prec-1) <= |EXTREMUM| < 2^prec */
724a238c70SJohn Marino
734a238c70SJohn Marino /* if e <= prec - 1, then f < 2^(prec-1) <= |EXTREMUM| */
744a238c70SJohn Marino if (e <= prec - 1)
754a238c70SJohn Marino return 1;
764a238c70SJohn Marino
774a238c70SJohn Marino /* if e >= prec + 1, then f >= 2^prec > |EXTREMUM| */
784a238c70SJohn Marino if (e >= prec + 1)
794a238c70SJohn Marino return 0;
804a238c70SJohn Marino
814a238c70SJohn Marino MPFR_ASSERTD (e == prec);
824a238c70SJohn Marino
834a238c70SJohn Marino /* hard case: first round to prec bits, then check */
844a238c70SJohn Marino mpfr_init2 (x, prec);
854a238c70SJohn Marino mpfr_set (x, f, rnd);
864a238c70SJohn Marino res = neg ? (mpfr_cmp_si (x, MINIMUM) >= 0) : (MPFR_GET_EXP (x) == e);
874a238c70SJohn Marino mpfr_clear (x);
884a238c70SJohn Marino return res;
894a238c70SJohn Marino }
90