blob: 64c0926f5dd8e5801a2f8609721ae67e60d3e3e2 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * lib/bitmap.c
3 * Helper functions for bitmap.h.
4 *
5 * This source code is licensed under the GNU General Public License,
6 * Version 2. See the file COPYING for more details.
7 */
Paul Gortmaker8bc3bcc2011-11-16 21:29:17 -05008#include <linux/export.h>
9#include <linux/thread_info.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070010#include <linux/ctype.h>
11#include <linux/errno.h>
12#include <linux/bitmap.h>
13#include <linux/bitops.h>
Paul Gortmaker50af5ea2012-01-20 18:35:53 -050014#include <linux/bug.h>
Sudeep Holla5aaba362014-09-30 14:48:22 +010015
16#include <asm/page.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <asm/uaccess.h>
18
19/*
20 * bitmaps provide an array of bits, implemented using an an
21 * array of unsigned longs. The number of valid bits in a
22 * given bitmap does _not_ need to be an exact multiple of
23 * BITS_PER_LONG.
24 *
25 * The possible unused bits in the last, partially used word
26 * of a bitmap are 'don't care'. The implementation makes
27 * no particular effort to keep them zero. It ensures that
28 * their value will not affect the results of any operation.
29 * The bitmap operations that return Boolean (bitmap_empty,
30 * for example) or scalar (bitmap_weight, for example) results
31 * carefully filter out these unused bits from impacting their
32 * results.
33 *
34 * These operations actually hold to a slightly stronger rule:
35 * if you don't input any bitmaps to these ops that have some
36 * unused bits set, then they won't output any set unused bits
37 * in output bitmaps.
38 *
39 * The byte ordering of bitmaps is more natural on little
40 * endian architectures. See the big-endian headers
41 * include/asm-ppc64/bitops.h and include/asm-s390/bitops.h
42 * for the best explanations of this ordering.
43 */
44
Linus Torvalds1da177e2005-04-16 15:20:36 -070045int __bitmap_equal(const unsigned long *bitmap1,
Rasmus Villemoes5e0680692014-08-06 16:09:53 -070046 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -070047{
Rasmus Villemoes5e0680692014-08-06 16:09:53 -070048 unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 for (k = 0; k < lim; ++k)
50 if (bitmap1[k] != bitmap2[k])
51 return 0;
52
53 if (bits % BITS_PER_LONG)
54 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
55 return 0;
56
57 return 1;
58}
59EXPORT_SYMBOL(__bitmap_equal);
60
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -070061void __bitmap_complement(unsigned long *dst, const unsigned long *src, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -070062{
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -070063 unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 for (k = 0; k < lim; ++k)
65 dst[k] = ~src[k];
66
67 if (bits % BITS_PER_LONG)
Rasmus Villemoes65b4ee62014-08-06 16:09:57 -070068 dst[k] = ~src[k];
Linus Torvalds1da177e2005-04-16 15:20:36 -070069}
70EXPORT_SYMBOL(__bitmap_complement);
71
Robert P. J. Day72fd4a32007-02-10 01:45:59 -080072/**
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 * __bitmap_shift_right - logical right shift of the bits in a bitmap
Randy Dunlap05fb6bf2007-02-28 20:12:13 -080074 * @dst : destination bitmap
75 * @src : source bitmap
76 * @shift : shift by this many bits
Rasmus Villemoes2fbad292015-02-13 14:36:02 -080077 * @nbits : bitmap size, in bits
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 *
79 * Shifting right (dividing) means moving bits in the MS -> LS bit
80 * direction. Zeros are fed into the vacated MS positions and the
81 * LS bits shifted off the bottom are lost.
82 */
Rasmus Villemoes2fbad292015-02-13 14:36:02 -080083void __bitmap_shift_right(unsigned long *dst, const unsigned long *src,
84 unsigned shift, unsigned nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -070085{
Rasmus Villemoescfac1d02015-02-13 14:36:10 -080086 unsigned k, lim = BITS_TO_LONGS(nbits);
Rasmus Villemoes2fbad292015-02-13 14:36:02 -080087 unsigned off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG;
Rasmus Villemoescfac1d02015-02-13 14:36:10 -080088 unsigned long mask = BITMAP_LAST_WORD_MASK(nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 for (k = 0; off + k < lim; ++k) {
90 unsigned long upper, lower;
91
92 /*
93 * If shift is not word aligned, take lower rem bits of
94 * word above and make them the top rem bits of result.
95 */
96 if (!rem || off + k + 1 >= lim)
97 upper = 0;
98 else {
99 upper = src[off + k + 1];
Rasmus Villemoescfac1d02015-02-13 14:36:10 -0800100 if (off + k + 1 == lim - 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101 upper &= mask;
Rasmus Villemoes9d8a6b22015-02-13 14:36:05 -0800102 upper <<= (BITS_PER_LONG - rem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 }
104 lower = src[off + k];
Rasmus Villemoescfac1d02015-02-13 14:36:10 -0800105 if (off + k == lim - 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106 lower &= mask;
Rasmus Villemoes9d8a6b22015-02-13 14:36:05 -0800107 lower >>= rem;
108 dst[k] = lower | upper;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109 }
110 if (off)
111 memset(&dst[lim - off], 0, off*sizeof(unsigned long));
112}
113EXPORT_SYMBOL(__bitmap_shift_right);
114
115
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800116/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 * __bitmap_shift_left - logical left shift of the bits in a bitmap
Randy Dunlap05fb6bf2007-02-28 20:12:13 -0800118 * @dst : destination bitmap
119 * @src : source bitmap
120 * @shift : shift by this many bits
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800121 * @nbits : bitmap size, in bits
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 *
123 * Shifting left (multiplying) means moving bits in the LS -> MS
124 * direction. Zeros are fed into the vacated LS bit positions
125 * and those MS bits shifted off the top are lost.
126 */
127
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800128void __bitmap_shift_left(unsigned long *dst, const unsigned long *src,
129 unsigned int shift, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130{
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800131 int k;
Rasmus Villemoes7f590652015-02-13 14:36:19 -0800132 unsigned int lim = BITS_TO_LONGS(nbits);
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800133 unsigned int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134 for (k = lim - off - 1; k >= 0; --k) {
135 unsigned long upper, lower;
136
137 /*
138 * If shift is not word aligned, take upper rem bits of
139 * word below and make them the bottom rem bits of result.
140 */
141 if (rem && k > 0)
Rasmus Villemoes6d874ec2015-02-13 14:36:16 -0800142 lower = src[k - 1] >> (BITS_PER_LONG - rem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143 else
144 lower = 0;
Rasmus Villemoes7f590652015-02-13 14:36:19 -0800145 upper = src[k] << rem;
Rasmus Villemoes6d874ec2015-02-13 14:36:16 -0800146 dst[k + off] = lower | upper;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147 }
148 if (off)
149 memset(dst, 0, off*sizeof(unsigned long));
150}
151EXPORT_SYMBOL(__bitmap_shift_left);
152
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700153int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700154 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155{
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700156 unsigned int k;
Rasmus Villemoes7e5f97d2014-08-06 16:10:22 -0700157 unsigned int lim = bits/BITS_PER_LONG;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700158 unsigned long result = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
Rasmus Villemoes7e5f97d2014-08-06 16:10:22 -0700160 for (k = 0; k < lim; k++)
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700161 result |= (dst[k] = bitmap1[k] & bitmap2[k]);
Rasmus Villemoes7e5f97d2014-08-06 16:10:22 -0700162 if (bits % BITS_PER_LONG)
163 result |= (dst[k] = bitmap1[k] & bitmap2[k] &
164 BITMAP_LAST_WORD_MASK(bits));
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700165 return result != 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166}
167EXPORT_SYMBOL(__bitmap_and);
168
169void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700170 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171{
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700172 unsigned int k;
173 unsigned int nr = BITS_TO_LONGS(bits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174
175 for (k = 0; k < nr; k++)
176 dst[k] = bitmap1[k] | bitmap2[k];
177}
178EXPORT_SYMBOL(__bitmap_or);
179
180void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700181 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182{
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700183 unsigned int k;
184 unsigned int nr = BITS_TO_LONGS(bits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185
186 for (k = 0; k < nr; k++)
187 dst[k] = bitmap1[k] ^ bitmap2[k];
188}
189EXPORT_SYMBOL(__bitmap_xor);
190
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700191int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700192 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193{
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700194 unsigned int k;
Rasmus Villemoes74e76532014-08-06 16:10:24 -0700195 unsigned int lim = bits/BITS_PER_LONG;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700196 unsigned long result = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197
Rasmus Villemoes74e76532014-08-06 16:10:24 -0700198 for (k = 0; k < lim; k++)
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700199 result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);
Rasmus Villemoes74e76532014-08-06 16:10:24 -0700200 if (bits % BITS_PER_LONG)
201 result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &
202 BITMAP_LAST_WORD_MASK(bits));
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700203 return result != 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204}
205EXPORT_SYMBOL(__bitmap_andnot);
206
207int __bitmap_intersects(const unsigned long *bitmap1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700208 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209{
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700210 unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211 for (k = 0; k < lim; ++k)
212 if (bitmap1[k] & bitmap2[k])
213 return 1;
214
215 if (bits % BITS_PER_LONG)
216 if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
217 return 1;
218 return 0;
219}
220EXPORT_SYMBOL(__bitmap_intersects);
221
222int __bitmap_subset(const unsigned long *bitmap1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700223 const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224{
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700225 unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 for (k = 0; k < lim; ++k)
227 if (bitmap1[k] & ~bitmap2[k])
228 return 0;
229
230 if (bits % BITS_PER_LONG)
231 if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
232 return 0;
233 return 1;
234}
235EXPORT_SYMBOL(__bitmap_subset);
236
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700237int __bitmap_weight(const unsigned long *bitmap, unsigned int bits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238{
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700239 unsigned int k, lim = bits/BITS_PER_LONG;
240 int w = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241
242 for (k = 0; k < lim; k++)
Akinobu Mita37d54112006-03-26 01:39:56 -0800243 w += hweight_long(bitmap[k]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244
245 if (bits % BITS_PER_LONG)
Akinobu Mita37d54112006-03-26 01:39:56 -0800246 w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247
248 return w;
249}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250EXPORT_SYMBOL(__bitmap_weight);
251
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700252void bitmap_set(unsigned long *map, unsigned int start, int len)
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800253{
254 unsigned long *p = map + BIT_WORD(start);
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700255 const unsigned int size = start + len;
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800256 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
257 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start);
258
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700259 while (len - bits_to_set >= 0) {
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800260 *p |= mask_to_set;
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700261 len -= bits_to_set;
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800262 bits_to_set = BITS_PER_LONG;
263 mask_to_set = ~0UL;
264 p++;
265 }
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700266 if (len) {
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800267 mask_to_set &= BITMAP_LAST_WORD_MASK(size);
268 *p |= mask_to_set;
269 }
270}
271EXPORT_SYMBOL(bitmap_set);
272
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700273void bitmap_clear(unsigned long *map, unsigned int start, int len)
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800274{
275 unsigned long *p = map + BIT_WORD(start);
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700276 const unsigned int size = start + len;
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800277 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
278 unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start);
279
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700280 while (len - bits_to_clear >= 0) {
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800281 *p &= ~mask_to_clear;
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700282 len -= bits_to_clear;
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800283 bits_to_clear = BITS_PER_LONG;
284 mask_to_clear = ~0UL;
285 p++;
286 }
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700287 if (len) {
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800288 mask_to_clear &= BITMAP_LAST_WORD_MASK(size);
289 *p &= ~mask_to_clear;
290 }
291}
292EXPORT_SYMBOL(bitmap_clear);
293
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800294/**
295 * bitmap_find_next_zero_area_off - find a contiguous aligned zero area
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800296 * @map: The address to base the search on
297 * @size: The bitmap size in bits
298 * @start: The bitnumber to start searching at
299 * @nr: The number of zeroed bits we're looking for
300 * @align_mask: Alignment mask for zero area
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800301 * @align_offset: Alignment offset for zero area.
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800302 *
303 * The @align_mask should be one less than a power of 2; the effect is that
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800304 * the bit offset of all zero areas this function finds plus @align_offset
305 * is multiple of that power of 2.
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800306 */
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800307unsigned long bitmap_find_next_zero_area_off(unsigned long *map,
308 unsigned long size,
309 unsigned long start,
310 unsigned int nr,
311 unsigned long align_mask,
312 unsigned long align_offset)
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800313{
314 unsigned long index, end, i;
315again:
316 index = find_next_zero_bit(map, size, start);
317
318 /* Align allocation */
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800319 index = __ALIGN_MASK(index + align_offset, align_mask) - align_offset;
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800320
321 end = index + nr;
322 if (end > size)
323 return end;
324 i = find_next_bit(map, end, index);
325 if (i < end) {
326 start = i + 1;
327 goto again;
328 }
329 return index;
330}
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800331EXPORT_SYMBOL(bitmap_find_next_zero_area_off);
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800332
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333/*
Nadia Yvette Chambers6d49e352012-12-06 10:39:54 +0100334 * Bitmap printing & parsing functions: first version by Nadia Yvette Chambers,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335 * second version by Paul Jackson, third by Joe Korty.
336 */
337
338#define CHUNKSZ 32
339#define nbits_to_hold_value(val) fls(val)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340#define BASEDEC 10 /* fancier cpuset lists input in decimal */
341
342/**
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700343 * __bitmap_parse - convert an ASCII hex string into a bitmap.
344 * @buf: pointer to buffer containing string.
345 * @buflen: buffer size in bytes. If string is smaller than this
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346 * then it must be terminated with a \0.
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700347 * @is_user: location of buffer, 0 indicates kernel space
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348 * @maskp: pointer to bitmap array that will contain result.
349 * @nmaskbits: size of bitmap, in bits.
350 *
351 * Commas group hex digits into chunks. Each chunk defines exactly 32
352 * bits of the resultant bitmask. No chunk may specify a value larger
Randy Dunlap6e1907ff2006-06-25 05:48:57 -0700353 * than 32 bits (%-EOVERFLOW), and if a chunk specifies a smaller value
354 * then leading 0-bits are prepended. %-EINVAL is returned for illegal
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355 * characters and for grouping errors such as "1,,5", ",44", "," and "".
356 * Leading and trailing whitespace accepted, but not embedded whitespace.
357 */
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700358int __bitmap_parse(const char *buf, unsigned int buflen,
359 int is_user, unsigned long *maskp,
360 int nmaskbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361{
362 int c, old_c, totaldigits, ndigits, nchunks, nbits;
363 u32 chunk;
H Hartley Sweetenb9c321f2011-10-31 17:12:32 -0700364 const char __user __force *ubuf = (const char __user __force *)buf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
366 bitmap_zero(maskp, nmaskbits);
367
368 nchunks = nbits = totaldigits = c = 0;
369 do {
370 chunk = ndigits = 0;
371
372 /* Get the next chunk of the bitmap */
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700373 while (buflen) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374 old_c = c;
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700375 if (is_user) {
376 if (__get_user(c, ubuf++))
377 return -EFAULT;
378 }
379 else
380 c = *buf++;
381 buflen--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382 if (isspace(c))
383 continue;
384
385 /*
386 * If the last character was a space and the current
387 * character isn't '\0', we've got embedded whitespace.
388 * This is a no-no, so throw an error.
389 */
390 if (totaldigits && c && isspace(old_c))
391 return -EINVAL;
392
393 /* A '\0' or a ',' signal the end of the chunk */
394 if (c == '\0' || c == ',')
395 break;
396
397 if (!isxdigit(c))
398 return -EINVAL;
399
400 /*
401 * Make sure there are at least 4 free bits in 'chunk'.
402 * If not, this hexdigit will overflow 'chunk', so
403 * throw an error.
404 */
405 if (chunk & ~((1UL << (CHUNKSZ - 4)) - 1))
406 return -EOVERFLOW;
407
Andy Shevchenko66f19912010-10-26 14:23:03 -0700408 chunk = (chunk << 4) | hex_to_bin(c);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409 ndigits++; totaldigits++;
410 }
411 if (ndigits == 0)
412 return -EINVAL;
413 if (nchunks == 0 && chunk == 0)
414 continue;
415
416 __bitmap_shift_left(maskp, maskp, CHUNKSZ, nmaskbits);
417 *maskp |= chunk;
418 nchunks++;
419 nbits += (nchunks == 1) ? nbits_to_hold_value(chunk) : CHUNKSZ;
420 if (nbits > nmaskbits)
421 return -EOVERFLOW;
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700422 } while (buflen && c == ',');
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
424 return 0;
425}
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700426EXPORT_SYMBOL(__bitmap_parse);
427
428/**
Ben Hutchings9a86e2b2010-03-05 13:43:17 -0800429 * bitmap_parse_user - convert an ASCII hex string in a user buffer into a bitmap
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700430 *
431 * @ubuf: pointer to user buffer containing string.
432 * @ulen: buffer size in bytes. If string is smaller than this
433 * then it must be terminated with a \0.
434 * @maskp: pointer to bitmap array that will contain result.
435 * @nmaskbits: size of bitmap, in bits.
436 *
437 * Wrapper for __bitmap_parse(), providing it with user buffer.
438 *
439 * We cannot have this as an inline function in bitmap.h because it needs
440 * linux/uaccess.h to get the access_ok() declaration and this causes
441 * cyclic dependencies.
442 */
443int bitmap_parse_user(const char __user *ubuf,
444 unsigned int ulen, unsigned long *maskp,
445 int nmaskbits)
446{
447 if (!access_ok(VERIFY_READ, ubuf, ulen))
448 return -EFAULT;
H Hartley Sweetenb9c321f2011-10-31 17:12:32 -0700449 return __bitmap_parse((const char __force *)ubuf,
450 ulen, 1, maskp, nmaskbits);
451
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700452}
453EXPORT_SYMBOL(bitmap_parse_user);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455/**
Sudeep Holla5aaba362014-09-30 14:48:22 +0100456 * bitmap_print_to_pagebuf - convert bitmap to list or hex format ASCII string
457 * @list: indicates whether the bitmap must be list
458 * @buf: page aligned buffer into which string is placed
459 * @maskp: pointer to bitmap to convert
460 * @nmaskbits: size of bitmap, in bits
461 *
462 * Output format is a comma-separated list of decimal numbers and
463 * ranges if list is specified or hex digits grouped into comma-separated
464 * sets of 8 digits/set. Returns the number of characters written to buf.
465 */
466int bitmap_print_to_pagebuf(bool list, char *buf, const unsigned long *maskp,
467 int nmaskbits)
468{
469 ptrdiff_t len = PTR_ALIGN(buf + PAGE_SIZE - 1, PAGE_SIZE) - buf - 2;
470 int n = 0;
471
472 if (len > 1) {
Tejun Heo4a0792b2015-02-13 14:37:00 -0800473 n = list ? scnprintf(buf, len, "%*pbl", nmaskbits, maskp) :
474 scnprintf(buf, len, "%*pb", nmaskbits, maskp);
Sudeep Holla5aaba362014-09-30 14:48:22 +0100475 buf[n++] = '\n';
476 buf[n] = '\0';
477 }
478 return n;
479}
480EXPORT_SYMBOL(bitmap_print_to_pagebuf);
481
482/**
Mike Travis4b060422011-05-24 17:13:12 -0700483 * __bitmap_parselist - convert list format ASCII string to bitmap
Randy Dunlapb0825ee2011-06-15 15:08:10 -0700484 * @buf: read nul-terminated user string from this buffer
Mike Travis4b060422011-05-24 17:13:12 -0700485 * @buflen: buffer size in bytes. If string is smaller than this
486 * then it must be terminated with a \0.
487 * @is_user: location of buffer, 0 indicates kernel space
Randy Dunlap6e1907ff2006-06-25 05:48:57 -0700488 * @maskp: write resulting mask here
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 * @nmaskbits: number of bits in mask to be written
490 *
491 * Input format is a comma-separated list of decimal numbers and
492 * ranges. Consecutively set bits are shown as two hyphen-separated
493 * decimal numbers, the smallest and largest bit numbers set in
494 * the range.
495 *
Randy Dunlap6e1907ff2006-06-25 05:48:57 -0700496 * Returns 0 on success, -errno on invalid input strings.
497 * Error values:
498 * %-EINVAL: second number in range smaller than first
499 * %-EINVAL: invalid character in string
500 * %-ERANGE: bit number specified too large for mask
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501 */
Mike Travis4b060422011-05-24 17:13:12 -0700502static int __bitmap_parselist(const char *buf, unsigned int buflen,
503 int is_user, unsigned long *maskp,
504 int nmaskbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505{
506 unsigned a, b;
Mike Travis4b060422011-05-24 17:13:12 -0700507 int c, old_c, totaldigits;
H Hartley Sweetenb9c321f2011-10-31 17:12:32 -0700508 const char __user __force *ubuf = (const char __user __force *)buf;
Mike Travis4b060422011-05-24 17:13:12 -0700509 int exp_digit, in_range;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510
Mike Travis4b060422011-05-24 17:13:12 -0700511 totaldigits = c = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512 bitmap_zero(maskp, nmaskbits);
513 do {
Mike Travis4b060422011-05-24 17:13:12 -0700514 exp_digit = 1;
515 in_range = 0;
516 a = b = 0;
517
518 /* Get the next cpu# or a range of cpu#'s */
519 while (buflen) {
520 old_c = c;
521 if (is_user) {
522 if (__get_user(c, ubuf++))
523 return -EFAULT;
524 } else
525 c = *buf++;
526 buflen--;
527 if (isspace(c))
528 continue;
529
530 /*
531 * If the last character was a space and the current
532 * character isn't '\0', we've got embedded whitespace.
533 * This is a no-no, so throw an error.
534 */
535 if (totaldigits && c && isspace(old_c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 return -EINVAL;
Mike Travis4b060422011-05-24 17:13:12 -0700537
538 /* A '\0' or a ',' signal the end of a cpu# or range */
539 if (c == '\0' || c == ',')
540 break;
541
542 if (c == '-') {
543 if (exp_digit || in_range)
544 return -EINVAL;
545 b = 0;
546 in_range = 1;
547 exp_digit = 1;
548 continue;
549 }
550
551 if (!isdigit(c))
552 return -EINVAL;
553
554 b = b * 10 + (c - '0');
555 if (!in_range)
556 a = b;
557 exp_digit = 0;
558 totaldigits++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559 }
560 if (!(a <= b))
561 return -EINVAL;
562 if (b >= nmaskbits)
563 return -ERANGE;
564 while (a <= b) {
565 set_bit(a, maskp);
566 a++;
567 }
Mike Travis4b060422011-05-24 17:13:12 -0700568 } while (buflen && c == ',');
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 return 0;
570}
Mike Travis4b060422011-05-24 17:13:12 -0700571
572int bitmap_parselist(const char *bp, unsigned long *maskp, int nmaskbits)
573{
Rasmus Villemoesbc5be182014-08-06 16:10:12 -0700574 char *nl = strchrnul(bp, '\n');
575 int len = nl - bp;
Mike Travis4b060422011-05-24 17:13:12 -0700576
577 return __bitmap_parselist(bp, len, 0, maskp, nmaskbits);
578}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579EXPORT_SYMBOL(bitmap_parselist);
580
Mike Travis4b060422011-05-24 17:13:12 -0700581
582/**
583 * bitmap_parselist_user()
584 *
585 * @ubuf: pointer to user buffer containing string.
586 * @ulen: buffer size in bytes. If string is smaller than this
587 * then it must be terminated with a \0.
588 * @maskp: pointer to bitmap array that will contain result.
589 * @nmaskbits: size of bitmap, in bits.
590 *
591 * Wrapper for bitmap_parselist(), providing it with user buffer.
592 *
593 * We cannot have this as an inline function in bitmap.h because it needs
594 * linux/uaccess.h to get the access_ok() declaration and this causes
595 * cyclic dependencies.
596 */
597int bitmap_parselist_user(const char __user *ubuf,
598 unsigned int ulen, unsigned long *maskp,
599 int nmaskbits)
600{
601 if (!access_ok(VERIFY_READ, ubuf, ulen))
602 return -EFAULT;
H Hartley Sweetenb9c321f2011-10-31 17:12:32 -0700603 return __bitmap_parselist((const char __force *)ubuf,
Mike Travis4b060422011-05-24 17:13:12 -0700604 ulen, 1, maskp, nmaskbits);
605}
606EXPORT_SYMBOL(bitmap_parselist_user);
607
608
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800609/**
Ben Hutchings9a86e2b2010-03-05 13:43:17 -0800610 * bitmap_pos_to_ord - find ordinal of set bit at given position in bitmap
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800611 * @buf: pointer to a bitmap
Rasmus Villemoesdf1d80a2015-02-12 15:02:07 -0800612 * @pos: a bit position in @buf (0 <= @pos < @nbits)
613 * @nbits: number of valid bit positions in @buf
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800614 *
Rasmus Villemoesdf1d80a2015-02-12 15:02:07 -0800615 * Map the bit at position @pos in @buf (of length @nbits) to the
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800616 * ordinal of which set bit it is. If it is not set or if @pos
Paul Jackson96b7f342006-01-08 01:01:46 -0800617 * is not a valid bit position, map to -1.
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800618 *
619 * If for example, just bits 4 through 7 are set in @buf, then @pos
620 * values 4 through 7 will get mapped to 0 through 3, respectively,
Rasmus Villemoesa8551742014-08-06 16:10:14 -0700621 * and other @pos values will get mapped to -1. When @pos value 7
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800622 * gets mapped to (returns) @ord value 3 in this example, that means
623 * that bit 7 is the 3rd (starting with 0th) set bit in @buf.
624 *
625 * The bit positions 0 through @bits are valid positions in @buf.
626 */
Rasmus Villemoesdf1d80a2015-02-12 15:02:07 -0800627static int bitmap_pos_to_ord(const unsigned long *buf, unsigned int pos, unsigned int nbits)
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800628{
Rasmus Villemoesdf1d80a2015-02-12 15:02:07 -0800629 if (pos >= nbits || !test_bit(pos, buf))
Paul Jackson96b7f342006-01-08 01:01:46 -0800630 return -1;
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800631
Rasmus Villemoesdf1d80a2015-02-12 15:02:07 -0800632 return __bitmap_weight(buf, pos);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800633}
634
635/**
Ben Hutchings9a86e2b2010-03-05 13:43:17 -0800636 * bitmap_ord_to_pos - find position of n-th set bit in bitmap
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800637 * @buf: pointer to bitmap
638 * @ord: ordinal bit position (n-th set bit, n >= 0)
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800639 * @nbits: number of valid bit positions in @buf
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800640 *
641 * Map the ordinal offset of bit @ord in @buf to its position in @buf.
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800642 * Value of @ord should be in range 0 <= @ord < weight(buf). If @ord
643 * >= weight(buf), returns @nbits.
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800644 *
645 * If for example, just bits 4 through 7 are set in @buf, then @ord
646 * values 0 through 3 will get mapped to 4 through 7, respectively,
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800647 * and all other @ord values returns @nbits. When @ord value 3
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800648 * gets mapped to (returns) @pos value 7 in this example, that means
649 * that the 3rd set bit (starting with 0th) is at position 7 in @buf.
650 *
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800651 * The bit positions 0 through @nbits-1 are valid positions in @buf.
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800652 */
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800653unsigned int bitmap_ord_to_pos(const unsigned long *buf, unsigned int ord, unsigned int nbits)
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800654{
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800655 unsigned int pos;
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800656
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800657 for (pos = find_first_bit(buf, nbits);
658 pos < nbits && ord;
659 pos = find_next_bit(buf, nbits, pos + 1))
660 ord--;
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800661
662 return pos;
663}
664
665/**
666 * bitmap_remap - Apply map defined by a pair of bitmaps to another bitmap
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800667 * @dst: remapped result
Paul Jackson96b7f342006-01-08 01:01:46 -0800668 * @src: subset to be remapped
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800669 * @old: defines domain of map
670 * @new: defines range of map
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800671 * @nbits: number of bits in each of these bitmaps
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800672 *
673 * Let @old and @new define a mapping of bit positions, such that
674 * whatever position is held by the n-th set bit in @old is mapped
675 * to the n-th set bit in @new. In the more general case, allowing
676 * for the possibility that the weight 'w' of @new is less than the
677 * weight of @old, map the position of the n-th set bit in @old to
678 * the position of the m-th set bit in @new, where m == n % w.
679 *
Paul Jackson96b7f342006-01-08 01:01:46 -0800680 * If either of the @old and @new bitmaps are empty, or if @src and
681 * @dst point to the same location, then this routine copies @src
682 * to @dst.
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800683 *
Paul Jackson96b7f342006-01-08 01:01:46 -0800684 * The positions of unset bits in @old are mapped to themselves
685 * (the identify map).
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800686 *
687 * Apply the above specified mapping to @src, placing the result in
688 * @dst, clearing any bits previously set in @dst.
689 *
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800690 * For example, lets say that @old has bits 4 through 7 set, and
691 * @new has bits 12 through 15 set. This defines the mapping of bit
692 * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
Paul Jackson96b7f342006-01-08 01:01:46 -0800693 * bit positions unchanged. So if say @src comes into this routine
694 * with bits 1, 5 and 7 set, then @dst should leave with bits 1,
695 * 13 and 15 set.
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800696 */
697void bitmap_remap(unsigned long *dst, const unsigned long *src,
698 const unsigned long *old, const unsigned long *new,
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800699 unsigned int nbits)
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800700{
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800701 unsigned int oldbit, w;
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800702
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800703 if (dst == src) /* following doesn't handle inplace remaps */
704 return;
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800705 bitmap_zero(dst, nbits);
Paul Jackson96b7f342006-01-08 01:01:46 -0800706
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800707 w = bitmap_weight(new, nbits);
708 for_each_set_bit(oldbit, src, nbits) {
709 int n = bitmap_pos_to_ord(old, oldbit, nbits);
Akinobu Mita08564fb2010-03-05 13:43:18 -0800710
Paul Jackson96b7f342006-01-08 01:01:46 -0800711 if (n < 0 || w == 0)
712 set_bit(oldbit, dst); /* identity map */
713 else
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800714 set_bit(bitmap_ord_to_pos(new, n % w, nbits), dst);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800715 }
716}
717EXPORT_SYMBOL(bitmap_remap);
718
719/**
720 * bitmap_bitremap - Apply map defined by a pair of bitmaps to a single bit
Randy Dunlap6e1907ff2006-06-25 05:48:57 -0700721 * @oldbit: bit position to be mapped
722 * @old: defines domain of map
723 * @new: defines range of map
724 * @bits: number of bits in each of these bitmaps
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800725 *
726 * Let @old and @new define a mapping of bit positions, such that
727 * whatever position is held by the n-th set bit in @old is mapped
728 * to the n-th set bit in @new. In the more general case, allowing
729 * for the possibility that the weight 'w' of @new is less than the
730 * weight of @old, map the position of the n-th set bit in @old to
731 * the position of the m-th set bit in @new, where m == n % w.
732 *
Paul Jackson96b7f342006-01-08 01:01:46 -0800733 * The positions of unset bits in @old are mapped to themselves
734 * (the identify map).
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800735 *
736 * Apply the above specified mapping to bit position @oldbit, returning
737 * the new bit position.
738 *
739 * For example, lets say that @old has bits 4 through 7 set, and
740 * @new has bits 12 through 15 set. This defines the mapping of bit
741 * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
Paul Jackson96b7f342006-01-08 01:01:46 -0800742 * bit positions unchanged. So if say @oldbit is 5, then this routine
743 * returns 13.
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800744 */
745int bitmap_bitremap(int oldbit, const unsigned long *old,
746 const unsigned long *new, int bits)
747{
Paul Jackson96b7f342006-01-08 01:01:46 -0800748 int w = bitmap_weight(new, bits);
749 int n = bitmap_pos_to_ord(old, oldbit, bits);
750 if (n < 0 || w == 0)
751 return oldbit;
752 else
753 return bitmap_ord_to_pos(new, n % w, bits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800754}
755EXPORT_SYMBOL(bitmap_bitremap);
756
Paul Jackson7ea931c2008-04-28 02:12:29 -0700757/**
758 * bitmap_onto - translate one bitmap relative to another
759 * @dst: resulting translated bitmap
760 * @orig: original untranslated bitmap
761 * @relmap: bitmap relative to which translated
762 * @bits: number of bits in each of these bitmaps
763 *
764 * Set the n-th bit of @dst iff there exists some m such that the
765 * n-th bit of @relmap is set, the m-th bit of @orig is set, and
766 * the n-th bit of @relmap is also the m-th _set_ bit of @relmap.
767 * (If you understood the previous sentence the first time your
768 * read it, you're overqualified for your current job.)
769 *
770 * In other words, @orig is mapped onto (surjectively) @dst,
Masanari Iidada3dae52014-09-09 01:27:23 +0900771 * using the map { <n, m> | the n-th bit of @relmap is the
Paul Jackson7ea931c2008-04-28 02:12:29 -0700772 * m-th set bit of @relmap }.
773 *
774 * Any set bits in @orig above bit number W, where W is the
775 * weight of (number of set bits in) @relmap are mapped nowhere.
776 * In particular, if for all bits m set in @orig, m >= W, then
777 * @dst will end up empty. In situations where the possibility
778 * of such an empty result is not desired, one way to avoid it is
779 * to use the bitmap_fold() operator, below, to first fold the
780 * @orig bitmap over itself so that all its set bits x are in the
781 * range 0 <= x < W. The bitmap_fold() operator does this by
782 * setting the bit (m % W) in @dst, for each bit (m) set in @orig.
783 *
784 * Example [1] for bitmap_onto():
785 * Let's say @relmap has bits 30-39 set, and @orig has bits
786 * 1, 3, 5, 7, 9 and 11 set. Then on return from this routine,
787 * @dst will have bits 31, 33, 35, 37 and 39 set.
788 *
789 * When bit 0 is set in @orig, it means turn on the bit in
790 * @dst corresponding to whatever is the first bit (if any)
791 * that is turned on in @relmap. Since bit 0 was off in the
792 * above example, we leave off that bit (bit 30) in @dst.
793 *
794 * When bit 1 is set in @orig (as in the above example), it
795 * means turn on the bit in @dst corresponding to whatever
796 * is the second bit that is turned on in @relmap. The second
797 * bit in @relmap that was turned on in the above example was
798 * bit 31, so we turned on bit 31 in @dst.
799 *
800 * Similarly, we turned on bits 33, 35, 37 and 39 in @dst,
801 * because they were the 4th, 6th, 8th and 10th set bits
802 * set in @relmap, and the 4th, 6th, 8th and 10th bits of
803 * @orig (i.e. bits 3, 5, 7 and 9) were also set.
804 *
805 * When bit 11 is set in @orig, it means turn on the bit in
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300806 * @dst corresponding to whatever is the twelfth bit that is
Paul Jackson7ea931c2008-04-28 02:12:29 -0700807 * turned on in @relmap. In the above example, there were
808 * only ten bits turned on in @relmap (30..39), so that bit
809 * 11 was set in @orig had no affect on @dst.
810 *
811 * Example [2] for bitmap_fold() + bitmap_onto():
812 * Let's say @relmap has these ten bits set:
813 * 40 41 42 43 45 48 53 61 74 95
814 * (for the curious, that's 40 plus the first ten terms of the
815 * Fibonacci sequence.)
816 *
817 * Further lets say we use the following code, invoking
818 * bitmap_fold() then bitmap_onto, as suggested above to
Masanari Iidada3dae52014-09-09 01:27:23 +0900819 * avoid the possibility of an empty @dst result:
Paul Jackson7ea931c2008-04-28 02:12:29 -0700820 *
821 * unsigned long *tmp; // a temporary bitmap's bits
822 *
823 * bitmap_fold(tmp, orig, bitmap_weight(relmap, bits), bits);
824 * bitmap_onto(dst, tmp, relmap, bits);
825 *
826 * Then this table shows what various values of @dst would be, for
827 * various @orig's. I list the zero-based positions of each set bit.
828 * The tmp column shows the intermediate result, as computed by
829 * using bitmap_fold() to fold the @orig bitmap modulo ten
830 * (the weight of @relmap).
831 *
832 * @orig tmp @dst
833 * 0 0 40
834 * 1 1 41
835 * 9 9 95
836 * 10 0 40 (*)
837 * 1 3 5 7 1 3 5 7 41 43 48 61
838 * 0 1 2 3 4 0 1 2 3 4 40 41 42 43 45
839 * 0 9 18 27 0 9 8 7 40 61 74 95
840 * 0 10 20 30 0 40
841 * 0 11 22 33 0 1 2 3 40 41 42 43
842 * 0 12 24 36 0 2 4 6 40 42 45 53
843 * 78 102 211 1 2 8 41 42 74 (*)
844 *
845 * (*) For these marked lines, if we hadn't first done bitmap_fold()
846 * into tmp, then the @dst result would have been empty.
847 *
848 * If either of @orig or @relmap is empty (no set bits), then @dst
849 * will be returned empty.
850 *
851 * If (as explained above) the only set bits in @orig are in positions
852 * m where m >= W, (where W is the weight of @relmap) then @dst will
853 * once again be returned empty.
854 *
855 * All bits in @dst not set by the above rule are cleared.
856 */
857void bitmap_onto(unsigned long *dst, const unsigned long *orig,
Rasmus Villemoeseb569882015-02-12 15:02:01 -0800858 const unsigned long *relmap, unsigned int bits)
Paul Jackson7ea931c2008-04-28 02:12:29 -0700859{
Rasmus Villemoeseb569882015-02-12 15:02:01 -0800860 unsigned int n, m; /* same meaning as in above comment */
Paul Jackson7ea931c2008-04-28 02:12:29 -0700861
862 if (dst == orig) /* following doesn't handle inplace mappings */
863 return;
864 bitmap_zero(dst, bits);
865
866 /*
867 * The following code is a more efficient, but less
868 * obvious, equivalent to the loop:
869 * for (m = 0; m < bitmap_weight(relmap, bits); m++) {
870 * n = bitmap_ord_to_pos(orig, m, bits);
871 * if (test_bit(m, orig))
872 * set_bit(n, dst);
873 * }
874 */
875
876 m = 0;
Akinobu Mita08564fb2010-03-05 13:43:18 -0800877 for_each_set_bit(n, relmap, bits) {
Paul Jackson7ea931c2008-04-28 02:12:29 -0700878 /* m == bitmap_pos_to_ord(relmap, n, bits) */
879 if (test_bit(m, orig))
880 set_bit(n, dst);
881 m++;
882 }
883}
884EXPORT_SYMBOL(bitmap_onto);
885
886/**
887 * bitmap_fold - fold larger bitmap into smaller, modulo specified size
888 * @dst: resulting smaller bitmap
889 * @orig: original larger bitmap
890 * @sz: specified size
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800891 * @nbits: number of bits in each of these bitmaps
Paul Jackson7ea931c2008-04-28 02:12:29 -0700892 *
893 * For each bit oldbit in @orig, set bit oldbit mod @sz in @dst.
894 * Clear all other bits in @dst. See further the comment and
895 * Example [2] for bitmap_onto() for why and how to use this.
896 */
897void bitmap_fold(unsigned long *dst, const unsigned long *orig,
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800898 unsigned int sz, unsigned int nbits)
Paul Jackson7ea931c2008-04-28 02:12:29 -0700899{
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800900 unsigned int oldbit;
Paul Jackson7ea931c2008-04-28 02:12:29 -0700901
902 if (dst == orig) /* following doesn't handle inplace mappings */
903 return;
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800904 bitmap_zero(dst, nbits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700905
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800906 for_each_set_bit(oldbit, orig, nbits)
Paul Jackson7ea931c2008-04-28 02:12:29 -0700907 set_bit(oldbit % sz, dst);
908}
909EXPORT_SYMBOL(bitmap_fold);
910
Paul Jackson3cf64b92006-03-24 03:15:46 -0800911/*
912 * Common code for bitmap_*_region() routines.
913 * bitmap: array of unsigned longs corresponding to the bitmap
914 * pos: the beginning of the region
915 * order: region size (log base 2 of number of bits)
916 * reg_op: operation(s) to perform on that region of bitmap
917 *
918 * Can set, verify and/or release a region of bits in a bitmap,
919 * depending on which combination of REG_OP_* flag bits is set.
920 *
921 * A region of a bitmap is a sequence of bits in the bitmap, of
922 * some size '1 << order' (a power of two), aligned to that same
923 * '1 << order' power of two.
924 *
925 * Returns 1 if REG_OP_ISFREE succeeds (region is all zero bits).
926 * Returns 0 in all other cases and reg_ops.
927 */
928
929enum {
930 REG_OP_ISFREE, /* true if region is all zero bits */
931 REG_OP_ALLOC, /* set all bits in region */
932 REG_OP_RELEASE, /* clear all bits in region */
933};
934
Rasmus Villemoes9279d322014-08-06 16:10:16 -0700935static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op)
Paul Jackson3cf64b92006-03-24 03:15:46 -0800936{
937 int nbits_reg; /* number of bits in region */
938 int index; /* index first long of region in bitmap */
939 int offset; /* bit offset region in bitmap[index] */
940 int nlongs_reg; /* num longs spanned by region in bitmap */
941 int nbitsinlong; /* num bits of region in each spanned long */
942 unsigned long mask; /* bitmask for one long of region */
943 int i; /* scans bitmap by longs */
944 int ret = 0; /* return value */
945
946 /*
947 * Either nlongs_reg == 1 (for small orders that fit in one long)
948 * or (offset == 0 && mask == ~0UL) (for larger multiword orders.)
949 */
950 nbits_reg = 1 << order;
951 index = pos / BITS_PER_LONG;
952 offset = pos - (index * BITS_PER_LONG);
953 nlongs_reg = BITS_TO_LONGS(nbits_reg);
954 nbitsinlong = min(nbits_reg, BITS_PER_LONG);
955
956 /*
957 * Can't do "mask = (1UL << nbitsinlong) - 1", as that
958 * overflows if nbitsinlong == BITS_PER_LONG.
959 */
960 mask = (1UL << (nbitsinlong - 1));
961 mask += mask - 1;
962 mask <<= offset;
963
964 switch (reg_op) {
965 case REG_OP_ISFREE:
966 for (i = 0; i < nlongs_reg; i++) {
967 if (bitmap[index + i] & mask)
968 goto done;
969 }
970 ret = 1; /* all bits in region free (zero) */
971 break;
972
973 case REG_OP_ALLOC:
974 for (i = 0; i < nlongs_reg; i++)
975 bitmap[index + i] |= mask;
976 break;
977
978 case REG_OP_RELEASE:
979 for (i = 0; i < nlongs_reg; i++)
980 bitmap[index + i] &= ~mask;
981 break;
982 }
983done:
984 return ret;
985}
986
Linus Torvalds1da177e2005-04-16 15:20:36 -0700987/**
Paul Jackson87e24802006-03-24 03:15:44 -0800988 * bitmap_find_free_region - find a contiguous aligned mem region
Paul Jackson3cf64b92006-03-24 03:15:46 -0800989 * @bitmap: array of unsigned longs corresponding to the bitmap
Linus Torvalds1da177e2005-04-16 15:20:36 -0700990 * @bits: number of bits in the bitmap
Paul Jackson3cf64b92006-03-24 03:15:46 -0800991 * @order: region size (log base 2 of number of bits) to find
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992 *
Paul Jackson3cf64b92006-03-24 03:15:46 -0800993 * Find a region of free (zero) bits in a @bitmap of @bits bits and
994 * allocate them (set them to one). Only consider regions of length
995 * a power (@order) of two, aligned to that power of two, which
Paul Jackson87e24802006-03-24 03:15:44 -0800996 * makes the search algorithm much faster.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700997 *
Paul Jackson3cf64b92006-03-24 03:15:46 -0800998 * Return the bit offset in bitmap of the allocated region,
Paul Jackson87e24802006-03-24 03:15:44 -0800999 * or -errno on failure.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001000 */
Rasmus Villemoes9279d322014-08-06 16:10:16 -07001001int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001002{
Rasmus Villemoes9279d322014-08-06 16:10:16 -07001003 unsigned int pos, end; /* scans bitmap by regions of size order */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001004
Rasmus Villemoes9279d322014-08-06 16:10:16 -07001005 for (pos = 0 ; (end = pos + (1U << order)) <= bits; pos = end) {
Linus Torvaldsaa8e4fc2009-03-12 19:32:51 -07001006 if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
1007 continue;
1008 __reg_op(bitmap, pos, order, REG_OP_ALLOC);
1009 return pos;
1010 }
1011 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001012}
1013EXPORT_SYMBOL(bitmap_find_free_region);
1014
1015/**
Paul Jackson87e24802006-03-24 03:15:44 -08001016 * bitmap_release_region - release allocated bitmap region
Paul Jackson3cf64b92006-03-24 03:15:46 -08001017 * @bitmap: array of unsigned longs corresponding to the bitmap
1018 * @pos: beginning of bit region to release
1019 * @order: region size (log base 2 of number of bits) to release
Linus Torvalds1da177e2005-04-16 15:20:36 -07001020 *
Robert P. J. Day72fd4a32007-02-10 01:45:59 -08001021 * This is the complement to __bitmap_find_free_region() and releases
Linus Torvalds1da177e2005-04-16 15:20:36 -07001022 * the found region (by clearing it in the bitmap).
Paul Jackson3cf64b92006-03-24 03:15:46 -08001023 *
1024 * No return value.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001025 */
Rasmus Villemoes9279d322014-08-06 16:10:16 -07001026void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001027{
Paul Jackson3cf64b92006-03-24 03:15:46 -08001028 __reg_op(bitmap, pos, order, REG_OP_RELEASE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001029}
1030EXPORT_SYMBOL(bitmap_release_region);
1031
Paul Jackson87e24802006-03-24 03:15:44 -08001032/**
1033 * bitmap_allocate_region - allocate bitmap region
Paul Jackson3cf64b92006-03-24 03:15:46 -08001034 * @bitmap: array of unsigned longs corresponding to the bitmap
1035 * @pos: beginning of bit region to allocate
1036 * @order: region size (log base 2 of number of bits) to allocate
Paul Jackson87e24802006-03-24 03:15:44 -08001037 *
1038 * Allocate (set bits in) a specified region of a bitmap.
Paul Jackson3cf64b92006-03-24 03:15:46 -08001039 *
Randy Dunlap6e1907ff2006-06-25 05:48:57 -07001040 * Return 0 on success, or %-EBUSY if specified region wasn't
Paul Jackson87e24802006-03-24 03:15:44 -08001041 * free (not all bits were zero).
1042 */
Rasmus Villemoes9279d322014-08-06 16:10:16 -07001043int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001044{
Paul Jackson3cf64b92006-03-24 03:15:46 -08001045 if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
1046 return -EBUSY;
Rasmus Villemoes2ac521d2014-08-06 16:10:18 -07001047 return __reg_op(bitmap, pos, order, REG_OP_ALLOC);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001048}
1049EXPORT_SYMBOL(bitmap_allocate_region);
David Vrabelccbe3292008-09-17 16:34:03 +01001050
1051/**
1052 * bitmap_copy_le - copy a bitmap, putting the bits into little-endian order.
1053 * @dst: destination buffer
1054 * @src: bitmap to copy
1055 * @nbits: number of bits in the bitmap
1056 *
1057 * Require nbits % BITS_PER_LONG == 0.
1058 */
Rasmus Villemoese8f24272015-02-13 14:36:00 -08001059#ifdef __BIG_ENDIAN
Rasmus Villemoes9b6c2d22015-02-13 14:35:57 -08001060void bitmap_copy_le(unsigned long *dst, const unsigned long *src, unsigned int nbits)
David Vrabelccbe3292008-09-17 16:34:03 +01001061{
Rasmus Villemoes9b6c2d22015-02-13 14:35:57 -08001062 unsigned int i;
David Vrabelccbe3292008-09-17 16:34:03 +01001063
1064 for (i = 0; i < nbits/BITS_PER_LONG; i++) {
1065 if (BITS_PER_LONG == 64)
Rasmus Villemoes9b6c2d22015-02-13 14:35:57 -08001066 dst[i] = cpu_to_le64(src[i]);
David Vrabelccbe3292008-09-17 16:34:03 +01001067 else
Rasmus Villemoes9b6c2d22015-02-13 14:35:57 -08001068 dst[i] = cpu_to_le32(src[i]);
David Vrabelccbe3292008-09-17 16:34:03 +01001069 }
1070}
1071EXPORT_SYMBOL(bitmap_copy_le);
Rasmus Villemoese8f24272015-02-13 14:36:00 -08001072#endif