Arnaldo Carvalho de Melo | 88bcea4 | 2014-12-16 10:53:27 -0300 | [diff] [blame^] | 1 | #ifndef _TOOLS_LINUX_BITOPS_H_ |
| 2 | #define _TOOLS_LINUX_BITOPS_H_ |
Frederic Weisbecker | 5a116dd | 2009-10-17 17:12:33 +0200 | [diff] [blame] | 3 | |
Arnaldo Carvalho de Melo | fb72014 | 2010-04-30 19:31:12 -0300 | [diff] [blame] | 4 | #include <linux/kernel.h> |
Arnaldo Carvalho de Melo | a860a60 | 2011-01-22 19:07:36 -0200 | [diff] [blame] | 5 | #include <linux/compiler.h> |
Arnaldo Carvalho de Melo | fb72014 | 2010-04-30 19:31:12 -0300 | [diff] [blame] | 6 | #include <asm/hweight.h> |
Frederic Weisbecker | 5a116dd | 2009-10-17 17:12:33 +0200 | [diff] [blame] | 7 | |
Irina Tirdea | 3f34f6c | 2012-09-11 01:15:00 +0300 | [diff] [blame] | 8 | #ifndef __WORDSIZE |
| 9 | #define __WORDSIZE (__SIZEOF_LONG__ * 8) |
| 10 | #endif |
| 11 | |
Arnaldo Carvalho de Melo | fb72014 | 2010-04-30 19:31:12 -0300 | [diff] [blame] | 12 | #define BITS_PER_LONG __WORDSIZE |
Arnaldo Carvalho de Melo | 93c49b3 | 2014-12-15 17:08:00 -0300 | [diff] [blame] | 13 | |
| 14 | #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG)) |
| 15 | #define BIT_WORD(nr) ((nr) / BITS_PER_LONG) |
| 16 | #define BITS_PER_BYTE 8 |
| 17 | #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long)) |
| 18 | #define BITS_TO_U64(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(u64)) |
| 19 | #define BITS_TO_U32(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(u32)) |
| 20 | #define BITS_TO_BYTES(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE) |
Paul Mackerras | ee3d250 | 2009-11-24 15:19:43 +1100 | [diff] [blame] | 21 | |
Arnaldo Carvalho de Melo | 88bcea4 | 2014-12-16 10:53:27 -0300 | [diff] [blame^] | 22 | /* |
| 23 | * Include this here because some architectures need generic_ffs/fls in |
| 24 | * scope |
| 25 | * |
| 26 | * XXX: this needs to be asm/bitops.h, when we get to per arch optimizations |
| 27 | */ |
| 28 | #include <asm-generic/bitops.h> |
| 29 | |
Robert Richter | b1e5a9b | 2011-12-07 10:02:57 +0100 | [diff] [blame] | 30 | #define for_each_set_bit(bit, addr, size) \ |
| 31 | for ((bit) = find_first_bit((addr), (size)); \ |
| 32 | (bit) < (size); \ |
| 33 | (bit) = find_next_bit((addr), (size), (bit) + 1)) |
| 34 | |
| 35 | /* same as for_each_set_bit() but use bit as value to start with */ |
Akinobu Mita | 307b1cd | 2012-03-23 15:02:03 -0700 | [diff] [blame] | 36 | #define for_each_set_bit_from(bit, addr, size) \ |
Robert Richter | b1e5a9b | 2011-12-07 10:02:57 +0100 | [diff] [blame] | 37 | for ((bit) = find_next_bit((addr), (size), (bit)); \ |
| 38 | (bit) < (size); \ |
| 39 | (bit) = find_next_bit((addr), (size), (bit) + 1)) |
| 40 | |
Arnaldo Carvalho de Melo | fb72014 | 2010-04-30 19:31:12 -0300 | [diff] [blame] | 41 | static inline unsigned long hweight_long(unsigned long w) |
| 42 | { |
| 43 | return sizeof(w) == 4 ? hweight32(w) : hweight64(w); |
| 44 | } |
Frederic Weisbecker | 5a116dd | 2009-10-17 17:12:33 +0200 | [diff] [blame] | 45 | |
Frederic Weisbecker | 5a116dd | 2009-10-17 17:12:33 +0200 | [diff] [blame] | 46 | #endif |