5 #include <linux/bitops.h>
8 #define DECLARE_BITMAP(name,bits) \
9 unsigned long name[BITS_TO_LONGS(bits)]
11 int __bitmap_weight(const unsigned long *bitmap, int bits);
12 void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
13 const unsigned long *bitmap2, int bits);
14 int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
15 const unsigned long *bitmap2, unsigned int bits);
17 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
19 #define BITMAP_LAST_WORD_MASK(nbits) \
21 ((nbits) % BITS_PER_LONG) ? \
22 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
25 #define small_const_nbits(nbits) \
26 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
28 static inline void bitmap_zero(unsigned long *dst, int nbits)
30 memset(dst, 0, BITS_TO_LONGS(nbits) * sizeof(unsigned long));
33 static inline int bitmap_weight(const unsigned long *src, int nbits)
35 if (small_const_nbits(nbits))
36 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
37 return __bitmap_weight(src, nbits);
40 static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
41 const unsigned long *src2, int nbits)
43 if (small_const_nbits(nbits))
46 __bitmap_or(dst, src1, src2, nbits);
50 * bitmap_alloc - Allocate bitmap
53 static inline unsigned long *bitmap_alloc(int nbits)
55 return calloc(1, BITS_TO_LONGS(nbits) * sizeof(unsigned long));
59 * bitmap_scnprintf - print bitmap list into buffer
61 * @nbits: size of bitmap
62 * @buf: buffer to store output
65 size_t bitmap_scnprintf(unsigned long *bitmap, int nbits,
66 char *buf, size_t size);
69 * bitmap_and - Do logical and on bitmaps
70 * @dst: resulting bitmap
73 * @nbits: size of bitmap
75 static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
76 const unsigned long *src2, unsigned int nbits)
78 if (small_const_nbits(nbits))
79 return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0;
80 return __bitmap_and(dst, src1, src2, nbits);
83 static inline unsigned long _find_next_bit(const unsigned long *addr,
84 unsigned long nbits, unsigned long start, unsigned long invert)
88 if (!nbits || start >= nbits)
91 tmp = addr[start / BITS_PER_LONG] ^ invert;
93 /* Handle 1st word. */
94 tmp &= BITMAP_FIRST_WORD_MASK(start);
95 start = round_down(start, BITS_PER_LONG);
98 start += BITS_PER_LONG;
102 tmp = addr[start / BITS_PER_LONG] ^ invert;
105 return min(start + __ffs(tmp), nbits);
108 static inline unsigned long find_next_bit(const unsigned long *addr, unsigned long size,
109 unsigned long offset)
111 return _find_next_bit(addr, size, offset, 0UL);
114 static inline unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size,
115 unsigned long offset)
117 return _find_next_bit(addr, size, offset, ~0UL);
120 static inline unsigned long find_first_zero_bit(const unsigned long *addr, unsigned long size)
124 for (idx = 0; idx * BITS_PER_LONG < size; idx++) {
125 if (addr[idx] != ~0UL)
126 return min(idx * BITS_PER_LONG + ffz(addr[idx]), size);
132 #endif /* _PERF_BITOPS_H */