1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * Copyright (C) 2004, 2007-2010, 2011-2012 Synopsys, Inc. (www.synopsys.com)
9 #ifndef _LINUX_BITOPS_H
10 #error only <linux/bitops.h> can be included directly
15 #include <linux/types.h>
16 #include <linux/compiler.h>
17 #include <asm/barrier.h>
18 #ifndef CONFIG_ARC_HAS_LLSC
22 #ifdef CONFIG_ARC_HAS_LLSC
25 * Hardware assisted Atomic-R-M-W
28 #define BIT_OP(op, c_op, asm_op) \
29 static inline void op##_bit(unsigned long nr, volatile unsigned long *m)\
37 __asm__ __volatile__( \
38 "1: llock %0, [%1] \n" \
39 " " #asm_op " %0, %0, %2 \n" \
40 " scond %0, [%1] \n" \
42 : "=&r"(temp) /* Early clobber, to prevent reg reuse */ \
43 : "r"(m), /* Not "m": llock only supports reg direct addr mode */ \
52 * set it and return 0 (old value)
54 * return 1 (old value).
56 * Since ARC lacks a equivalent h/w primitive, the bit is set unconditionally
57 * and the old value of bit is returned
59 #define TEST_N_BIT_OP(op, c_op, asm_op) \
60 static inline int test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
62 unsigned long old, temp; \
69 * Explicit full memory barrier needed before/after as \
70 * LLOCK/SCOND themselves don't provide any such smenatic \
74 __asm__ __volatile__( \
75 "1: llock %0, [%2] \n" \
76 " " #asm_op " %1, %0, %3 \n" \
77 " scond %1, [%2] \n" \
79 : "=&r"(old), "=&r"(temp) \
85 return (old & (1 << nr)) != 0; \
88 #elif !defined(CONFIG_ARC_PLAT_EZNPS)
91 * Non hardware assisted Atomic-R-M-W
92 * Locking would change to irq-disabling only (UP) and spinlocks (SMP)
94 * There's "significant" micro-optimization in writing our own variants of
95 * bitops (over generic variants)
97 * (1) The generic APIs have "signed" @nr while we have it "unsigned"
98 * This avoids extra code to be generated for pointer arithmatic, since
99 * is "not sure" that index is NOT -ve
100 * (2) Utilize the fact that ARCompact bit fidding insn (BSET/BCLR/ASL) etc
101 * only consider bottom 5 bits of @nr, so NO need to mask them off.
102 * (GCC Quirk: however for constant @nr we still need to do the masking
106 #define BIT_OP(op, c_op, asm_op) \
107 static inline void op##_bit(unsigned long nr, volatile unsigned long *m)\
109 unsigned long temp, flags; \
113 * spin lock/unlock provide the needed smp_mb() before/after \
115 bitops_lock(flags); \
118 *m = temp c_op (1UL << (nr & 0x1f)); \
120 bitops_unlock(flags); \
123 #define TEST_N_BIT_OP(op, c_op, asm_op) \
124 static inline int test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
126 unsigned long old, flags; \
129 bitops_lock(flags); \
132 *m = old c_op (1UL << (nr & 0x1f)); \
134 bitops_unlock(flags); \
136 return (old & (1UL << (nr & 0x1f))) != 0; \
139 #else /* CONFIG_ARC_PLAT_EZNPS */
141 #define BIT_OP(op, c_op, asm_op) \
142 static inline void op##_bit(unsigned long nr, volatile unsigned long *m)\
146 nr = (1UL << (nr & 0x1f)); \
147 if (asm_op == CTOP_INST_AAND_DI_R2_R2_R3) \
150 __asm__ __volatile__( \
155 : "r"(nr), "r"(m), "i"(asm_op) \
156 : "r2", "r3", "memory"); \
159 #define TEST_N_BIT_OP(op, c_op, asm_op) \
160 static inline int test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
166 nr = old = (1UL << (nr & 0x1f)); \
167 if (asm_op == CTOP_INST_AAND_DI_R2_R2_R3) \
170 /* Explicit full memory barrier needed before/after */ \
173 __asm__ __volatile__( \
179 : "r"(m), "i"(asm_op) \
180 : "r2", "r3", "memory"); \
184 return (old & nr) != 0; \
187 #endif /* CONFIG_ARC_PLAT_EZNPS */
189 /***************************************
190 * Non atomic variants
191 **************************************/
193 #define __BIT_OP(op, c_op, asm_op) \
194 static inline void __##op##_bit(unsigned long nr, volatile unsigned long *m) \
196 unsigned long temp; \
200 *m = temp c_op (1UL << (nr & 0x1f)); \
203 #define __TEST_N_BIT_OP(op, c_op, asm_op) \
204 static inline int __test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
210 *m = old c_op (1UL << (nr & 0x1f)); \
212 return (old & (1UL << (nr & 0x1f))) != 0; \
215 #define BIT_OPS(op, c_op, asm_op) \
217 /* set_bit(), clear_bit(), change_bit() */ \
218 BIT_OP(op, c_op, asm_op) \
220 /* test_and_set_bit(), test_and_clear_bit(), test_and_change_bit() */\
221 TEST_N_BIT_OP(op, c_op, asm_op) \
223 /* __set_bit(), __clear_bit(), __change_bit() */ \
224 __BIT_OP(op, c_op, asm_op) \
226 /* __test_and_set_bit(), __test_and_clear_bit(), __test_and_change_bit() */\
227 __TEST_N_BIT_OP(op, c_op, asm_op)
229 #ifndef CONFIG_ARC_PLAT_EZNPS
230 BIT_OPS(set, |, bset)
231 BIT_OPS(clear, & ~, bclr)
232 BIT_OPS(change, ^, bxor)
234 BIT_OPS(set, |, CTOP_INST_AOR_DI_R2_R2_R3)
235 BIT_OPS(clear, & ~, CTOP_INST_AAND_DI_R2_R2_R3)
236 BIT_OPS(change, ^, CTOP_INST_AXOR_DI_R2_R2_R3)
240 * This routine doesn't need to be atomic.
243 test_bit(unsigned int nr, const volatile unsigned long *addr)
249 mask = 1UL << (nr & 0x1f);
251 return ((mask & *addr) != 0);
254 #ifdef CONFIG_ISA_ARCOMPACT
257 * Count the number of zeros, starting from MSB
258 * Helper for fls( ) friends
259 * This is a pure count, so (1-32) or (0-31) doesn't apply
260 * It could be 0 to 32, based on num of 0's in there
261 * clz(0x8000_0000) = 0, clz(0xFFFF_FFFF)=0, clz(0) = 32, clz(1) = 31
263 static inline __attribute__ ((const)) int clz(unsigned int x)
267 __asm__ __volatile__(
270 " add.p %0, %0, 1 \n"
278 static inline int constant_fls(unsigned int x)
284 if (!(x & 0xffff0000u)) {
288 if (!(x & 0xff000000u)) {
292 if (!(x & 0xf0000000u)) {
296 if (!(x & 0xc0000000u)) {
300 if (!(x & 0x80000000u)) {
308 * fls = Find Last Set in word
310 * fls(1) = 1, fls(0x80000000) = 32, fls(0) = 0
312 static inline __attribute__ ((const)) int fls(unsigned int x)
314 if (__builtin_constant_p(x))
315 return constant_fls(x);
321 * __fls: Similar to fls, but zero based (0-31)
323 static inline __attribute__ ((const)) int __fls(unsigned long x)
332 * ffs = Find First Set in word (LSB to MSB)
333 * @result: [1-32], 0 if all 0's
335 #define ffs(x) ({ unsigned long __t = (x); fls(__t & -__t); })
338 * __ffs: Similar to ffs, but zero based (0-31)
340 static inline __attribute__ ((const)) unsigned long __ffs(unsigned long word)
345 return ffs(word) - 1;
348 #else /* CONFIG_ISA_ARCV2 */
351 * fls = Find Last Set in word
353 * fls(1) = 1, fls(0x80000000) = 32, fls(0) = 0
355 static inline __attribute__ ((const)) int fls(unsigned long x)
360 " fls.f %0, %1 \n" /* 0:31; 0(Z) if src 0 */
361 " add.nz %0, %0, 1 \n" /* 0:31 -> 1:32 */
362 : "=r"(n) /* Early clobber not needed */
370 * __fls: Similar to fls, but zero based (0-31). Also 0 if no bit set
372 static inline __attribute__ ((const)) int __fls(unsigned long x)
374 /* FLS insn has exactly same semantics as the API */
375 return __builtin_arc_fls(x);
379 * ffs = Find First Set in word (LSB to MSB)
380 * @result: [1-32], 0 if all 0's
382 static inline __attribute__ ((const)) int ffs(unsigned long x)
387 " ffs.f %0, %1 \n" /* 0:31; 31(Z) if src 0 */
388 " add.nz %0, %0, 1 \n" /* 0:31 -> 1:32 */
389 " mov.z %0, 0 \n" /* 31(Z)-> 0 */
390 : "=r"(n) /* Early clobber not needed */
398 * __ffs: Similar to ffs, but zero based (0-31)
400 static inline __attribute__ ((const)) unsigned long __ffs(unsigned long x)
405 " ffs.f %0, %1 \n" /* 0:31; 31(Z) if src 0 */
406 " mov.z %0, 0 \n" /* 31(Z)-> 0 */
415 #endif /* CONFIG_ISA_ARCOMPACT */
418 * ffz = Find First Zero in word.
419 * @return:[0-31], 32 if all 1's
421 #define ffz(x) __ffs(~(x))
423 #include <asm-generic/bitops/hweight.h>
424 #include <asm-generic/bitops/fls64.h>
425 #include <asm-generic/bitops/sched.h>
426 #include <asm-generic/bitops/lock.h>
428 #include <asm-generic/bitops/find.h>
429 #include <asm-generic/bitops/le.h>
430 #include <asm-generic/bitops/ext2-atomic-setbit.h>
432 #endif /* !__ASSEMBLY__ */