Greg Kroah-Hartman | b244131 | 2017-11-01 15:07:57 +0100 | [diff] [blame] | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2 | #ifndef _LINUX_BITOPS_H |
| 3 | #define _LINUX_BITOPS_H |
| 4 | #include <asm/types.h> |
Will Deacon | 8bd9cb5 | 2018-06-19 13:53:08 +0100 | [diff] [blame] | 5 | #include <linux/bits.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 6 | |
Chris Wilson | 9144d75 | 2018-08-21 21:57:03 -0700 | [diff] [blame] | 7 | #define BITS_PER_TYPE(type) (sizeof(type) * BITS_PER_BYTE) |
| 8 | #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_TYPE(long)) |
Chen, Gong | 10ef6b0 | 2013-10-18 14:29:07 -0700 | [diff] [blame] | 9 | |
Borislav Petkov | 4677d4a | 2010-05-03 14:57:11 +0200 | [diff] [blame] | 10 | extern unsigned int __sw_hweight8(unsigned int w); |
| 11 | extern unsigned int __sw_hweight16(unsigned int w); |
| 12 | extern unsigned int __sw_hweight32(unsigned int w); |
| 13 | extern unsigned long __sw_hweight64(__u64 w); |
| 14 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 15 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 16 | * Include this here because some architectures need generic_ffs/fls in |
| 17 | * scope |
| 18 | */ |
| 19 | #include <asm/bitops.h> |
| 20 | |
Akinobu Mita | 984b3f5 | 2010-03-05 13:41:37 -0800 | [diff] [blame] | 21 | #define for_each_set_bit(bit, addr, size) \ |
Robert Richter | 1e2ad28 | 2011-11-18 12:35:21 +0100 | [diff] [blame] | 22 | for ((bit) = find_first_bit((addr), (size)); \ |
| 23 | (bit) < (size); \ |
| 24 | (bit) = find_next_bit((addr), (size), (bit) + 1)) |
| 25 | |
| 26 | /* same as for_each_set_bit() but use bit as value to start with */ |
Akinobu Mita | 307b1cd | 2012-03-23 15:02:03 -0700 | [diff] [blame] | 27 | #define for_each_set_bit_from(bit, addr, size) \ |
Robert Richter | 1e2ad28 | 2011-11-18 12:35:21 +0100 | [diff] [blame] | 28 | for ((bit) = find_next_bit((addr), (size), (bit)); \ |
| 29 | (bit) < (size); \ |
Shannon Nelson | 3e03745 | 2007-10-16 01:27:40 -0700 | [diff] [blame] | 30 | (bit) = find_next_bit((addr), (size), (bit) + 1)) |
| 31 | |
Akinobu Mita | 03f4a82 | 2012-03-23 15:02:04 -0700 | [diff] [blame] | 32 | #define for_each_clear_bit(bit, addr, size) \ |
| 33 | for ((bit) = find_first_zero_bit((addr), (size)); \ |
| 34 | (bit) < (size); \ |
| 35 | (bit) = find_next_zero_bit((addr), (size), (bit) + 1)) |
| 36 | |
| 37 | /* same as for_each_clear_bit() but use bit as value to start with */ |
| 38 | #define for_each_clear_bit_from(bit, addr, size) \ |
| 39 | for ((bit) = find_next_zero_bit((addr), (size), (bit)); \ |
| 40 | (bit) < (size); \ |
| 41 | (bit) = find_next_zero_bit((addr), (size), (bit) + 1)) |
| 42 | |
Denys Vlasenko | 1a1d48a | 2015-08-04 16:15:14 +0200 | [diff] [blame] | 43 | static inline int get_bitmask_order(unsigned int count) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 44 | { |
| 45 | int order; |
Peter Zijlstra | 9f41699 | 2010-01-22 15:59:29 +0100 | [diff] [blame] | 46 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 47 | order = fls(count); |
| 48 | return order; /* We could be slightly more clever with -1 here... */ |
| 49 | } |
| 50 | |
Denys Vlasenko | 1a1d48a | 2015-08-04 16:15:14 +0200 | [diff] [blame] | 51 | static __always_inline unsigned long hweight_long(unsigned long w) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 52 | { |
Akinobu Mita | e9bebd6 | 2006-03-26 01:39:55 -0800 | [diff] [blame] | 53 | return sizeof(w) == 4 ? hweight32(w) : hweight64(w); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 54 | } |
| 55 | |
Robert P. J. Day | 45f8bde | 2007-01-26 00:57:09 -0800 | [diff] [blame] | 56 | /** |
Alexey Dobriyan | f2ea0f5 | 2012-01-14 21:44:49 +0300 | [diff] [blame] | 57 | * rol64 - rotate a 64-bit value left |
| 58 | * @word: value to rotate |
| 59 | * @shift: bits to roll |
| 60 | */ |
| 61 | static inline __u64 rol64(__u64 word, unsigned int shift) |
| 62 | { |
| 63 | return (word << shift) | (word >> (64 - shift)); |
| 64 | } |
| 65 | |
| 66 | /** |
| 67 | * ror64 - rotate a 64-bit value right |
| 68 | * @word: value to rotate |
| 69 | * @shift: bits to roll |
| 70 | */ |
| 71 | static inline __u64 ror64(__u64 word, unsigned int shift) |
| 72 | { |
| 73 | return (word >> shift) | (word << (64 - shift)); |
| 74 | } |
| 75 | |
| 76 | /** |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 77 | * rol32 - rotate a 32-bit value left |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 78 | * @word: value to rotate |
| 79 | * @shift: bits to roll |
| 80 | */ |
| 81 | static inline __u32 rol32(__u32 word, unsigned int shift) |
| 82 | { |
Sasha Levin | d7e35df | 2015-12-03 22:04:01 -0500 | [diff] [blame] | 83 | return (word << shift) | (word >> ((-shift) & 31)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 84 | } |
| 85 | |
Robert P. J. Day | 45f8bde | 2007-01-26 00:57:09 -0800 | [diff] [blame] | 86 | /** |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 87 | * ror32 - rotate a 32-bit value right |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 88 | * @word: value to rotate |
| 89 | * @shift: bits to roll |
| 90 | */ |
| 91 | static inline __u32 ror32(__u32 word, unsigned int shift) |
| 92 | { |
| 93 | return (word >> shift) | (word << (32 - shift)); |
| 94 | } |
| 95 | |
Harvey Harrison | 3afe392 | 2008-03-28 14:16:01 -0700 | [diff] [blame] | 96 | /** |
| 97 | * rol16 - rotate a 16-bit value left |
| 98 | * @word: value to rotate |
| 99 | * @shift: bits to roll |
| 100 | */ |
| 101 | static inline __u16 rol16(__u16 word, unsigned int shift) |
| 102 | { |
| 103 | return (word << shift) | (word >> (16 - shift)); |
| 104 | } |
| 105 | |
| 106 | /** |
| 107 | * ror16 - rotate a 16-bit value right |
| 108 | * @word: value to rotate |
| 109 | * @shift: bits to roll |
| 110 | */ |
| 111 | static inline __u16 ror16(__u16 word, unsigned int shift) |
| 112 | { |
| 113 | return (word >> shift) | (word << (16 - shift)); |
| 114 | } |
| 115 | |
| 116 | /** |
| 117 | * rol8 - rotate an 8-bit value left |
| 118 | * @word: value to rotate |
| 119 | * @shift: bits to roll |
| 120 | */ |
| 121 | static inline __u8 rol8(__u8 word, unsigned int shift) |
| 122 | { |
| 123 | return (word << shift) | (word >> (8 - shift)); |
| 124 | } |
| 125 | |
| 126 | /** |
| 127 | * ror8 - rotate an 8-bit value right |
| 128 | * @word: value to rotate |
| 129 | * @shift: bits to roll |
| 130 | */ |
| 131 | static inline __u8 ror8(__u8 word, unsigned int shift) |
| 132 | { |
| 133 | return (word >> shift) | (word << (8 - shift)); |
| 134 | } |
| 135 | |
Andreas Herrmann | 7919a57 | 2010-08-30 19:04:01 +0000 | [diff] [blame] | 136 | /** |
| 137 | * sign_extend32 - sign extend a 32-bit value using specified bit as sign-bit |
| 138 | * @value: value to sign extend |
| 139 | * @index: 0 based bit index (0<=index<32) to sign bit |
Martin Kepplinger | e2eb53a | 2015-11-06 16:30:58 -0800 | [diff] [blame] | 140 | * |
| 141 | * This is safe to use for 16- and 8-bit types as well. |
Andreas Herrmann | 7919a57 | 2010-08-30 19:04:01 +0000 | [diff] [blame] | 142 | */ |
| 143 | static inline __s32 sign_extend32(__u32 value, int index) |
| 144 | { |
| 145 | __u8 shift = 31 - index; |
| 146 | return (__s32)(value << shift) >> shift; |
| 147 | } |
| 148 | |
Martin Kepplinger | 48e203e | 2015-11-06 16:31:02 -0800 | [diff] [blame] | 149 | /** |
| 150 | * sign_extend64 - sign extend a 64-bit value using specified bit as sign-bit |
| 151 | * @value: value to sign extend |
| 152 | * @index: 0 based bit index (0<=index<64) to sign bit |
| 153 | */ |
| 154 | static inline __s64 sign_extend64(__u64 value, int index) |
| 155 | { |
| 156 | __u8 shift = 63 - index; |
| 157 | return (__s64)(value << shift) >> shift; |
| 158 | } |
| 159 | |
Andrew Morton | 962749a | 2006-03-25 03:08:01 -0800 | [diff] [blame] | 160 | static inline unsigned fls_long(unsigned long l) |
| 161 | { |
| 162 | if (sizeof(l) == 4) |
| 163 | return fls(l); |
| 164 | return fls64(l); |
| 165 | } |
| 166 | |
zijun_hu | 252e5c6 | 2016-10-07 16:57:26 -0700 | [diff] [blame] | 167 | static inline int get_count_order(unsigned int count) |
| 168 | { |
| 169 | int order; |
| 170 | |
| 171 | order = fls(count) - 1; |
| 172 | if (count & (count - 1)) |
| 173 | order++; |
| 174 | return order; |
| 175 | } |
| 176 | |
| 177 | /** |
| 178 | * get_count_order_long - get order after rounding @l up to power of 2 |
| 179 | * @l: parameter |
| 180 | * |
| 181 | * it is same as get_count_order() but with long type parameter |
| 182 | */ |
| 183 | static inline int get_count_order_long(unsigned long l) |
| 184 | { |
| 185 | if (l == 0UL) |
| 186 | return -1; |
| 187 | else if (l & (l - 1UL)) |
| 188 | return (int)fls_long(l); |
| 189 | else |
| 190 | return (int)fls_long(l) - 1; |
| 191 | } |
| 192 | |
Steven Whitehouse | 952043a | 2009-04-23 08:48:15 +0100 | [diff] [blame] | 193 | /** |
| 194 | * __ffs64 - find first set bit in a 64 bit word |
| 195 | * @word: The 64 bit word |
| 196 | * |
| 197 | * On 64 bit arches this is a synomyn for __ffs |
| 198 | * The result is not defined if no bits are set, so check that @word |
| 199 | * is non-zero before calling this. |
| 200 | */ |
| 201 | static inline unsigned long __ffs64(u64 word) |
| 202 | { |
| 203 | #if BITS_PER_LONG == 32 |
| 204 | if (((u32)word) == 0UL) |
| 205 | return __ffs((u32)(word >> 32)) + 32; |
| 206 | #elif BITS_PER_LONG != 64 |
| 207 | #error BITS_PER_LONG not 32 or 64 |
| 208 | #endif |
| 209 | return __ffs((unsigned long)word); |
| 210 | } |
| 211 | |
Lukas Wunner | 5307e2a | 2017-10-12 12:40:10 +0200 | [diff] [blame] | 212 | /** |
| 213 | * assign_bit - Assign value to a bit in memory |
| 214 | * @nr: the bit to set |
| 215 | * @addr: the address to start counting from |
| 216 | * @value: the value to assign |
| 217 | */ |
| 218 | static __always_inline void assign_bit(long nr, volatile unsigned long *addr, |
| 219 | bool value) |
| 220 | { |
| 221 | if (value) |
| 222 | set_bit(nr, addr); |
| 223 | else |
| 224 | clear_bit(nr, addr); |
| 225 | } |
| 226 | |
| 227 | static __always_inline void __assign_bit(long nr, volatile unsigned long *addr, |
| 228 | bool value) |
| 229 | { |
| 230 | if (value) |
| 231 | __set_bit(nr, addr); |
| 232 | else |
| 233 | __clear_bit(nr, addr); |
| 234 | } |
| 235 | |
Alexander van Heukelum | 64970b6 | 2008-03-11 16:17:19 +0100 | [diff] [blame] | 236 | #ifdef __KERNEL__ |
Alexander van Heukelum | 77b9bd9 | 2008-04-01 11:46:19 +0200 | [diff] [blame] | 237 | |
Theodore Ts'o | 00a1a05 | 2014-03-30 10:20:01 -0400 | [diff] [blame] | 238 | #ifndef set_mask_bits |
Miklos Szeredi | 1812742 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 239 | #define set_mask_bits(ptr, mask, bits) \ |
Theodore Ts'o | 00a1a05 | 2014-03-30 10:20:01 -0400 | [diff] [blame] | 240 | ({ \ |
Miklos Szeredi | 1812742 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 241 | const typeof(*(ptr)) mask__ = (mask), bits__ = (bits); \ |
| 242 | typeof(*(ptr)) old__, new__; \ |
Theodore Ts'o | 00a1a05 | 2014-03-30 10:20:01 -0400 | [diff] [blame] | 243 | \ |
| 244 | do { \ |
Miklos Szeredi | 1812742 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 245 | old__ = READ_ONCE(*(ptr)); \ |
| 246 | new__ = (old__ & ~mask__) | bits__; \ |
| 247 | } while (cmpxchg(ptr, old__, new__) != old__); \ |
Theodore Ts'o | 00a1a05 | 2014-03-30 10:20:01 -0400 | [diff] [blame] | 248 | \ |
Vineet Gupta | 1db604f | 2019-03-07 16:28:14 -0800 | [diff] [blame] | 249 | old__; \ |
Theodore Ts'o | 00a1a05 | 2014-03-30 10:20:01 -0400 | [diff] [blame] | 250 | }) |
| 251 | #endif |
| 252 | |
Guoqing Jiang | 85ad1d1 | 2016-05-03 22:22:13 -0400 | [diff] [blame] | 253 | #ifndef bit_clear_unless |
Miklos Szeredi | edfa872 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 254 | #define bit_clear_unless(ptr, clear, test) \ |
Guoqing Jiang | 85ad1d1 | 2016-05-03 22:22:13 -0400 | [diff] [blame] | 255 | ({ \ |
Miklos Szeredi | edfa872 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 256 | const typeof(*(ptr)) clear__ = (clear), test__ = (test);\ |
| 257 | typeof(*(ptr)) old__, new__; \ |
Guoqing Jiang | 85ad1d1 | 2016-05-03 22:22:13 -0400 | [diff] [blame] | 258 | \ |
| 259 | do { \ |
Miklos Szeredi | edfa872 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 260 | old__ = READ_ONCE(*(ptr)); \ |
| 261 | new__ = old__ & ~clear__; \ |
| 262 | } while (!(old__ & test__) && \ |
| 263 | cmpxchg(ptr, old__, new__) != old__); \ |
Guoqing Jiang | 85ad1d1 | 2016-05-03 22:22:13 -0400 | [diff] [blame] | 264 | \ |
Miklos Szeredi | edfa872 | 2018-10-15 15:43:06 +0200 | [diff] [blame] | 265 | !(old__ & test__); \ |
Guoqing Jiang | 85ad1d1 | 2016-05-03 22:22:13 -0400 | [diff] [blame] | 266 | }) |
| 267 | #endif |
| 268 | |
Akinobu Mita | 19de85e | 2011-05-26 16:26:09 -0700 | [diff] [blame] | 269 | #ifndef find_last_bit |
Rusty Russell | ab53d47 | 2009-01-01 10:12:19 +1030 | [diff] [blame] | 270 | /** |
| 271 | * find_last_bit - find the last set bit in a memory region |
| 272 | * @addr: The address to start the search at |
Yury Norov | 2c57a0e | 2015-04-16 12:43:13 -0700 | [diff] [blame] | 273 | * @size: The number of bits to search |
Rusty Russell | ab53d47 | 2009-01-01 10:12:19 +1030 | [diff] [blame] | 274 | * |
Yury Norov | 2c57a0e | 2015-04-16 12:43:13 -0700 | [diff] [blame] | 275 | * Returns the bit number of the last set bit, or size. |
Rusty Russell | ab53d47 | 2009-01-01 10:12:19 +1030 | [diff] [blame] | 276 | */ |
| 277 | extern unsigned long find_last_bit(const unsigned long *addr, |
| 278 | unsigned long size); |
Akinobu Mita | 19de85e | 2011-05-26 16:26:09 -0700 | [diff] [blame] | 279 | #endif |
Rusty Russell | ab53d47 | 2009-01-01 10:12:19 +1030 | [diff] [blame] | 280 | |
Alexander van Heukelum | 64970b6 | 2008-03-11 16:17:19 +0100 | [diff] [blame] | 281 | #endif /* __KERNEL__ */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 282 | #endif |