# HG changeset patch
# User arpi
# Date 1035480841 0
# Node ID 3aba91eb5c1f8933541532038faa466b69b4af64
# Parent  fa65f25f748a74276f15e245c9b33d79d93a0e9d
made gcd() static

diff -r fa65f25f748a -r 3aba91eb5c1f libaf/af_resample.c
--- a/libaf/af_resample.c	Thu Oct 24 10:05:09 2002 +0000
+++ b/libaf/af_resample.c	Thu Oct 24 17:34:01 2002 +0000
@@ -72,7 +72,7 @@
 } af_resample_t;
 
 // Euclids algorithm for calculating Greatest Common Divisor GCD(a,b)
-inline int gcd(register int a, register int b)
+static inline int gcd(register int a, register int b)
 {
   register int r = min(a,b);
   a=max(a,b);