mirror of
https://review.haiku-os.org/buildtools
synced 2025-02-07 14:34:51 +01:00
f133d007f9
Old version was from 2012-05-06, 6.1.2 is from 2016-12-16 A lot of support for newer processors and speedups since then See gmp/NEWS for details
100 lines
2.5 KiB
C
100 lines
2.5 KiB
C
/* mpz_tdiv_r_ui(rem, dividend, divisor_limb)
|
|
-- Set REM to DIVDEND mod DIVISOR_LIMB.
|
|
|
|
Copyright 1991, 1993, 1994, 1996, 1998, 2001, 2002, 2004, 2005, 2012 Free
|
|
Software Foundation, Inc.
|
|
|
|
This file is part of the GNU MP Library.
|
|
|
|
The GNU MP Library is free software; you can redistribute it and/or modify
|
|
it under the terms of either:
|
|
|
|
* the GNU Lesser General Public License as published by the Free
|
|
Software Foundation; either version 3 of the License, or (at your
|
|
option) any later version.
|
|
|
|
or
|
|
|
|
* the GNU General Public License as published by the Free Software
|
|
Foundation; either version 2 of the License, or (at your option) any
|
|
later version.
|
|
|
|
or both in parallel, as here.
|
|
|
|
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
|
|
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
for more details.
|
|
|
|
You should have received copies of the GNU General Public License and the
|
|
GNU Lesser General Public License along with the GNU MP Library. If not,
|
|
see https://www.gnu.org/licenses/. */
|
|
|
|
#include "gmp.h"
|
|
#include "gmp-impl.h"
|
|
|
|
unsigned long int
|
|
mpz_tdiv_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor)
|
|
{
|
|
mp_size_t ns, nn;
|
|
mp_ptr np;
|
|
mp_limb_t rl;
|
|
|
|
if (UNLIKELY (divisor == 0))
|
|
DIVIDE_BY_ZERO;
|
|
|
|
ns = SIZ(dividend);
|
|
if (ns == 0)
|
|
{
|
|
SIZ(rem) = 0;
|
|
return 0;
|
|
}
|
|
|
|
nn = ABS(ns);
|
|
np = PTR(dividend);
|
|
#if BITS_PER_ULONG > GMP_NUMB_BITS /* avoid warnings about shift amount */
|
|
if (divisor > GMP_NUMB_MAX)
|
|
{
|
|
mp_limb_t dp[2];
|
|
mp_ptr rp, qp;
|
|
mp_size_t rn;
|
|
TMP_DECL;
|
|
|
|
if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
|
|
{
|
|
rl = np[0];
|
|
SIZ(rem) = ns >= 0 ? 1 : -1;
|
|
PTR(rem)[0] = rl;
|
|
return rl;
|
|
}
|
|
|
|
rp = MPZ_REALLOC (rem, 2);
|
|
|
|
TMP_MARK;
|
|
dp[0] = divisor & GMP_NUMB_MASK;
|
|
dp[1] = divisor >> GMP_NUMB_BITS;
|
|
qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
|
|
mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
|
|
TMP_FREE;
|
|
rl = rp[0] + (rp[1] << GMP_NUMB_BITS);
|
|
rn = 2 - (rp[1] == 0); rn -= (rp[rn - 1] == 0);
|
|
SIZ(rem) = ns >= 0 ? rn : -rn;
|
|
}
|
|
else
|
|
#endif
|
|
{
|
|
rl = mpn_mod_1 (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;
|
|
}
|
|
}
|
|
|
|
return rl;
|
|
}
|