mirrors/qemu
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

bitops: Remove routines redundant with host-utils

Browse Source 
Signed-off-by: Richard Henderson <rth@twiddle.net>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Blue Swirl <blauwirbel@gmail.com>
This commit is contained in:
Richard Henderson 2013-02-13 17:47:43 -08:00 committed by Blue Swirl
parent 0f9d8bd386
commit 453776e574
1 changed files with 0 additions and 48 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
include/qemu/bitops.h
View File

@ -23,54 +23,6 @@
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG) #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
#define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long)) #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long))
/**
* bitops_ctzl - count trailing zeroes in word.
* @word: The word to search
*
* Returns -1 if no bit exists. Note that compared to the C library
* routine ffsl, this one returns one less.
*/
static unsigned long bitops_ctzl(unsigned long word)
{
#if QEMU_GNUC_PREREQ(3, 4)
return __builtin_ffsl(word) - 1;
#else
if (!word) {
return -1;
}
if (sizeof(long) == 4) {
return ctz32(word);
} else if (sizeof(long) == 8) {
return ctz64(word);
} else {
abort();
}
#endif
}
/**
* bitops_fls - find last (most-significant) set bit in a long word
* @word: the word to search
*
* Undefined if no set bit exists, so code should check against 0 first.
*/
static inline unsigned long bitops_flsl(unsigned long word)
{
return BITS_PER_LONG - 1 - clzl(word);
}
/**
* cto - count trailing ones in word.
* @word: The word to search
*
* Returns -1 if all bit are set.
*/
static inline unsigned long bitops_ctol(unsigned long word)
{
return bitops_ctzl(~word);
}
/** /**
* set_bit - Set a bit in memory * set_bit - Set a bit in memory
* @nr: the bit to set * @nr: the bit to set