1
/* mpz_divexact -- finds quotient when known that quot * den == num && den != 0.
3
Copyright 1991, 1993, 1994, 1995, 1996, 1997, 1998, 2000, 2001 Free Software
6
This file is part of the GNU MP Library.
8
The GNU MP Library is free software; you can redistribute it and/or modify
9
it under the terms of the GNU Lesser General Public License as published by
10
the Free Software Foundation; either version 2.1 of the License, or (at your
11
option) any later version.
13
The GNU MP Library is distributed in the hope that it will be useful, but
14
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
16
License for more details.
18
You should have received a copy of the GNU Lesser General Public License
19
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
20
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
21
MA 02111-1307, USA. */
23
/* Ken Weber (kweber@mat.ufrgs.br, kweber@mcs.kent.edu)
25
Funding for this work has been partially provided by Conselho Nacional
26
de Desenvolvimento Cienti'fico e Tecnolo'gico (CNPq) do Brazil, Grant
27
301314194-2, and was done while I was a visiting reseacher in the Instituto
28
de Matema'tica at Universidade Federal do Rio Grande do Sul (UFRGS).
31
T. Jebelean, An algorithm for exact division, Journal of Symbolic
32
Computation, v. 15, 1993, pp. 169-180. */
39
mpz_divexact (mpz_ptr quot, mpz_srcptr num, mpz_srcptr den)
42
mp_size_t qsize, tsize;
44
mp_size_t nsize, dsize;
47
nsize = ABS (num->_mp_size);
48
dsize = ABS (den->_mp_size);
50
qsize = nsize - dsize + 1;
51
if (quot->_mp_alloc < qsize)
52
_mpz_realloc (quot, qsize);
70
MPN_DIVREM_OR_DIVEXACT_1 (qp, np, nsize, dp[0]);
71
qsize -= qp[qsize - 1] == 0;
72
quot->_mp_size = (num->_mp_size ^ den->_mp_size) >= 0 ? qsize : -qsize;
76
/* Generate divide-by-zero error since dsize == 0. */
82
/* QUOT <-- NUM/2^r, T <-- DEN/2^r where = r number of twos in DEN. */
84
np += 1, nsize -= 1, dp += 1, dsize -= 1;
85
tsize = MIN (qsize, dsize);
88
if (quot == den) /* QUOT and DEN overlap. */
90
tp = (mp_ptr) TMP_ALLOC (tsize * BYTES_PER_MP_LIMB);
91
MPN_COPY (tp, dp, tsize);
96
MPN_COPY_INCR (qp, np, qsize);
101
tp = (mp_ptr) TMP_ALLOC (tsize * BYTES_PER_MP_LIMB);
102
count_trailing_zeros (r, dp[0]);
103
mpn_rshift (tp, dp, tsize, r);
105
tp[tsize - 1] |= dp[tsize] << (BITS_PER_MP_LIMB - r);
106
mpn_rshift (qp, np, qsize, r);
108
qp[qsize - 1] |= np[qsize] << (BITS_PER_MP_LIMB - r);
111
/* Now QUOT <-- QUOT/T. */
112
mpn_bdivmod (qp, qp, qsize, tp, tsize, qsize * BITS_PER_MP_LIMB);
113
MPN_NORMALIZE (qp, qsize);
115
quot->_mp_size = (num->_mp_size ^ den->_mp_size) >= 0 ? qsize : -qsize;