summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--lib/ChangeLog5
-rw-r--r--lib/gcd.c12
-rw-r--r--lib/gcd.h6
3 files changed, 14 insertions, 9 deletions
diff --git a/lib/ChangeLog b/lib/ChangeLog
index c5bc0d7e8a..929750acbd 100644
--- a/lib/ChangeLog
+++ b/lib/ChangeLog
@@ -1,3 +1,8 @@
+2002-11-06 Bruno Haible <bruno@clisp.org>
+
+ * gcd.h (gcd): Change argument type to 'unsigned long'.
+ * gcd.c (gcd): Likewise.
+
2002-11-05 Bruno Haible <bruno@clisp.org>
* gcd.h: New file, from gettext-0.11.5.
diff --git a/lib/gcd.c b/lib/gcd.c
index 4d9e88f2d9..af3ba16830 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
@@ -22,10 +22,10 @@
#include <stdlib.h>
/* Return the greatest common divisor of a > 0 and b > 0. */
-unsigned int
+unsigned long
gcd (a, b)
- unsigned int a;
- unsigned int b;
+ 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 +35,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. */
diff --git a/lib/gcd.h b/lib/gcd.h
index 37ff21ea52..225057ed87 100644
--- a/lib/gcd.h
+++ b/lib/gcd.h
@@ -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
@@ -28,6 +28,6 @@
#endif
/* Return the greatest common divisor of a > 0 and b > 0. */
-extern unsigned int gcd PARAMS ((unsigned int a, unsigned int b));
+extern unsigned long gcd PARAMS ((unsigned long a, unsigned long b));
#endif /* _GCD_H */