=================================================================== RCS file: /home/cvs/OpenXM_contrib/gmp/mpz/Attic/tdiv_qr_ui.c,v retrieving revision 1.1.1.2 retrieving revision 1.1.1.3 diff -u -p -r1.1.1.2 -r1.1.1.3 --- OpenXM_contrib/gmp/mpz/Attic/tdiv_qr_ui.c 2000/09/09 14:12:59 1.1.1.2 +++ OpenXM_contrib/gmp/mpz/Attic/tdiv_qr_ui.c 2003/08/25 16:06:34 1.1.1.3 @@ -2,7 +2,8 @@ Set QUOT to DIVIDEND / SHORT_DIVISOR and REM to DIVIDEND mod SHORT_DIVISOR. -Copyright (C) 1991, 1993, 1994, 1996, 1998 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. @@ -25,52 +26,71 @@ MA 02111-1307, USA. */ #include "gmp-impl.h" unsigned long int -#if __STDC__ 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 size; - mp_ptr quot_ptr; - mp_limb_t remainder_limb; + mp_size_t ns, nn, qn; + mp_ptr np, qp; + mp_limb_t rl; if (divisor == 0) DIVIDE_BY_ZERO; - dividend_size = dividend->_mp_size; - size = ABS (dividend_size); + ns = SIZ(dividend); + if (ns == 0) + { + SIZ(quot) = 0; + SIZ(rem) = 0; + return 0; + } - /* No need for temporary allocation and copying if QUOT == DIVIDEND as - the divisor is just one limb, and thus no intermediate remainders - need to be stored. */ + nn = ABS(ns); + MPZ_REALLOC (quot, nn); + qp = PTR(quot); + np = PTR(dividend); - if (quot->_mp_alloc < size) - _mpz_realloc (quot, size); +#if GMP_NAIL_BITS != 0 + 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, - (mp_limb_t) divisor); + MPZ_REALLOC (rem, 2); + rp = PTR(rem); - if (remainder_limb == 0) - rem->_mp_size = 0; + dp[0] = divisor & GMP_NUMB_MASK; + 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 +#endif { - /* Store the single-limb remainder. We don't check if there's space - for just one limb, since no function ever makes zero space. */ - rem->_mp_size = dividend_size >= 0 ? 1 : -1; - rem->_mp_d[0] = remainder_limb; + rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); + if (rl == 0) + SIZ(rem) = 0; + 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. */ - size -= size != 0 && quot_ptr[size - 1] == 0; - quot->_mp_size = dividend_size >= 0 ? size : -size; - - return remainder_limb; + SIZ(quot) = ns >= 0 ? qn : -qn; + return rl; }