#ifndef _TOOLS_LINUX_BITOPS_H_
|
#define _TOOLS_LINUX_BITOPS_H_
|
|
#include <asm/types.h>
|
#include <linux/kernel.h>
|
#include <linux/compiler.h>
|
|
#ifndef __WORDSIZE
|
#define __WORDSIZE (__SIZEOF_LONG__ * 8)
|
#endif
|
|
#ifndef BITS_PER_LONG
|
# define BITS_PER_LONG __WORDSIZE
|
#endif
|
|
#define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
|
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
|
#define BITS_PER_BYTE 8
|
#define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long))
|
#define BITS_TO_U64(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(u64))
|
#define BITS_TO_U32(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(u32))
|
#define BITS_TO_BYTES(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE)
|
|
extern unsigned int __sw_hweight8(unsigned int w);
|
extern unsigned int __sw_hweight16(unsigned int w);
|
extern unsigned int __sw_hweight32(unsigned int w);
|
extern unsigned long __sw_hweight64(__u64 w);
|
|
/*
|
* Include this here because some architectures need generic_ffs/fls in
|
* scope
|
*
|
* XXX: this needs to be asm/bitops.h, when we get to per arch optimizations
|
*/
|
#include <asm-generic/bitops.h>
|
|
#define for_each_set_bit(bit, addr, size) \
|
for ((bit) = find_first_bit((addr), (size)); \
|
(bit) < (size); \
|
(bit) = find_next_bit((addr), (size), (bit) + 1))
|
|
#define for_each_clear_bit(bit, addr, size) \
|
for ((bit) = find_first_zero_bit((addr), (size)); \
|
(bit) < (size); \
|
(bit) = find_next_zero_bit((addr), (size), (bit) + 1))
|
|
/* same as for_each_set_bit() but use bit as value to start with */
|
#define for_each_set_bit_from(bit, addr, size) \
|
for ((bit) = find_next_bit((addr), (size), (bit)); \
|
(bit) < (size); \
|
(bit) = find_next_bit((addr), (size), (bit) + 1))
|
|
static inline unsigned long hweight_long(unsigned long w)
|
{
|
return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
|
}
|
|
static inline unsigned fls_long(unsigned long l)
|
{
|
if (sizeof(l) == 4)
|
return fls(l);
|
return fls64(l);
|
}
|
|
#endif
|
