mirror of https://github.com/mpv-player/mpv
made gcd() static
git-svn-id: svn://svn.mplayerhq.hu/mplayer/trunk@7895 b3059339-0415-0410-9bf9-f77b7e298cf2
This commit is contained in:
parent
385a4b8f30
commit
ef97f44160
|
@ -72,7 +72,7 @@ typedef struct af_resample_s
|
||||||
} af_resample_t;
|
} af_resample_t;
|
||||||
|
|
||||||
// Euclids algorithm for calculating Greatest Common Divisor GCD(a,b)
|
// 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);
|
register int r = min(a,b);
|
||||||
a=max(a,b);
|
a=max(a,b);
|
||||||
|
|
Loading…
Reference in New Issue