blob: 01ab4519d7cf7251b6dd030b9f8cf0c1e0e2c5ef [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef __LINUX_BITMAP_H
2#define __LINUX_BITMAP_H
3
4#ifndef __ASSEMBLY__
5
6#include <linux/types.h>
7#include <linux/bitops.h>
8#include <linux/string.h>
Jiri Slaby14ed9d22007-10-18 23:40:37 -07009#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070010
11/*
12 * bitmaps provide bit arrays that consume one or more unsigned
13 * longs. The bitmap interface and available operations are listed
14 * here, in bitmap.h
15 *
16 * Function implementations generic to all architectures are in
17 * lib/bitmap.c. Functions implementations that are architecture
18 * specific are in various include/asm-<arch>/bitops.h headers
19 * and other arch/<arch> specific files.
20 *
21 * See lib/bitmap.c for more details.
22 */
23
24/*
25 * The available bitmap operations and their rough meaning in the
26 * case that the bitmap is a single unsigned long are thus:
27 *
Andi Kleen08cd3652006-06-26 13:57:10 +020028 * Note that nbits should be always a compile time evaluable constant.
29 * Otherwise many inlines will generate horrible code.
30 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070031 * bitmap_zero(dst, nbits) *dst = 0UL
32 * bitmap_fill(dst, nbits) *dst = ~0UL
33 * bitmap_copy(dst, src, nbits) *dst = *src
34 * bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2
35 * bitmap_or(dst, src1, src2, nbits) *dst = *src1 | *src2
36 * bitmap_xor(dst, src1, src2, nbits) *dst = *src1 ^ *src2
37 * bitmap_andnot(dst, src1, src2, nbits) *dst = *src1 & ~(*src2)
38 * bitmap_complement(dst, src, nbits) *dst = ~(*src)
39 * bitmap_equal(src1, src2, nbits) Are *src1 and *src2 equal?
40 * bitmap_intersects(src1, src2, nbits) Do *src1 and *src2 overlap?
41 * bitmap_subset(src1, src2, nbits) Is *src1 a subset of *src2?
42 * bitmap_empty(src, nbits) Are all bits zero in *src?
43 * bitmap_full(src, nbits) Are all bits set in *src?
44 * bitmap_weight(src, nbits) Hamming Weight: number set bits
Akinobu Mitac1a2a962009-12-15 16:48:25 -080045 * bitmap_set(dst, pos, nbits) Set specified bit area
46 * bitmap_clear(dst, pos, nbits) Clear specified bit area
47 * bitmap_find_next_zero_area(buf, len, pos, n, mask) Find bit free area
Bryan Huntsman3f2bc4d2011-08-16 17:27:22 -070048 * bitmap_find_next_zero_area_off(buf, len, pos, n, mask) as above
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n
50 * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n
Paul Jacksonfb5eeee2005-10-30 15:02:33 -080051 * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src)
52 * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit)
Paul Jackson7ea931c2008-04-28 02:12:29 -070053 * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap
54 * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf
Reinette Chatre01a3ee22006-10-11 01:21:55 -070056 * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf
57 * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf
Mike Travis4b060422011-05-24 17:13:12 -070059 * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf
60 * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf
Paul Jackson87e24802006-03-24 03:15:44 -080061 * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region
62 * bitmap_release_region(bitmap, pos, order) Free specified bit region
63 * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 */
65
66/*
67 * Also the following operations in asm/bitops.h apply to bitmaps.
68 *
69 * set_bit(bit, addr) *addr |= bit
70 * clear_bit(bit, addr) *addr &= ~bit
71 * change_bit(bit, addr) *addr ^= bit
72 * test_bit(bit, addr) Is bit set in *addr?
73 * test_and_set_bit(bit, addr) Set bit and return old value
74 * test_and_clear_bit(bit, addr) Clear bit and return old value
75 * test_and_change_bit(bit, addr) Change bit and return old value
76 * find_first_zero_bit(addr, nbits) Position first zero bit in *addr
77 * find_first_bit(addr, nbits) Position first set bit in *addr
78 * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit
79 * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit
80 */
81
82/*
83 * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used
84 * to declare an array named 'name' of just enough unsigned longs to
85 * contain all bit positions from 0 to 'bits' - 1.
86 */
87
88/*
89 * lib/bitmap.c provides these functions:
90 */
91
92extern int __bitmap_empty(const unsigned long *bitmap, int bits);
93extern int __bitmap_full(const unsigned long *bitmap, int bits);
94extern int __bitmap_equal(const unsigned long *bitmap1,
95 const unsigned long *bitmap2, int bits);
96extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
97 int bits);
98extern void __bitmap_shift_right(unsigned long *dst,
99 const unsigned long *src, int shift, int bits);
100extern void __bitmap_shift_left(unsigned long *dst,
101 const unsigned long *src, int shift, int bits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700102extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 const unsigned long *bitmap2, int bits);
104extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
105 const unsigned long *bitmap2, int bits);
106extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
107 const unsigned long *bitmap2, int bits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700108extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109 const unsigned long *bitmap2, int bits);
110extern int __bitmap_intersects(const unsigned long *bitmap1,
111 const unsigned long *bitmap2, int bits);
112extern int __bitmap_subset(const unsigned long *bitmap1,
113 const unsigned long *bitmap2, int bits);
114extern int __bitmap_weight(const unsigned long *bitmap, int bits);
115
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800116extern void bitmap_set(unsigned long *map, int i, int len);
117extern void bitmap_clear(unsigned long *map, int start, int nr);
Bryan Huntsman3f2bc4d2011-08-16 17:27:22 -0700118
119extern unsigned long bitmap_find_next_zero_area_off(unsigned long *map,
120 unsigned long size,
121 unsigned long start,
122 unsigned int nr,
123 unsigned long align_mask,
124 unsigned long align_offset);
125
126static inline unsigned long
127bitmap_find_next_zero_area(unsigned long *map,
128 unsigned long size,
129 unsigned long start,
130 unsigned int nr,
131 unsigned long align_mask)
132{
133 return bitmap_find_next_zero_area_off(map, size, start, nr,
134 align_mask, 0);
135}
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800136
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137extern int bitmap_scnprintf(char *buf, unsigned int len,
138 const unsigned long *src, int nbits);
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700139extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
140 unsigned long *dst, int nbits);
141extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 unsigned long *dst, int nbits);
143extern int bitmap_scnlistprintf(char *buf, unsigned int len,
144 const unsigned long *src, int nbits);
145extern int bitmap_parselist(const char *buf, unsigned long *maskp,
146 int nmaskbits);
Mike Travis4b060422011-05-24 17:13:12 -0700147extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen,
148 unsigned long *dst, int nbits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800149extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
150 const unsigned long *old, const unsigned long *new, int bits);
151extern int bitmap_bitremap(int oldbit,
152 const unsigned long *old, const unsigned long *new, int bits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700153extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
154 const unsigned long *relmap, int bits);
155extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
156 int sz, int bits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157extern int bitmap_find_free_region(unsigned long *bitmap, int bits, int order);
158extern void bitmap_release_region(unsigned long *bitmap, int pos, int order);
159extern int bitmap_allocate_region(unsigned long *bitmap, int pos, int order);
David Vrabelccbe3292008-09-17 16:34:03 +0100160extern void bitmap_copy_le(void *dst, const unsigned long *src, int nbits);
Michal Hocko778d3b02011-07-26 16:08:30 -0700161extern int bitmap_ord_to_pos(const unsigned long *bitmap, int n, int bits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162
Huang Ying7f184272011-07-13 13:14:24 +0800163#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164#define BITMAP_LAST_WORD_MASK(nbits) \
165( \
166 ((nbits) % BITS_PER_LONG) ? \
167 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
168)
169
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030170#define small_const_nbits(nbits) \
171 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
172
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173static inline void bitmap_zero(unsigned long *dst, int nbits)
174{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030175 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 *dst = 0UL;
177 else {
178 int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
179 memset(dst, 0, len);
180 }
181}
182
183static inline void bitmap_fill(unsigned long *dst, int nbits)
184{
185 size_t nlongs = BITS_TO_LONGS(nbits);
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030186 if (!small_const_nbits(nbits)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 int len = (nlongs - 1) * sizeof(unsigned long);
188 memset(dst, 0xff, len);
189 }
190 dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
191}
192
193static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
194 int nbits)
195{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030196 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 *dst = *src;
198 else {
199 int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
200 memcpy(dst, src, len);
201 }
202}
203
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700204static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205 const unsigned long *src2, int nbits)
206{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030207 if (small_const_nbits(nbits))
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700208 return (*dst = *src1 & *src2) != 0;
209 return __bitmap_and(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210}
211
212static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
213 const unsigned long *src2, int nbits)
214{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030215 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 *dst = *src1 | *src2;
217 else
218 __bitmap_or(dst, src1, src2, nbits);
219}
220
221static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
222 const unsigned long *src2, int nbits)
223{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030224 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 *dst = *src1 ^ *src2;
226 else
227 __bitmap_xor(dst, src1, src2, nbits);
228}
229
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700230static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231 const unsigned long *src2, int nbits)
232{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030233 if (small_const_nbits(nbits))
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700234 return (*dst = *src1 & ~(*src2)) != 0;
235 return __bitmap_andnot(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236}
237
238static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
239 int nbits)
240{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030241 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 *dst = ~(*src) & BITMAP_LAST_WORD_MASK(nbits);
243 else
244 __bitmap_complement(dst, src, nbits);
245}
246
247static inline int bitmap_equal(const unsigned long *src1,
248 const unsigned long *src2, int nbits)
249{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030250 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251 return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
252 else
253 return __bitmap_equal(src1, src2, nbits);
254}
255
256static inline int bitmap_intersects(const unsigned long *src1,
257 const unsigned long *src2, int nbits)
258{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030259 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
261 else
262 return __bitmap_intersects(src1, src2, nbits);
263}
264
265static inline int bitmap_subset(const unsigned long *src1,
266 const unsigned long *src2, int nbits)
267{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030268 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
270 else
271 return __bitmap_subset(src1, src2, nbits);
272}
273
274static inline int bitmap_empty(const unsigned long *src, int nbits)
275{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030276 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277 return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
278 else
279 return __bitmap_empty(src, nbits);
280}
281
282static inline int bitmap_full(const unsigned long *src, int nbits)
283{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030284 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
286 else
287 return __bitmap_full(src, nbits);
288}
289
290static inline int bitmap_weight(const unsigned long *src, int nbits)
291{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030292 if (small_const_nbits(nbits))
Andi Kleen08cd3652006-06-26 13:57:10 +0200293 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 return __bitmap_weight(src, nbits);
295}
296
297static inline void bitmap_shift_right(unsigned long *dst,
298 const unsigned long *src, int n, int nbits)
299{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030300 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301 *dst = *src >> n;
302 else
303 __bitmap_shift_right(dst, src, n, nbits);
304}
305
306static inline void bitmap_shift_left(unsigned long *dst,
307 const unsigned long *src, int n, int nbits)
308{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030309 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310 *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits);
311 else
312 __bitmap_shift_left(dst, src, n, nbits);
313}
314
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700315static inline int bitmap_parse(const char *buf, unsigned int buflen,
316 unsigned long *maskp, int nmaskbits)
317{
318 return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
319}
320
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321#endif /* __ASSEMBLY__ */
322
323#endif /* __LINUX_BITMAP_H */