Rev 5056 | Rev 6082 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 5056 | Rev 5270 | ||
---|---|---|---|
1 | #ifndef __LINUX_BITMAP_H |
1 | #ifndef __LINUX_BITMAP_H |
2 | #define __LINUX_BITMAP_H |
2 | #define __LINUX_BITMAP_H |
3 | 3 | ||
4 | #ifndef __ASSEMBLY__ |
4 | #ifndef __ASSEMBLY__ |
5 | 5 | ||
6 | #include |
6 | #include |
7 | #include |
7 | #include |
8 | #include |
8 | #include |
9 | #include |
9 | #include |
10 | 10 | ||
11 | /* |
11 | /* |
12 | * bitmaps provide bit arrays that consume one or more unsigned |
12 | * bitmaps provide bit arrays that consume one or more unsigned |
13 | * longs. The bitmap interface and available operations are listed |
13 | * longs. The bitmap interface and available operations are listed |
14 | * here, in bitmap.h |
14 | * here, in bitmap.h |
15 | * |
15 | * |
16 | * Function implementations generic to all architectures are in |
16 | * Function implementations generic to all architectures are in |
17 | * lib/bitmap.c. Functions implementations that are architecture |
17 | * lib/bitmap.c. Functions implementations that are architecture |
18 | * specific are in various include/asm- |
18 | * specific are in various include/asm- |
19 | * and other arch/ |
19 | * and other arch/ |
20 | * |
20 | * |
21 | * See lib/bitmap.c for more details. |
21 | * See lib/bitmap.c for more details. |
22 | */ |
22 | */ |
23 | 23 | ||
24 | /* |
24 | /* |
25 | * The available bitmap operations and their rough meaning in the |
25 | * The available bitmap operations and their rough meaning in the |
26 | * case that the bitmap is a single unsigned long are thus: |
26 | * case that the bitmap is a single unsigned long are thus: |
27 | * |
27 | * |
28 | * Note that nbits should be always a compile time evaluable constant. |
28 | * Note that nbits should be always a compile time evaluable constant. |
29 | * Otherwise many inlines will generate horrible code. |
29 | * Otherwise many inlines will generate horrible code. |
30 | * |
30 | * |
31 | * bitmap_zero(dst, nbits) *dst = 0UL |
31 | * bitmap_zero(dst, nbits) *dst = 0UL |
32 | * bitmap_fill(dst, nbits) *dst = ~0UL |
32 | * bitmap_fill(dst, nbits) *dst = ~0UL |
33 | * bitmap_copy(dst, src, nbits) *dst = *src |
33 | * bitmap_copy(dst, src, nbits) *dst = *src |
34 | * bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2 |
34 | * bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2 |
35 | * bitmap_or(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 |
36 | * bitmap_xor(dst, src1, src2, nbits) *dst = *src1 ^ *src2 |
37 | * bitmap_andnot(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) |
38 | * bitmap_complement(dst, src, nbits) *dst = ~(*src) |
39 | * bitmap_equal(src1, src2, nbits) Are *src1 and *src2 equal? |
39 | * bitmap_equal(src1, src2, nbits) Are *src1 and *src2 equal? |
40 | * bitmap_intersects(src1, src2, nbits) Do *src1 and *src2 overlap? |
40 | * bitmap_intersects(src1, src2, nbits) Do *src1 and *src2 overlap? |
41 | * bitmap_subset(src1, src2, nbits) Is *src1 a subset of *src2? |
41 | * bitmap_subset(src1, src2, nbits) Is *src1 a subset of *src2? |
42 | * bitmap_empty(src, nbits) Are all bits zero in *src? |
42 | * bitmap_empty(src, nbits) Are all bits zero in *src? |
43 | * bitmap_full(src, nbits) Are all bits set in *src? |
43 | * bitmap_full(src, nbits) Are all bits set in *src? |
44 | * bitmap_weight(src, nbits) Hamming Weight: number set bits |
44 | * bitmap_weight(src, nbits) Hamming Weight: number set bits |
45 | * bitmap_set(dst, pos, nbits) Set specified bit area |
45 | * bitmap_set(dst, pos, nbits) Set specified bit area |
46 | * bitmap_clear(dst, pos, nbits) Clear 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 |
47 | * bitmap_find_next_zero_area(buf, len, pos, n, mask) Find bit free area |
- | 48 | * bitmap_find_next_zero_area_off(buf, len, pos, n, mask) as above |
|
48 | * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n |
49 | * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n |
49 | * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n |
50 | * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n |
50 | * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src) |
51 | * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src) |
51 | * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit) |
52 | * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit) |
52 | * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap |
53 | * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap |
53 | * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz |
54 | * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz |
54 | * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf |
55 | * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf |
55 | * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf |
56 | * 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 |
57 | * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf |
57 | * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf |
58 | * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf |
58 | * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf |
59 | * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf |
59 | * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf |
60 | * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf |
60 | * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region |
61 | * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region |
61 | * bitmap_release_region(bitmap, pos, order) Free specified bit region |
62 | * bitmap_release_region(bitmap, pos, order) Free specified bit region |
62 | * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region |
63 | * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region |
- | 64 | * bitmap_print_to_pagebuf(list, buf, mask, nbits) Print bitmap src as list/hex |
|
63 | */ |
65 | */ |
64 | 66 | ||
65 | /* |
67 | /* |
66 | * Also the following operations in asm/bitops.h apply to bitmaps. |
68 | * Also the following operations in asm/bitops.h apply to bitmaps. |
67 | * |
69 | * |
68 | * set_bit(bit, addr) *addr |= bit |
70 | * set_bit(bit, addr) *addr |= bit |
69 | * clear_bit(bit, addr) *addr &= ~bit |
71 | * clear_bit(bit, addr) *addr &= ~bit |
70 | * change_bit(bit, addr) *addr ^= bit |
72 | * change_bit(bit, addr) *addr ^= bit |
71 | * test_bit(bit, addr) Is bit set in *addr? |
73 | * test_bit(bit, addr) Is bit set in *addr? |
72 | * test_and_set_bit(bit, addr) Set bit and return old value |
74 | * test_and_set_bit(bit, addr) Set bit and return old value |
73 | * test_and_clear_bit(bit, addr) Clear bit and return old value |
75 | * test_and_clear_bit(bit, addr) Clear bit and return old value |
74 | * test_and_change_bit(bit, addr) Change bit and return old value |
76 | * test_and_change_bit(bit, addr) Change bit and return old value |
75 | * find_first_zero_bit(addr, nbits) Position first zero bit in *addr |
77 | * find_first_zero_bit(addr, nbits) Position first zero bit in *addr |
76 | * find_first_bit(addr, nbits) Position first set bit in *addr |
78 | * find_first_bit(addr, nbits) Position first set bit in *addr |
77 | * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit |
79 | * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit |
78 | * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit |
80 | * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit |
79 | */ |
81 | */ |
80 | 82 | ||
81 | /* |
83 | /* |
82 | * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used |
84 | * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used |
83 | * to declare an array named 'name' of just enough unsigned longs to |
85 | * to declare an array named 'name' of just enough unsigned longs to |
84 | * contain all bit positions from 0 to 'bits' - 1. |
86 | * contain all bit positions from 0 to 'bits' - 1. |
85 | */ |
87 | */ |
86 | 88 | ||
87 | /* |
89 | /* |
88 | * lib/bitmap.c provides these functions: |
90 | * lib/bitmap.c provides these functions: |
89 | */ |
91 | */ |
90 | 92 | ||
91 | extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits); |
93 | extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits); |
92 | extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits); |
94 | extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits); |
93 | extern int __bitmap_equal(const unsigned long *bitmap1, |
95 | extern int __bitmap_equal(const unsigned long *bitmap1, |
94 | const unsigned long *bitmap2, unsigned int nbits); |
96 | const unsigned long *bitmap2, unsigned int nbits); |
95 | extern void __bitmap_complement(unsigned long *dst, const unsigned long *src, |
97 | extern void __bitmap_complement(unsigned long *dst, const unsigned long *src, |
96 | unsigned int nbits); |
98 | unsigned int nbits); |
97 | extern void __bitmap_shift_right(unsigned long *dst, |
99 | extern void __bitmap_shift_right(unsigned long *dst, |
98 | const unsigned long *src, int shift, int bits); |
100 | const unsigned long *src, int shift, int bits); |
99 | extern void __bitmap_shift_left(unsigned long *dst, |
101 | extern void __bitmap_shift_left(unsigned long *dst, |
100 | const unsigned long *src, int shift, int bits); |
102 | const unsigned long *src, int shift, int bits); |
101 | extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, |
103 | extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1, |
102 | const unsigned long *bitmap2, unsigned int nbits); |
104 | const unsigned long *bitmap2, unsigned int nbits); |
103 | extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, |
105 | extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1, |
104 | const unsigned long *bitmap2, unsigned int nbits); |
106 | const unsigned long *bitmap2, unsigned int nbits); |
105 | extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1, |
107 | extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1, |
106 | const unsigned long *bitmap2, unsigned int nbits); |
108 | const unsigned long *bitmap2, unsigned int nbits); |
107 | extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1, |
109 | extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1, |
108 | const unsigned long *bitmap2, unsigned int nbits); |
110 | const unsigned long *bitmap2, unsigned int nbits); |
109 | extern int __bitmap_intersects(const unsigned long *bitmap1, |
111 | extern int __bitmap_intersects(const unsigned long *bitmap1, |
110 | const unsigned long *bitmap2, unsigned int nbits); |
112 | const unsigned long *bitmap2, unsigned int nbits); |
111 | extern int __bitmap_subset(const unsigned long *bitmap1, |
113 | extern int __bitmap_subset(const unsigned long *bitmap1, |
112 | const unsigned long *bitmap2, unsigned int nbits); |
114 | const unsigned long *bitmap2, unsigned int nbits); |
113 | extern int __bitmap_weight(const unsigned long *bitmap, unsigned int nbits); |
115 | extern int __bitmap_weight(const unsigned long *bitmap, unsigned int nbits); |
114 | 116 | ||
115 | extern void bitmap_set(unsigned long *map, unsigned int start, int len); |
117 | extern void bitmap_set(unsigned long *map, unsigned int start, int len); |
116 | extern void bitmap_clear(unsigned long *map, unsigned int start, int len); |
118 | extern void bitmap_clear(unsigned long *map, unsigned int start, int len); |
- | 119 | ||
117 | extern unsigned long bitmap_find_next_zero_area(unsigned long *map, |
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, |
|
118 | unsigned long size, |
141 | unsigned long size, |
119 | unsigned long start, |
142 | unsigned long start, |
120 | unsigned int nr, |
143 | unsigned int nr, |
121 | unsigned long align_mask); |
144 | unsigned long align_mask) |
- | 145 | { |
|
- | 146 | return bitmap_find_next_zero_area_off(map, size, start, nr, |
|
- | 147 | align_mask, 0); |
|
- | 148 | } |
|
122 | 149 | ||
123 | extern int bitmap_scnprintf(char *buf, unsigned int len, |
150 | extern int bitmap_scnprintf(char *buf, unsigned int len, |
124 | const unsigned long *src, int nbits); |
151 | const unsigned long *src, int nbits); |
125 | extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user, |
152 | extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user, |
126 | unsigned long *dst, int nbits); |
153 | unsigned long *dst, int nbits); |
127 | extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen, |
154 | extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen, |
128 | unsigned long *dst, int nbits); |
155 | unsigned long *dst, int nbits); |
129 | extern int bitmap_scnlistprintf(char *buf, unsigned int len, |
156 | extern int bitmap_scnlistprintf(char *buf, unsigned int len, |
130 | const unsigned long *src, int nbits); |
157 | const unsigned long *src, int nbits); |
131 | extern int bitmap_parselist(const char *buf, unsigned long *maskp, |
158 | extern int bitmap_parselist(const char *buf, unsigned long *maskp, |
132 | int nmaskbits); |
159 | int nmaskbits); |
133 | extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen, |
160 | extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen, |
134 | unsigned long *dst, int nbits); |
161 | unsigned long *dst, int nbits); |
135 | extern void bitmap_remap(unsigned long *dst, const unsigned long *src, |
162 | extern void bitmap_remap(unsigned long *dst, const unsigned long *src, |
136 | const unsigned long *old, const unsigned long *new, int bits); |
163 | const unsigned long *old, const unsigned long *new, int bits); |
137 | extern int bitmap_bitremap(int oldbit, |
164 | extern int bitmap_bitremap(int oldbit, |
138 | const unsigned long *old, const unsigned long *new, int bits); |
165 | const unsigned long *old, const unsigned long *new, int bits); |
139 | extern void bitmap_onto(unsigned long *dst, const unsigned long *orig, |
166 | extern void bitmap_onto(unsigned long *dst, const unsigned long *orig, |
140 | const unsigned long *relmap, int bits); |
167 | const unsigned long *relmap, int bits); |
141 | extern void bitmap_fold(unsigned long *dst, const unsigned long *orig, |
168 | extern void bitmap_fold(unsigned long *dst, const unsigned long *orig, |
142 | int sz, int bits); |
169 | int sz, int bits); |
143 | extern int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order); |
170 | extern int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order); |
144 | extern void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order); |
171 | extern void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order); |
145 | extern int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order); |
172 | extern int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order); |
146 | extern void bitmap_copy_le(void *dst, const unsigned long *src, int nbits); |
173 | extern void bitmap_copy_le(void *dst, const unsigned long *src, int nbits); |
147 | extern int bitmap_ord_to_pos(const unsigned long *bitmap, int n, int bits); |
174 | extern int bitmap_ord_to_pos(const unsigned long *bitmap, int n, int bits); |
- | 175 | extern int bitmap_print_to_pagebuf(bool list, char *buf, |
|
- | 176 | const unsigned long *maskp, int nmaskbits); |
|
148 | 177 | ||
149 | #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG)) |
178 | #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG)) |
150 | #define BITMAP_LAST_WORD_MASK(nbits) \ |
179 | #define BITMAP_LAST_WORD_MASK(nbits) \ |
151 | ( \ |
180 | ( \ |
152 | ((nbits) % BITS_PER_LONG) ? \ |
181 | ((nbits) % BITS_PER_LONG) ? \ |
153 | (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \ |
182 | (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \ |
154 | ) |
183 | ) |
155 | 184 | ||
156 | #define small_const_nbits(nbits) \ |
185 | #define small_const_nbits(nbits) \ |
157 | (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG) |
186 | (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG) |
158 | 187 | ||
159 | static inline void bitmap_zero(unsigned long *dst, int nbits) |
188 | static inline void bitmap_zero(unsigned long *dst, int nbits) |
160 | { |
189 | { |
161 | if (small_const_nbits(nbits)) |
190 | if (small_const_nbits(nbits)) |
162 | *dst = 0UL; |
191 | *dst = 0UL; |
163 | else { |
192 | else { |
164 | int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long); |
193 | int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long); |
165 | memset(dst, 0, len); |
194 | memset(dst, 0, len); |
166 | } |
195 | } |
167 | } |
196 | } |
168 | 197 | ||
169 | static inline void bitmap_fill(unsigned long *dst, int nbits) |
198 | static inline void bitmap_fill(unsigned long *dst, int nbits) |
170 | { |
199 | { |
171 | size_t nlongs = BITS_TO_LONGS(nbits); |
200 | size_t nlongs = BITS_TO_LONGS(nbits); |
172 | if (!small_const_nbits(nbits)) { |
201 | if (!small_const_nbits(nbits)) { |
173 | int len = (nlongs - 1) * sizeof(unsigned long); |
202 | int len = (nlongs - 1) * sizeof(unsigned long); |
174 | memset(dst, 0xff, len); |
203 | memset(dst, 0xff, len); |
175 | } |
204 | } |
176 | dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits); |
205 | dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits); |
177 | } |
206 | } |
178 | 207 | ||
179 | static inline void bitmap_copy(unsigned long *dst, const unsigned long *src, |
208 | static inline void bitmap_copy(unsigned long *dst, const unsigned long *src, |
180 | int nbits) |
209 | int nbits) |
181 | { |
210 | { |
182 | if (small_const_nbits(nbits)) |
211 | if (small_const_nbits(nbits)) |
183 | *dst = *src; |
212 | *dst = *src; |
184 | else { |
213 | else { |
185 | int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long); |
214 | int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long); |
186 | memcpy(dst, src, len); |
215 | memcpy(dst, src, len); |
187 | } |
216 | } |
188 | } |
217 | } |
189 | 218 | ||
190 | static inline int bitmap_and(unsigned long *dst, const unsigned long *src1, |
219 | static inline int bitmap_and(unsigned long *dst, const unsigned long *src1, |
191 | const unsigned long *src2, unsigned int nbits) |
220 | const unsigned long *src2, unsigned int nbits) |
192 | { |
221 | { |
193 | if (small_const_nbits(nbits)) |
222 | if (small_const_nbits(nbits)) |
194 | return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
223 | return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
195 | return __bitmap_and(dst, src1, src2, nbits); |
224 | return __bitmap_and(dst, src1, src2, nbits); |
196 | } |
225 | } |
197 | 226 | ||
198 | static inline void bitmap_or(unsigned long *dst, const unsigned long *src1, |
227 | static inline void bitmap_or(unsigned long *dst, const unsigned long *src1, |
199 | const unsigned long *src2, unsigned int nbits) |
228 | const unsigned long *src2, unsigned int nbits) |
200 | { |
229 | { |
201 | if (small_const_nbits(nbits)) |
230 | if (small_const_nbits(nbits)) |
202 | *dst = *src1 | *src2; |
231 | *dst = *src1 | *src2; |
203 | else |
232 | else |
204 | __bitmap_or(dst, src1, src2, nbits); |
233 | __bitmap_or(dst, src1, src2, nbits); |
205 | } |
234 | } |
206 | 235 | ||
207 | static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1, |
236 | static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1, |
208 | const unsigned long *src2, unsigned int nbits) |
237 | const unsigned long *src2, unsigned int nbits) |
209 | { |
238 | { |
210 | if (small_const_nbits(nbits)) |
239 | if (small_const_nbits(nbits)) |
211 | *dst = *src1 ^ *src2; |
240 | *dst = *src1 ^ *src2; |
212 | else |
241 | else |
213 | __bitmap_xor(dst, src1, src2, nbits); |
242 | __bitmap_xor(dst, src1, src2, nbits); |
214 | } |
243 | } |
215 | 244 | ||
216 | static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1, |
245 | static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1, |
217 | const unsigned long *src2, unsigned int nbits) |
246 | const unsigned long *src2, unsigned int nbits) |
218 | { |
247 | { |
219 | if (small_const_nbits(nbits)) |
248 | if (small_const_nbits(nbits)) |
220 | return (*dst = *src1 & ~(*src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
249 | return (*dst = *src1 & ~(*src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
221 | return __bitmap_andnot(dst, src1, src2, nbits); |
250 | return __bitmap_andnot(dst, src1, src2, nbits); |
222 | } |
251 | } |
223 | 252 | ||
224 | static inline void bitmap_complement(unsigned long *dst, const unsigned long *src, |
253 | static inline void bitmap_complement(unsigned long *dst, const unsigned long *src, |
225 | unsigned int nbits) |
254 | unsigned int nbits) |
226 | { |
255 | { |
227 | if (small_const_nbits(nbits)) |
256 | if (small_const_nbits(nbits)) |
228 | *dst = ~(*src); |
257 | *dst = ~(*src); |
229 | else |
258 | else |
230 | __bitmap_complement(dst, src, nbits); |
259 | __bitmap_complement(dst, src, nbits); |
231 | } |
260 | } |
232 | 261 | ||
233 | static inline int bitmap_equal(const unsigned long *src1, |
262 | static inline int bitmap_equal(const unsigned long *src1, |
234 | const unsigned long *src2, unsigned int nbits) |
263 | const unsigned long *src2, unsigned int nbits) |
235 | { |
264 | { |
236 | if (small_const_nbits(nbits)) |
265 | if (small_const_nbits(nbits)) |
237 | return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits)); |
266 | return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits)); |
238 | else |
267 | else |
239 | return __bitmap_equal(src1, src2, nbits); |
268 | return __bitmap_equal(src1, src2, nbits); |
240 | } |
269 | } |
241 | 270 | ||
242 | static inline int bitmap_intersects(const unsigned long *src1, |
271 | static inline int bitmap_intersects(const unsigned long *src1, |
243 | const unsigned long *src2, unsigned int nbits) |
272 | const unsigned long *src2, unsigned int nbits) |
244 | { |
273 | { |
245 | if (small_const_nbits(nbits)) |
274 | if (small_const_nbits(nbits)) |
246 | return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
275 | return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; |
247 | else |
276 | else |
248 | return __bitmap_intersects(src1, src2, nbits); |
277 | return __bitmap_intersects(src1, src2, nbits); |
249 | } |
278 | } |
250 | 279 | ||
251 | static inline int bitmap_subset(const unsigned long *src1, |
280 | static inline int bitmap_subset(const unsigned long *src1, |
252 | const unsigned long *src2, unsigned int nbits) |
281 | const unsigned long *src2, unsigned int nbits) |
253 | { |
282 | { |
254 | if (small_const_nbits(nbits)) |
283 | if (small_const_nbits(nbits)) |
255 | return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits)); |
284 | return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits)); |
256 | else |
285 | else |
257 | return __bitmap_subset(src1, src2, nbits); |
286 | return __bitmap_subset(src1, src2, nbits); |
258 | } |
287 | } |
259 | 288 | ||
260 | static inline int bitmap_empty(const unsigned long *src, unsigned nbits) |
289 | static inline int bitmap_empty(const unsigned long *src, unsigned nbits) |
261 | { |
290 | { |
262 | if (small_const_nbits(nbits)) |
291 | if (small_const_nbits(nbits)) |
263 | return ! (*src & BITMAP_LAST_WORD_MASK(nbits)); |
292 | return ! (*src & BITMAP_LAST_WORD_MASK(nbits)); |
264 | else |
293 | else |
265 | return __bitmap_empty(src, nbits); |
294 | return __bitmap_empty(src, nbits); |
266 | } |
295 | } |
267 | 296 | ||
268 | static inline int bitmap_full(const unsigned long *src, unsigned int nbits) |
297 | static inline int bitmap_full(const unsigned long *src, unsigned int nbits) |
269 | { |
298 | { |
270 | if (small_const_nbits(nbits)) |
299 | if (small_const_nbits(nbits)) |
271 | return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits)); |
300 | return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits)); |
272 | else |
301 | else |
273 | return __bitmap_full(src, nbits); |
302 | return __bitmap_full(src, nbits); |
274 | } |
303 | } |
275 | 304 | ||
276 | static inline int bitmap_weight(const unsigned long *src, unsigned int nbits) |
305 | static inline int bitmap_weight(const unsigned long *src, unsigned int nbits) |
277 | { |
306 | { |
278 | if (small_const_nbits(nbits)) |
307 | if (small_const_nbits(nbits)) |
279 | return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits)); |
308 | return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits)); |
280 | return __bitmap_weight(src, nbits); |
309 | return __bitmap_weight(src, nbits); |
281 | } |
310 | } |
282 | 311 | ||
283 | static inline void bitmap_shift_right(unsigned long *dst, |
312 | static inline void bitmap_shift_right(unsigned long *dst, |
284 | const unsigned long *src, int n, int nbits) |
313 | const unsigned long *src, int n, int nbits) |
285 | { |
314 | { |
286 | if (small_const_nbits(nbits)) |
315 | if (small_const_nbits(nbits)) |
287 | *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> n; |
316 | *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> n; |
288 | else |
317 | else |
289 | __bitmap_shift_right(dst, src, n, nbits); |
318 | __bitmap_shift_right(dst, src, n, nbits); |
290 | } |
319 | } |
291 | 320 | ||
292 | static inline void bitmap_shift_left(unsigned long *dst, |
321 | static inline void bitmap_shift_left(unsigned long *dst, |
293 | const unsigned long *src, int n, int nbits) |
322 | const unsigned long *src, int n, int nbits) |
294 | { |
323 | { |
295 | if (small_const_nbits(nbits)) |
324 | if (small_const_nbits(nbits)) |
296 | *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits); |
325 | *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits); |
297 | else |
326 | else |
298 | __bitmap_shift_left(dst, src, n, nbits); |
327 | __bitmap_shift_left(dst, src, n, nbits); |
299 | } |
328 | } |
300 | 329 | ||
301 | static inline int bitmap_parse(const char *buf, unsigned int buflen, |
330 | static inline int bitmap_parse(const char *buf, unsigned int buflen, |
302 | unsigned long *maskp, int nmaskbits) |
331 | unsigned long *maskp, int nmaskbits) |
303 | { |
332 | { |
304 | return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits); |
333 | return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits); |
305 | } |
334 | } |
306 | 335 | ||
307 | #endif /* __ASSEMBLY__ */ |
336 | #endif /* __ASSEMBLY__ */ |
308 | 337 | ||
309 | #endif /* __LINUX_BITMAP_H */><>=>((nbits)><((nbits)>><>><> |
338 | #endif /* __LINUX_BITMAP_H */><>=>((nbits)><((nbits)>><>><> |