linux-imx

#include <linux/export.h>

​

/*

 * This implements the binary GCD algorithm. (Often attributed to Stein,

 * but as Knuth has noted, appears in a first-century Chinese math text.)

 *

 * This is faster than the division-based algorithm even on x86, which

 * has decent hardware division.

 */

​

​

/* If __ffs is available, the even/odd algorithm benchmarks slower. */

​

/**

 * gcd - calculate and return the greatest common divisor of 2 unsigned longs

 * @a: first value

 * @b: second value

 */

unsigned long gcd(unsigned long a, unsigned long b)

{