Home | History | Annotate | Line # | Download | only in src 
      1 /* mpfr_set_ui_2exp -- set a MPFR number from a machine unsigned integer with
      2    a shift
      3 
      4 Copyright 2004, 2006-2023 Free Software Foundation, Inc.
      5 Contributed by the AriC and Caramba projects, INRIA.
      6 
      7 This file is part of the GNU MPFR Library.
      8 
      9 The GNU MPFR Library is free software; you can redistribute it and/or modify
     10 it under the terms of the GNU Lesser General Public License as published by
     11 the Free Software Foundation; either version 3 of the License, or (at your
     12 option) any later version.
     13 
     14 The GNU MPFR Library is distributed in the hope that it will be useful, but
     15 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
     16 or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
     17 License for more details.
     18 
     19 You should have received a copy of the GNU Lesser General Public License
     20 along with the GNU MPFR Library; see the file COPYING.LESSER.  If not, see
     21 https://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
     22 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
     23 
     24 #define MPFR_NEED_LONGLONG_H
     25 #include "mpfr-impl.h"
     26 
     27 MPFR_HOT_FUNCTION_ATTR int
     28 mpfr_set_ui_2exp (mpfr_ptr x, unsigned long i, mpfr_exp_t e, mpfr_rnd_t rnd_mode)
     29 {
     30   MPFR_SET_POS (x);
     31 
     32   if (MPFR_UNLIKELY (i == 0))
     33     {
     34       MPFR_SET_ZERO (x);
     35       MPFR_RET (0);
     36     }
     37   else
     38     {
     39 #ifdef MPFR_LONG_WITHIN_LIMB
     40       mp_size_t xn;
     41       int cnt, nbits;
     42       mp_limb_t *xp;
     43       int inex = 0;
     44 
     45       /* Early underflow/overflow checking is necessary to avoid
     46          integer overflow or errors due to special exponent values. */
     47       if (MPFR_UNLIKELY (e < __gmpfr_emin - (mpfr_exp_t)
     48                          (sizeof (unsigned long) * CHAR_BIT + 1)))
     49         return mpfr_underflow (x, rnd_mode == MPFR_RNDN ?
     50                                MPFR_RNDZ : rnd_mode, i < 0 ? -1 : 1);
     51       if (MPFR_UNLIKELY (e >= __gmpfr_emax))
     52         return mpfr_overflow (x, rnd_mode, i < 0 ? -1 : 1);
     53 
     54       MPFR_ASSERTD (i == (mp_limb_t) i);
     55 
     56       /* Position of the highest limb */
     57       xn = (MPFR_PREC (x) - 1) / GMP_NUMB_BITS;
     58       count_leading_zeros (cnt, (mp_limb_t) i);
     59       MPFR_ASSERTD (cnt < GMP_NUMB_BITS);  /* OK since i != 0 */
     60 
     61       xp = MPFR_MANT(x);
     62       xp[xn] = ((mp_limb_t) i) << cnt;
     63       /* Zero the xn lower limbs. */
     64       MPN_ZERO(xp, xn);
     65 
     66       nbits = GMP_NUMB_BITS - cnt;
     67       e += nbits;  /* exponent _before_ the rounding */
     68 
     69       /* round if MPFR_PREC(x) smaller than length of i */
     70       if (MPFR_UNLIKELY (MPFR_PREC (x) < nbits) &&
     71           MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, 0,
     72                                          MPFR_PREC (x), rnd_mode, &inex)))
     73         {
     74           e++;
     75           xp[xn] = MPFR_LIMB_HIGHBIT;
     76         }
     77 
     78       MPFR_EXP (x) = e;
     79       return mpfr_check_range (x, inex, rnd_mode);
     80 #else
     81       /* if a long does not fit into a limb, we use mpfr_set_z_2exp */
     82       mpz_t z;
     83       int inex;
     84 
     85       mpz_init_set_ui (z, i);
     86       inex = mpfr_set_z_2exp (x, z, e, rnd_mode);
     87       mpz_clear (z);
     88       return inex;
     89 #endif
     90     }
     91 }
     92