1 /* mpz_fdiv_q_ui -- Division rounding the quotient towards -infinity. 2 The remainder gets the same sign as the denominator. 3 4 Copyright 1994, 1995, 1996, 1999, 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_fdiv_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 qp[0] = 0; 54 rl = np[0]; 55 qn = 1; /* a white lie, fixed below */ 56 } 57 else 58 { 59 dp[0] = divisor & GMP_NUMB_MASK; 60 dp[1] = divisor >> GMP_NUMB_BITS; 61 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); 62 rl = rp[0] + (rp[1] << GMP_NUMB_BITS); 63 qn = nn - 2 + 1; 64 } 65 66 if (rl != 0 && ns < 0) 67 { 68 mpn_incr_u (qp, (mp_limb_t) 1); 69 rl = divisor - rl; 70 } 71 72 qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0; 73 } 74 else 75 #endif 76 { 77 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); 78 79 if (rl != 0 && ns < 0) 80 { 81 mpn_incr_u (qp, (mp_limb_t) 1); 82 rl = divisor - rl; 83 } 84 85 qn = nn - (qp[nn - 1] == 0); 86 } 87 88 SIZ(quot) = ns >= 0 ? qn : -qn; 89 return rl; 90 } 91