comparison libaf/af_resample.c @ 7894:3aba91eb5c1f

made gcd() static

7893:fa65f25f748a

  uint32_t  	dn;     // Down sampling factor
  uint32_t	up;	// Up sampling factor 
} af_resample_t;

// Euclids algorithm for calculating Greatest Common Divisor GCD(a,b)
inline int gcd(register int a, register int b)
{
  register int r = min(a,b);
  a=max(a,b);
  b=r;

7894:3aba91eb5c1f

  uint32_t  	dn;     // Down sampling factor
  uint32_t	up;	// Up sampling factor 
} af_resample_t;

// Euclids algorithm for calculating Greatest Common Divisor GCD(a,b)
static inline int gcd(register int a, register int b)
{
  register int r = min(a,b);
  a=max(a,b);
  b=r;