2 * This file is subject to the terms and conditions of the GNU General Public
3 * License. See the file "COPYING" in the main directory of this archive
7 * Copyright (c) 1999, 2000 Silicon Graphics, Inc.
12 #ifndef _LINUX_BITOPS_H
13 #error only <linux/bitops.h> can be included directly
16 #include <linux/bits.h>
17 #include <linux/compiler.h>
18 #include <linux/types.h>
20 #include <asm/barrier.h>
21 #include <asm/byteorder.h> /* sigh ... */
22 #include <asm/compiler.h>
23 #include <asm/cpu-features.h>
24 #include <asm/sgidefs.h>
26 #define __bit_op(mem, insn, inputs...) do { \
27 unsigned long __temp; \
31 " .set " MIPS_ISA_LEVEL " \n" \
32 " " __SYNC(full, loongson3_war) " \n" \
33 "1: " __stringify(LONG_LL) " %0, %1 \n" \
35 " " __stringify(LONG_SC) " %0, %1 \n" \
36 " " __stringify(SC_BEQZ) " %0, 1b \n" \
38 : "=&r"(__temp), "+" GCC_OFF_SMALL_ASM()(mem) \
43 #define __test_bit_op(mem, ll_dst, insn, inputs...) ({ \
44 unsigned long __orig, __temp; \
48 " .set " MIPS_ISA_LEVEL " \n" \
49 " " __SYNC(full, loongson3_war) " \n" \
50 "1: " __stringify(LONG_LL) " " ll_dst ", %2\n" \
52 " " __stringify(LONG_SC) " %1, %2 \n" \
53 " " __stringify(SC_BEQZ) " %1, 1b \n" \
55 : "=&r"(__orig), "=&r"(__temp), \
56 "+" GCC_OFF_SMALL_ASM()(mem) \
64 * These are the "slower" versions of the functions and are in bitops.c.
65 * These functions call raw_local_irq_{save,restore}().
67 void __mips_set_bit(unsigned long nr, volatile unsigned long *addr);
68 void __mips_clear_bit(unsigned long nr, volatile unsigned long *addr);
69 void __mips_change_bit(unsigned long nr, volatile unsigned long *addr);
70 int __mips_test_and_set_bit_lock(unsigned long nr,
71 volatile unsigned long *addr);
72 int __mips_test_and_clear_bit(unsigned long nr,
73 volatile unsigned long *addr);
74 int __mips_test_and_change_bit(unsigned long nr,
75 volatile unsigned long *addr);
79 * set_bit - Atomically set a bit in memory
81 * @addr: the address to start counting from
83 * This function is atomic and may not be reordered. See __set_bit()
84 * if you do not require the atomic guarantees.
85 * Note that @nr may be almost arbitrarily large; this function is not
86 * restricted to acting on a single-word quantity.
88 static inline void set_bit(unsigned long nr, volatile unsigned long *addr)
90 volatile unsigned long *m = &addr[BIT_WORD(nr)];
91 int bit = nr % BITS_PER_LONG;
93 if (!kernel_uses_llsc) {
94 __mips_set_bit(nr, addr);
98 if ((MIPS_ISA_REV >= 2) && __builtin_constant_p(bit) && (bit >= 16)) {
99 __bit_op(*m, __stringify(LONG_INS) " %0, %3, %2, 1", "i"(bit), "r"(~0));
103 __bit_op(*m, "or\t%0, %2", "ir"(BIT(bit)));
107 * clear_bit - Clears a bit in memory
109 * @addr: Address to start counting from
111 * clear_bit() is atomic and may not be reordered. However, it does
112 * not contain a memory barrier, so if it is used for locking purposes,
113 * you should call smp_mb__before_atomic() and/or smp_mb__after_atomic()
114 * in order to ensure changes are visible on other processors.
116 static inline void clear_bit(unsigned long nr, volatile unsigned long *addr)
118 volatile unsigned long *m = &addr[BIT_WORD(nr)];
119 int bit = nr % BITS_PER_LONG;
121 if (!kernel_uses_llsc) {
122 __mips_clear_bit(nr, addr);
126 if ((MIPS_ISA_REV >= 2) && __builtin_constant_p(bit)) {
127 __bit_op(*m, __stringify(LONG_INS) " %0, $0, %2, 1", "i"(bit));
131 __bit_op(*m, "and\t%0, %2", "ir"(~BIT(bit)));
135 * clear_bit_unlock - Clears a bit in memory
137 * @addr: Address to start counting from
139 * clear_bit() is atomic and implies release semantics before the memory
140 * operation. It can be used for an unlock.
142 static inline void clear_bit_unlock(unsigned long nr, volatile unsigned long *addr)
144 smp_mb__before_atomic();
149 * change_bit - Toggle a bit in memory
151 * @addr: Address to start counting from
153 * change_bit() is atomic and may not be reordered.
154 * Note that @nr may be almost arbitrarily large; this function is not
155 * restricted to acting on a single-word quantity.
157 static inline void change_bit(unsigned long nr, volatile unsigned long *addr)
159 volatile unsigned long *m = &addr[BIT_WORD(nr)];
160 int bit = nr % BITS_PER_LONG;
162 if (!kernel_uses_llsc) {
163 __mips_change_bit(nr, addr);
167 __bit_op(*m, "xor\t%0, %2", "ir"(BIT(bit)));
171 * test_and_set_bit_lock - Set a bit and return its old value
173 * @addr: Address to count from
175 * This operation is atomic and implies acquire ordering semantics
176 * after the memory operation.
178 static inline int test_and_set_bit_lock(unsigned long nr,
179 volatile unsigned long *addr)
181 volatile unsigned long *m = &addr[BIT_WORD(nr)];
182 int bit = nr % BITS_PER_LONG;
183 unsigned long res, orig;
185 if (!kernel_uses_llsc) {
186 res = __mips_test_and_set_bit_lock(nr, addr);
188 orig = __test_bit_op(*m, "%0",
191 res = (orig & BIT(bit)) != 0;
200 * test_and_set_bit - Set a bit and return its old value
202 * @addr: Address to count from
204 * This operation is atomic and cannot be reordered.
205 * It also implies a memory barrier.
207 static inline int test_and_set_bit(unsigned long nr,
208 volatile unsigned long *addr)
210 smp_mb__before_atomic();
211 return test_and_set_bit_lock(nr, addr);
215 * test_and_clear_bit - Clear a bit and return its old value
217 * @addr: Address to count from
219 * This operation is atomic and cannot be reordered.
220 * It also implies a memory barrier.
222 static inline int test_and_clear_bit(unsigned long nr,
223 volatile unsigned long *addr)
225 volatile unsigned long *m = &addr[BIT_WORD(nr)];
226 int bit = nr % BITS_PER_LONG;
227 unsigned long res, orig;
229 smp_mb__before_atomic();
231 if (!kernel_uses_llsc) {
232 res = __mips_test_and_clear_bit(nr, addr);
233 } else if ((MIPS_ISA_REV >= 2) && __builtin_constant_p(nr)) {
234 res = __test_bit_op(*m, "%1",
235 __stringify(LONG_EXT) " %0, %1, %3, 1;"
236 __stringify(LONG_INS) " %1, $0, %3, 1",
239 orig = __test_bit_op(*m, "%0",
243 res = (orig & BIT(bit)) != 0;
252 * test_and_change_bit - Change a bit and return its old value
254 * @addr: Address to count from
256 * This operation is atomic and cannot be reordered.
257 * It also implies a memory barrier.
259 static inline int test_and_change_bit(unsigned long nr,
260 volatile unsigned long *addr)
262 volatile unsigned long *m = &addr[BIT_WORD(nr)];
263 int bit = nr % BITS_PER_LONG;
264 unsigned long res, orig;
266 smp_mb__before_atomic();
268 if (!kernel_uses_llsc) {
269 res = __mips_test_and_change_bit(nr, addr);
271 orig = __test_bit_op(*m, "%0",
274 res = (orig & BIT(bit)) != 0;
285 #include <asm-generic/bitops/non-atomic.h>
288 * __clear_bit_unlock - Clears a bit in memory
290 * @addr: Address to start counting from
292 * __clear_bit() is non-atomic and implies release semantics before the memory
293 * operation. It can be used for an unlock if no other CPUs can concurrently
294 * modify other bits in the word.
296 static inline void __clear_bit_unlock(unsigned long nr, volatile unsigned long *addr)
298 smp_mb__before_llsc();
299 __clear_bit(nr, addr);
304 * Return the bit position (0..63) of the most significant 1 bit in a word
305 * Returns -1 if no 1 bit exists
307 static __always_inline unsigned long __fls(unsigned long word)
311 if (BITS_PER_LONG == 32 && !__builtin_constant_p(word) &&
312 __builtin_constant_p(cpu_has_clo_clz) && cpu_has_clo_clz) {
315 " .set "MIPS_ISA_LEVEL" \n"
324 if (BITS_PER_LONG == 64 && !__builtin_constant_p(word) &&
325 __builtin_constant_p(cpu_has_mips64) && cpu_has_mips64) {
328 " .set "MIPS_ISA_LEVEL" \n"
337 num = BITS_PER_LONG - 1;
339 #if BITS_PER_LONG == 64
340 if (!(word & (~0ul << 32))) {
345 if (!(word & (~0ul << (BITS_PER_LONG-16)))) {
349 if (!(word & (~0ul << (BITS_PER_LONG-8)))) {
353 if (!(word & (~0ul << (BITS_PER_LONG-4)))) {
357 if (!(word & (~0ul << (BITS_PER_LONG-2)))) {
361 if (!(word & (~0ul << (BITS_PER_LONG-1))))
367 * __ffs - find first bit in word.
368 * @word: The word to search
370 * Returns 0..SZLONG-1
371 * Undefined if no bit exists, so code should check against 0 first.
373 static __always_inline unsigned long __ffs(unsigned long word)
375 return __fls(word & -word);
379 * fls - find last bit set.
380 * @word: The word to search
382 * This is defined the same way as ffs.
383 * Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
385 static inline int fls(unsigned int x)
389 if (!__builtin_constant_p(x) &&
390 __builtin_constant_p(cpu_has_clo_clz) && cpu_has_clo_clz) {
393 " .set "MIPS_ISA_LEVEL" \n"
405 if (!(x & 0xffff0000u)) {
409 if (!(x & 0xff000000u)) {
413 if (!(x & 0xf0000000u)) {
417 if (!(x & 0xc0000000u)) {
421 if (!(x & 0x80000000u)) {
428 #include <asm-generic/bitops/fls64.h>
431 * ffs - find first bit set.
432 * @word: The word to search
434 * This is defined the same way as
435 * the libc and compiler builtin ffs routines, therefore
436 * differs in spirit from the below ffz (man ffs).
438 static inline int ffs(int word)
443 return fls(word & -word);
446 #include <asm-generic/bitops/ffz.h>
450 #include <asm-generic/bitops/sched.h>
452 #include <asm/arch_hweight.h>
453 #include <asm-generic/bitops/const_hweight.h>
455 #include <asm-generic/bitops/le.h>
456 #include <asm-generic/bitops/ext2-atomic.h>
458 #endif /* __KERNEL__ */
460 #endif /* _ASM_BITOPS_H */