From f792f72aa5086439c266433b39303c6377df909b Mon Sep 17 00:00:00 2001
From: Con Kolivas <kernel@kolivas.org>
Date: Sun, 11 Mar 2012 00:11:11 +1100
Subject: [PATCH] Use ffsl for a faster lesser_bitness function.

---
 rzip.c | 10 +++-------
 1 file changed, 3 insertions(+), 7 deletions(-)

diff --git a/rzip.c b/rzip.c
index 36c791b..9d161c6 100644
--- a/rzip.c
+++ b/rzip.c
@@ -343,13 +343,9 @@ static int minimum_bitness(struct rzip_state *st, tag t)
  * set than b? */
 static int lesser_bitness(tag a, tag b)
 {
-	tag mask;
-
-	for (mask = 0; mask != (tag) - 1; mask = ((mask << 1) | 1)) {
-		if ((a & b & mask) != mask)
-			break;
-	}
-	return ((a & mask) < (b & mask));
+	a ^= 0xffffffffffffffff;
+	b ^= 0xffffffffffffffff;
+	return (ffsll(a) < ffsll(b));
 }
 
 /* If hash bucket is taken, we spill into next bucket(s).  Secondary hashing