blob: cee74a52b9eb84503dcdebed8c8b68230ad55fe7 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef _LINUX_BITOPS_H
2#define _LINUX_BITOPS_H
3#include <asm/types.h>
Will Deaconb9951962018-06-19 13:53:08 +01004#include <linux/bits.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07005
Chris Wilson366d3682018-08-21 21:57:03 -07006#define BITS_PER_TYPE(type) (sizeof(type) * BITS_PER_BYTE)
7#define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_TYPE(long))
Chen, Gong10ef6b02013-10-18 14:29:07 -07008
Borislav Petkov4677d4a2010-05-03 14:57:11 +02009extern unsigned int __sw_hweight8(unsigned int w);
10extern unsigned int __sw_hweight16(unsigned int w);
11extern unsigned int __sw_hweight32(unsigned int w);
12extern unsigned long __sw_hweight64(__u64 w);
13
Linus Torvalds1da177e2005-04-16 15:20:36 -070014/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070015 * Include this here because some architectures need generic_ffs/fls in
16 * scope
17 */
18#include <asm/bitops.h>
19
Akinobu Mita984b3f52010-03-05 13:41:37 -080020#define for_each_set_bit(bit, addr, size) \
Robert Richter1e2ad282011-11-18 12:35:21 +010021 for ((bit) = find_first_bit((addr), (size)); \
22 (bit) < (size); \
23 (bit) = find_next_bit((addr), (size), (bit) + 1))
24
25/* same as for_each_set_bit() but use bit as value to start with */
Akinobu Mita307b1cd2012-03-23 15:02:03 -070026#define for_each_set_bit_from(bit, addr, size) \
Robert Richter1e2ad282011-11-18 12:35:21 +010027 for ((bit) = find_next_bit((addr), (size), (bit)); \
28 (bit) < (size); \
Shannon Nelson3e037452007-10-16 01:27:40 -070029 (bit) = find_next_bit((addr), (size), (bit) + 1))
30
Akinobu Mita03f4a822012-03-23 15:02:04 -070031#define for_each_clear_bit(bit, addr, size) \
32 for ((bit) = find_first_zero_bit((addr), (size)); \
33 (bit) < (size); \
34 (bit) = find_next_zero_bit((addr), (size), (bit) + 1))
35
36/* same as for_each_clear_bit() but use bit as value to start with */
37#define for_each_clear_bit_from(bit, addr, size) \
38 for ((bit) = find_next_zero_bit((addr), (size), (bit)); \
39 (bit) < (size); \
40 (bit) = find_next_zero_bit((addr), (size), (bit) + 1))
41
Denys Vlasenko1a1d48a2015-08-04 16:15:14 +020042static inline int get_bitmask_order(unsigned int count)
Linus Torvalds1da177e2005-04-16 15:20:36 -070043{
44 int order;
Peter Zijlstra9f416992010-01-22 15:59:29 +010045
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 order = fls(count);
47 return order; /* We could be slightly more clever with -1 here... */
48}
49
Denys Vlasenko1a1d48a2015-08-04 16:15:14 +020050static __always_inline unsigned long hweight_long(unsigned long w)
Linus Torvalds1da177e2005-04-16 15:20:36 -070051{
Akinobu Mitae9bebd62006-03-26 01:39:55 -080052 return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
Linus Torvalds1da177e2005-04-16 15:20:36 -070053}
54
Robert P. J. Day45f8bde2007-01-26 00:57:09 -080055/**
Alexey Dobriyanf2ea0f52012-01-14 21:44:49 +030056 * rol64 - rotate a 64-bit value left
57 * @word: value to rotate
58 * @shift: bits to roll
59 */
60static inline __u64 rol64(__u64 word, unsigned int shift)
61{
Rasmus Villemoese186b192019-05-14 15:43:27 -070062 return (word << (shift & 63)) | (word >> ((-shift) & 63));
Alexey Dobriyanf2ea0f52012-01-14 21:44:49 +030063}
64
65/**
66 * ror64 - rotate a 64-bit value right
67 * @word: value to rotate
68 * @shift: bits to roll
69 */
70static inline __u64 ror64(__u64 word, unsigned int shift)
71{
Rasmus Villemoese186b192019-05-14 15:43:27 -070072 return (word >> (shift & 63)) | (word << ((-shift) & 63));
Alexey Dobriyanf2ea0f52012-01-14 21:44:49 +030073}
74
75/**
Linus Torvalds1da177e2005-04-16 15:20:36 -070076 * rol32 - rotate a 32-bit value left
Linus Torvalds1da177e2005-04-16 15:20:36 -070077 * @word: value to rotate
78 * @shift: bits to roll
79 */
80static inline __u32 rol32(__u32 word, unsigned int shift)
81{
Rasmus Villemoese186b192019-05-14 15:43:27 -070082 return (word << (shift & 31)) | (word >> ((-shift) & 31));
Linus Torvalds1da177e2005-04-16 15:20:36 -070083}
84
Robert P. J. Day45f8bde2007-01-26 00:57:09 -080085/**
Linus Torvalds1da177e2005-04-16 15:20:36 -070086 * ror32 - rotate a 32-bit value right
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 * @word: value to rotate
88 * @shift: bits to roll
89 */
90static inline __u32 ror32(__u32 word, unsigned int shift)
91{
Rasmus Villemoese186b192019-05-14 15:43:27 -070092 return (word >> (shift & 31)) | (word << ((-shift) & 31));
Linus Torvalds1da177e2005-04-16 15:20:36 -070093}
94
Harvey Harrison3afe3922008-03-28 14:16:01 -070095/**
96 * rol16 - rotate a 16-bit value left
97 * @word: value to rotate
98 * @shift: bits to roll
99 */
100static inline __u16 rol16(__u16 word, unsigned int shift)
101{
Rasmus Villemoese186b192019-05-14 15:43:27 -0700102 return (word << (shift & 15)) | (word >> ((-shift) & 15));
Harvey Harrison3afe3922008-03-28 14:16:01 -0700103}
104
105/**
106 * ror16 - rotate a 16-bit value right
107 * @word: value to rotate
108 * @shift: bits to roll
109 */
110static inline __u16 ror16(__u16 word, unsigned int shift)
111{
Rasmus Villemoese186b192019-05-14 15:43:27 -0700112 return (word >> (shift & 15)) | (word << ((-shift) & 15));
Harvey Harrison3afe3922008-03-28 14:16:01 -0700113}
114
115/**
116 * rol8 - rotate an 8-bit value left
117 * @word: value to rotate
118 * @shift: bits to roll
119 */
120static inline __u8 rol8(__u8 word, unsigned int shift)
121{
Rasmus Villemoese186b192019-05-14 15:43:27 -0700122 return (word << (shift & 7)) | (word >> ((-shift) & 7));
Harvey Harrison3afe3922008-03-28 14:16:01 -0700123}
124
125/**
126 * ror8 - rotate an 8-bit value right
127 * @word: value to rotate
128 * @shift: bits to roll
129 */
130static inline __u8 ror8(__u8 word, unsigned int shift)
131{
Rasmus Villemoese186b192019-05-14 15:43:27 -0700132 return (word >> (shift & 7)) | (word << ((-shift) & 7));
Harvey Harrison3afe3922008-03-28 14:16:01 -0700133}
134
Andreas Herrmann7919a572010-08-30 19:04:01 +0000135/**
136 * sign_extend32 - sign extend a 32-bit value using specified bit as sign-bit
137 * @value: value to sign extend
138 * @index: 0 based bit index (0<=index<32) to sign bit
Martin Kepplingere2eb53a2015-11-06 16:30:58 -0800139 *
140 * This is safe to use for 16- and 8-bit types as well.
Andreas Herrmann7919a572010-08-30 19:04:01 +0000141 */
142static inline __s32 sign_extend32(__u32 value, int index)
143{
144 __u8 shift = 31 - index;
145 return (__s32)(value << shift) >> shift;
146}
147
Martin Kepplinger48e203e2015-11-06 16:31:02 -0800148/**
149 * sign_extend64 - sign extend a 64-bit value using specified bit as sign-bit
150 * @value: value to sign extend
151 * @index: 0 based bit index (0<=index<64) to sign bit
152 */
153static inline __s64 sign_extend64(__u64 value, int index)
154{
155 __u8 shift = 63 - index;
156 return (__s64)(value << shift) >> shift;
157}
158
Andrew Morton962749a2006-03-25 03:08:01 -0800159static inline unsigned fls_long(unsigned long l)
160{
161 if (sizeof(l) == 4)
162 return fls(l);
163 return fls64(l);
164}
165
zijun_hu252e5c62016-10-07 16:57:26 -0700166static inline int get_count_order(unsigned int count)
167{
168 int order;
169
170 order = fls(count) - 1;
171 if (count & (count - 1))
172 order++;
173 return order;
174}
175
176/**
177 * get_count_order_long - get order after rounding @l up to power of 2
178 * @l: parameter
179 *
180 * it is same as get_count_order() but with long type parameter
181 */
182static inline int get_count_order_long(unsigned long l)
183{
184 if (l == 0UL)
185 return -1;
186 else if (l & (l - 1UL))
187 return (int)fls_long(l);
188 else
189 return (int)fls_long(l) - 1;
190}
191
Steven Whitehouse952043a2009-04-23 08:48:15 +0100192/**
193 * __ffs64 - find first set bit in a 64 bit word
194 * @word: The 64 bit word
195 *
196 * On 64 bit arches this is a synomyn for __ffs
197 * The result is not defined if no bits are set, so check that @word
198 * is non-zero before calling this.
199 */
200static inline unsigned long __ffs64(u64 word)
201{
202#if BITS_PER_LONG == 32
203 if (((u32)word) == 0UL)
204 return __ffs((u32)(word >> 32)) + 32;
205#elif BITS_PER_LONG != 64
206#error BITS_PER_LONG not 32 or 64
207#endif
208 return __ffs((unsigned long)word);
209}
210
Alexander van Heukelum64970b62008-03-11 16:17:19 +0100211#ifdef __KERNEL__
Alexander van Heukelum77b9bd92008-04-01 11:46:19 +0200212
Theodore Ts'o00a1a052014-03-30 10:20:01 -0400213#ifndef set_mask_bits
214#define set_mask_bits(ptr, _mask, _bits) \
215({ \
216 const typeof(*ptr) mask = (_mask), bits = (_bits); \
217 typeof(*ptr) old, new; \
218 \
219 do { \
220 old = ACCESS_ONCE(*ptr); \
221 new = (old & ~mask) | bits; \
222 } while (cmpxchg(ptr, old, new) != old); \
223 \
224 new; \
225})
226#endif
227
Guoqing Jiang85ad1d12016-05-03 22:22:13 -0400228#ifndef bit_clear_unless
229#define bit_clear_unless(ptr, _clear, _test) \
230({ \
231 const typeof(*ptr) clear = (_clear), test = (_test); \
232 typeof(*ptr) old, new; \
233 \
234 do { \
235 old = ACCESS_ONCE(*ptr); \
236 new = old & ~clear; \
237 } while (!(old & test) && \
238 cmpxchg(ptr, old, new) != old); \
239 \
240 !(old & test); \
241})
242#endif
243
Akinobu Mita19de85e2011-05-26 16:26:09 -0700244#ifndef find_last_bit
Rusty Russellab53d472009-01-01 10:12:19 +1030245/**
246 * find_last_bit - find the last set bit in a memory region
247 * @addr: The address to start the search at
Yury Norov2c57a0e2015-04-16 12:43:13 -0700248 * @size: The number of bits to search
Rusty Russellab53d472009-01-01 10:12:19 +1030249 *
Yury Norov2c57a0e2015-04-16 12:43:13 -0700250 * Returns the bit number of the last set bit, or size.
Rusty Russellab53d472009-01-01 10:12:19 +1030251 */
252extern unsigned long find_last_bit(const unsigned long *addr,
253 unsigned long size);
Akinobu Mita19de85e2011-05-26 16:26:09 -0700254#endif
Rusty Russellab53d472009-01-01 10:12:19 +1030255
Alexander van Heukelum64970b62008-03-11 16:17:19 +0100256#endif /* __KERNEL__ */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257#endif