1 /* mpz_tdiv_qr_ui(quot,rem,dividend,short_divisor) --
2 Set QUOT to DIVIDEND / SHORT_DIVISOR
3 and REM to DIVIDEND mod SHORT_DIVISOR.
5 Copyright 1991, 1993, 1994, 1996, 1998, 2001, 2002, 2004 Free Software
8 This file is part of the GNU MP Library.
10 The GNU MP Library is free software; you can redistribute it and/or modify
11 it under the terms of the GNU Lesser General Public License as published by
12 the Free Software Foundation; either version 3 of the License, or (at your
13 option) any later version.
15 The GNU MP Library is distributed in the hope that it will be useful, but
16 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
18 License for more details.
20 You should have received a copy of the GNU Lesser General Public License
21 along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
27 mpz_tdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor)
45 MPZ_REALLOC (quot, nn);
49 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
50 if (divisor > GMP_NUMB_MAX)
56 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
60 SIZ(rem) = ns >= 0 ? 1 : -1;
68 dp[0] = divisor & GMP_NUMB_MASK;
69 dp[1] = divisor >> GMP_NUMB_BITS;
70 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
71 rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
72 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
73 rn = 2 - (rp[1] == 0); rn -= (rp[rn - 1] == 0);
74 SIZ(rem) = ns >= 0 ? rn : -rn;
79 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
84 /* Store the single-limb remainder. We don't check if there's space
85 for just one limb, since no function ever makes zero space. */
86 SIZ(rem) = ns >= 0 ? 1 : -1;
89 qn = nn - (qp[nn - 1] == 0);
92 SIZ(quot) = ns >= 0 ? qn : -qn;