github.com/aergoio/aergo@v1.3.1/libtool/src/gmp-6.1.2/mpz/tdiv_r_2exp.c (about)

     1  /* mpz_tdiv_r_2exp -- Divide an integer by 2**CNT and produce a remainder.
     2  
     3  Copyright 1991, 1993-1995, 2001, 2002, 2012 Free Software Foundation, Inc.
     4  
     5  This file is part of the GNU MP Library.
     6  
     7  The GNU MP Library is free software; you can redistribute it and/or modify
     8  it under the terms of either:
     9  
    10    * the GNU Lesser General Public License as published by the Free
    11      Software Foundation; either version 3 of the License, or (at your
    12      option) any later version.
    13  
    14  or
    15  
    16    * the GNU General Public License as published by the Free Software
    17      Foundation; either version 2 of the License, or (at your option) any
    18      later version.
    19  
    20  or both in parallel, as here.
    21  
    22  The GNU MP Library is distributed in the hope that it will be useful, but
    23  WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
    24  or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    25  for more details.
    26  
    27  You should have received copies of the GNU General Public License and the
    28  GNU Lesser General Public License along with the GNU MP Library.  If not,
    29  see https://www.gnu.org/licenses/.  */
    30  
    31  #include "gmp.h"
    32  #include "gmp-impl.h"
    33  
    34  void
    35  mpz_tdiv_r_2exp (mpz_ptr res, mpz_srcptr in, mp_bitcnt_t cnt)
    36  {
    37    mp_size_t in_size = ABSIZ (in);
    38    mp_size_t res_size;
    39    mp_size_t limb_cnt = cnt / GMP_NUMB_BITS;
    40    mp_srcptr in_ptr = PTR (in);
    41  
    42    if (in_size > limb_cnt)
    43      {
    44        /* The input operand is (probably) greater than 2**CNT.  */
    45        mp_limb_t x;
    46  
    47        x = in_ptr[limb_cnt] & (((mp_limb_t) 1 << cnt % GMP_NUMB_BITS) - 1);
    48        if (x != 0)
    49  	{
    50  	  res_size = limb_cnt + 1;
    51  	  MPZ_REALLOC (res, res_size);
    52  
    53  	  PTR (res)[limb_cnt] = x;
    54  	}
    55        else
    56  	{
    57  	  res_size = limb_cnt;
    58  	  MPN_NORMALIZE (in_ptr, res_size);
    59  
    60  	  MPZ_REALLOC (res, res_size);
    61  
    62  	  limb_cnt = res_size;
    63  	}
    64      }
    65    else
    66      {
    67        /* The input operand is smaller than 2**CNT.  We perform a no-op,
    68  	 apart from that we might need to copy IN to RES.  */
    69        res_size = in_size;
    70        MPZ_REALLOC (res, res_size);
    71  
    72        limb_cnt = res_size;
    73      }
    74  
    75    if (res != in)
    76      MPN_COPY (PTR (res), PTR (in), limb_cnt);
    77    SIZ (res) = SIZ (in) >= 0 ? res_size : -res_size;
    78  }