Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | #ifndef _LINUX_BITOPS_H |
2 | #define _LINUX_BITOPS_H | |
3 | #include <asm/types.h> | |
4 | ||
d05be13b | 5 | #ifdef __KERNEL__ |
93043ece | 6 | #define BIT(nr) (1UL << (nr)) |
d05be13b JS |
7 | #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG)) |
8 | #define BIT_WORD(nr) ((nr) / BITS_PER_LONG) | |
14ed9d23 | 9 | #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_LONG) |
d05be13b JS |
10 | #define BITS_PER_BYTE 8 |
11 | #endif | |
12 | ||
1da177e4 LT |
13 | /* |
14 | * Include this here because some architectures need generic_ffs/fls in | |
15 | * scope | |
16 | */ | |
17 | #include <asm/bitops.h> | |
18 | ||
3e037454 SN |
19 | #define for_each_bit(bit, addr, size) \ |
20 | for ((bit) = find_first_bit((addr), (size)); \ | |
21 | (bit) < (size); \ | |
22 | (bit) = find_next_bit((addr), (size), (bit) + 1)) | |
23 | ||
24 | ||
1da177e4 LT |
25 | static __inline__ int get_bitmask_order(unsigned int count) |
26 | { | |
27 | int order; | |
28 | ||
29 | order = fls(count); | |
30 | return order; /* We could be slightly more clever with -1 here... */ | |
31 | } | |
32 | ||
94605eff SS |
33 | static __inline__ int get_count_order(unsigned int count) |
34 | { | |
35 | int order; | |
36 | ||
37 | order = fls(count) - 1; | |
38 | if (count & (count - 1)) | |
39 | order++; | |
40 | return order; | |
41 | } | |
42 | ||
1da177e4 LT |
43 | static inline unsigned long hweight_long(unsigned long w) |
44 | { | |
e9bebd6f | 45 | return sizeof(w) == 4 ? hweight32(w) : hweight64(w); |
1da177e4 LT |
46 | } |
47 | ||
45f8bde0 | 48 | /** |
1da177e4 | 49 | * rol32 - rotate a 32-bit value left |
1da177e4 LT |
50 | * @word: value to rotate |
51 | * @shift: bits to roll | |
52 | */ | |
53 | static inline __u32 rol32(__u32 word, unsigned int shift) | |
54 | { | |
55 | return (word << shift) | (word >> (32 - shift)); | |
56 | } | |
57 | ||
45f8bde0 | 58 | /** |
1da177e4 | 59 | * ror32 - rotate a 32-bit value right |
1da177e4 LT |
60 | * @word: value to rotate |
61 | * @shift: bits to roll | |
62 | */ | |
63 | static inline __u32 ror32(__u32 word, unsigned int shift) | |
64 | { | |
65 | return (word >> shift) | (word << (32 - shift)); | |
66 | } | |
67 | ||
3afe3925 HH |
68 | /** |
69 | * rol16 - rotate a 16-bit value left | |
70 | * @word: value to rotate | |
71 | * @shift: bits to roll | |
72 | */ | |
73 | static inline __u16 rol16(__u16 word, unsigned int shift) | |
74 | { | |
75 | return (word << shift) | (word >> (16 - shift)); | |
76 | } | |
77 | ||
78 | /** | |
79 | * ror16 - rotate a 16-bit value right | |
80 | * @word: value to rotate | |
81 | * @shift: bits to roll | |
82 | */ | |
83 | static inline __u16 ror16(__u16 word, unsigned int shift) | |
84 | { | |
85 | return (word >> shift) | (word << (16 - shift)); | |
86 | } | |
87 | ||
88 | /** | |
89 | * rol8 - rotate an 8-bit value left | |
90 | * @word: value to rotate | |
91 | * @shift: bits to roll | |
92 | */ | |
93 | static inline __u8 rol8(__u8 word, unsigned int shift) | |
94 | { | |
95 | return (word << shift) | (word >> (8 - shift)); | |
96 | } | |
97 | ||
98 | /** | |
99 | * ror8 - rotate an 8-bit value right | |
100 | * @word: value to rotate | |
101 | * @shift: bits to roll | |
102 | */ | |
103 | static inline __u8 ror8(__u8 word, unsigned int shift) | |
104 | { | |
105 | return (word >> shift) | (word << (8 - shift)); | |
106 | } | |
107 | ||
962749af AM |
108 | static inline unsigned fls_long(unsigned long l) |
109 | { | |
110 | if (sizeof(l) == 4) | |
111 | return fls(l); | |
112 | return fls64(l); | |
113 | } | |
114 | ||
64970b68 | 115 | #ifdef __KERNEL__ |
77b9bd9c AH |
116 | #ifdef CONFIG_GENERIC_FIND_FIRST_BIT |
117 | extern unsigned long __find_first_bit(const unsigned long *addr, | |
118 | unsigned long size); | |
119 | ||
120 | /** | |
121 | * find_first_bit - find the first set bit in a memory region | |
122 | * @addr: The address to start the search at | |
123 | * @size: The maximum size to search | |
124 | * | |
125 | * Returns the bit number of the first set bit. | |
126 | */ | |
127 | static __always_inline unsigned long | |
128 | find_first_bit(const unsigned long *addr, unsigned long size) | |
129 | { | |
3a483050 AH |
130 | /* Avoid a function call if the bitmap size is a constant */ |
131 | /* and not bigger than BITS_PER_LONG. */ | |
132 | ||
133 | /* insert a sentinel so that __ffs returns size if there */ | |
134 | /* are no set bits in the bitmap */ | |
135 | if (__builtin_constant_p(size) && (size < BITS_PER_LONG)) | |
136 | return __ffs((*addr) | (1ul << size)); | |
137 | ||
138 | /* the result of __ffs(0) is undefined, so it needs to be */ | |
139 | /* handled separately */ | |
140 | if (__builtin_constant_p(size) && (size == BITS_PER_LONG)) | |
141 | return ((*addr) == 0) ? BITS_PER_LONG : __ffs(*addr); | |
142 | ||
143 | /* size is not constant or too big */ | |
77b9bd9c AH |
144 | return __find_first_bit(addr, size); |
145 | } | |
146 | ||
147 | extern unsigned long __find_first_zero_bit(const unsigned long *addr, | |
148 | unsigned long size); | |
149 | ||
150 | /** | |
151 | * find_first_zero_bit - find the first cleared bit in a memory region | |
152 | * @addr: The address to start the search at | |
153 | * @size: The maximum size to search | |
154 | * | |
155 | * Returns the bit number of the first cleared bit. | |
156 | */ | |
157 | static __always_inline unsigned long | |
158 | find_first_zero_bit(const unsigned long *addr, unsigned long size) | |
159 | { | |
3a483050 AH |
160 | /* Avoid a function call if the bitmap size is a constant */ |
161 | /* and not bigger than BITS_PER_LONG. */ | |
162 | ||
163 | /* insert a sentinel so that __ffs returns size if there */ | |
164 | /* are no set bits in the bitmap */ | |
165 | if (__builtin_constant_p(size) && (size < BITS_PER_LONG)) { | |
166 | return __ffs(~(*addr) | (1ul << size)); | |
167 | } | |
168 | ||
169 | /* the result of __ffs(0) is undefined, so it needs to be */ | |
170 | /* handled separately */ | |
171 | if (__builtin_constant_p(size) && (size == BITS_PER_LONG)) | |
172 | return (~(*addr) == 0) ? BITS_PER_LONG : __ffs(~(*addr)); | |
173 | ||
174 | /* size is not constant or too big */ | |
77b9bd9c AH |
175 | return __find_first_zero_bit(addr, size); |
176 | } | |
177 | #endif /* CONFIG_GENERIC_FIND_FIRST_BIT */ | |
178 | ||
64970b68 AH |
179 | #ifdef CONFIG_GENERIC_FIND_NEXT_BIT |
180 | extern unsigned long __find_next_bit(const unsigned long *addr, | |
181 | unsigned long size, unsigned long offset); | |
182 | ||
183 | /** | |
184 | * find_next_bit - find the next set bit in a memory region | |
185 | * @addr: The address to base the search on | |
186 | * @offset: The bitnumber to start searching at | |
187 | * @size: The bitmap size in bits | |
188 | */ | |
189 | static __always_inline unsigned long | |
190 | find_next_bit(const unsigned long *addr, unsigned long size, | |
191 | unsigned long offset) | |
192 | { | |
193 | unsigned long value; | |
194 | ||
195 | /* Avoid a function call if the bitmap size is a constant */ | |
196 | /* and not bigger than BITS_PER_LONG. */ | |
197 | ||
198 | /* insert a sentinel so that __ffs returns size if there */ | |
199 | /* are no set bits in the bitmap */ | |
200 | if (__builtin_constant_p(size) && (size < BITS_PER_LONG)) { | |
201 | value = (*addr) & ((~0ul) << offset); | |
202 | value |= (1ul << size); | |
203 | return __ffs(value); | |
204 | } | |
205 | ||
206 | /* the result of __ffs(0) is undefined, so it needs to be */ | |
207 | /* handled separately */ | |
208 | if (__builtin_constant_p(size) && (size == BITS_PER_LONG)) { | |
209 | value = (*addr) & ((~0ul) << offset); | |
210 | return (value == 0) ? BITS_PER_LONG : __ffs(value); | |
211 | } | |
212 | ||
213 | /* size is not constant or too big */ | |
214 | return __find_next_bit(addr, size, offset); | |
215 | } | |
216 | ||
217 | extern unsigned long __find_next_zero_bit(const unsigned long *addr, | |
218 | unsigned long size, unsigned long offset); | |
219 | ||
220 | /** | |
221 | * find_next_zero_bit - find the next cleared bit in a memory region | |
222 | * @addr: The address to base the search on | |
223 | * @offset: The bitnumber to start searching at | |
224 | * @size: The bitmap size in bits | |
225 | */ | |
226 | static __always_inline unsigned long | |
227 | find_next_zero_bit(const unsigned long *addr, unsigned long size, | |
228 | unsigned long offset) | |
229 | { | |
230 | unsigned long value; | |
231 | ||
232 | /* Avoid a function call if the bitmap size is a constant */ | |
233 | /* and not bigger than BITS_PER_LONG. */ | |
234 | ||
235 | /* insert a sentinel so that __ffs returns size if there */ | |
236 | /* are no set bits in the bitmap */ | |
237 | if (__builtin_constant_p(size) && (size < BITS_PER_LONG)) { | |
238 | value = (~(*addr)) & ((~0ul) << offset); | |
239 | value |= (1ul << size); | |
240 | return __ffs(value); | |
241 | } | |
242 | ||
243 | /* the result of __ffs(0) is undefined, so it needs to be */ | |
244 | /* handled separately */ | |
245 | if (__builtin_constant_p(size) && (size == BITS_PER_LONG)) { | |
246 | value = (~(*addr)) & ((~0ul) << offset); | |
247 | return (value == 0) ? BITS_PER_LONG : __ffs(value); | |
248 | } | |
249 | ||
250 | /* size is not constant or too big */ | |
251 | return __find_next_zero_bit(addr, size, offset); | |
252 | } | |
253 | #endif /* CONFIG_GENERIC_FIND_NEXT_BIT */ | |
254 | #endif /* __KERNEL__ */ | |
1da177e4 | 255 | #endif |