tdiv_q_ui.c revision 1.1.1.1.8.1 1 1.1 mrg /* mpz_tdiv_q_ui(quot, dividend, divisor_limb)
2 1.1 mrg -- Divide DIVIDEND by DIVISOR_LIMB and store the result in QUOT.
3 1.1 mrg
4 1.1.1.1.8.1 tls Copyright 1991, 1993, 1994, 1996, 1998, 2001, 2002, 2004, 2012 Free Software
5 1.1 mrg Foundation, Inc.
6 1.1 mrg
7 1.1 mrg This file is part of the GNU MP Library.
8 1.1 mrg
9 1.1 mrg The GNU MP Library is free software; you can redistribute it and/or modify
10 1.1 mrg it under the terms of the GNU Lesser General Public License as published by
11 1.1 mrg the Free Software Foundation; either version 3 of the License, or (at your
12 1.1 mrg option) any later version.
13 1.1 mrg
14 1.1 mrg The GNU MP Library is distributed in the hope that it will be useful, but
15 1.1 mrg WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
16 1.1 mrg or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
17 1.1 mrg License for more details.
18 1.1 mrg
19 1.1 mrg You should have received a copy of the GNU Lesser General Public License
20 1.1 mrg along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
21 1.1 mrg
22 1.1 mrg #include "gmp.h"
23 1.1 mrg #include "gmp-impl.h"
24 1.1 mrg
25 1.1 mrg unsigned long int
26 1.1 mrg mpz_tdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor)
27 1.1 mrg {
28 1.1 mrg mp_size_t ns, nn, qn;
29 1.1 mrg mp_ptr np, qp;
30 1.1 mrg mp_limb_t rl;
31 1.1 mrg
32 1.1.1.1.8.1 tls if (UNLIKELY (divisor == 0))
33 1.1 mrg DIVIDE_BY_ZERO;
34 1.1 mrg
35 1.1 mrg ns = SIZ(dividend);
36 1.1 mrg if (ns == 0)
37 1.1 mrg {
38 1.1 mrg SIZ(quot) = 0;
39 1.1 mrg return 0;
40 1.1 mrg }
41 1.1 mrg
42 1.1 mrg nn = ABS(ns);
43 1.1.1.1.8.1 tls qp = MPZ_REALLOC (quot, nn);
44 1.1 mrg np = PTR(dividend);
45 1.1 mrg
46 1.1 mrg #if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
47 1.1 mrg if (divisor > GMP_NUMB_MAX)
48 1.1 mrg {
49 1.1 mrg mp_limb_t dp[2], rp[2];
50 1.1 mrg
51 1.1 mrg if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
52 1.1 mrg {
53 1.1 mrg SIZ(quot) = 0;
54 1.1 mrg rl = np[0];
55 1.1 mrg return rl;
56 1.1 mrg }
57 1.1 mrg
58 1.1 mrg dp[0] = divisor & GMP_NUMB_MASK;
59 1.1 mrg dp[1] = divisor >> GMP_NUMB_BITS;
60 1.1 mrg mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
61 1.1 mrg rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
62 1.1 mrg qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
63 1.1 mrg }
64 1.1 mrg else
65 1.1 mrg #endif
66 1.1 mrg {
67 1.1 mrg rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
68 1.1 mrg qn = nn - (qp[nn - 1] == 0);
69 1.1 mrg }
70 1.1 mrg
71 1.1 mrg SIZ(quot) = ns >= 0 ? qn : -qn;
72 1.1 mrg return rl;
73 1.1 mrg }
74