14a238c70SJohn Marino /* mpfr_mul_2ui -- multiply a floating-point number by a power of two
24a238c70SJohn Marino
3*ab6d115fSJohn Marino Copyright 1999, 2001, 2002, 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 int
mpfr_mul_2ui(mpfr_ptr y,mpfr_srcptr x,unsigned long int n,mpfr_rnd_t rnd_mode)264a238c70SJohn Marino mpfr_mul_2ui (mpfr_ptr y, mpfr_srcptr x, unsigned long int n, mpfr_rnd_t rnd_mode)
274a238c70SJohn Marino {
284a238c70SJohn Marino int inexact;
294a238c70SJohn Marino
304a238c70SJohn Marino MPFR_LOG_FUNC
314a238c70SJohn Marino (("x[%Pu]=%.*Rg n=%lu rnd=%d",
324a238c70SJohn Marino mpfr_get_prec (x), mpfr_log_prec, x, n, rnd_mode),
334a238c70SJohn Marino ("y[%Pu]=%.*Rg inexact=%d",
344a238c70SJohn Marino mpfr_get_prec (y), mpfr_log_prec, y, inexact));
354a238c70SJohn Marino
364a238c70SJohn Marino inexact = MPFR_UNLIKELY(y != x) ? mpfr_set (y, x, rnd_mode) : 0;
374a238c70SJohn Marino
384a238c70SJohn Marino if (MPFR_LIKELY( MPFR_IS_PURE_FP(y)) )
394a238c70SJohn Marino {
404a238c70SJohn Marino /* n will have to be casted to long to make sure that the addition
414a238c70SJohn Marino and subtraction below (for overflow detection) are signed */
424a238c70SJohn Marino while (MPFR_UNLIKELY(n > LONG_MAX))
434a238c70SJohn Marino {
444a238c70SJohn Marino int inex2;
454a238c70SJohn Marino
464a238c70SJohn Marino n -= LONG_MAX;
474a238c70SJohn Marino inex2 = mpfr_mul_2ui(y, y, LONG_MAX, rnd_mode);
484a238c70SJohn Marino if (inex2)
494a238c70SJohn Marino return inex2; /* overflow */
504a238c70SJohn Marino }
514a238c70SJohn Marino
524a238c70SJohn Marino /* MPFR_EMIN_MIN + (long) n is signed and doesn't lead to an overflow;
534a238c70SJohn Marino the first test useful so that the real test can't lead to an
544a238c70SJohn Marino overflow. */
554a238c70SJohn Marino {
564a238c70SJohn Marino mpfr_exp_t exp = MPFR_GET_EXP (y);
574a238c70SJohn Marino if (MPFR_UNLIKELY( __gmpfr_emax < MPFR_EMIN_MIN + (long) n ||
584a238c70SJohn Marino exp > __gmpfr_emax - (long) n))
594a238c70SJohn Marino return mpfr_overflow (y, rnd_mode, MPFR_SIGN(y));
604a238c70SJohn Marino
614a238c70SJohn Marino MPFR_SET_EXP (y, exp + (long) n);
624a238c70SJohn Marino }
634a238c70SJohn Marino }
644a238c70SJohn Marino
654a238c70SJohn Marino return inexact;
664a238c70SJohn Marino }
67