| #define BIT(nr) (1UL << (nr)) |
| #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG)) |
| #define BIT_WORD(nr) ((nr) / BITS_PER_LONG) |
| #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_LONG) |
| * Include this here because some architectures need generic_ffs/fls in |
| #define for_each_bit(bit, addr, size) \ |
| for ((bit) = find_first_bit((addr), (size)); \ |
| (bit) = find_next_bit((addr), (size), (bit) + 1)) |
| static __inline__ int get_bitmask_order(unsigned int count) |
| return order; /* We could be slightly more clever with -1 here... */ |
| static __inline__ int get_count_order(unsigned int count) |
| static inline unsigned long hweight_long(unsigned long w) |
| return sizeof(w) == 4 ? hweight32(w) : hweight64(w); |
| * rol32 - rotate a 32-bit value left |
| static inline __u32 rol32(__u32 word, unsigned int shift) |
| return (word << shift) | (word >> (32 - shift)); |
| * ror32 - rotate a 32-bit value right |
| static inline __u32 ror32(__u32 word, unsigned int shift) |
| return (word >> shift) | (word << (32 - shift)); |
| static inline unsigned fls_long(unsigned long l) |