version 1.1.1.1, 2000/01/10 15:35:27 |
version 1.1.1.3, 2003/08/25 16:06:34 |
|
|
Set QUOT to DIVIDEND / SHORT_DIVISOR |
Set QUOT to DIVIDEND / SHORT_DIVISOR |
and REM to DIVIDEND mod SHORT_DIVISOR. |
and REM to DIVIDEND mod SHORT_DIVISOR. |
|
|
Copyright (C) 1991, 1993, 1994, 1996 Free Software Foundation, Inc. |
Copyright 1991, 1993, 1994, 1996, 1998, 2001, 2002 Free Software Foundation, |
|
Inc. |
|
|
This file is part of the GNU MP Library. |
This file is part of the GNU MP Library. |
|
|
The GNU MP Library is free software; you can redistribute it and/or modify |
The GNU MP Library is free software; you can redistribute it and/or modify |
it under the terms of the GNU Library General Public License as published by |
it under the terms of the GNU Lesser General Public License as published by |
the Free Software Foundation; either version 2 of the License, or (at your |
the Free Software Foundation; either version 2.1 of the License, or (at your |
option) any later version. |
option) any later version. |
|
|
The GNU MP Library is distributed in the hope that it will be useful, but |
The GNU MP Library is distributed in the hope that it will be useful, but |
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public |
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public |
License for more details. |
License for more details. |
|
|
You should have received a copy of the GNU Library General Public License |
You should have received a copy of the GNU Lesser General Public License |
along with the GNU MP Library; see the file COPYING.LIB. If not, write to |
along with the GNU MP Library; see the file COPYING.LIB. If not, write to |
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, |
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, |
MA 02111-1307, USA. */ |
MA 02111-1307, USA. */ |
Line 24 MA 02111-1307, USA. */ |
|
Line 25 MA 02111-1307, USA. */ |
|
#include "gmp.h" |
#include "gmp.h" |
#include "gmp-impl.h" |
#include "gmp-impl.h" |
|
|
void |
unsigned long int |
#if __STDC__ |
|
mpz_tdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) |
mpz_tdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) |
#else |
|
mpz_tdiv_qr_ui (quot, rem, dividend, divisor) |
|
mpz_ptr quot; |
|
mpz_ptr rem; |
|
mpz_srcptr dividend; |
|
unsigned long int divisor; |
|
#endif |
|
{ |
{ |
mp_size_t dividend_size; |
mp_size_t ns, nn, qn; |
mp_size_t size; |
mp_ptr np, qp; |
mp_ptr quot_ptr; |
mp_limb_t rl; |
mp_limb_t remainder_limb; |
|
|
|
dividend_size = dividend->_mp_size; |
if (divisor == 0) |
size = ABS (dividend_size); |
DIVIDE_BY_ZERO; |
|
|
if (size == 0) |
ns = SIZ(dividend); |
|
if (ns == 0) |
{ |
{ |
quot->_mp_size = 0; |
SIZ(quot) = 0; |
rem->_mp_size = 0; |
SIZ(rem) = 0; |
return; |
return 0; |
} |
} |
|
|
/* No need for temporary allocation and copying if QUOT == DIVIDEND as |
nn = ABS(ns); |
the divisor is just one limb, and thus no intermediate remainders |
MPZ_REALLOC (quot, nn); |
need to be stored. */ |
qp = PTR(quot); |
|
np = PTR(dividend); |
|
|
if (quot->_mp_alloc < size) |
#if GMP_NAIL_BITS != 0 |
_mpz_realloc (quot, size); |
if (divisor > GMP_NUMB_MAX) |
|
{ |
|
mp_limb_t dp[2]; |
|
mp_ptr rp; |
|
mp_size_t rn; |
|
|
quot_ptr = quot->_mp_d; |
if (nn == 1) /* tdiv_qr requirements; tested above for 0 */ |
|
{ |
|
SIZ(quot) = 0; |
|
rl = np[0]; |
|
SIZ(rem) = ns >= 0 ? 1 : -1; |
|
PTR(rem)[0] = rl; |
|
return rl; |
|
} |
|
|
remainder_limb = mpn_divmod_1 (quot_ptr, dividend->_mp_d, size, |
MPZ_REALLOC (rem, 2); |
(mp_limb_t) divisor); |
rp = PTR(rem); |
|
|
if (remainder_limb == 0) |
dp[0] = divisor & GMP_NUMB_MASK; |
rem->_mp_size = 0; |
dp[1] = divisor >> GMP_NUMB_BITS; |
|
mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2); |
|
rl = rp[0] + (rp[1] << GMP_NUMB_BITS); |
|
qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0; |
|
rn = 2 - (rp[1] == 0); rn -= (rp[rn - 1] == 0); |
|
SIZ(rem) = ns >= 0 ? rn : -rn; |
|
} |
else |
else |
|
#endif |
{ |
{ |
/* Store the single-limb remainder. We don't check if there's space |
rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); |
for just one limb, since no function ever makes zero space. */ |
if (rl == 0) |
rem->_mp_size = dividend_size >= 0 ? 1 : -1; |
SIZ(rem) = 0; |
rem->_mp_d[0] = remainder_limb; |
else |
|
{ |
|
/* Store the single-limb remainder. We don't check if there's space |
|
for just one limb, since no function ever makes zero space. */ |
|
SIZ(rem) = ns >= 0 ? 1 : -1; |
|
PTR(rem)[0] = rl; |
|
} |
|
qn = nn - (qp[nn - 1] == 0); |
} |
} |
|
|
/* The quotient is SIZE limbs, but the most significant might be zero. */ |
SIZ(quot) = ns >= 0 ? qn : -qn; |
size -= quot_ptr[size - 1] == 0; |
return rl; |
quot->_mp_size = dividend_size >= 0 ? size : -size; |
|
} |
} |