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
6 Copyright 1994, 1995, 1996, 1999, 2001, 2002, 2004 Free Software Foundation,
9 This file is part of the GNU MP Library.
11 The GNU MP Library is free software; you can redistribute it and/or modify
12 it under the terms of the GNU Lesser General Public License as published by
13 the Free Software Foundation; either version 3 of the License, or (at your
14 option) any later version.
16 The GNU MP Library is distributed in the hope that it will be useful, but
17 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
18 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
19 License for more details.
21 You should have received a copy of the GNU Lesser General Public License
22 along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
28 mpz_cdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor)
46 MPZ_REALLOC (quot, nn);
50 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
51 if (divisor > GMP_NUMB_MAX)
60 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
63 qn = 1; /* a white lie, fixed below */
69 dp[0] = divisor & GMP_NUMB_MASK;
70 dp[1] = divisor >> GMP_NUMB_BITS;
71 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
72 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
76 if (rl != 0 && ns >= 0)
78 mpn_incr_u (qp, (mp_limb_t) 1);
80 rp[0] = rl & GMP_NUMB_MASK;
81 rp[1] = rl >> GMP_NUMB_BITS;
84 qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
85 rn = 1 + (rl > GMP_NUMB_MAX); rn -= (rp[rn - 1] == 0);
91 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
98 mpn_incr_u (qp, (mp_limb_t) 1);
103 SIZ(rem) = -(rl != 0);
105 qn = nn - (qp[nn - 1] == 0);
108 SIZ(quot) = ns >= 0 ? qn : -qn;