1 #ifndef _TOOLS_LINUX_BITOPS_H_
2 #define _TOOLS_LINUX_BITOPS_H_
5 #include <linux/kernel.h>
6 #include <linux/compiler.h>
9 #define __WORDSIZE (__SIZEOF_LONG__ * 8)
13 # define BITS_PER_LONG __WORDSIZE
16 #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
17 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
18 #define BITS_PER_BYTE 8
19 #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long))
20 #define BITS_TO_U64(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(u64))
21 #define BITS_TO_U32(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(u32))
22 #define BITS_TO_BYTES(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE)
24 extern unsigned int __sw_hweight8(unsigned int w);
25 extern unsigned int __sw_hweight16(unsigned int w);
26 extern unsigned int __sw_hweight32(unsigned int w);
27 extern unsigned long __sw_hweight64(__u64 w);
30 * Include this here because some architectures need generic_ffs/fls in
33 * XXX: this needs to be asm/bitops.h, when we get to per arch optimizations
35 #include <asm-generic/bitops.h>
37 #define for_each_set_bit(bit, addr, size) \
38 for ((bit) = find_first_bit((addr), (size)); \
40 (bit) = find_next_bit((addr), (size), (bit) + 1))
42 #define for_each_clear_bit(bit, addr, size) \
43 for ((bit) = find_first_zero_bit((addr), (size)); \
45 (bit) = find_next_zero_bit((addr), (size), (bit) + 1))
47 /* same as for_each_set_bit() but use bit as value to start with */
48 #define for_each_set_bit_from(bit, addr, size) \
49 for ((bit) = find_next_bit((addr), (size), (bit)); \
51 (bit) = find_next_bit((addr), (size), (bit) + 1))
53 static inline unsigned long hweight_long(unsigned long w)
55 return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
58 static inline unsigned fls_long(unsigned long l)