1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/* mpz_gcd_ui -- Calculate the greatest common divisior of two integers.
Copyright 1994, 1996, 1999, 2000, 2001, 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 the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include <stdio.h> /* for NULL */
#include "gmp.h"
#include "gmp-impl.h"
unsigned long int
mpz_gcd_ui (mpz_ptr w, mpz_srcptr u, unsigned long int v)
{
mp_size_t un;
mp_limb_t res;
#if GMP_NAIL_BITS != 0
if (v > GMP_NUMB_MAX)
{
mpz_t vz;
mp_limb_t vlimbs[2];
vlimbs[0] = v & GMP_NUMB_MASK;
vlimbs[1] = v >> GMP_NUMB_BITS;
PTR(vz) = vlimbs;
SIZ(vz) = 2;
mpz_gcd (w, u, vz);
return;
}
#endif
un = ABSIZ(u);
if (un == 0)
res = v;
else if (v == 0)
{
if (w != NULL && u != w)
{
MPZ_REALLOC (w, un);
MPN_COPY (PTR(w), PTR(u), un);
SIZ(w) = un;
}
/* We can't return any useful result for gcd(big,0). */
return un > 1 ? 0 : PTR(u)[0];
}
else
res = mpn_gcd_1 (PTR(u), un, (mp_limb_t) v);
if (w != NULL)
{
PTR(w)[0] = res;
SIZ(w) = res != 0;
}
return res;
}
|
