1 /* mpz_tdiv_q_ui(quot, dividend, divisor_limb)
2 -- Divide DIVIDEND by DIVISOR_LIMB and store the result in QUOT.
4 Copyright 1991, 1993, 1994, 1996, 1998, 2001, 2002, 2004 Free Software
7 This file is part of the GNU MP Library.
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.
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.
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/. */
26 mpz_tdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor)
43 MPZ_REALLOC (quot, nn);
47 #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
48 if (divisor > GMP_NUMB_MAX)
50 mp_limb_t dp[2], rp[2];
52 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
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; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
68 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
69 qn = nn - (qp[nn - 1] == 0);
72 SIZ(quot) = ns >= 0 ? qn : -qn;