summaryrefslogtreecommitdiff
path: root/util
diff options
context:
space:
mode:
authorPaolo Bonzini <pbonzini@redhat.com>2013-02-01 23:03:16 +0100
committerBlue Swirl <blauwirbel@gmail.com>2013-02-02 20:16:00 +0000
commitfbeadf50f2f965741def823036b086bbc2999b1f (patch)
tree859da9be446ae21d999274d1972730a69e1de9ee /util
parent7b2d9779818f4c0d4c31d3a0292bee1c4b633217 (diff)
downloadqemu-fbeadf50f2f965741def823036b086bbc2999b1f.tar.gz
qemu-fbeadf50f2f965741def823036b086bbc2999b1f.tar.bz2
qemu-fbeadf50f2f965741def823036b086bbc2999b1f.zip
bitops: unify bitops_ffsl with the one in host-utils.h, call it bitops_ctzl
We had two copies of a ffs function for longs with subtly different semantics and, for the one in bitops.h, a confusing name: the result was off-by-one compared to the library function ffsl. Unify the functions into one, and solve the name problem by calling the 0-based functions "bitops_ctzl" and "bitops_ctol" respectively. This also fixes the build on platforms with ffsl, including Mac OS X and Windows. Signed-off-by: Paolo Bonzini <pbonzini@redhat.com> Reviewed-by: Eric Blake <eblake@redhat.com> Tested-by: Andreas Färber <afaerber@suse.de> Tested-by: Peter Maydell <peter.maydell@linaro.org> Signed-off-by: Blue Swirl <blauwirbel@gmail.com>
Diffstat (limited to 'util')
-rw-r--r--util/bitops.c4
-rw-r--r--util/hbitmap.c2
2 files changed, 3 insertions, 3 deletions
diff --git a/util/bitops.c b/util/bitops.c
index 4c3a836a01..7b853cf944 100644
--- a/util/bitops.c
+++ b/util/bitops.c
@@ -60,7 +60,7 @@ found_first:
return result + size; /* Nope. */
}
found_middle:
- return result + bitops_ffsl(tmp);
+ return result + bitops_ctzl(tmp);
}
/*
@@ -109,7 +109,7 @@ found_first:
return result + size; /* Nope. */
}
found_middle:
- return result + ffz(tmp);
+ return result + bitops_ctol(tmp);
}
unsigned long find_last_bit(const unsigned long *addr, unsigned long size)
diff --git a/util/hbitmap.c b/util/hbitmap.c
index 2aa487db74..a0df5d3591 100644
--- a/util/hbitmap.c
+++ b/util/hbitmap.c
@@ -126,7 +126,7 @@ unsigned long hbitmap_iter_skip_words(HBitmapIter *hbi)
* The index of this word's least significant set bit provides
* the low-order bits.
*/
- pos = (pos << BITS_PER_LEVEL) + ffsl(cur) - 1;
+ pos = (pos << BITS_PER_LEVEL) + bitops_ctzl(cur);
hbi->cur[i] = cur & (cur - 1);
/* Set up next level for iteration. */