blob: 9d5c3224a1e23f11a761eff49c1d99c4b4ae3974 [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
Linus Torvalds1da177e2005-04-16 15:20:36 -070048 * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n
49 * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n
Paul Jacksonfb5eeee2005-10-30 15:02:33 -080050 * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src)
51 * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit)
Paul Jackson7ea931c2008-04-28 02:12:29 -070052 * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap
53 * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf
Reinette Chatre01a3ee22006-10-11 01:21:55 -070055 * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf
56 * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf
Mike Travis4b0604202011-05-24 17:13:12 -070058 * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf
59 * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf
Paul Jackson87e24802006-03-24 03:15:44 -080060 * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region
61 * bitmap_release_region(bitmap, pos, order) Free specified bit region
62 * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region
Sudeep Holla5aaba362014-09-30 14:48:22 +010063 * bitmap_print_to_pagebuf(list, buf, mask, nbits) Print bitmap src as list/hex
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
Rasmus Villemoes0679cc42014-08-06 16:09:49 -070092extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits);
Rasmus Villemoes83979272014-08-06 16:09:51 -070093extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070094extern int __bitmap_equal(const unsigned long *bitmap1,
Rasmus Villemoes5e0680692014-08-06 16:09:53 -070095 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070096extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -070097 unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070098extern 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,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700103 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700105 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700107 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700108extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700109 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110extern int __bitmap_intersects(const unsigned long *bitmap1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700111 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112extern int __bitmap_subset(const unsigned long *bitmap1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700113 const unsigned long *bitmap2, unsigned int nbits);
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700114extern int __bitmap_weight(const unsigned long *bitmap, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700116extern void bitmap_set(unsigned long *map, unsigned int start, int len);
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700117extern void bitmap_clear(unsigned long *map, unsigned int start, int len);
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800118extern unsigned long bitmap_find_next_zero_area(unsigned long *map,
119 unsigned long size,
120 unsigned long start,
121 unsigned int nr,
122 unsigned long align_mask);
123
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124extern int bitmap_scnprintf(char *buf, unsigned int len,
125 const unsigned long *src, int nbits);
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700126extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
127 unsigned long *dst, int nbits);
128extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 unsigned long *dst, int nbits);
130extern int bitmap_scnlistprintf(char *buf, unsigned int len,
131 const unsigned long *src, int nbits);
132extern int bitmap_parselist(const char *buf, unsigned long *maskp,
133 int nmaskbits);
Mike Travis4b0604202011-05-24 17:13:12 -0700134extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen,
135 unsigned long *dst, int nbits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800136extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
137 const unsigned long *old, const unsigned long *new, int bits);
138extern int bitmap_bitremap(int oldbit,
139 const unsigned long *old, const unsigned long *new, int bits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700140extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
141 const unsigned long *relmap, int bits);
142extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
143 int sz, int bits);
Rasmus Villemoes9279d322014-08-06 16:10:16 -0700144extern int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order);
145extern void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order);
146extern int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order);
David Vrabelccbe3292008-09-17 16:34:03 +0100147extern void bitmap_copy_le(void *dst, const unsigned long *src, int nbits);
Michal Hocko778d3b02011-07-26 16:08:30 -0700148extern int bitmap_ord_to_pos(const unsigned long *bitmap, int n, int bits);
Sudeep Holla5aaba362014-09-30 14:48:22 +0100149extern int bitmap_print_to_pagebuf(bool list, char *buf,
150 const unsigned long *maskp, int nmaskbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
Huang Ying7f184272011-07-13 13:14:24 +0800152#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153#define BITMAP_LAST_WORD_MASK(nbits) \
154( \
155 ((nbits) % BITS_PER_LONG) ? \
156 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
157)
158
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030159#define small_const_nbits(nbits) \
160 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
161
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162static inline void bitmap_zero(unsigned long *dst, int nbits)
163{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030164 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 *dst = 0UL;
166 else {
167 int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
168 memset(dst, 0, len);
169 }
170}
171
172static inline void bitmap_fill(unsigned long *dst, int nbits)
173{
174 size_t nlongs = BITS_TO_LONGS(nbits);
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030175 if (!small_const_nbits(nbits)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 int len = (nlongs - 1) * sizeof(unsigned long);
177 memset(dst, 0xff, len);
178 }
179 dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
180}
181
182static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
183 int nbits)
184{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030185 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 *dst = *src;
187 else {
188 int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
189 memcpy(dst, src, len);
190 }
191}
192
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700193static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700194 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030196 if (small_const_nbits(nbits))
Rasmus Villemoes7e5f97d2014-08-06 16:10:22 -0700197 return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700198 return __bitmap_and(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199}
200
201static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700202 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030204 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205 *dst = *src1 | *src2;
206 else
207 __bitmap_or(dst, src1, src2, nbits);
208}
209
210static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700211 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030213 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 *dst = *src1 ^ *src2;
215 else
216 __bitmap_xor(dst, src1, src2, nbits);
217}
218
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700219static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700220 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030222 if (small_const_nbits(nbits))
Rasmus Villemoes74e76532014-08-06 16:10:24 -0700223 return (*dst = *src1 & ~(*src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700224 return __bitmap_andnot(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225}
226
227static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -0700228 unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030230 if (small_const_nbits(nbits))
Rasmus Villemoes65b4ee62014-08-06 16:09:57 -0700231 *dst = ~(*src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232 else
233 __bitmap_complement(dst, src, nbits);
234}
235
236static inline int bitmap_equal(const unsigned long *src1,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -0700237 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030239 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240 return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
241 else
242 return __bitmap_equal(src1, src2, nbits);
243}
244
245static inline int bitmap_intersects(const unsigned long *src1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700246 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030248 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
250 else
251 return __bitmap_intersects(src1, src2, nbits);
252}
253
254static inline int bitmap_subset(const unsigned long *src1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700255 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030257 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258 return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
259 else
260 return __bitmap_subset(src1, src2, nbits);
261}
262
Rasmus Villemoes0679cc42014-08-06 16:09:49 -0700263static inline int bitmap_empty(const unsigned long *src, unsigned nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030265 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
267 else
268 return __bitmap_empty(src, nbits);
269}
270
Rasmus Villemoes83979272014-08-06 16:09:51 -0700271static inline int bitmap_full(const unsigned long *src, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030273 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
275 else
276 return __bitmap_full(src, nbits);
277}
278
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700279static inline int bitmap_weight(const unsigned long *src, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030281 if (small_const_nbits(nbits))
Andi Kleen08cd3652006-06-26 13:57:10 +0200282 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283 return __bitmap_weight(src, nbits);
284}
285
286static inline void bitmap_shift_right(unsigned long *dst,
287 const unsigned long *src, int n, int nbits)
288{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030289 if (small_const_nbits(nbits))
Rasmus Villemoesc5341ec892014-08-06 16:10:20 -0700290 *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> n;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291 else
292 __bitmap_shift_right(dst, src, n, nbits);
293}
294
295static inline void bitmap_shift_left(unsigned long *dst,
296 const unsigned long *src, int n, int nbits)
297{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030298 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits);
300 else
301 __bitmap_shift_left(dst, src, n, nbits);
302}
303
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700304static inline int bitmap_parse(const char *buf, unsigned int buflen,
305 unsigned long *maskp, int nmaskbits)
306{
307 return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
308}
309
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310#endif /* __ASSEMBLY__ */
311
312#endif /* __LINUX_BITMAP_H */