1
/* mpn_gcd_1 -- mpn and limb greatest common divisor.
3
Copyright 1994, 1996, 2000, 2001 Free Software Foundation, Inc.
5
This file is part of the GNU MP Library.
7
The GNU MP Library is free software; you can redistribute it and/or modify
8
it under the terms of the GNU Lesser General Public License as published by
9
the Free Software Foundation; either version 2.1 of the License, or (at your
10
option) any later version.
12
The GNU MP Library is distributed in the hope that it will be useful, but
13
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
15
License for more details.
17
You should have received a copy of the GNU Lesser General Public License
18
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
19
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
20
MA 02111-1307, USA. */
27
/* Does not work for U == 0 or V == 0. It would be tough to make it work for
28
V == 0 since gcd(x,0) = x, and U does not generally fit in an mp_limb_t.
30
The threshold for doing u%v when size==1 will vary by CPU according to
31
the speed of a division and the code generated for the main loop. Any
32
tuning for this is left to a CPU specific implementation. */
35
mpn_gcd_1 (mp_srcptr up, mp_size_t size, mp_limb_t vlimb)
38
unsigned long zero_bits, u_low_zero_bits;
42
ASSERT_MPN_NONZERO_P (up, size);
46
/* Need vlimb odd for modexact, want it odd to get common zeros. */
47
count_trailing_zeros (zero_bits, vlimb);
52
/* Must get common zeros before the mod reduction. If ulimb==0 then
53
vlimb already gives the common zeros. */
56
count_trailing_zeros (u_low_zero_bits, ulimb);
57
zero_bits = MIN (zero_bits, u_low_zero_bits);
60
ulimb = MPN_MOD_OR_MODEXACT_1_ODD (up, size, vlimb);
67
/* size==1, so up[0]!=0 */
68
count_trailing_zeros (u_low_zero_bits, ulimb);
69
ulimb >>= u_low_zero_bits;
70
zero_bits = MIN (zero_bits, u_low_zero_bits);
74
MP_LIMB_T_SWAP (ulimb, vlimb);
76
/* if u is much bigger than v, reduce using a division rather than
77
chipping away at it bit-by-bit */
78
if ((ulimb >> 16) > vlimb)
86
while (ulimb != vlimb)
101
while ((ulimb & 1) == 0);
103
else /* vlimb > ulimb. */
111
while ((vlimb & 1) == 0);
116
return vlimb << zero_bits;