1 /* Licensed under LGPLv2+ - see LICENSE file for details */
10 #include <ccan/endian/endian.h>
12 typedef unsigned long bitmap_word;
14 #define BITMAP_WORD_BITS (sizeof(bitmap_word) * CHAR_BIT)
15 #define BITMAP_NWORDS(_n) \
16 (((_n) + BITMAP_WORD_BITS - 1) / BITMAP_WORD_BITS)
19 * We wrap each word in a structure for type checking.
25 static inline size_t bitmap_sizeof(int nbits)
27 return BITMAP_NWORDS(nbits) * sizeof(bitmap_word);
30 static inline bitmap *bitmap_alloc(int nbits)
32 return malloc(bitmap_sizeof(nbits));
35 static inline bitmap_word bitmap_bswap(bitmap_word w)
37 if (BITMAP_WORD_BITS == 32)
38 return cpu_to_be32(w);
39 else if (BITMAP_WORD_BITS == 64)
40 return cpu_to_be64(w);
43 #define BITMAP_WORD(_bm, _n) ((_bm)[(_n) / BITMAP_WORD_BITS].w)
44 #define BITMAP_WORDBIT(_n) \
45 (bitmap_bswap(1UL << (BITMAP_WORD_BITS - ((_n) % BITMAP_WORD_BITS) - 1)))
47 #define BITMAP_HEADWORDS(_nbits) \
48 ((_nbits) / BITMAP_WORD_BITS)
49 #define BITMAP_HEADBYTES(_nbits) \
50 (BITMAP_HEADWORDS(_nbits) * sizeof(bitmap_word))
52 #define BITMAP_TAILWORD(_bm, _nbits) \
53 ((_bm)[BITMAP_HEADWORDS(_nbits)].w)
54 #define BITMAP_HASTAIL(_nbits) (((_nbits) % BITMAP_WORD_BITS) != 0)
55 #define BITMAP_TAILBITS(_nbits) \
56 (bitmap_bswap(~(-1UL >> ((_nbits) % BITMAP_WORD_BITS))))
57 #define BITMAP_TAIL(_bm, _nbits) \
58 (BITMAP_TAILWORD(_bm, _nbits) & BITMAP_TAILBITS(_nbits))
60 static inline void bitmap_set_bit(bitmap *bitmap, int n)
62 BITMAP_WORD(bitmap, n) |= BITMAP_WORDBIT(n);
65 static inline void bitmap_clear_bit(bitmap *bitmap, int n)
67 BITMAP_WORD(bitmap, n) &= ~BITMAP_WORDBIT(n);
70 static inline void bitmap_change_bit(bitmap *bitmap, int n)
72 BITMAP_WORD(bitmap, n) ^= BITMAP_WORDBIT(n);
75 static inline bool bitmap_test_bit(bitmap *bitmap, int n)
77 return !!(BITMAP_WORD(bitmap, n) & BITMAP_WORDBIT(n));
81 static inline void bitmap_zero(bitmap *bitmap, int nbits)
83 memset(bitmap, 0, bitmap_sizeof(nbits));
86 static inline void bitmap_fill(bitmap *bitmap, int nbits)
88 memset(bitmap, 0xff, bitmap_sizeof(nbits));
91 static inline void bitmap_copy(bitmap *dst, bitmap *src, int nbits)
93 memcpy(dst, src, bitmap_sizeof(nbits));
96 #define BITMAP_DEF_BINOP(_name, _op) \
97 static inline void bitmap_##_name(bitmap *dst, bitmap *src1, bitmap *src2, \
101 for (i = 0; i < BITMAP_NWORDS(nbits); i++) { \
102 dst[i].w = src1[i].w _op src2[i].w; \
106 BITMAP_DEF_BINOP(and, &)
107 BITMAP_DEF_BINOP(or, |)
108 BITMAP_DEF_BINOP(xor, ^)
109 BITMAP_DEF_BINOP(andnot, & ~)
111 #undef BITMAP_DEF_BINOP
113 static inline void bitmap_complement(bitmap *dst, bitmap *src, int nbits)
117 for (i = 0; i < BITMAP_NWORDS(nbits); i++)
118 dst[i].w = ~src[i].w;
121 static inline bool bitmap_equal(bitmap *src1, bitmap *src2, int nbits)
123 return (memcmp(src1, src2, BITMAP_HEADBYTES(nbits)) == 0)
124 && (!BITMAP_HASTAIL(nbits)
125 || (BITMAP_TAIL(src1, nbits) == BITMAP_TAIL(src2, nbits)));
128 static inline bool bitmap_intersects(bitmap *src1, bitmap *src2, int nbits)
132 for (i = 0; i < BITMAP_HEADWORDS(nbits); i++) {
133 if (src1[i].w & src2[i].w)
136 if (BITMAP_HASTAIL(nbits) &&
137 (BITMAP_TAIL(src1, nbits) & BITMAP_TAIL(src2, nbits)))
142 static inline bool bitmap_subset(bitmap *src1, bitmap *src2, int nbits)
146 for (i = 0; i < BITMAP_HEADWORDS(nbits); i++) {
147 if (src1[i].w & ~src2[i].w)
150 if (BITMAP_HASTAIL(nbits) &&
151 (BITMAP_TAIL(src1, nbits) & ~BITMAP_TAIL(src2, nbits)))
156 static inline bool bitmap_full(bitmap *bitmap, int nbits)
160 for (i = 0; i < BITMAP_HEADWORDS(nbits); i++) {
161 if (bitmap[i].w != -1UL)
164 if (BITMAP_HASTAIL(nbits) &&
165 (BITMAP_TAIL(bitmap, nbits) != BITMAP_TAILBITS(nbits)))
171 static inline bool bitmap_empty(bitmap *bitmap, int nbits)
175 for (i = 0; i < BITMAP_HEADWORDS(nbits); i++) {
176 if (bitmap[i].w != 0)
179 if (BITMAP_HASTAIL(nbits) && (BITMAP_TAIL(bitmap, nbits) != 0))
185 #endif /* CCAN_BITMAP_H_ */