summaryrefslogtreecommitdiff
path: root/lib/ffs.c
diff options
context:
space:
mode:
Diffstat (limited to 'lib/ffs.c')
-rw-r--r--lib/ffs.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/ffs.c b/lib/ffs.c
index 4ac244cc8e..5fb42f9d47 100644
--- a/lib/ffs.c
+++ b/lib/ffs.c
@@ -29,7 +29,7 @@ ffs (int i)
#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
return __builtin_ffs (i);
#else
- /* http://graphics.stanford.edu/~seander/bithacks.html#ZerosOnRightMultLookup
+ /* <https://github.com/gibsjose/BitHacks>
gives this deBruijn constant for a branch-less computation, although
that table counted trailing zeros rather than bit position. This
requires 32-bit int, we fall back to a naive algorithm on the rare