2 * Copyright (C) 2004, 2007-2010, 2011-2012 Synopsys, Inc. (www.synopsys.com)
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
12 #ifndef _LINUX_BITOPS_H
13 #error only <linux/bitops.h> can be included directly
18 #include <linux/types.h>
19 #include <linux/compiler.h>
20 #include <asm/barrier.h>
21 #ifndef CONFIG_ARC_HAS_LLSC
25 #ifdef CONFIG_ARC_HAS_LLSC
28 * Hardware assisted Atomic-R-M-W
31 #define BIT_OP(op, c_op, asm_op) \
32 static inline void op##_bit(unsigned long nr, volatile unsigned long *m)\
40 __asm__ __volatile__( \
41 "1: llock %0, [%1] \n" \
42 " " #asm_op " %0, %0, %2 \n" \
43 " scond %0, [%1] \n" \
45 : "=&r"(temp) /* Early clobber, to prevent reg reuse */ \
46 : "r"(m), /* Not "m": llock only supports reg direct addr mode */ \
55 * set it and return 0 (old value)
57 * return 1 (old value).
59 * Since ARC lacks a equivalent h/w primitive, the bit is set unconditionally
60 * and the old value of bit is returned
62 #define TEST_N_BIT_OP(op, c_op, asm_op) \
63 static inline int test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
65 unsigned long old, temp; \
72 * Explicit full memory barrier needed before/after as \
73 * LLOCK/SCOND themselves don't provide any such smenatic \
77 __asm__ __volatile__( \
78 "1: llock %0, [%2] \n" \
79 " " #asm_op " %1, %0, %3 \n" \
80 " scond %1, [%2] \n" \
82 : "=&r"(old), "=&r"(temp) \
88 return (old & (1 << nr)) != 0; \
91 #elif !defined(CONFIG_ARC_PLAT_EZNPS)
94 * Non hardware assisted Atomic-R-M-W
95 * Locking would change to irq-disabling only (UP) and spinlocks (SMP)
97 * There's "significant" micro-optimization in writing our own variants of
98 * bitops (over generic variants)
100 * (1) The generic APIs have "signed" @nr while we have it "unsigned"
101 * This avoids extra code to be generated for pointer arithmatic, since
102 * is "not sure" that index is NOT -ve
103 * (2) Utilize the fact that ARCompact bit fidding insn (BSET/BCLR/ASL) etc
104 * only consider bottom 5 bits of @nr, so NO need to mask them off.
105 * (GCC Quirk: however for constant @nr we still need to do the masking
109 #define BIT_OP(op, c_op, asm_op) \
110 static inline void op##_bit(unsigned long nr, volatile unsigned long *m)\
112 unsigned long temp, flags; \
116 * spin lock/unlock provide the needed smp_mb() before/after \
118 bitops_lock(flags); \
121 *m = temp c_op (1UL << (nr & 0x1f)); \
123 bitops_unlock(flags); \
126 #define TEST_N_BIT_OP(op, c_op, asm_op) \
127 static inline int test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
129 unsigned long old, flags; \
132 bitops_lock(flags); \
135 *m = old c_op (1UL << (nr & 0x1f)); \
137 bitops_unlock(flags); \
139 return (old & (1UL << (nr & 0x1f))) != 0; \
142 #else /* CONFIG_ARC_PLAT_EZNPS */
144 #define BIT_OP(op, c_op, asm_op) \
145 static inline void op##_bit(unsigned long nr, volatile unsigned long *m)\
149 nr = (1UL << (nr & 0x1f)); \
150 if (asm_op == CTOP_INST_AAND_DI_R2_R2_R3) \
153 __asm__ __volatile__( \
158 : "r"(nr), "r"(m), "i"(asm_op) \
159 : "r2", "r3", "memory"); \
162 #define TEST_N_BIT_OP(op, c_op, asm_op) \
163 static inline int test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
169 nr = old = (1UL << (nr & 0x1f)); \
170 if (asm_op == CTOP_INST_AAND_DI_R2_R2_R3) \
173 /* Explicit full memory barrier needed before/after */ \
176 __asm__ __volatile__( \
182 : "r"(m), "i"(asm_op) \
183 : "r2", "r3", "memory"); \
187 return (old & nr) != 0; \
190 #endif /* CONFIG_ARC_PLAT_EZNPS */
192 /***************************************
193 * Non atomic variants
194 **************************************/
196 #define __BIT_OP(op, c_op, asm_op) \
197 static inline void __##op##_bit(unsigned long nr, volatile unsigned long *m) \
199 unsigned long temp; \
203 *m = temp c_op (1UL << (nr & 0x1f)); \
206 #define __TEST_N_BIT_OP(op, c_op, asm_op) \
207 static inline int __test_and_##op##_bit(unsigned long nr, volatile unsigned long *m)\
213 *m = old c_op (1UL << (nr & 0x1f)); \
215 return (old & (1UL << (nr & 0x1f))) != 0; \
218 #define BIT_OPS(op, c_op, asm_op) \
220 /* set_bit(), clear_bit(), change_bit() */ \
221 BIT_OP(op, c_op, asm_op) \
223 /* test_and_set_bit(), test_and_clear_bit(), test_and_change_bit() */\
224 TEST_N_BIT_OP(op, c_op, asm_op) \
226 /* __set_bit(), __clear_bit(), __change_bit() */ \
227 __BIT_OP(op, c_op, asm_op) \
229 /* __test_and_set_bit(), __test_and_clear_bit(), __test_and_change_bit() */\
230 __TEST_N_BIT_OP(op, c_op, asm_op)
232 #ifndef CONFIG_ARC_PLAT_EZNPS
233 BIT_OPS(set
, |, bset
)
234 BIT_OPS(clear
, & ~, bclr
)
235 BIT_OPS(change
, ^, bxor
)
237 BIT_OPS(set
, |, CTOP_INST_AOR_DI_R2_R2_R3
)
238 BIT_OPS(clear
, & ~, CTOP_INST_AAND_DI_R2_R2_R3
)
239 BIT_OPS(change
, ^, CTOP_INST_AXOR_DI_R2_R2_R3
)
243 * This routine doesn't need to be atomic.
246 test_bit(unsigned int nr
, const volatile unsigned long *addr
)
252 mask
= 1UL << (nr
& 0x1f);
254 return ((mask
& *addr
) != 0);
257 #ifdef CONFIG_ISA_ARCOMPACT
260 * Count the number of zeros, starting from MSB
261 * Helper for fls( ) friends
262 * This is a pure count, so (1-32) or (0-31) doesn't apply
263 * It could be 0 to 32, based on num of 0's in there
264 * clz(0x8000_0000) = 0, clz(0xFFFF_FFFF)=0, clz(0) = 32, clz(1) = 31
266 static inline __attribute__ ((const)) int clz(unsigned int x
)
270 __asm__
__volatile__(
273 " add.p %0, %0, 1 \n"
281 static inline int constant_fls(int x
)
287 if (!(x
& 0xffff0000u
)) {
291 if (!(x
& 0xff000000u
)) {
295 if (!(x
& 0xf0000000u
)) {
299 if (!(x
& 0xc0000000u
)) {
303 if (!(x
& 0x80000000u
)) {
311 * fls = Find Last Set in word
313 * fls(1) = 1, fls(0x80000000) = 32, fls(0) = 0
315 static inline __attribute__ ((const)) int fls(unsigned long x
)
317 if (__builtin_constant_p(x
))
318 return constant_fls(x
);
324 * __fls: Similar to fls, but zero based (0-31)
326 static inline __attribute__ ((const)) int __fls(unsigned long x
)
335 * ffs = Find First Set in word (LSB to MSB)
336 * @result: [1-32], 0 if all 0's
338 #define ffs(x) ({ unsigned long __t = (x); fls(__t & -__t); })
341 * __ffs: Similar to ffs, but zero based (0-31)
343 static inline __attribute__ ((const)) int __ffs(unsigned long word
)
348 return ffs(word
) - 1;
351 #else /* CONFIG_ISA_ARCV2 */
354 * fls = Find Last Set in word
356 * fls(1) = 1, fls(0x80000000) = 32, fls(0) = 0
358 static inline __attribute__ ((const)) int fls(unsigned long x
)
363 " fls.f %0, %1 \n" /* 0:31; 0(Z) if src 0 */
364 " add.nz %0, %0, 1 \n" /* 0:31 -> 1:32 */
365 : "=r"(n
) /* Early clobber not needed */
373 * __fls: Similar to fls, but zero based (0-31). Also 0 if no bit set
375 static inline __attribute__ ((const)) int __fls(unsigned long x
)
377 /* FLS insn has exactly same semantics as the API */
378 return __builtin_arc_fls(x
);
382 * ffs = Find First Set in word (LSB to MSB)
383 * @result: [1-32], 0 if all 0's
385 static inline __attribute__ ((const)) int ffs(unsigned long x
)
390 " ffs.f %0, %1 \n" /* 0:31; 31(Z) if src 0 */
391 " add.nz %0, %0, 1 \n" /* 0:31 -> 1:32 */
392 " mov.z %0, 0 \n" /* 31(Z)-> 0 */
393 : "=r"(n
) /* Early clobber not needed */
401 * __ffs: Similar to ffs, but zero based (0-31)
403 static inline __attribute__ ((const)) int __ffs(unsigned long x
)
408 " ffs.f %0, %1 \n" /* 0:31; 31(Z) if src 0 */
409 " mov.z %0, 0 \n" /* 31(Z)-> 0 */
418 #endif /* CONFIG_ISA_ARCOMPACT */
421 * ffz = Find First Zero in word.
422 * @return:[0-31], 32 if all 1's
424 #define ffz(x) __ffs(~(x))
426 #include <asm-generic/bitops/hweight.h>
427 #include <asm-generic/bitops/fls64.h>
428 #include <asm-generic/bitops/sched.h>
429 #include <asm-generic/bitops/lock.h>
431 #include <asm-generic/bitops/find.h>
432 #include <asm-generic/bitops/le.h>
433 #include <asm-generic/bitops/ext2-atomic-setbit.h>
435 #endif /* !__ASSEMBLY__ */