Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #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 Slaby | 14ed9d2 | 2007-10-18 23:40:37 -0700 | [diff] [blame] | 9 | #include <linux/kernel.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 10 | |
| 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 Kleen | 08cd365 | 2006-06-26 13:57:10 +0200 | [diff] [blame] | 28 | * Note that nbits should be always a compile time evaluable constant. |
| 29 | * Otherwise many inlines will generate horrible code. |
| 30 | * |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 31 | * 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 Mita | c1a2a96 | 2009-12-15 16:48:25 -0800 | [diff] [blame] | 45 | * 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 Nazarewicz | 5e19b01 | 2014-12-12 16:54:45 -0800 | [diff] [blame] | 48 | * bitmap_find_next_zero_area_off(buf, len, pos, n, mask) as above |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 49 | * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n |
| 50 | * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n |
Paul Jackson | fb5eeee | 2005-10-30 15:02:33 -0800 | [diff] [blame] | 51 | * 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 Jackson | 7ea931c | 2008-04-28 02:12:29 -0700 | [diff] [blame] | 53 | * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap |
| 54 | * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 55 | * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf |
Reinette Chatre | 01a3ee2 | 2006-10-11 01:21:55 -0700 | [diff] [blame] | 56 | * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf |
| 57 | * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 58 | * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf |
Mike Travis | 4b060420 | 2011-05-24 17:13:12 -0700 | [diff] [blame] | 59 | * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf |
| 60 | * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf |
Paul Jackson | 87e2480 | 2006-03-24 03:15:44 -0800 | [diff] [blame] | 61 | * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region |
| 62 | * bitmap_release_region(bitmap, pos, order) Free specified bit region |
| 63 | * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region |
Sudeep Holla | 5aaba36 | 2014-09-30 14:48:22 +0100 | [diff] [blame] | 64 | * bitmap_print_to_pagebuf(list, buf, mask, nbits) Print bitmap src as list/hex |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 65 | */ |
| 66 | |
| 67 | /* |
| 68 | * Also the following operations in asm/bitops.h apply to bitmaps. |
| 69 | * |
| 70 | * set_bit(bit, addr) *addr |= bit |
| 71 | * clear_bit(bit, addr) *addr &= ~bit |
| 72 | * change_bit(bit, addr) *addr ^= bit |
| 73 | * test_bit(bit, addr) Is bit set in *addr? |
| 74 | * test_and_set_bit(bit, addr) Set bit and return old value |
| 75 | * test_and_clear_bit(bit, addr) Clear bit and return old value |
| 76 | * test_and_change_bit(bit, addr) Change bit and return old value |
| 77 | * find_first_zero_bit(addr, nbits) Position first zero bit in *addr |
| 78 | * find_first_bit(addr, nbits) Position first set bit in *addr |
| 79 | * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit |
| 80 | * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit |
| 81 | */ |
| 82 | |
| 83 | /* |
| 84 | * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used |
| 85 | * to declare an array named 'name' of just enough unsigned longs to |
| 86 | * contain all bit positions from 0 to 'bits' - 1. |
| 87 | */ |
| 88 | |
| 89 | /* |
| 90 | * lib/bitmap.c provides these functions: |
| 91 | */ |
| 92 | |
Rasmus Villemoes | 0679cc4 | 2014-08-06 16:09:49 -0700 | [diff] [blame] | 93 | extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits); |
Rasmus Villemoes | 8397927 | 2014-08-06 16:09:51 -0700 | [diff] [blame] | 94 | extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 95 | extern int __bitmap_equal(const unsigned long *bitmap1, |
Rasmus Villemoes | 5e068069 | 2014-08-06 16:09:53 -0700 | [diff] [blame] | 96 | const unsigned long *bitmap2, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 97 | extern void __bitmap_complement(unsigned long *dst, const unsigned long *src, |
Rasmus Villemoes | 3d6684f | 2014-08-06 16:09:55 -0700 | [diff] [blame] | 98 | unsigned int nbits); |
Rasmus Villemoes | 2fbad29 | 2015-02-13 14:36:02 -0800 | [diff] [blame^] | 99 | extern void __bitmap_shift_right(unsigned long *dst, const unsigned long *src, |
| 100 | unsigned int shift, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 101 | extern void __bitmap_shift_left(unsigned long *dst, |
| 102 | const unsigned long *src, int shift, int bits); |
Linus Torvalds | f4b0373 | 2009-08-21 09:26:15 -0700 | [diff] [blame] | 103 | extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 104 | const unsigned long *bitmap2, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 105 | extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 106 | const unsigned long *bitmap2, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 107 | extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 108 | const unsigned long *bitmap2, unsigned int nbits); |
Linus Torvalds | f4b0373 | 2009-08-21 09:26:15 -0700 | [diff] [blame] | 109 | extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 110 | const unsigned long *bitmap2, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 111 | extern int __bitmap_intersects(const unsigned long *bitmap1, |
Rasmus Villemoes | 6dfe979 | 2014-08-06 16:10:01 -0700 | [diff] [blame] | 112 | const unsigned long *bitmap2, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 113 | extern int __bitmap_subset(const unsigned long *bitmap1, |
Rasmus Villemoes | 5be2021 | 2014-08-06 16:10:03 -0700 | [diff] [blame] | 114 | const unsigned long *bitmap2, unsigned int nbits); |
Rasmus Villemoes | 877d9f3 | 2014-08-06 16:10:05 -0700 | [diff] [blame] | 115 | extern int __bitmap_weight(const unsigned long *bitmap, unsigned int nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 116 | |
Rasmus Villemoes | fb5ac54 | 2014-08-06 16:10:07 -0700 | [diff] [blame] | 117 | extern void bitmap_set(unsigned long *map, unsigned int start, int len); |
Rasmus Villemoes | 154f5e3 | 2014-08-06 16:10:10 -0700 | [diff] [blame] | 118 | extern void bitmap_clear(unsigned long *map, unsigned int start, int len); |
Michal Nazarewicz | 5e19b01 | 2014-12-12 16:54:45 -0800 | [diff] [blame] | 119 | |
| 120 | extern unsigned long bitmap_find_next_zero_area_off(unsigned long *map, |
| 121 | unsigned long size, |
| 122 | unsigned long start, |
| 123 | unsigned int nr, |
| 124 | unsigned long align_mask, |
| 125 | unsigned long align_offset); |
| 126 | |
| 127 | /** |
| 128 | * bitmap_find_next_zero_area - find a contiguous aligned zero area |
| 129 | * @map: The address to base the search on |
| 130 | * @size: The bitmap size in bits |
| 131 | * @start: The bitnumber to start searching at |
| 132 | * @nr: The number of zeroed bits we're looking for |
| 133 | * @align_mask: Alignment mask for zero area |
| 134 | * |
| 135 | * The @align_mask should be one less than a power of 2; the effect is that |
| 136 | * the bit offset of all zero areas this function finds is multiples of that |
| 137 | * power of 2. A @align_mask of 0 means no alignment is required. |
| 138 | */ |
| 139 | static inline unsigned long |
| 140 | bitmap_find_next_zero_area(unsigned long *map, |
| 141 | unsigned long size, |
| 142 | unsigned long start, |
| 143 | unsigned int nr, |
| 144 | unsigned long align_mask) |
| 145 | { |
| 146 | return bitmap_find_next_zero_area_off(map, size, start, nr, |
| 147 | align_mask, 0); |
| 148 | } |
Akinobu Mita | c1a2a96 | 2009-12-15 16:48:25 -0800 | [diff] [blame] | 149 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 150 | extern int bitmap_scnprintf(char *buf, unsigned int len, |
| 151 | const unsigned long *src, int nbits); |
Reinette Chatre | 01a3ee2 | 2006-10-11 01:21:55 -0700 | [diff] [blame] | 152 | extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user, |
| 153 | unsigned long *dst, int nbits); |
| 154 | extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 155 | unsigned long *dst, int nbits); |
| 156 | extern int bitmap_scnlistprintf(char *buf, unsigned int len, |
| 157 | const unsigned long *src, int nbits); |
| 158 | extern int bitmap_parselist(const char *buf, unsigned long *maskp, |
| 159 | int nmaskbits); |
Mike Travis | 4b060420 | 2011-05-24 17:13:12 -0700 | [diff] [blame] | 160 | extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen, |
| 161 | unsigned long *dst, int nbits); |
Paul Jackson | fb5eeee | 2005-10-30 15:02:33 -0800 | [diff] [blame] | 162 | extern void bitmap_remap(unsigned long *dst, const unsigned long *src, |
Rasmus Villemoes | 9814ec1 | 2015-02-12 15:02:13 -0800 | [diff] [blame] | 163 | const unsigned long *old, const unsigned long *new, unsigned int nbits); |
Paul Jackson | fb5eeee | 2005-10-30 15:02:33 -0800 | [diff] [blame] | 164 | extern int bitmap_bitremap(int oldbit, |
| 165 | const unsigned long *old, const unsigned long *new, int bits); |
Paul Jackson | 7ea931c | 2008-04-28 02:12:29 -0700 | [diff] [blame] | 166 | extern void bitmap_onto(unsigned long *dst, const unsigned long *orig, |
Rasmus Villemoes | eb56988 | 2015-02-12 15:02:01 -0800 | [diff] [blame] | 167 | const unsigned long *relmap, unsigned int bits); |
Paul Jackson | 7ea931c | 2008-04-28 02:12:29 -0700 | [diff] [blame] | 168 | extern void bitmap_fold(unsigned long *dst, const unsigned long *orig, |
Rasmus Villemoes | b26ad58 | 2015-02-12 15:02:04 -0800 | [diff] [blame] | 169 | unsigned int sz, unsigned int nbits); |
Rasmus Villemoes | 9279d32 | 2014-08-06 16:10:16 -0700 | [diff] [blame] | 170 | extern int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order); |
| 171 | extern void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order); |
| 172 | extern int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order); |
Rasmus Villemoes | e8f2427 | 2015-02-13 14:36:00 -0800 | [diff] [blame] | 173 | #ifdef __BIG_ENDIAN |
Rasmus Villemoes | 9b6c2d2 | 2015-02-13 14:35:57 -0800 | [diff] [blame] | 174 | extern void bitmap_copy_le(unsigned long *dst, const unsigned long *src, unsigned int nbits); |
Rasmus Villemoes | e8f2427 | 2015-02-13 14:36:00 -0800 | [diff] [blame] | 175 | #else |
| 176 | #define bitmap_copy_le bitmap_copy |
| 177 | #endif |
Rasmus Villemoes | f6a1f5d | 2015-02-12 15:02:10 -0800 | [diff] [blame] | 178 | extern unsigned int bitmap_ord_to_pos(const unsigned long *bitmap, unsigned int ord, unsigned int nbits); |
Sudeep Holla | 5aaba36 | 2014-09-30 14:48:22 +0100 | [diff] [blame] | 179 | extern int bitmap_print_to_pagebuf(bool list, char *buf, |
| 180 | const unsigned long *maskp, int nmaskbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 181 | |
Huang Ying | 7f18427 | 2011-07-13 13:14:24 +0800 | [diff] [blame] | 182 | #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 183 | #define BITMAP_LAST_WORD_MASK(nbits) \ |
| 184 | ( \ |
| 185 | ((nbits) % BITS_PER_LONG) ? \ |
| 186 | (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \ |
| 187 | ) |
| 188 | |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 189 | #define small_const_nbits(nbits) \ |
| 190 | (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG) |
| 191 | |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 192 | static inline void bitmap_zero(unsigned long *dst, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 193 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 194 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 195 | *dst = 0UL; |
| 196 | else { |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 197 | unsigned int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 198 | memset(dst, 0, len); |
| 199 | } |
| 200 | } |
| 201 | |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 202 | static inline void bitmap_fill(unsigned long *dst, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 203 | { |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 204 | unsigned int nlongs = BITS_TO_LONGS(nbits); |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 205 | if (!small_const_nbits(nbits)) { |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 206 | unsigned int len = (nlongs - 1) * sizeof(unsigned long); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 207 | memset(dst, 0xff, len); |
| 208 | } |
| 209 | dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits); |
| 210 | } |
| 211 | |
| 212 | static inline void bitmap_copy(unsigned long *dst, const unsigned long *src, |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 213 | unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 214 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 215 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 216 | *dst = *src; |
| 217 | else { |
Rasmus Villemoes | 8b4daad | 2015-02-12 15:01:53 -0800 | [diff] [blame] | 218 | unsigned int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 219 | memcpy(dst, src, len); |
| 220 | } |
| 221 | } |
| 222 | |
Linus Torvalds | f4b0373 | 2009-08-21 09:26:15 -0700 | [diff] [blame] | 223 | static inline int bitmap_and(unsigned long *dst, const unsigned long *src1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 224 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 225 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 226 | if (small_const_nbits(nbits)) |
Rasmus Villemoes | 7e5f97d | 2014-08-06 16:10:22 -0700 | [diff] [blame] | 227 | return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
Linus Torvalds | f4b0373 | 2009-08-21 09:26:15 -0700 | [diff] [blame] | 228 | return __bitmap_and(dst, src1, src2, nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 229 | } |
| 230 | |
| 231 | static inline void bitmap_or(unsigned long *dst, const unsigned long *src1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 232 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 233 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 234 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 235 | *dst = *src1 | *src2; |
| 236 | else |
| 237 | __bitmap_or(dst, src1, src2, nbits); |
| 238 | } |
| 239 | |
| 240 | static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 241 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 242 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 243 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 244 | *dst = *src1 ^ *src2; |
| 245 | else |
| 246 | __bitmap_xor(dst, src1, src2, nbits); |
| 247 | } |
| 248 | |
Linus Torvalds | f4b0373 | 2009-08-21 09:26:15 -0700 | [diff] [blame] | 249 | static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1, |
Rasmus Villemoes | 2f9305e | 2014-08-06 16:09:59 -0700 | [diff] [blame] | 250 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 251 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 252 | if (small_const_nbits(nbits)) |
Rasmus Villemoes | 74e7653 | 2014-08-06 16:10:24 -0700 | [diff] [blame] | 253 | return (*dst = *src1 & ~(*src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
Linus Torvalds | f4b0373 | 2009-08-21 09:26:15 -0700 | [diff] [blame] | 254 | return __bitmap_andnot(dst, src1, src2, nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 255 | } |
| 256 | |
| 257 | static inline void bitmap_complement(unsigned long *dst, const unsigned long *src, |
Rasmus Villemoes | 3d6684f | 2014-08-06 16:09:55 -0700 | [diff] [blame] | 258 | unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 259 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 260 | if (small_const_nbits(nbits)) |
Rasmus Villemoes | 65b4ee6 | 2014-08-06 16:09:57 -0700 | [diff] [blame] | 261 | *dst = ~(*src); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 262 | else |
| 263 | __bitmap_complement(dst, src, nbits); |
| 264 | } |
| 265 | |
| 266 | static inline int bitmap_equal(const unsigned long *src1, |
Rasmus Villemoes | 3d6684f | 2014-08-06 16:09:55 -0700 | [diff] [blame] | 267 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 268 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 269 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 270 | return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits)); |
| 271 | else |
| 272 | return __bitmap_equal(src1, src2, nbits); |
| 273 | } |
| 274 | |
| 275 | static inline int bitmap_intersects(const unsigned long *src1, |
Rasmus Villemoes | 6dfe979 | 2014-08-06 16:10:01 -0700 | [diff] [blame] | 276 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 277 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 278 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 279 | return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
| 280 | else |
| 281 | return __bitmap_intersects(src1, src2, nbits); |
| 282 | } |
| 283 | |
| 284 | static inline int bitmap_subset(const unsigned long *src1, |
Rasmus Villemoes | 5be2021 | 2014-08-06 16:10:03 -0700 | [diff] [blame] | 285 | const unsigned long *src2, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 286 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 287 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 288 | return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits)); |
| 289 | else |
| 290 | return __bitmap_subset(src1, src2, nbits); |
| 291 | } |
| 292 | |
Rasmus Villemoes | 0679cc4 | 2014-08-06 16:09:49 -0700 | [diff] [blame] | 293 | static inline int bitmap_empty(const unsigned long *src, unsigned nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 294 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 295 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 296 | return ! (*src & BITMAP_LAST_WORD_MASK(nbits)); |
| 297 | else |
| 298 | return __bitmap_empty(src, nbits); |
| 299 | } |
| 300 | |
Rasmus Villemoes | 8397927 | 2014-08-06 16:09:51 -0700 | [diff] [blame] | 301 | static inline int bitmap_full(const unsigned long *src, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 302 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 303 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 304 | return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits)); |
| 305 | else |
| 306 | return __bitmap_full(src, nbits); |
| 307 | } |
| 308 | |
Rasmus Villemoes | 877d9f3 | 2014-08-06 16:10:05 -0700 | [diff] [blame] | 309 | static inline int bitmap_weight(const unsigned long *src, unsigned int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 310 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 311 | if (small_const_nbits(nbits)) |
Andi Kleen | 08cd365 | 2006-06-26 13:57:10 +0200 | [diff] [blame] | 312 | return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 313 | return __bitmap_weight(src, nbits); |
| 314 | } |
| 315 | |
Rasmus Villemoes | 2fbad29 | 2015-02-13 14:36:02 -0800 | [diff] [blame^] | 316 | static inline void bitmap_shift_right(unsigned long *dst, const unsigned long *src, |
| 317 | unsigned int shift, int nbits) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 318 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 319 | if (small_const_nbits(nbits)) |
Rasmus Villemoes | 2fbad29 | 2015-02-13 14:36:02 -0800 | [diff] [blame^] | 320 | *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> shift; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 321 | else |
Rasmus Villemoes | 2fbad29 | 2015-02-13 14:36:02 -0800 | [diff] [blame^] | 322 | __bitmap_shift_right(dst, src, shift, nbits); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 323 | } |
| 324 | |
| 325 | static inline void bitmap_shift_left(unsigned long *dst, |
| 326 | const unsigned long *src, int n, int nbits) |
| 327 | { |
Rusty Russell | 4b0bc0b | 2008-12-30 09:05:13 +1030 | [diff] [blame] | 328 | if (small_const_nbits(nbits)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 329 | *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits); |
| 330 | else |
| 331 | __bitmap_shift_left(dst, src, n, nbits); |
| 332 | } |
| 333 | |
Reinette Chatre | 01a3ee2 | 2006-10-11 01:21:55 -0700 | [diff] [blame] | 334 | static inline int bitmap_parse(const char *buf, unsigned int buflen, |
| 335 | unsigned long *maskp, int nmaskbits) |
| 336 | { |
| 337 | return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits); |
| 338 | } |
| 339 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 340 | #endif /* __ASSEMBLY__ */ |
| 341 | |
| 342 | #endif /* __LINUX_BITMAP_H */ |