1 /* mpz_cdiv_r_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, 2001, 2002, 2004, 2005 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_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor)
46 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
47 if (divisor > GMP_NUMB_MAX)
57 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
65 dp[0] = divisor & GMP_NUMB_MASK;
66 dp[1] = divisor >> GMP_NUMB_BITS;
67 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
68 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
70 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
73 if (rl != 0 && ns >= 0)
76 rp[0] = rl & GMP_NUMB_MASK;
77 rp[1] = rl >> GMP_NUMB_BITS;
80 rn = 1 + (rl > GMP_NUMB_MAX); rn -= (rp[rn - 1] == 0);
86 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);