bitmap.c 35.8 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5 6 7
/*
 * lib/bitmap.c
 * Helper functions for bitmap.h.
 *
 * This source code is licensed under the GNU General Public License,
 * Version 2.  See the file COPYING for more details.
 */
8 9
#include <linux/export.h>
#include <linux/thread_info.h>
Linus Torvalds's avatar
Linus Torvalds committed
10 11 12 13
#include <linux/ctype.h>
#include <linux/errno.h>
#include <linux/bitmap.h>
#include <linux/bitops.h>
14
#include <linux/bug.h>
15
#include <linux/kernel.h>
16
#include <linux/mm.h>
17
#include <linux/slab.h>
18
#include <linux/string.h>
19
#include <linux/uaccess.h>
20 21

#include <asm/page.h>
Linus Torvalds's avatar
Linus Torvalds committed
22

23 24 25
/**
 * DOC: bitmap introduction
 *
Linus Torvalds's avatar
Linus Torvalds committed
26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46
 * bitmaps provide an array of bits, implemented using an an
 * array of unsigned longs.  The number of valid bits in a
 * given bitmap does _not_ need to be an exact multiple of
 * BITS_PER_LONG.
 *
 * The possible unused bits in the last, partially used word
 * of a bitmap are 'don't care'.  The implementation makes
 * no particular effort to keep them zero.  It ensures that
 * their value will not affect the results of any operation.
 * The bitmap operations that return Boolean (bitmap_empty,
 * for example) or scalar (bitmap_weight, for example) results
 * carefully filter out these unused bits from impacting their
 * results.
 *
 * The byte ordering of bitmaps is more natural on little
 * endian architectures.  See the big-endian headers
 * include/asm-ppc64/bitops.h and include/asm-s390/bitops.h
 * for the best explanations of this ordering.
 */

int __bitmap_equal(const unsigned long *bitmap1,
47
		const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
48
{
49
	unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds's avatar
Linus Torvalds committed
50 51 52 53 54 55 56 57 58 59 60 61
	for (k = 0; k < lim; ++k)
		if (bitmap1[k] != bitmap2[k])
			return 0;

	if (bits % BITS_PER_LONG)
		if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
			return 0;

	return 1;
}
EXPORT_SYMBOL(__bitmap_equal);

62
void __bitmap_complement(unsigned long *dst, const unsigned long *src, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
63
{
64
	unsigned int k, lim = BITS_TO_LONGS(bits);
Linus Torvalds's avatar
Linus Torvalds committed
65 66 67 68 69
	for (k = 0; k < lim; ++k)
		dst[k] = ~src[k];
}
EXPORT_SYMBOL(__bitmap_complement);

70
/**
Linus Torvalds's avatar
Linus Torvalds committed
71
 * __bitmap_shift_right - logical right shift of the bits in a bitmap
72 73 74
 *   @dst : destination bitmap
 *   @src : source bitmap
 *   @shift : shift by this many bits
75
 *   @nbits : bitmap size, in bits
Linus Torvalds's avatar
Linus Torvalds committed
76 77 78 79 80
 *
 * Shifting right (dividing) means moving bits in the MS -> LS bit
 * direction.  Zeros are fed into the vacated MS positions and the
 * LS bits shifted off the bottom are lost.
 */
81 82
void __bitmap_shift_right(unsigned long *dst, const unsigned long *src,
			unsigned shift, unsigned nbits)
Linus Torvalds's avatar
Linus Torvalds committed
83
{
84
	unsigned k, lim = BITS_TO_LONGS(nbits);
85
	unsigned off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG;
86
	unsigned long mask = BITMAP_LAST_WORD_MASK(nbits);
Linus Torvalds's avatar
Linus Torvalds committed
87 88 89 90 91 92 93 94 95 96 97
	for (k = 0; off + k < lim; ++k) {
		unsigned long upper, lower;

		/*
		 * If shift is not word aligned, take lower rem bits of
		 * word above and make them the top rem bits of result.
		 */
		if (!rem || off + k + 1 >= lim)
			upper = 0;
		else {
			upper = src[off + k + 1];
98
			if (off + k + 1 == lim - 1)
Linus Torvalds's avatar
Linus Torvalds committed
99
				upper &= mask;
100
			upper <<= (BITS_PER_LONG - rem);
Linus Torvalds's avatar
Linus Torvalds committed
101 102
		}
		lower = src[off + k];
103
		if (off + k == lim - 1)
Linus Torvalds's avatar
Linus Torvalds committed
104
			lower &= mask;
105 106
		lower >>= rem;
		dst[k] = lower | upper;
Linus Torvalds's avatar
Linus Torvalds committed
107 108 109 110 111 112 113
	}
	if (off)
		memset(&dst[lim - off], 0, off*sizeof(unsigned long));
}
EXPORT_SYMBOL(__bitmap_shift_right);


114
/**
Linus Torvalds's avatar
Linus Torvalds committed
115
 * __bitmap_shift_left - logical left shift of the bits in a bitmap
116 117 118
 *   @dst : destination bitmap
 *   @src : source bitmap
 *   @shift : shift by this many bits
119
 *   @nbits : bitmap size, in bits
Linus Torvalds's avatar
Linus Torvalds committed
120 121 122 123 124 125
 *
 * Shifting left (multiplying) means moving bits in the LS -> MS
 * direction.  Zeros are fed into the vacated LS bit positions
 * and those MS bits shifted off the top are lost.
 */

126 127
void __bitmap_shift_left(unsigned long *dst, const unsigned long *src,
			unsigned int shift, unsigned int nbits)
Linus Torvalds's avatar
Linus Torvalds committed
128
{
129
	int k;
130
	unsigned int lim = BITS_TO_LONGS(nbits);
131
	unsigned int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG;
Linus Torvalds's avatar
Linus Torvalds committed
132 133 134 135 136 137 138 139
	for (k = lim - off - 1; k >= 0; --k) {
		unsigned long upper, lower;

		/*
		 * If shift is not word aligned, take upper rem bits of
		 * word below and make them the bottom rem bits of result.
		 */
		if (rem && k > 0)
140
			lower = src[k - 1] >> (BITS_PER_LONG - rem);
Linus Torvalds's avatar
Linus Torvalds committed
141 142
		else
			lower = 0;
143
		upper = src[k] << rem;
144
		dst[k + off] = lower | upper;
Linus Torvalds's avatar
Linus Torvalds committed
145 146 147 148 149 150
	}
	if (off)
		memset(dst, 0, off*sizeof(unsigned long));
}
EXPORT_SYMBOL(__bitmap_shift_left);

151
int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
152
				const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
153
{
154
	unsigned int k;
155
	unsigned int lim = bits/BITS_PER_LONG;
156
	unsigned long result = 0;
Linus Torvalds's avatar
Linus Torvalds committed
157

158
	for (k = 0; k < lim; k++)
159
		result |= (dst[k] = bitmap1[k] & bitmap2[k]);
160 161 162
	if (bits % BITS_PER_LONG)
		result |= (dst[k] = bitmap1[k] & bitmap2[k] &
			   BITMAP_LAST_WORD_MASK(bits));
163
	return result != 0;
Linus Torvalds's avatar
Linus Torvalds committed
164 165 166 167
}
EXPORT_SYMBOL(__bitmap_and);

void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
168
				const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
169
{
170 171
	unsigned int k;
	unsigned int nr = BITS_TO_LONGS(bits);
Linus Torvalds's avatar
Linus Torvalds committed
172 173 174 175 176 177 178

	for (k = 0; k < nr; k++)
		dst[k] = bitmap1[k] | bitmap2[k];
}
EXPORT_SYMBOL(__bitmap_or);

void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
179
				const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
180
{
181 182
	unsigned int k;
	unsigned int nr = BITS_TO_LONGS(bits);
Linus Torvalds's avatar
Linus Torvalds committed
183 184 185 186 187 188

	for (k = 0; k < nr; k++)
		dst[k] = bitmap1[k] ^ bitmap2[k];
}
EXPORT_SYMBOL(__bitmap_xor);

189
int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
190
				const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
191
{
192
	unsigned int k;
193
	unsigned int lim = bits/BITS_PER_LONG;
194
	unsigned long result = 0;
Linus Torvalds's avatar
Linus Torvalds committed
195

196
	for (k = 0; k < lim; k++)
197
		result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);
198 199 200
	if (bits % BITS_PER_LONG)
		result |= (dst[k] = bitmap1[k] & ~bitmap2[k] &
			   BITMAP_LAST_WORD_MASK(bits));
201
	return result != 0;
Linus Torvalds's avatar
Linus Torvalds committed
202 203 204 205
}
EXPORT_SYMBOL(__bitmap_andnot);

int __bitmap_intersects(const unsigned long *bitmap1,
206
			const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
207
{
208
	unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds's avatar
Linus Torvalds committed
209 210 211 212 213 214 215 216 217 218 219 220
	for (k = 0; k < lim; ++k)
		if (bitmap1[k] & bitmap2[k])
			return 1;

	if (bits % BITS_PER_LONG)
		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
			return 1;
	return 0;
}
EXPORT_SYMBOL(__bitmap_intersects);

int __bitmap_subset(const unsigned long *bitmap1,
221
		    const unsigned long *bitmap2, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
222
{
223
	unsigned int k, lim = bits/BITS_PER_LONG;
Linus Torvalds's avatar
Linus Torvalds committed
224 225 226 227 228 229 230 231 232 233 234
	for (k = 0; k < lim; ++k)
		if (bitmap1[k] & ~bitmap2[k])
			return 0;

	if (bits % BITS_PER_LONG)
		if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
			return 0;
	return 1;
}
EXPORT_SYMBOL(__bitmap_subset);

235
int __bitmap_weight(const unsigned long *bitmap, unsigned int bits)
Linus Torvalds's avatar
Linus Torvalds committed
236
{
237 238
	unsigned int k, lim = bits/BITS_PER_LONG;
	int w = 0;
Linus Torvalds's avatar
Linus Torvalds committed
239 240

	for (k = 0; k < lim; k++)
241
		w += hweight_long(bitmap[k]);
Linus Torvalds's avatar
Linus Torvalds committed
242 243

	if (bits % BITS_PER_LONG)
244
		w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));
Linus Torvalds's avatar
Linus Torvalds committed
245 246 247 248 249

	return w;
}
EXPORT_SYMBOL(__bitmap_weight);

250
void __bitmap_set(unsigned long *map, unsigned int start, int len)
251 252
{
	unsigned long *p = map + BIT_WORD(start);
253
	const unsigned int size = start + len;
254 255 256
	int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
	unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start);

257
	while (len - bits_to_set >= 0) {
258
		*p |= mask_to_set;
259
		len -= bits_to_set;
260 261 262 263
		bits_to_set = BITS_PER_LONG;
		mask_to_set = ~0UL;
		p++;
	}
264
	if (len) {
265 266 267 268
		mask_to_set &= BITMAP_LAST_WORD_MASK(size);
		*p |= mask_to_set;
	}
}
269
EXPORT_SYMBOL(__bitmap_set);
270

271
void __bitmap_clear(unsigned long *map, unsigned int start, int len)
272 273
{
	unsigned long *p = map + BIT_WORD(start);
274
	const unsigned int size = start + len;
275 276 277
	int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
	unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start);

278
	while (len - bits_to_clear >= 0) {
279
		*p &= ~mask_to_clear;
280
		len -= bits_to_clear;
281 282 283 284
		bits_to_clear = BITS_PER_LONG;
		mask_to_clear = ~0UL;
		p++;
	}
285
	if (len) {
286 287 288 289
		mask_to_clear &= BITMAP_LAST_WORD_MASK(size);
		*p &= ~mask_to_clear;
	}
}
290
EXPORT_SYMBOL(__bitmap_clear);
291

292 293
/**
 * bitmap_find_next_zero_area_off - find a contiguous aligned zero area
294 295 296 297 298
 * @map: The address to base the search on
 * @size: The bitmap size in bits
 * @start: The bitnumber to start searching at
 * @nr: The number of zeroed bits we're looking for
 * @align_mask: Alignment mask for zero area
299
 * @align_offset: Alignment offset for zero area.
300 301
 *
 * The @align_mask should be one less than a power of 2; the effect is that
302 303
 * the bit offset of all zero areas this function finds plus @align_offset
 * is multiple of that power of 2.
304
 */
305 306 307 308 309 310
unsigned long bitmap_find_next_zero_area_off(unsigned long *map,
					     unsigned long size,
					     unsigned long start,
					     unsigned int nr,
					     unsigned long align_mask,
					     unsigned long align_offset)
311 312 313 314 315 316
{
	unsigned long index, end, i;
again:
	index = find_next_zero_bit(map, size, start);

	/* Align allocation */
317
	index = __ALIGN_MASK(index + align_offset, align_mask) - align_offset;
318 319 320 321 322 323 324 325 326 327 328

	end = index + nr;
	if (end > size)
		return end;
	i = find_next_bit(map, end, index);
	if (i < end) {
		start = i + 1;
		goto again;
	}
	return index;
}
329
EXPORT_SYMBOL(bitmap_find_next_zero_area_off);
330

Linus Torvalds's avatar
Linus Torvalds committed
331
/*
332
 * Bitmap printing & parsing functions: first version by Nadia Yvette Chambers,
Linus Torvalds's avatar
Linus Torvalds committed
333 334 335 336 337 338 339 340
 * second version by Paul Jackson, third by Joe Korty.
 */

#define CHUNKSZ				32
#define nbits_to_hold_value(val)	fls(val)
#define BASEDEC 10		/* fancier cpuset lists input in decimal */

/**
341 342 343
 * __bitmap_parse - convert an ASCII hex string into a bitmap.
 * @buf: pointer to buffer containing string.
 * @buflen: buffer size in bytes.  If string is smaller than this
Linus Torvalds's avatar
Linus Torvalds committed
344
 *    then it must be terminated with a \0.
345
 * @is_user: location of buffer, 0 indicates kernel space
Linus Torvalds's avatar
Linus Torvalds committed
346 347 348 349 350
 * @maskp: pointer to bitmap array that will contain result.
 * @nmaskbits: size of bitmap, in bits.
 *
 * Commas group hex digits into chunks.  Each chunk defines exactly 32
 * bits of the resultant bitmask.  No chunk may specify a value larger
351 352
 * than 32 bits (%-EOVERFLOW), and if a chunk specifies a smaller value
 * then leading 0-bits are prepended.  %-EINVAL is returned for illegal
Linus Torvalds's avatar
Linus Torvalds committed
353 354 355
 * characters and for grouping errors such as "1,,5", ",44", "," and "".
 * Leading and trailing whitespace accepted, but not embedded whitespace.
 */
356 357 358
int __bitmap_parse(const char *buf, unsigned int buflen,
		int is_user, unsigned long *maskp,
		int nmaskbits)
Linus Torvalds's avatar
Linus Torvalds committed
359 360 361
{
	int c, old_c, totaldigits, ndigits, nchunks, nbits;
	u32 chunk;
362
	const char __user __force *ubuf = (const char __user __force *)buf;
Linus Torvalds's avatar
Linus Torvalds committed
363 364 365 366 367

	bitmap_zero(maskp, nmaskbits);

	nchunks = nbits = totaldigits = c = 0;
	do {
368 369
		chunk = 0;
		ndigits = totaldigits;
Linus Torvalds's avatar
Linus Torvalds committed
370 371

		/* Get the next chunk of the bitmap */
372
		while (buflen) {
Linus Torvalds's avatar
Linus Torvalds committed
373
			old_c = c;
374 375 376 377 378 379 380
			if (is_user) {
				if (__get_user(c, ubuf++))
					return -EFAULT;
			}
			else
				c = *buf++;
			buflen--;
Linus Torvalds's avatar
Linus Torvalds committed
381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406
			if (isspace(c))
				continue;

			/*
			 * If the last character was a space and the current
			 * character isn't '\0', we've got embedded whitespace.
			 * This is a no-no, so throw an error.
			 */
			if (totaldigits && c && isspace(old_c))
				return -EINVAL;

			/* A '\0' or a ',' signal the end of the chunk */
			if (c == '\0' || c == ',')
				break;

			if (!isxdigit(c))
				return -EINVAL;

			/*
			 * Make sure there are at least 4 free bits in 'chunk'.
			 * If not, this hexdigit will overflow 'chunk', so
			 * throw an error.
			 */
			if (chunk & ~((1UL << (CHUNKSZ - 4)) - 1))
				return -EOVERFLOW;

407
			chunk = (chunk << 4) | hex_to_bin(c);
408
			totaldigits++;
Linus Torvalds's avatar
Linus Torvalds committed
409
		}
410
		if (ndigits == totaldigits)
Linus Torvalds's avatar
Linus Torvalds committed
411 412 413 414 415 416 417 418 419 420
			return -EINVAL;
		if (nchunks == 0 && chunk == 0)
			continue;

		__bitmap_shift_left(maskp, maskp, CHUNKSZ, nmaskbits);
		*maskp |= chunk;
		nchunks++;
		nbits += (nchunks == 1) ? nbits_to_hold_value(chunk) : CHUNKSZ;
		if (nbits > nmaskbits)
			return -EOVERFLOW;
421
	} while (buflen && c == ',');
Linus Torvalds's avatar
Linus Torvalds committed
422 423 424

	return 0;
}
425 426 427
EXPORT_SYMBOL(__bitmap_parse);

/**
428
 * bitmap_parse_user - convert an ASCII hex string in a user buffer into a bitmap
429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445
 *
 * @ubuf: pointer to user buffer containing string.
 * @ulen: buffer size in bytes.  If string is smaller than this
 *    then it must be terminated with a \0.
 * @maskp: pointer to bitmap array that will contain result.
 * @nmaskbits: size of bitmap, in bits.
 *
 * Wrapper for __bitmap_parse(), providing it with user buffer.
 *
 * We cannot have this as an inline function in bitmap.h because it needs
 * linux/uaccess.h to get the access_ok() declaration and this causes
 * cyclic dependencies.
 */
int bitmap_parse_user(const char __user *ubuf,
			unsigned int ulen, unsigned long *maskp,
			int nmaskbits)
{
446
	if (!access_ok(ubuf, ulen))
447
		return -EFAULT;
448 449 450
	return __bitmap_parse((const char __force *)ubuf,
				ulen, 1, maskp, nmaskbits);

451 452
}
EXPORT_SYMBOL(bitmap_parse_user);
Linus Torvalds's avatar
Linus Torvalds committed
453

454 455 456 457 458 459 460 461 462 463
/**
 * bitmap_print_to_pagebuf - convert bitmap to list or hex format ASCII string
 * @list: indicates whether the bitmap must be list
 * @buf: page aligned buffer into which string is placed
 * @maskp: pointer to bitmap to convert
 * @nmaskbits: size of bitmap, in bits
 *
 * Output format is a comma-separated list of decimal numbers and
 * ranges if list is specified or hex digits grouped into comma-separated
 * sets of 8 digits/set. Returns the number of characters written to buf.
464
 *
465 466 467 468
 * It is assumed that @buf is a pointer into a PAGE_SIZE, page-aligned
 * area and that sufficient storage remains at @buf to accommodate the
 * bitmap_print_to_pagebuf() output. Returns the number of characters
 * actually printed to @buf, excluding terminating '\0'.
469 470 471 472
 */
int bitmap_print_to_pagebuf(bool list, char *buf, const unsigned long *maskp,
			    int nmaskbits)
{
473
	ptrdiff_t len = PAGE_SIZE - offset_in_page(buf);
474

475 476
	return list ? scnprintf(buf, len, "%*pbl\n", nmaskbits, maskp) :
		      scnprintf(buf, len, "%*pb\n", nmaskbits, maskp);
477 478 479
}
EXPORT_SYMBOL(bitmap_print_to_pagebuf);

Linus Torvalds's avatar
Linus Torvalds committed
480
/**
481
 * __bitmap_parselist - convert list format ASCII string to bitmap
482
 * @buf: read nul-terminated user string from this buffer
483 484 485
 * @buflen: buffer size in bytes.  If string is smaller than this
 *    then it must be terminated with a \0.
 * @is_user: location of buffer, 0 indicates kernel space
486
 * @maskp: write resulting mask here
Linus Torvalds's avatar
Linus Torvalds committed
487 488 489 490 491 492
 * @nmaskbits: number of bits in mask to be written
 *
 * Input format is a comma-separated list of decimal numbers and
 * ranges.  Consecutively set bits are shown as two hyphen-separated
 * decimal numbers, the smallest and largest bit numbers set in
 * the range.
493 494 495 496 497
 * Optionally each range can be postfixed to denote that only parts of it
 * should be set. The range will divided to groups of specific size.
 * From each group will be used only defined amount of bits.
 * Syntax: range:used_size/group_size
 * Example: 0-1023:2/256 ==> 0,1,256,257,512,513,768,769
Linus Torvalds's avatar
Linus Torvalds committed
498
 *
499 500 501 502 503
 * Returns: 0 on success, -errno on invalid input strings. Error values:
 *
 *   - ``-EINVAL``: second number in range smaller than first
 *   - ``-EINVAL``: invalid character in string
 *   - ``-ERANGE``: bit number specified too large for mask
Linus Torvalds's avatar
Linus Torvalds committed
504
 */
505 506 507
static int __bitmap_parselist(const char *buf, unsigned int buflen,
		int is_user, unsigned long *maskp,
		int nmaskbits)
Linus Torvalds's avatar
Linus Torvalds committed
508
{
509
	unsigned int a, b, old_a, old_b;
510
	unsigned int group_size, used_size, off;
511
	int c, old_c, totaldigits, ndigits;
512
	const char __user __force *ubuf = (const char __user __force *)buf;
513
	int at_start, in_range, in_partial_range;
Linus Torvalds's avatar
Linus Torvalds committed
514

515
	totaldigits = c = 0;
516 517
	old_a = old_b = 0;
	group_size = used_size = 0;
Linus Torvalds's avatar
Linus Torvalds committed
518 519
	bitmap_zero(maskp, nmaskbits);
	do {
520
		at_start = 1;
521
		in_range = 0;
522
		in_partial_range = 0;
523
		a = b = 0;
524
		ndigits = totaldigits;
525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540

		/* Get the next cpu# or a range of cpu#'s */
		while (buflen) {
			old_c = c;
			if (is_user) {
				if (__get_user(c, ubuf++))
					return -EFAULT;
			} else
				c = *buf++;
			buflen--;
			if (isspace(c))
				continue;

			/* A '\0' or a ',' signal the end of a cpu# or range */
			if (c == '\0' || c == ',')
				break;
541 542 543 544 545 546 547 548 549 550 551
			/*
			* whitespaces between digits are not allowed,
			* but it's ok if whitespaces are on head or tail.
			* when old_c is whilespace,
			* if totaldigits == ndigits, whitespace is on head.
			* if whitespace is on tail, it should not run here.
			* as c was ',' or '\0',
			* the last code line has broken the current loop.
			*/
			if ((totaldigits != ndigits) && isspace(old_c))
				return -EINVAL;
552

553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570
			if (c == '/') {
				used_size = a;
				at_start = 1;
				in_range = 0;
				a = b = 0;
				continue;
			}

			if (c == ':') {
				old_a = a;
				old_b = b;
				at_start = 1;
				in_range = 0;
				in_partial_range = 1;
				a = b = 0;
				continue;
			}

571
			if (c == '-') {
572
				if (at_start || in_range)
573 574 575
					return -EINVAL;
				b = 0;
				in_range = 1;
576
				at_start = 1;
577 578 579 580
				continue;
			}

			if (!isdigit(c))
Linus Torvalds's avatar
Linus Torvalds committed
581
				return -EINVAL;
582 583 584 585

			b = b * 10 + (c - '0');
			if (!in_range)
				a = b;
586
			at_start = 0;
587
			totaldigits++;
Linus Torvalds's avatar
Linus Torvalds committed
588
		}
589 590
		if (ndigits == totaldigits)
			continue;
591 592 593 594 595
		if (in_partial_range) {
			group_size = a;
			a = old_a;
			b = old_b;
			old_a = old_b = 0;
596 597
		} else {
			used_size = group_size = b - a + 1;
598
		}
599 600 601
		/* if no digit is after '-', it's wrong*/
		if (at_start && in_range)
			return -EINVAL;
602
		if (!(a <= b) || group_size == 0 || !(used_size <= group_size))
Linus Torvalds's avatar
Linus Torvalds committed
603 604 605
			return -EINVAL;
		if (b >= nmaskbits)
			return -ERANGE;
606
		while (a <= b) {
607 608 609
			off = min(b - a + 1, used_size);
			bitmap_set(maskp, a, off);
			a += group_size;
Linus Torvalds's avatar
Linus Torvalds committed
610
		}
611
	} while (buflen && c == ',');
Linus Torvalds's avatar
Linus Torvalds committed
612 613
	return 0;
}
614 615 616

int bitmap_parselist(const char *bp, unsigned long *maskp, int nmaskbits)
{
617 618
	char *nl  = strchrnul(bp, '\n');
	int len = nl - bp;
619 620 621

	return __bitmap_parselist(bp, len, 0, maskp, nmaskbits);
}
Linus Torvalds's avatar
Linus Torvalds committed
622 623
EXPORT_SYMBOL(bitmap_parselist);

624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643

/**
 * bitmap_parselist_user()
 *
 * @ubuf: pointer to user buffer containing string.
 * @ulen: buffer size in bytes.  If string is smaller than this
 *    then it must be terminated with a \0.
 * @maskp: pointer to bitmap array that will contain result.
 * @nmaskbits: size of bitmap, in bits.
 *
 * Wrapper for bitmap_parselist(), providing it with user buffer.
 *
 * We cannot have this as an inline function in bitmap.h because it needs
 * linux/uaccess.h to get the access_ok() declaration and this causes
 * cyclic dependencies.
 */
int bitmap_parselist_user(const char __user *ubuf,
			unsigned int ulen, unsigned long *maskp,
			int nmaskbits)
{
644
	if (!access_ok(ubuf, ulen))
645
		return -EFAULT;
646
	return __bitmap_parselist((const char __force *)ubuf,
647 648 649 650 651
					ulen, 1, maskp, nmaskbits);
}
EXPORT_SYMBOL(bitmap_parselist_user);


652
/**
653
 * bitmap_pos_to_ord - find ordinal of set bit at given position in bitmap
654
 *	@buf: pointer to a bitmap
655 656
 *	@pos: a bit position in @buf (0 <= @pos < @nbits)
 *	@nbits: number of valid bit positions in @buf
657
 *
658
 * Map the bit at position @pos in @buf (of length @nbits) to the
659
 * ordinal of which set bit it is.  If it is not set or if @pos
660
 * is not a valid bit position, map to -1.
661 662 663
 *
 * If for example, just bits 4 through 7 are set in @buf, then @pos
 * values 4 through 7 will get mapped to 0 through 3, respectively,
664
 * and other @pos values will get mapped to -1.  When @pos value 7
665 666 667 668 669
 * gets mapped to (returns) @ord value 3 in this example, that means
 * that bit 7 is the 3rd (starting with 0th) set bit in @buf.
 *
 * The bit positions 0 through @bits are valid positions in @buf.
 */
670
static int bitmap_pos_to_ord(const unsigned long *buf, unsigned int pos, unsigned int nbits)
671
{
672
	if (pos >= nbits || !test_bit(pos, buf))
673
		return -1;
674

675
	return __bitmap_weight(buf, pos);
676 677 678
}

/**
679
 * bitmap_ord_to_pos - find position of n-th set bit in bitmap
680 681
 *	@buf: pointer to bitmap
 *	@ord: ordinal bit position (n-th set bit, n >= 0)
682
 *	@nbits: number of valid bit positions in @buf
683 684
 *
 * Map the ordinal offset of bit @ord in @buf to its position in @buf.
685 686
 * Value of @ord should be in range 0 <= @ord < weight(buf). If @ord
 * >= weight(buf), returns @nbits.
687 688 689
 *
 * If for example, just bits 4 through 7 are set in @buf, then @ord
 * values 0 through 3 will get mapped to 4 through 7, respectively,
690
 * and all other @ord values returns @nbits.  When @ord value 3
691 692 693
 * gets mapped to (returns) @pos value 7 in this example, that means
 * that the 3rd set bit (starting with 0th) is at position 7 in @buf.
 *
694
 * The bit positions 0 through @nbits-1 are valid positions in @buf.
695
 */
696
unsigned int bitmap_ord_to_pos(const unsigned long *buf, unsigned int ord, unsigned int nbits)
697
{
698
	unsigned int pos;
699

700 701 702 703
	for (pos = find_first_bit(buf, nbits);
	     pos < nbits && ord;
	     pos = find_next_bit(buf, nbits, pos + 1))
		ord--;
704 705 706 707 708 709 710

	return pos;
}

/**
 * bitmap_remap - Apply map defined by a pair of bitmaps to another bitmap
 *	@dst: remapped result
711
 *	@src: subset to be remapped
712 713
 *	@old: defines domain of map
 *	@new: defines range of map
714
 *	@nbits: number of bits in each of these bitmaps
715 716 717 718 719 720 721 722
 *
 * Let @old and @new define a mapping of bit positions, such that
 * whatever position is held by the n-th set bit in @old is mapped
 * to the n-th set bit in @new.  In the more general case, allowing
 * for the possibility that the weight 'w' of @new is less than the
 * weight of @old, map the position of the n-th set bit in @old to
 * the position of the m-th set bit in @new, where m == n % w.
 *
723 724 725
 * If either of the @old and @new bitmaps are empty, or if @src and
 * @dst point to the same location, then this routine copies @src
 * to @dst.
726
 *
727 728
 * The positions of unset bits in @old are mapped to themselves
 * (the identify map).
729 730 731 732 733 734 735
 *
 * Apply the above specified mapping to @src, placing the result in
 * @dst, clearing any bits previously set in @dst.
 *
 * For example, lets say that @old has bits 4 through 7 set, and
 * @new has bits 12 through 15 set.  This defines the mapping of bit
 * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
736 737 738
 * bit positions unchanged.  So if say @src comes into this routine
 * with bits 1, 5 and 7 set, then @dst should leave with bits 1,
 * 13 and 15 set.
739 740 741
 */
void bitmap_remap(unsigned long *dst, const unsigned long *src,
		const unsigned long *old, const unsigned long *new,
742
		unsigned int nbits)
743
{
744
	unsigned int oldbit, w;
745 746 747

	if (dst == src)		/* following doesn't handle inplace remaps */
		return;
748
	bitmap_zero(dst, nbits);
749

750 751 752
	w = bitmap_weight(new, nbits);
	for_each_set_bit(oldbit, src, nbits) {
		int n = bitmap_pos_to_ord(old, oldbit, nbits);
753

754 755 756
		if (n < 0 || w == 0)
			set_bit(oldbit, dst);	/* identity map */
		else
757
			set_bit(bitmap_ord_to_pos(new, n % w, nbits), dst);
758 759 760 761 762 763
	}
}
EXPORT_SYMBOL(bitmap_remap);

/**
 * bitmap_bitremap - Apply map defined by a pair of bitmaps to a single bit
764 765 766 767
 *	@oldbit: bit position to be mapped
 *	@old: defines domain of map
 *	@new: defines range of map
 *	@bits: number of bits in each of these bitmaps
768 769 770 771 772 773 774 775
 *
 * Let @old and @new define a mapping of bit positions, such that
 * whatever position is held by the n-th set bit in @old is mapped
 * to the n-th set bit in @new.  In the more general case, allowing
 * for the possibility that the weight 'w' of @new is less than the
 * weight of @old, map the position of the n-th set bit in @old to
 * the position of the m-th set bit in @new, where m == n % w.
 *
776 777
 * The positions of unset bits in @old are mapped to themselves
 * (the identify map).
778 779 780 781 782 783 784
 *
 * Apply the above specified mapping to bit position @oldbit, returning
 * the new bit position.
 *
 * For example, lets say that @old has bits 4 through 7 set, and
 * @new has bits 12 through 15 set.  This defines the mapping of bit
 * position 4 to 12, 5 to 13, 6 to 14 and 7 to 15, and of all other
785 786
 * bit positions unchanged.  So if say @oldbit is 5, then this routine
 * returns 13.
787 788 789 790
 */
int bitmap_bitremap(int oldbit, const unsigned long *old,
				const unsigned long *new, int bits)
{
791 792 793 794 795 796
	int w = bitmap_weight(new, bits);
	int n = bitmap_pos_to_ord(old, oldbit, bits);
	if (n < 0 || w == 0)
		return oldbit;
	else
		return bitmap_ord_to_pos(new, n % w, bits);
797 798 799
}
EXPORT_SYMBOL(bitmap_bitremap);

800 801 802 803 804 805 806 807 808 809 810 811 812 813
/**
 * bitmap_onto - translate one bitmap relative to another
 *	@dst: resulting translated bitmap
 * 	@orig: original untranslated bitmap
 * 	@relmap: bitmap relative to which translated
 *	@bits: number of bits in each of these bitmaps
 *
 * Set the n-th bit of @dst iff there exists some m such that the
 * n-th bit of @relmap is set, the m-th bit of @orig is set, and
 * the n-th bit of @relmap is also the m-th _set_ bit of @relmap.
 * (If you understood the previous sentence the first time your
 * read it, you're overqualified for your current job.)
 *
 * In other words, @orig is mapped onto (surjectively) @dst,
814
 * using the map { <n, m> | the n-th bit of @relmap is the
815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848
 * m-th set bit of @relmap }.
 *
 * Any set bits in @orig above bit number W, where W is the
 * weight of (number of set bits in) @relmap are mapped nowhere.
 * In particular, if for all bits m set in @orig, m >= W, then
 * @dst will end up empty.  In situations where the possibility
 * of such an empty result is not desired, one way to avoid it is
 * to use the bitmap_fold() operator, below, to first fold the
 * @orig bitmap over itself so that all its set bits x are in the
 * range 0 <= x < W.  The bitmap_fold() operator does this by
 * setting the bit (m % W) in @dst, for each bit (m) set in @orig.
 *
 * Example [1] for bitmap_onto():
 *  Let's say @relmap has bits 30-39 set, and @orig has bits
 *  1, 3, 5, 7, 9 and 11 set.  Then on return from this routine,
 *  @dst will have bits 31, 33, 35, 37 and 39 set.
 *
 *  When bit 0 is set in @orig, it means turn on the bit in
 *  @dst corresponding to whatever is the first bit (if any)
 *  that is turned on in @relmap.  Since bit 0 was off in the
 *  above example, we leave off that bit (bit 30) in @dst.
 *
 *  When bit 1 is set in @orig (as in the above example), it
 *  means turn on the bit in @dst corresponding to whatever
 *  is the second bit that is turned on in @relmap.  The second
 *  bit in @relmap that was turned on in the above example was
 *  bit 31, so we turned on bit 31 in @dst.
 *
 *  Similarly, we turned on bits 33, 35, 37 and 39 in @dst,
 *  because they were the 4th, 6th, 8th and 10th set bits
 *  set in @relmap, and the 4th, 6th, 8th and 10th bits of
 *  @orig (i.e. bits 3, 5, 7 and 9) were also set.
 *
 *  When bit 11 is set in @orig, it means turn on the bit in
849
 *  @dst corresponding to whatever is the twelfth bit that is
850 851 852 853 854
 *  turned on in @relmap.  In the above example, there were
 *  only ten bits turned on in @relmap (30..39), so that bit
 *  11 was set in @orig had no affect on @dst.
 *
 * Example [2] for bitmap_fold() + bitmap_onto():
855 856
 *  Let's say @relmap has these ten bits set::
 *
857
 *		40 41 42 43 45 48 53 61 74 95
858
 *
859 860 861 862 863
 *  (for the curious, that's 40 plus the first ten terms of the
 *  Fibonacci sequence.)
 *
 *  Further lets say we use the following code, invoking
 *  bitmap_fold() then bitmap_onto, as suggested above to
864
 *  avoid the possibility of an empty @dst result::
865 866 867 868 869 870 871 872 873 874
 *
 *	unsigned long *tmp;	// a temporary bitmap's bits
 *
 *	bitmap_fold(tmp, orig, bitmap_weight(relmap, bits), bits);
 *	bitmap_onto(dst, tmp, relmap, bits);
 *
 *  Then this table shows what various values of @dst would be, for
 *  various @orig's.  I list the zero-based positions of each set bit.
 *  The tmp column shows the intermediate result, as computed by
 *  using bitmap_fold() to fold the @orig bitmap modulo ten
875
 *  (the weight of @relmap):
876
 *
877
 *      =============== ============== =================
878 879 880 881
 *      @orig           tmp            @dst
 *      0                0             40
 *      1                1             41
 *      9                9             95
882
 *      10               0             40 [#f1]_
883 884 885 886 887 888
 *      1 3 5 7          1 3 5 7       41 43 48 61
 *      0 1 2 3 4        0 1 2 3 4     40 41 42 43 45
 *      0 9 18 27        0 9 8 7       40 61 74 95
 *      0 10 20 30       0             40
 *      0 11 22 33       0 1 2 3       40 41 42 43
 *      0 12 24 36       0 2 4 6       40 42 45 53
889 890 891 892
 *      78 102 211       1 2 8         41 42 74 [#f1]_
 *      =============== ============== =================
 *
 * .. [#f1]
893
 *
894
 *     For these marked lines, if we hadn't first done bitmap_fold()
895 896 897 898 899 900 901 902 903 904 905 906
 *     into tmp, then the @dst result would have been empty.
 *
 * If either of @orig or @relmap is empty (no set bits), then @dst
 * will be returned empty.
 *
 * If (as explained above) the only set bits in @orig are in positions
 * m where m >= W, (where W is the weight of @relmap) then @dst will
 * once again be returned empty.
 *
 * All bits in @dst not set by the above rule are cleared.
 */
void bitmap_onto(unsigned long *dst, const unsigned long *orig,
907
			const unsigned long *relmap, unsigned int bits)
908
{
909
	unsigned int n, m;	/* same meaning as in above comment */
910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925

	if (dst == orig)	/* following doesn't handle inplace mappings */
		return;
	bitmap_zero(dst, bits);

	/*
	 * The following code is a more efficient, but less
	 * obvious, equivalent to the loop:
	 *	for (m = 0; m < bitmap_weight(relmap, bits); m++) {
	 *		n = bitmap_ord_to_pos(orig, m, bits);
	 *		if (test_bit(m, orig))
	 *			set_bit(n, dst);
	 *	}
	 */

	m = 0;
926
	for_each_set_bit(n, relmap, bits) {
927 928 929 930 931 932 933 934 935 936 937 938 939
		/* m == bitmap_pos_to_ord(relmap, n, bits) */
		if (test_bit(m, orig))
			set_bit(n, dst);
		m++;
	}
}
EXPORT_SYMBOL(bitmap_onto);

/**
 * bitmap_fold - fold larger bitmap into smaller, modulo specified size
 *	@dst: resulting smaller bitmap
 *	@orig: original larger bitmap
 *	@sz: specified size
940
 *	@nbits: number of bits in each of these bitmaps
941 942 943 944 945 946
 *
 * For each bit oldbit in @orig, set bit oldbit mod @sz in @dst.
 * Clear all other bits in @dst.  See further the comment and
 * Example [2] for bitmap_onto() for why and how to use this.
 */
void bitmap_fold(unsigned long *dst, const unsigned long *orig,
947
			unsigned int sz, unsigned int nbits)
948
{
949
	unsigned int oldbit;
950 951 952

	if (dst == orig)	/* following doesn't handle inplace mappings */
		return;
953
	bitmap_zero(dst, nbits);
954

955
	for_each_set_bit(oldbit, orig, nbits)
956 957 958 959
		set_bit(oldbit % sz, dst);
}
EXPORT_SYMBOL(bitmap_fold);

960 961 962 963 964 965
/*
 * Common code for bitmap_*_region() routines.
 *	bitmap: array of unsigned longs corresponding to the bitmap
 *	pos: the beginning of the region
 *	order: region size (log base 2 of number of bits)
 *	reg_op: operation(s) to perform on that region of bitmap
Linus Torvalds's avatar
Linus Torvalds committed
966
 *
967 968
 * Can set, verify and/or release a region of bits in a bitmap,
 * depending on which combination of REG_OP_* flag bits is set.
Linus Torvalds's avatar
Linus Torvalds committed
969
 *
970 971 972 973 974 975
 * A region of a bitmap is a sequence of bits in the bitmap, of
 * some size '1 << order' (a power of two), aligned to that same
 * '1 << order' power of two.
 *
 * Returns 1 if REG_OP_ISFREE succeeds (region is all zero bits).
 * Returns 0 in all other cases and reg_ops.
Linus Torvalds's avatar
Linus Torvalds committed
976
 */
977 978 979 980 981 982 983

enum {
	REG_OP_ISFREE,		/* true if region is all zero bits */
	REG_OP_ALLOC,		/* set all bits in region */
	REG_OP_RELEASE,		/* clear all bits in region */
};

984
static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op)
Linus Torvalds's avatar
Linus Torvalds committed
985
{
986 987 988 989
	int nbits_reg;		/* number of bits in region */
	int index;		/* index first long of region in bitmap */
	int offset;		/* bit offset region in bitmap[index] */
	int nlongs_reg;		/* num longs spanned by region in bitmap */
990
	int nbitsinlong;	/* num bits of region in each spanned long */
991
	unsigned long mask;	/* bitmask for one long of region */
992
	int i;			/* scans bitmap by longs */
993
	int ret = 0;		/* return value */
994

995 996 997 998 999 1000 1001 1002 1003
	/*
	 * Either nlongs_reg == 1 (for small orders that fit in one long)
	 * or (offset == 0 && mask == ~0UL) (for larger multiword orders.)
	 */
	nbits_reg = 1 << order;
	index = pos / BITS_PER_LONG;
	offset = pos - (index * BITS_PER_LONG);
	nlongs_reg = BITS_TO_LONGS(nbits_reg);
	nbitsinlong = min(nbits_reg,  BITS_PER_LONG);
Linus Torvalds's avatar
Linus Torvalds committed
1004

1005 1006 1007 1008
	/*
	 * Can't do "mask = (1UL << nbitsinlong) - 1", as that
	 * overflows if nbitsinlong == BITS_PER_LONG.
	 */
1009
	mask = (1UL << (nbitsinlong - 1));
Linus Torvalds's avatar
Linus Torvalds committed
1010
	mask += mask - 1;
1011
	mask <<= offset;
Linus Torvalds's avatar
Linus Torvalds committed
1012

1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030
	switch (reg_op) {
	case REG_OP_ISFREE:
		for (i = 0; i < nlongs_reg; i++) {
			if (bitmap[index + i] & mask)
				goto done;
		}
		ret = 1;	/* all bits in region free (zero) */
		break;

	case REG_OP_ALLOC:
		for (i = 0; i < nlongs_reg; i++)
			bitmap[index + i] |= mask;
		break;

	case REG_OP_RELEASE:
		for (i = 0; i < nlongs_reg; i++)
			bitmap[index + i] &= ~mask;
		break;
Linus Torvalds's avatar
Linus Torvalds committed
1031
	}
1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
done:
	return ret;
}

/**
 * bitmap_find_free_region - find a contiguous aligned mem region
 *	@bitmap: array of unsigned longs corresponding to the bitmap
 *	@bits: number of bits in the bitmap
 *	@order: region size (log base 2 of number of bits) to find
 *
 * Find a region of free (zero) bits in a @bitmap of @bits bits and
 * allocate them (set them to one).  Only consider regions of length
 * a power (@order) of two, aligned to that power of two, which
 * makes the search algorithm much faster.
 *
 * Return the bit offset in bitmap of the allocated region,
 * or -errno on failure.
 */
1050
int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order)
1051
{
1052
	unsigned int pos, end;		/* scans bitmap by regions of size order */
1053

1054
	for (pos = 0 ; (end = pos + (1U << order)) <= bits; pos = end) {
1055 1056 1057 1058 1059 1060
		if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
			continue;
		__reg_op(bitmap, pos, order, REG_OP_ALLOC);
		return pos;
	}
	return -ENOMEM;
Linus Torvalds's avatar
Linus Torvalds committed
1061 1062 1063 1064
}
EXPORT_SYMBOL(bitmap_find_free_region);

/**
1065
 * bitmap_release_region - release allocated bitmap region
1066 1067 1068
 *	@bitmap: array of unsigned longs corresponding to the bitmap
 *	@pos: beginning of bit region to release
 *	@order: region size (log base 2 of number of bits) to release
Linus Torvalds's avatar
Linus Torvalds committed
1069
 *
1070
 * This is the complement to __bitmap_find_free_region() and releases
Linus Torvalds's avatar
Linus Torvalds committed
1071
 * the found region (by clearing it in the bitmap).
1072 1073
 *
 * No return value.
Linus Torvalds's avatar
Linus Torvalds committed
1074
 */
1075
void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order)
Linus Torvalds's avatar
Linus Torvalds committed
1076
{
1077
	__reg_op(bitmap, pos, order, REG_OP_RELEASE);
Linus Torvalds's avatar
Linus Torvalds committed
1078 1079 1080
}
EXPORT_SYMBOL(bitmap_release_region);

1081 1082
/**
 * bitmap_allocate_region - allocate bitmap region
1083 1084 1085
 *	@bitmap: array of unsigned longs corresponding to the bitmap
 *	@pos: beginning of bit region to allocate
 *	@order: region size (log base 2 of number of bits) to allocate
1086 1087
 *
 * Allocate (set bits in) a specified region of a bitmap.
1088
 *
1089
 * Return 0 on success, or %-EBUSY if specified region wasn't
1090 1091
 * free (not all bits were zero).
 */
1092
int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order)
Linus Torvalds's avatar
Linus Torvalds committed
1093
{
1094 1095
	if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
		return -EBUSY;
1096
	return __reg_op(bitmap, pos, order, REG_OP_ALLOC);
Linus Torvalds's avatar
Linus Torvalds committed
1097 1098
}
EXPORT_SYMBOL(bitmap_allocate_region);
1099 1100 1101 1102 1103 1104 1105 1106 1107

/**
 * bitmap_copy_le - copy a bitmap, putting the bits into little-endian order.
 * @dst:   destination buffer
 * @src:   bitmap to copy
 * @nbits: number of bits in the bitmap
 *
 * Require nbits % BITS_PER_LONG == 0.
 */
1108
#ifdef __BIG_ENDIAN
1109
void bitmap_copy_le(unsigned long *dst, const unsigned long *src, unsigned int nbits)
1110
{
1111
	unsigned int i;
1112 1113 1114

	for (i = 0; i < nbits/BITS_PER_LONG; i++) {
		if (BITS_PER_LONG == 64)
1115
			dst[i] = cpu_to_le64(src[i]);
1116
		else
1117
			dst[i] = cpu_to_le32(src[i]);
1118 1119 1120
	}
}
EXPORT_SYMBOL(bitmap_copy_le);
1121
#endif
1122

1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
unsigned long *bitmap_alloc(unsigned int nbits, gfp_t flags)
{
	return kmalloc_array(BITS_TO_LONGS(nbits), sizeof(unsigned long),
			     flags);
}
EXPORT_SYMBOL(bitmap_alloc);

unsigned long *bitmap_zalloc(unsigned int nbits, gfp_t flags)
{
	return bitmap_alloc(nbits, flags | __GFP_ZERO);
}
EXPORT_SYMBOL(bitmap_zalloc);

void bitmap_free(const unsigned long *bitmap)
{
	kfree(bitmap);
}
EXPORT_SYMBOL(bitmap_free);

1142 1143 1144 1145 1146 1147 1148
#if BITS_PER_LONG == 64
/**
 * bitmap_from_arr32 - copy the contents of u32 array of bits to bitmap
 *	@bitmap: array of unsigned longs, the destination bitmap
 *	@buf: array of u32 (in host byte order), the source bitmap
 *	@nbits: number of bits in @bitmap
 */
1149
void bitmap_from_arr32(unsigned long *bitmap, const u32 *buf, unsigned int nbits)
1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189
{
	unsigned int i, halfwords;

	halfwords = DIV_ROUND_UP(nbits, 32);
	for (i = 0; i < halfwords; i++) {
		bitmap[i/2] = (unsigned long) buf[i];
		if (++i < halfwords)
			bitmap[i/2] |= ((unsigned long) buf[i]) << 32;
	}

	/* Clear tail bits in last word beyond nbits. */
	if (nbits % BITS_PER_LONG)
		bitmap[(halfwords - 1) / 2] &= BITMAP_LAST_WORD_MASK(nbits);
}
EXPORT_SYMBOL(bitmap_from_arr32);

/**
 * bitmap_to_arr32 - copy the contents of bitmap to a u32 array of bits
 *	@buf: array of u32 (in host byte order), the dest bitmap
 *	@bitmap: array of unsigned longs, the source bitmap
 *	@nbits: number of bits in @bitmap
 */
void bitmap_to_arr32(u32 *buf, const unsigned long *bitmap, unsigned int nbits)
{
	unsigned int i, halfwords;

	halfwords = DIV_ROUND_UP(nbits, 32);
	for (i = 0; i < halfwords; i++) {
		buf[i] = (u32) (bitmap[i/2] & UINT_MAX);
		if (++i < halfwords)
			buf[i] = (u32) (bitmap[i/2] >> 32);
	}

	/* Clear tail bits in last element of array beyond nbits. */
	if (nbits % BITS_PER_LONG)
		buf[halfwords - 1] &= (u32) (UINT_MAX >> ((-nbits) & 31));
}
EXPORT_SYMBOL(bitmap_to_arr32);

#endif