X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgcd.c;h=b79087974970e13d385c0403941bc8e4fff80933;hb=f792a03ccf327e0e80b60e6b7a013e7f89f9f5ca;hp=af3ba16830df9c5cea94fe9f014c3fd5ed3c1417;hpb=c50728dcc26ea56e6e20937a97a26a70b0484703;p=gnulib.git

diff --git a/lib/gcd.c b/lib/gcd.c
index af3ba1683..b79087974 100644
--- a/lib/gcd.c
+++ b/lib/gcd.c
@@ -23,9 +23,7 @@
 
 /* Return the greatest common divisor of a > 0 and b > 0.  */
 unsigned long
-gcd (a, b)
-     unsigned long a;
-     unsigned long b;
+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,