Because some architectures (alpha, armv6, etc.) don't provide hardware division,
the mod operation is slow! Binary GCD algorithm uses simple arithmetic
operations,
it replaces division with arithmetic shifts, comparisons, and subtraction.
Signed-off-by: Zhaoxiu Zeng <zhaoxiu.z...@gmail.com>
---
lib/Kconfig | 15 +++++++++++++++
lib/gcd.c | 31 ++++++++++++++++++++++++++++++-
2 files changed, 45 insertions(+), 1 deletion(-)
diff --git a/lib/Kconfig b/lib/Kconfig
index a5ce0c7..80e8e54 100644
--- a/lib/Kconfig
+++ b/lib/Kconfig
@@ -177,6 +177,21 @@ config CRC8
when they need to do cyclic redundancy check according CRC8
algorithm. Module will be called crc8.
+#
+# GCD
+#
+choice
+ prompt "GCD implementation"
+ default GCD_ALGO_EUCLIDEAN
+
+config GCD_ALGO_EUCLIDEAN
+ bool "Euclidean algorithm"
+
+config GCD_ALGO_BINARY
+ bool "Binary GCD algorithm (Stein's algorithm)"
+
+endchoice
+
config AUDIT_GENERIC
bool
depends on AUDIT && !AUDIT_ARCH
diff --git a/lib/gcd.c b/lib/gcd.c
index 3657f12..911ec7f 100644
--- a/lib/gcd.c
+++ b/lib/gcd.c
@@ -6,7 +6,7 @@
unsigned long gcd(unsigned long a, unsigned long b)
{
unsigned long r;
-
+#ifdef CONFIG_GCD_ALGO_EUCLIDEAN
if (a < b)
swap(a, b);
@@ -16,6 +16,35 @@ unsigned long gcd(unsigned long a, unsigned long b)
a = b;
b = r;
}
+#else
+ r = a | b;
+
+ if (!a || !b)
+ return r;
+
+ r = r ^ (r - 1);
+ if (!(a & r))
+ goto even_odd; /* a/c even, b/c odd */
+ if (!(b & r))
+ goto odd_even; /* a/c odd, b/c even */
+
+ /* a/c and b/c both odd */
+ while (a != b) {
+ if (a > b) {
+ a -= b;
+even_odd:
+ do
+ a >>= 1;
+ while (!(a & r));
+ } else {
+ b -= a;
+odd_even:
+ do
+ b >>= 1;
+ while (!(b & r));
+ }
+ }
+#endif
return b;
}
EXPORT_SYMBOL_GPL(gcd);
--
1.9.3
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
