Home | History | Annotate | Line # | Download | only in mpz 
      1 /* mpz_cdiv_qr_ui -- Division rounding the quotient towards +infinity.  The
      2    remainder gets the opposite sign as the denominator.  In order to make it
      3    always fit into the return type, the negative of the true remainder is
      4    returned.
      5 
      6 Copyright 1994-1996, 1999, 2001, 2002, 2004, 2012, 2015 Free Software
      7 Foundation, Inc.
      8 
      9 This file is part of the GNU MP Library.
     10 
     11 The GNU MP Library is free software; you can redistribute it and/or modify
     12 it under the terms of either:
     13 
     14   * the GNU Lesser General Public License as published by the Free
     15     Software Foundation; either version 3 of the License, or (at your
     16     option) any later version.
     17 
     18 or
     19 
     20   * the GNU General Public License as published by the Free Software
     21     Foundation; either version 2 of the License, or (at your option) any
     22     later version.
     23 
     24 or both in parallel, as here.
     25 
     26 The GNU MP Library is distributed in the hope that it will be useful, but
     27 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
     28 or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
     29 for more details.
     30 
     31 You should have received copies of the GNU General Public License and the
     32 GNU Lesser General Public License along with the GNU MP Library.  If not,
     33 see https://www.gnu.org/licenses/.  */
     34 
     35 #include "gmp-impl.h"
     36 
     37 unsigned long int
     38 mpz_cdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor)
     39 {
     40   mp_size_t ns, nn, qn;
     41   mp_ptr np, qp;
     42   mp_limb_t rl;
     43 
     44   if (UNLIKELY (divisor == 0))
     45     DIVIDE_BY_ZERO;
     46 
     47   ns = SIZ(dividend);
     48   if (ns == 0)
     49     {
     50       SIZ(quot) = 0;
     51       SIZ(rem) = 0;
     52       return 0;
     53     }
     54 
     55   nn = ABS(ns);
     56   qp = MPZ_REALLOC (quot, nn);
     57   np = PTR(dividend);
     58 
     59 #if BITS_PER_ULONG > GMP_NUMB_BITS  /* avoid warnings about shift amount */
     60   if (divisor > GMP_NUMB_MAX)
     61     {
     62       mp_limb_t dp[2];
     63       mp_ptr rp;
     64       mp_size_t rn;
     65 
     66       rp = MPZ_REALLOC (rem, 2);
     67 
     68       if (nn == 1)		/* tdiv_qr requirements; tested above for 0 */
     69 	{
     70 	  qp[0] = 0;
     71 	  qn = 1;		/* a white lie, fixed below */
     72 	  rl = np[0];
     73 	  rp[0] = rl;
     74 	}
     75       else
     76 	{
     77 	  dp[0] = divisor & GMP_NUMB_MASK;
     78 	  dp[1] = divisor >> GMP_NUMB_BITS;
     79 	  mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
     80 	  rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
     81 	  qn = nn - 2 + 1;
     82 	}
     83 
     84       if (rl != 0 && ns >= 0)
     85 	{
     86 	  mpn_incr_u (qp, (mp_limb_t) 1);
     87 	  rl = divisor - rl;
     88 	  rp[0] = rl & GMP_NUMB_MASK;
     89 	  rp[1] = rl >> GMP_NUMB_BITS;
     90 	}
     91 
     92       qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
     93       rn = 1 + (rl > GMP_NUMB_MAX);  rn -= (rp[rn - 1] == 0);
     94       SIZ(rem) = -rn;
     95     }
     96   else
     97 #endif
     98     {
     99       rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
    100       if (rl == 0)
    101 	SIZ(rem) = 0;
    102       else
    103 	{
    104 	  if (ns >= 0)
    105 	    {
    106 	      mpn_incr_u (qp, (mp_limb_t) 1);
    107 	      rl = divisor - rl;
    108 	    }
    109 
    110 	  MPZ_NEWALLOC (rem, 1)[0] = rl;
    111 	  SIZ(rem) = -(rl != 0);
    112 	}
    113       qn = nn - (qp[nn - 1] == 0);
    114     }
    115 
    116   SIZ(quot) = ns >= 0 ? qn : -qn;
    117   return rl;
    118 }
    119