version 1.1.1.2, 2000/09/09 14:12:51 |
version 1.1.1.3, 2003/08/25 16:06:33 |
|
|
/* mpz/gcd.c: Calculate the greatest common divisor of two integers. |
/* mpz/gcd.c: Calculate the greatest common divisor of two integers. |
|
|
Copyright (C) 1991, 1993, 1994, 1996, 2000 Free Software Foundation, Inc. |
Copyright 1991, 1993, 1994, 1996, 2000, 2001, 2002 Free Software Foundation, |
|
Inc. |
|
|
This file is part of the GNU MP Library. |
This file is part of the GNU MP Library. |
|
|
Line 27 MA 02111-1307, USA. */ |
|
Line 28 MA 02111-1307, USA. */ |
|
#endif |
#endif |
|
|
|
|
#ifndef BERKELEY_MP |
|
void |
void |
#if __STDC__ |
#ifndef BERKELEY_MP |
mpz_gcd (mpz_ptr g, mpz_srcptr u, mpz_srcptr v) |
mpz_gcd (mpz_ptr g, mpz_srcptr u, mpz_srcptr v) |
#else |
|
mpz_gcd (g, u, v) |
|
mpz_ptr g; |
|
mpz_srcptr u; |
|
mpz_srcptr v; |
|
#endif |
|
#else /* BERKELEY_MP */ |
#else /* BERKELEY_MP */ |
void |
|
#if __STDC__ |
|
gcd (mpz_srcptr u, mpz_srcptr v, mpz_ptr g) |
gcd (mpz_srcptr u, mpz_srcptr v, mpz_ptr g) |
#else |
|
gcd (u, v, g) |
|
mpz_ptr g; |
|
mpz_srcptr u; |
|
mpz_srcptr v; |
|
#endif |
|
#endif /* BERKELEY_MP */ |
#endif /* BERKELEY_MP */ |
|
|
{ |
{ |
unsigned long int g_zero_bits, u_zero_bits, v_zero_bits; |
unsigned long int g_zero_bits, u_zero_bits, v_zero_bits; |
mp_size_t g_zero_limbs, u_zero_limbs, v_zero_limbs; |
mp_size_t g_zero_limbs, u_zero_limbs, v_zero_limbs; |
|
|
if (g_zero_bits != 0) |
if (g_zero_bits != 0) |
{ |
{ |
mp_limb_t cy_limb; |
mp_limb_t cy_limb; |
gsize += (vp[vsize - 1] >> (BITS_PER_MP_LIMB - g_zero_bits)) != 0; |
gsize += (vp[vsize - 1] >> (GMP_NUMB_BITS - g_zero_bits)) != 0; |
if (g->_mp_alloc < gsize) |
if (g->_mp_alloc < gsize) |
_mpz_realloc (g, gsize); |
_mpz_realloc (g, gsize); |
MPN_ZERO (g->_mp_d, g_zero_limbs); |
MPN_ZERO (g->_mp_d, g_zero_limbs); |