blob: 3b77588a93602eecd5d73d30d6fd77377286f07e [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
David Decotignye52bc7c2016-02-19 09:23:59 -050062 * bitmap_from_u32array(dst, nbits, buf, nwords) *dst = *buf (nwords 32b words)
63 * bitmap_to_u32array(buf, nwords, src, nbits) *buf = *dst (nwords 32b words)
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 */
65
66/*
67 * Also the following operations in asm/bitops.h apply to bitmaps.
68 *
69 * set_bit(bit, addr) *addr |= bit
70 * clear_bit(bit, addr) *addr &= ~bit
71 * change_bit(bit, addr) *addr ^= bit
72 * test_bit(bit, addr) Is bit set in *addr?
73 * test_and_set_bit(bit, addr) Set bit and return old value
74 * test_and_clear_bit(bit, addr) Clear bit and return old value
75 * test_and_change_bit(bit, addr) Change bit and return old value
76 * find_first_zero_bit(addr, nbits) Position first zero bit in *addr
77 * find_first_bit(addr, nbits) Position first set bit in *addr
78 * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit
79 * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit
80 */
81
82/*
83 * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used
84 * to declare an array named 'name' of just enough unsigned longs to
85 * contain all bit positions from 0 to 'bits' - 1.
86 */
87
88/*
89 * lib/bitmap.c provides these functions:
90 */
91
Rasmus Villemoes0679cc42014-08-06 16:09:49 -070092extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits);
Rasmus Villemoes83979272014-08-06 16:09:51 -070093extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070094extern int __bitmap_equal(const unsigned long *bitmap1,
Rasmus Villemoes5e0680692014-08-06 16:09:53 -070095 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -070096extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -070097 unsigned int nbits);
Rasmus Villemoes2fbad292015-02-13 14:36:02 -080098extern void __bitmap_shift_right(unsigned long *dst, const unsigned long *src,
99 unsigned int shift, unsigned int nbits);
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800100extern void __bitmap_shift_left(unsigned long *dst, const unsigned long *src,
101 unsigned int shift, unsigned int nbits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700102extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700103 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700105 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700107 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700108extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700109 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110extern int __bitmap_intersects(const unsigned long *bitmap1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700111 const unsigned long *bitmap2, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112extern int __bitmap_subset(const unsigned long *bitmap1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700113 const unsigned long *bitmap2, unsigned int nbits);
Rasmus Villemoes877d9f32014-08-06 16:10:05 -0700114extern int __bitmap_weight(const unsigned long *bitmap, unsigned int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115
Rasmus Villemoesfb5ac542014-08-06 16:10:07 -0700116extern void bitmap_set(unsigned long *map, unsigned int start, int len);
Rasmus Villemoes154f5e32014-08-06 16:10:10 -0700117extern void bitmap_clear(unsigned long *map, unsigned int start, int len);
Michal Nazarewicz5e19b012014-12-12 16:54:45 -0800118
119extern unsigned long bitmap_find_next_zero_area_off(unsigned long *map,
120 unsigned long size,
121 unsigned long start,
122 unsigned int nr,
123 unsigned long align_mask,
124 unsigned long align_offset);
125
126/**
127 * bitmap_find_next_zero_area - find a contiguous aligned zero area
128 * @map: The address to base the search on
129 * @size: The bitmap size in bits
130 * @start: The bitnumber to start searching at
131 * @nr: The number of zeroed bits we're looking for
132 * @align_mask: Alignment mask for zero area
133 *
134 * The @align_mask should be one less than a power of 2; the effect is that
135 * the bit offset of all zero areas this function finds is multiples of that
136 * power of 2. A @align_mask of 0 means no alignment is required.
137 */
138static inline unsigned long
139bitmap_find_next_zero_area(unsigned long *map,
140 unsigned long size,
141 unsigned long start,
142 unsigned int nr,
143 unsigned long align_mask)
144{
145 return bitmap_find_next_zero_area_off(map, size, start, nr,
146 align_mask, 0);
147}
Akinobu Mitac1a2a962009-12-15 16:48:25 -0800148
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700149extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
150 unsigned long *dst, int nbits);
151extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 unsigned long *dst, int nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153extern int bitmap_parselist(const char *buf, unsigned long *maskp,
154 int nmaskbits);
Mike Travis4b060422011-05-24 17:13:12 -0700155extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen,
156 unsigned long *dst, int nbits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800157extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes9814ec12015-02-12 15:02:13 -0800158 const unsigned long *old, const unsigned long *new, unsigned int nbits);
Paul Jacksonfb5eeee2005-10-30 15:02:33 -0800159extern int bitmap_bitremap(int oldbit,
160 const unsigned long *old, const unsigned long *new, int bits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700161extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
Rasmus Villemoeseb569882015-02-12 15:02:01 -0800162 const unsigned long *relmap, unsigned int bits);
Paul Jackson7ea931c2008-04-28 02:12:29 -0700163extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
Rasmus Villemoesb26ad582015-02-12 15:02:04 -0800164 unsigned int sz, unsigned int nbits);
Rasmus Villemoes9279d322014-08-06 16:10:16 -0700165extern int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order);
166extern void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order);
167extern int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order);
David Decotignye52bc7c2016-02-19 09:23:59 -0500168extern unsigned int bitmap_from_u32array(unsigned long *bitmap,
169 unsigned int nbits,
170 const u32 *buf,
171 unsigned int nwords);
172extern unsigned int bitmap_to_u32array(u32 *buf,
173 unsigned int nwords,
174 const unsigned long *bitmap,
175 unsigned int nbits);
Rasmus Villemoese8f24272015-02-13 14:36:00 -0800176#ifdef __BIG_ENDIAN
Rasmus Villemoes9b6c2d22015-02-13 14:35:57 -0800177extern void bitmap_copy_le(unsigned long *dst, const unsigned long *src, unsigned int nbits);
Rasmus Villemoese8f24272015-02-13 14:36:00 -0800178#else
179#define bitmap_copy_le bitmap_copy
180#endif
Rasmus Villemoesf6a1f5d2015-02-12 15:02:10 -0800181extern unsigned int bitmap_ord_to_pos(const unsigned long *bitmap, unsigned int ord, unsigned int nbits);
Sudeep Holla5aaba362014-09-30 14:48:22 +0100182extern int bitmap_print_to_pagebuf(bool list, char *buf,
183 const unsigned long *maskp, int nmaskbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184
Rasmus Villemoes89c1e792015-04-15 16:17:42 -0700185#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
186#define BITMAP_LAST_WORD_MASK(nbits) (~0UL >> (-(nbits) & (BITS_PER_LONG - 1)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030188#define small_const_nbits(nbits) \
189 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
190
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800191static inline void bitmap_zero(unsigned long *dst, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030193 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194 *dst = 0UL;
195 else {
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800196 unsigned int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 memset(dst, 0, len);
198 }
199}
200
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800201static inline void bitmap_fill(unsigned long *dst, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202{
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800203 unsigned int nlongs = BITS_TO_LONGS(nbits);
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030204 if (!small_const_nbits(nbits)) {
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800205 unsigned int len = (nlongs - 1) * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 memset(dst, 0xff, len);
207 }
208 dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
209}
210
211static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800212 unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030214 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 *dst = *src;
216 else {
Rasmus Villemoes8b4daad2015-02-12 15:01:53 -0800217 unsigned int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 memcpy(dst, src, len);
219 }
220}
221
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700222static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700223 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030225 if (small_const_nbits(nbits))
Rasmus Villemoes7e5f97d2014-08-06 16:10:22 -0700226 return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700227 return __bitmap_and(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228}
229
230static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700231 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030233 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234 *dst = *src1 | *src2;
235 else
236 __bitmap_or(dst, src1, src2, nbits);
237}
238
239static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700240 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030242 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 *dst = *src1 ^ *src2;
244 else
245 __bitmap_xor(dst, src1, src2, nbits);
246}
247
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700248static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1,
Rasmus Villemoes2f9305e2014-08-06 16:09:59 -0700249 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030251 if (small_const_nbits(nbits))
Rasmus Villemoes74e76532014-08-06 16:10:24 -0700252 return (*dst = *src1 & ~(*src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700253 return __bitmap_andnot(dst, src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254}
255
256static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -0700257 unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030259 if (small_const_nbits(nbits))
Rasmus Villemoes65b4ee62014-08-06 16:09:57 -0700260 *dst = ~(*src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261 else
262 __bitmap_complement(dst, src, nbits);
263}
264
265static inline int bitmap_equal(const unsigned long *src1,
Rasmus Villemoes3d6684f2014-08-06 16:09:55 -0700266 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030268 if (small_const_nbits(nbits))
Andrew Morton4b9d3142016-08-03 13:45:54 -0700269 return !((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
Martin Schwidefsky7dd96812016-05-25 09:32:20 +0200270#ifdef CONFIG_S390
Andrew Morton4b9d3142016-08-03 13:45:54 -0700271 if (__builtin_constant_p(nbits) && (nbits % BITS_PER_LONG) == 0)
Martin Schwidefsky7dd96812016-05-25 09:32:20 +0200272 return !memcmp(src1, src2, nbits / 8);
273#endif
Andrew Morton4b9d3142016-08-03 13:45:54 -0700274 return __bitmap_equal(src1, src2, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275}
276
277static inline int bitmap_intersects(const unsigned long *src1,
Rasmus Villemoes6dfe9792014-08-06 16:10:01 -0700278 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030280 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
282 else
283 return __bitmap_intersects(src1, src2, nbits);
284}
285
286static inline int bitmap_subset(const unsigned long *src1,
Rasmus Villemoes5be20212014-08-06 16:10:03 -0700287 const unsigned long *src2, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030289 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
291 else
292 return __bitmap_subset(src1, src2, nbits);
293}
294
Rasmus Villemoes0679cc42014-08-06 16:09:49 -0700295static inline int bitmap_empty(const unsigned long *src, unsigned nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030297 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
Yury Norov2afe27c2015-04-16 12:44:00 -0700299
300 return find_first_bit(src, nbits) == nbits;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301}
302
Rasmus Villemoes83979272014-08-06 16:09:51 -0700303static inline int bitmap_full(const unsigned long *src, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030305 if (small_const_nbits(nbits))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
Yury Norov2afe27c2015-04-16 12:44:00 -0700307
308 return find_first_zero_bit(src, nbits) == nbits;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309}
310
Denys Vlasenko1a1d48a2015-08-04 16:15:14 +0200311static __always_inline int bitmap_weight(const unsigned long *src, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030313 if (small_const_nbits(nbits))
Andi Kleen08cd3652006-06-26 13:57:10 +0200314 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315 return __bitmap_weight(src, nbits);
316}
317
Rasmus Villemoes2fbad292015-02-13 14:36:02 -0800318static inline void bitmap_shift_right(unsigned long *dst, const unsigned long *src,
319 unsigned int shift, int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030321 if (small_const_nbits(nbits))
Rasmus Villemoes2fbad292015-02-13 14:36:02 -0800322 *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 else
Rasmus Villemoes2fbad292015-02-13 14:36:02 -0800324 __bitmap_shift_right(dst, src, shift, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325}
326
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800327static inline void bitmap_shift_left(unsigned long *dst, const unsigned long *src,
328 unsigned int shift, unsigned int nbits)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329{
Rusty Russell4b0bc0b2008-12-30 09:05:13 +1030330 if (small_const_nbits(nbits))
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800331 *dst = (*src << shift) & BITMAP_LAST_WORD_MASK(nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332 else
Rasmus Villemoesdba94c22015-02-13 14:36:13 -0800333 __bitmap_shift_left(dst, src, shift, nbits);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334}
335
Reinette Chatre01a3ee22006-10-11 01:21:55 -0700336static inline int bitmap_parse(const char *buf, unsigned int buflen,
337 unsigned long *maskp, int nmaskbits)
338{
339 return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
340}
341
Madhavan Srinivasan29dd3282016-08-17 15:06:08 +0530342/*
343 * bitmap_from_u64 - Check and swap words within u64.
344 * @mask: source bitmap
345 * @dst: destination bitmap
346 *
347 * In 32-bit Big Endian kernel, when using (u32 *)(&val)[*]
348 * to read u64 mask, we will get the wrong word.
349 * That is "(u32 *)(&val)[0]" gets the upper 32 bits,
350 * but we expect the lower 32-bits of u64.
351 */
352static inline void bitmap_from_u64(unsigned long *dst, u64 mask)
353{
354 dst[0] = mask & ULONG_MAX;
355
356 if (sizeof(mask) > sizeof(unsigned long))
357 dst[1] = mask >> 32;
358}
359
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360#endif /* __ASSEMBLY__ */
361
362#endif /* __LINUX_BITMAP_H */