X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgcd.c;h=9c46985545d119fa86b10e2908696b560279acba;hb=5131be5b019b1110cd597012b63e48886aaaafc7;hp=4d9e88f2d9c2d802f3d7dd471f11b4712f450a25;hpb=ad4e337794aeb185ab58fef27ddee3ee4e81efe3;p=gnulib.git

diff --git a/lib/gcd.c b/lib/gcd.c
index 4d9e88f2d..9c4698554 100644
--- a/lib/gcd.c
+++ b/lib/gcd.c
@@ -1,6 +1,6 @@
 /* Arithmetic.
-   Copyright (C) 2001 Free Software Foundation, Inc.
-   Written by Bruno Haible <haible@clisp.cons.org>, 2001.
+   Copyright (C) 2001-2002 Free Software Foundation, Inc.
+   Written by Bruno Haible <bruno@clisp.org>, 2001.
 
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
@@ -14,7 +14,7 @@
 
    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software Foundation,
-   Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */
+   Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.  */
 
 /* Specification.  */
 #include "gcd.h"
@@ -22,10 +22,8 @@
 #include <stdlib.h>
 
 /* Return the greatest common divisor of a > 0 and b > 0.  */
-unsigned int
-gcd (a, b)
-     unsigned int a;
-     unsigned int b;
+unsigned long
+gcd (unsigned long a, unsigned long b)
 {
   /* Why no division, as in Euclid's algorithm? Because in Euclid's algorithm
      the division result floor(a/b) or floor(b/a) is very often = 1 or = 2,
@@ -35,7 +33,7 @@ gcd (a, b)
      bit in a single instruction, and the algorithm uses fewer variables than
      Euclid's algorithm.  */
 
-  unsigned int c = a | b;
+  unsigned long c = a | b;
   c = c ^ (c - 1);
   /* c = largest power of 2 that divides a and b.  */