blob: ea17cca9e6852f982b1f98a5a06f863de7324e61 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef __LINUX_BITMAP_H
2#define __LINUX_BITMAP_H
3
4#ifndef __ASSEMBLY__
5
6#include <linux/types.h>
7#include <linux/bitops.h>
8#include <linux/string.h>
Jiri Slaby14ed9d22007-10-18 23:40:37 -07009#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070010
11/*
12 * bitmaps provide bit arrays that consume one or more unsigned
13 * longs. The bitmap interface and available operations are listed
14 * here, in bitmap.h
15 *
16 * Function implementations generic to all architectures are in
17 * lib/bitmap.c. Functions implementations that are architecture
18 * specific are in various include/asm-<arch>/bitops.h headers
19 * and other arch/<arch> specific files.
20 *
21 * See lib/bitmap.c for more details.
22 */
23
24/*
25 * The available bitmap operations and their rough meaning in the
26 * case that the bitmap is a single unsigned long are thus:
27 *
Andi Kleen08cd3652006-06-26 13:57:10 +020028 * Note that nbits should be always a compile time evaluable constant.
29 * Otherwise many inlines will generate horrible code.
30 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070031 * bitmap_zero(dst, nbits) *dst = 0UL
32 * bitmap_fill(dst, nbits) *dst = ~0UL
33 * bitmap_copy(dst, src, nbits) *dst = *src
34 * bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2
35 * bitmap_or(dst, src1, src2, nbits) *dst = *src1 | *src2
36 * bitmap_xor(dst, src1, src2, nbits) *dst = *src1 ^ *src2
37 * bitmap_andnot(dst, src1, src2, nbits) *dst = *src1 & ~(*src2)
38 * bitmap_complement(dst, src, nbits) *dst = ~(*src)
39 * bitmap_equal(src1, src2, nbits) Are *src1 and *src2 equal?
40 * bitmap_intersects(src1, src2, nbits) Do *src1 and *src2 overlap?
41 * bitmap_subset(src1, src2, nbits) Is *src1 a subset of *src2?
42 * bitmap_empty(src, nbits) Are all bits zero in *src?
43 * bitmap_full(src, nbits) Are all bits set in *src?
44 * bitmap_weight(src, nbits) Hamming Weight: number set bits
Akinobu Mitac1a2a962009-12-15 16:48:25 -080045 * bitmap_set(dst, pos, nbits) Set specified bit area
46 * bitmap_clear(dst, pos, nbits) Clear specified bit area
47 * bitmap_find_next_zero_area(buf, len, pos, n, mask) Find bit free area
Michal Nazarewicz5e19b012014-12-12 16:54:45 -080048 * bitmap_find_next_zero_area_off(buf, len, pos, n, mask) as above
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n
50 * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n
Paul Jacksonfb5eeee2005-10-30 15:02:33 -080051 * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src)
52 * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit)
Paul Jackson7ea931c2008-04-28 02:12:29 -070053 * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap
54 * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz
Reinette Chatre01a3ee22006-10-11 01:21:55 -070055 * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf
56 * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf
Mike Travis4b060422011-05-24 17:13:12 -070057 * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf
58 * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf
Paul Jackson87e24802006-03-24 03:15:44 -080059 * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region
60 * bitmap_release_region(bitmap, pos, order) Free specified bit region
61 * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 */
63
64/*
65 * Also the following operations in asm/bitops.h apply to bitmaps.
66 *
67 * set_bit(bit, addr) *addr |= bit
68 * clear_bit(bit, addr) *addr &= ~bit
69 * change_bit(bit, addr) *addr ^= bit
70 * test_bit(bit, addr) Is bit set in *addr?
71 * test_and_set_bit(bit, addr) Set bit and return old value
72 * test_and_clear_bit(bit, addr) Clear bit and return old value
73 * test_and_change_bit(bit, addr) Change bit and return old value
74 * find_first_zero_bit(addr, nbits) Position first zero bit in *addr
75 * find_first_bit(addr, nbits) Position first set bit in *addr
76 * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit
77 * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit
78 */
79
80/*
81 * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used
82 * to declare an array named 'name' of just enough unsigned longs to
83 * contain all bit positions from 0 to 'bits' - 1.
84 */
85
86/*
87 * lib/bitmap.c provides these functions:
88 */
89
Rasmus Villemoes0679cc42014-08-06 16:09:49 -070090extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits);
Rasmus Villemoes83979272014-08-06 16:09:51 -070091extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070092extern int __bitmap_equal(const unsigned long *bitmap1,
Rasmus Villemoes5e0680692014-08-06 16:09:53 -070093 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070094extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -070095 unsigned int nbits);
Rasmus Villemoes2fbad292015-02-13 14:36:02 -080096extern void __bitmap_shift_right(unsigned long *dst, const unsigned long *src,
97 unsigned int shift, unsigned int nbits);
Rasmus Villemoesdba94c22015-02-13 14:36:13 -080098extern void __bitmap_shift_left(unsigned long *dst, const unsigned long *src,
99 unsigned int shift, unsigned int nbits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700100extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700101 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700103 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700105 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700106extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700107 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108extern int __bitmap_intersects(const unsigned long *bitmap1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700109 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110extern int __bitmap_subset(const unsigned long *bitmap1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700111 const unsigned long *bitmap2, unsigned int nbits);
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700112extern int __bitmap_weight(const unsigned long *bitmap, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700114extern void bitmap_set(unsigned long *map, unsigned int start, int len);
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700115extern void bitmap_clear(unsigned long *map, unsigned int start, int len);
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800116
117extern unsigned long bitmap_find_next_zero_area_off(unsigned long *map,
118 unsigned long size,
119 unsigned long start,
120 unsigned int nr,
121 unsigned long align_mask,
122 unsigned long align_offset);
123
124/**
125 * bitmap_find_next_zero_area - find a contiguous aligned zero area
126 * @map: The address to base the search on
127 * @size: The bitmap size in bits
128 * @start: The bitnumber to start searching at
129 * @nr: The number of zeroed bits we're looking for
130 * @align_mask: Alignment mask for zero area
131 *
132 * The @align_mask should be one less than a power of 2; the effect is that
133 * the bit offset of all zero areas this function finds is multiples of that
134 * power of 2. A @align_mask of 0 means no alignment is required.
135 */
136static inline unsigned long
137bitmap_find_next_zero_area(unsigned long *map,
138 unsigned long size,
139 unsigned long start,
140 unsigned int nr,
141 unsigned long align_mask)
142{
143 return bitmap_find_next_zero_area_off(map, size, start, nr,
144 align_mask, 0);
145}
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800146
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700147extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
148 unsigned long *dst, int nbits);
149extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 unsigned long *dst, int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151extern int bitmap_parselist(const char *buf, unsigned long *maskp,
152 int nmaskbits);
Mike Travis4b060422011-05-24 17:13:12 -0700153extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen,
154 unsigned long *dst, int nbits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800155extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800156 const unsigned long *old, const unsigned long *new, unsigned int nbits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800157extern int bitmap_bitremap(int oldbit,
158 const unsigned long *old, const unsigned long *new, int bits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700159extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
Rasmus Villemoeseb569882015-02-12 15:02:01 -0800160 const unsigned long *relmap, unsigned int bits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700161extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800162 unsigned int sz, unsigned int nbits);
Rasmus Villemoes9279d322014-08-06 16:10:16 -0700163extern int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order);
164extern void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order);
165extern int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order);
Rasmus Villemoese8f24272015-02-13 14:36:00 -0800166#ifdef __BIG_ENDIAN
Rasmus Villemoes9b6c2d22015-02-13 14:35:57 -0800167extern void bitmap_copy_le(unsigned long *dst, const unsigned long *src, unsigned int nbits);
Rasmus Villemoese8f24272015-02-13 14:36:00 -0800168#else
169#define bitmap_copy_le bitmap_copy
170#endif
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800171extern unsigned int bitmap_ord_to_pos(const unsigned long *bitmap, unsigned int ord, unsigned int nbits);
Sudeep Holla5aaba362014-09-30 14:48:22 +0100172extern int bitmap_print_to_pagebuf(bool list, char *buf,
173 const unsigned long *maskp, int nmaskbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174
Rasmus Villemoes89c1e792015-04-15 16:17:42 -0700175#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
176#define BITMAP_LAST_WORD_MASK(nbits) (~0UL >> (-(nbits) & (BITS_PER_LONG - 1)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030178#define small_const_nbits(nbits) \
179 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
180
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800181static inline void bitmap_zero(unsigned long *dst, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030183 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 *dst = 0UL;
185 else {
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800186 unsigned int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 memset(dst, 0, len);
188 }
189}
190
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800191static inline void bitmap_fill(unsigned long *dst, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192{
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800193 unsigned int nlongs = BITS_TO_LONGS(nbits);
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030194 if (!small_const_nbits(nbits)) {
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800195 unsigned int len = (nlongs - 1) * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196 memset(dst, 0xff, len);
197 }
198 dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
199}
200
201static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800202 unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030204 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205 *dst = *src;
206 else {
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800207 unsigned int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208 memcpy(dst, src, len);
209 }
210}
211
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700212static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700213 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030215 if (small_const_nbits(nbits))
Rasmus Villemoes7e5f97d2014-08-06 16:10:22 -0700216 return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700217 return __bitmap_and(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218}
219
220static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700221 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030223 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224 *dst = *src1 | *src2;
225 else
226 __bitmap_or(dst, src1, src2, nbits);
227}
228
229static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700230 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030232 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233 *dst = *src1 ^ *src2;
234 else
235 __bitmap_xor(dst, src1, src2, nbits);
236}
237
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700238static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700239 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030241 if (small_const_nbits(nbits))
Rasmus Villemoes74e76532014-08-06 16:10:24 -0700242 return (*dst = *src1 & ~(*src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700243 return __bitmap_andnot(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244}
245
246static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -0700247 unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030249 if (small_const_nbits(nbits))
Rasmus Villemoes65b4ee62014-08-06 16:09:57 -0700250 *dst = ~(*src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251 else
252 __bitmap_complement(dst, src, nbits);
253}
254
255static inline int bitmap_equal(const unsigned long *src1,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -0700256 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030258 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
260 else
261 return __bitmap_equal(src1, src2, nbits);
262}
263
264static inline int bitmap_intersects(const unsigned long *src1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700265 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030267 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268 return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
269 else
270 return __bitmap_intersects(src1, src2, nbits);
271}
272
273static inline int bitmap_subset(const unsigned long *src1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700274 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030276 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277 return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
278 else
279 return __bitmap_subset(src1, src2, nbits);
280}
281
Rasmus Villemoes0679cc42014-08-06 16:09:49 -0700282static inline int bitmap_empty(const unsigned long *src, unsigned nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030284 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
Yury Norov2afe27c2015-04-16 12:44:00 -0700286
287 return find_first_bit(src, nbits) == nbits;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288}
289
Rasmus Villemoes83979272014-08-06 16:09:51 -0700290static inline int bitmap_full(const unsigned long *src, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030292 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293 return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
Yury Norov2afe27c2015-04-16 12:44:00 -0700294
295 return find_first_zero_bit(src, nbits) == nbits;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296}
297
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700298static inline int bitmap_weight(const unsigned long *src, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030300 if (small_const_nbits(nbits))
Andi Kleen08cd3652006-06-26 13:57:10 +0200301 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302 return __bitmap_weight(src, nbits);
303}
304
Rasmus Villemoes2fbad292015-02-13 14:36:02 -0800305static inline void bitmap_shift_right(unsigned long *dst, const unsigned long *src,
306 unsigned int shift, int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030308 if (small_const_nbits(nbits))
Rasmus Villemoes2fbad292015-02-13 14:36:02 -0800309 *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310 else
Rasmus Villemoes2fbad292015-02-13 14:36:02 -0800311 __bitmap_shift_right(dst, src, shift, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312}
313
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800314static inline void bitmap_shift_left(unsigned long *dst, const unsigned long *src,
315 unsigned int shift, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030317 if (small_const_nbits(nbits))
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800318 *dst = (*src << shift) & BITMAP_LAST_WORD_MASK(nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319 else
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800320 __bitmap_shift_left(dst, src, shift, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321}
322
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700323static inline int bitmap_parse(const char *buf, unsigned int buflen,
324 unsigned long *maskp, int nmaskbits)
325{
326 return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
327}
328
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329#endif /* __ASSEMBLY__ */
330
331#endif /* __LINUX_BITMAP_H */