It calculates greatest common divisor. Signed-off-by: Andrey Panov <rockford@yandex.ru> Signed-off-by: Sascha Hauer <s.hauer@pengutronix.de>
19 lines
237 B
C
19 lines
237 B
C
#include <linux/gcd.h>
|
|
|
|
/* Greatest common divisor */
|
|
unsigned long gcd(unsigned long a, unsigned long b)
|
|
{
|
|
unsigned long r;
|
|
|
|
if (a < b)
|
|
swap(a, b);
|
|
|
|
if (!b)
|
|
return a;
|
|
while ((r = a % b) != 0) {
|
|
a = b;
|
|
b = r;
|
|
}
|
|
return b;
|
|
}
|