mirror of
https://review.haiku-os.org/buildtools
synced 2025-02-23 06:07:41 +01:00
4c74403188
Change-Id: Iae65e95cfa0d92091b8b0a424ae36d88efa76aa9 Reviewed-on: https://review.haiku-os.org/c/buildtools/+/3020 Reviewed-by: Adrien Destugues <pulkomandy@gmail.com>
89 lines
2.2 KiB
C
89 lines
2.2 KiB
C
/* mpz_kronecker_ui -- mpz+ulong Kronecker/Jacobi symbol.
|
|
|
|
Copyright 1999-2002 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-impl.h"
|
|
#include "longlong.h"
|
|
|
|
|
|
int
|
|
mpz_kronecker_ui (mpz_srcptr a, unsigned long b)
|
|
{
|
|
mp_srcptr a_ptr;
|
|
mp_size_t a_size;
|
|
mp_limb_t a_rem;
|
|
int result_bit1;
|
|
|
|
a_size = SIZ(a);
|
|
if (a_size == 0)
|
|
return JACOBI_0U (b);
|
|
|
|
if (b > GMP_NUMB_MAX)
|
|
{
|
|
mp_limb_t blimbs[2];
|
|
mpz_t bz;
|
|
ALLOC(bz) = numberof (blimbs);
|
|
PTR(bz) = blimbs;
|
|
mpz_set_ui (bz, b);
|
|
return mpz_kronecker (a, bz);
|
|
}
|
|
|
|
a_ptr = PTR(a);
|
|
if ((b & 1) != 0)
|
|
{
|
|
result_bit1 = JACOBI_ASGN_SU_BIT1 (a_size, b);
|
|
}
|
|
else
|
|
{
|
|
mp_limb_t a_low = a_ptr[0];
|
|
int twos;
|
|
|
|
if (b == 0)
|
|
return JACOBI_LS0 (a_low, a_size); /* (a/0) */
|
|
|
|
if (! (a_low & 1))
|
|
return 0; /* (even/even)=0 */
|
|
|
|
/* (a/2)=(2/a) for a odd */
|
|
count_trailing_zeros (twos, b);
|
|
b >>= twos;
|
|
result_bit1 = (JACOBI_TWOS_U_BIT1 (twos, a_low)
|
|
^ JACOBI_ASGN_SU_BIT1 (a_size, b));
|
|
}
|
|
|
|
if (b == 1)
|
|
return JACOBI_BIT1_TO_PN (result_bit1); /* (a/1)=1 for any a */
|
|
|
|
a_size = ABS(a_size);
|
|
|
|
/* (a/b) = (a mod b / b) */
|
|
JACOBI_MOD_OR_MODEXACT_1_ODD (result_bit1, a_rem, a_ptr, a_size, b);
|
|
return mpn_jacobi_base (a_rem, (mp_limb_t) b, result_bit1);
|
|
}
|