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

diff --git a/lib/gcd.c b/lib/gcd.c
index af3ba1683..9c4698554 100644
--- a/lib/gcd.c
+++ b/lib/gcd.c
@@ -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"
@@ -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,