Home | History | Annotate | Line # | Download | only in mpz
tdiv_q_ui.c revision 1.1.1.1.8.1 
      1 /* mpz_tdiv_q_ui(quot, dividend, divisor_limb)
      2    -- Divide DIVIDEND by DIVISOR_LIMB and store the result in QUOT.
      3 
      4 Copyright 1991, 1993, 1994, 1996, 1998, 2001, 2002, 2004, 2012 Free Software
      5 Foundation, Inc.
      6 
      7 This file is part of the GNU MP Library.
      8 
      9 The GNU MP 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 MP 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 MP Library.  If not, see http://www.gnu.org/licenses/.  */
     21 
     22 #include "gmp.h"
     23 #include "gmp-impl.h"
     24 
     25 unsigned long int
     26 mpz_tdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor)
     27 {
     28   mp_size_t ns, nn, qn;
     29   mp_ptr np, qp;
     30   mp_limb_t rl;
     31 
     32   if (UNLIKELY (divisor == 0))
     33     DIVIDE_BY_ZERO;
     34 
     35   ns = SIZ(dividend);
     36   if (ns == 0)
     37     {
     38       SIZ(quot) = 0;
     39       return 0;
     40     }
     41 
     42   nn = ABS(ns);
     43   qp = MPZ_REALLOC (quot, nn);
     44   np = PTR(dividend);
     45 
     46 #if BITS_PER_ULONG > GMP_NUMB_BITS  /* avoid warnings about shift amount */
     47   if (divisor > GMP_NUMB_MAX)
     48     {
     49       mp_limb_t dp[2], rp[2];
     50 
     51       if (nn == 1)		/* tdiv_qr requirements; tested above for 0 */
     52 	{
     53 	  SIZ(quot) = 0;
     54 	  rl = np[0];
     55 	  return rl;
     56 	}
     57 
     58       dp[0] = divisor & GMP_NUMB_MASK;
     59       dp[1] = divisor >> GMP_NUMB_BITS;
     60       mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
     61       rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
     62       qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
     63     }
     64   else
     65 #endif
     66     {
     67       rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
     68       qn = nn - (qp[nn - 1] == 0);
     69     }
     70 
     71   SIZ(quot) = ns >= 0 ? qn : -qn;
     72   return rl;
     73 }
     74