2 * Copyright 1995, Russell King.
3 * Various bits and pieces copyrights include:
4 * Linus Torvalds (test_bit).
5 * Big endian support: Copyright 2001, Nicolas Pitre
8 * bit 0 is the LSB of an "unsigned long" quantity.
10 * Please note that the code in this file should never be included
11 * from user space. Many of these are not implemented in assembler
12 * since they would be too costly. Also, they require privileged
13 * instructions (which are not available from user mode) to ensure
14 * that they are atomic.
17 #ifndef __ASM_ARM_BITOPS_H
18 #define __ASM_ARM_BITOPS_H
22 #ifndef _LINUX_BITOPS_H
23 #error only <linux/bitops.h> can be included directly
26 #include <linux/compiler.h>
27 #include <asm/system.h>
29 #define smp_mb__before_clear_bit() smp_mb()
30 #define smp_mb__after_clear_bit() smp_mb()
33 * These functions are the basis of our bit ops.
35 * First, the atomic bitops. These use native endian.
37 static inline void ____atomic_set_bit(unsigned int bit
, volatile unsigned long *p
)
40 unsigned long mask
= 1UL << (bit
& 31);
44 raw_local_irq_save(flags
);
46 raw_local_irq_restore(flags
);
49 static inline void ____atomic_clear_bit(unsigned int bit
, volatile unsigned long *p
)
52 unsigned long mask
= 1UL << (bit
& 31);
56 raw_local_irq_save(flags
);
58 raw_local_irq_restore(flags
);
61 static inline void ____atomic_change_bit(unsigned int bit
, volatile unsigned long *p
)
64 unsigned long mask
= 1UL << (bit
& 31);
68 raw_local_irq_save(flags
);
70 raw_local_irq_restore(flags
);
74 ____atomic_test_and_set_bit(unsigned int bit
, volatile unsigned long *p
)
78 unsigned long mask
= 1UL << (bit
& 31);
82 raw_local_irq_save(flags
);
85 raw_local_irq_restore(flags
);
87 return (res
& mask
) != 0;
91 ____atomic_test_and_clear_bit(unsigned int bit
, volatile unsigned long *p
)
95 unsigned long mask
= 1UL << (bit
& 31);
99 raw_local_irq_save(flags
);
102 raw_local_irq_restore(flags
);
104 return (res
& mask
) != 0;
108 ____atomic_test_and_change_bit(unsigned int bit
, volatile unsigned long *p
)
112 unsigned long mask
= 1UL << (bit
& 31);
116 raw_local_irq_save(flags
);
119 raw_local_irq_restore(flags
);
121 return (res
& mask
) != 0;
124 #include <asm-generic/bitops/non-atomic.h>
127 * A note about Endian-ness.
128 * -------------------------
130 * When the ARM is put into big endian mode via CR15, the processor
131 * merely swaps the order of bytes within words, thus:
133 * ------------ physical data bus bits -----------
134 * D31 ... D24 D23 ... D16 D15 ... D8 D7 ... D0
135 * little byte 3 byte 2 byte 1 byte 0
136 * big byte 0 byte 1 byte 2 byte 3
138 * This means that reading a 32-bit word at address 0 returns the same
139 * value irrespective of the endian mode bit.
141 * Peripheral devices should be connected with the data bus reversed in
142 * "Big Endian" mode. ARM Application Note 61 is applicable, and is
143 * available from http://www.arm.com/.
145 * The following assumes that the data bus connectivity for big endian
146 * mode has been followed.
148 * Note that bit 0 is defined to be 32-bit word bit 0, not byte 0 bit 0.
152 * Native endian assembly bitops. nr = 0 -> word 0 bit 0.
154 extern void _set_bit(int nr
, volatile unsigned long * p
);
155 extern void _clear_bit(int nr
, volatile unsigned long * p
);
156 extern void _change_bit(int nr
, volatile unsigned long * p
);
157 extern int _test_and_set_bit(int nr
, volatile unsigned long * p
);
158 extern int _test_and_clear_bit(int nr
, volatile unsigned long * p
);
159 extern int _test_and_change_bit(int nr
, volatile unsigned long * p
);
162 * Little endian assembly bitops. nr = 0 -> byte 0 bit 0.
164 extern int _find_first_zero_bit_le(const void * p
, unsigned size
);
165 extern int _find_next_zero_bit_le(const void * p
, int size
, int offset
);
166 extern int _find_first_bit_le(const unsigned long *p
, unsigned size
);
167 extern int _find_next_bit_le(const unsigned long *p
, int size
, int offset
);
170 * Big endian assembly bitops. nr = 0 -> byte 3 bit 0.
172 extern int _find_first_zero_bit_be(const void * p
, unsigned size
);
173 extern int _find_next_zero_bit_be(const void * p
, int size
, int offset
);
174 extern int _find_first_bit_be(const unsigned long *p
, unsigned size
);
175 extern int _find_next_bit_be(const unsigned long *p
, int size
, int offset
);
179 * The __* form of bitops are non-atomic and may be reordered.
181 #define ATOMIC_BITOP(name,nr,p) \
182 (__builtin_constant_p(nr) ? ____atomic_##name(nr, p) : _##name(nr,p))
184 #define ATOMIC_BITOP(name,nr,p) _##name(nr,p)
188 * Native endian atomic definitions.
190 #define set_bit(nr,p) ATOMIC_BITOP(set_bit,nr,p)
191 #define clear_bit(nr,p) ATOMIC_BITOP(clear_bit,nr,p)
192 #define change_bit(nr,p) ATOMIC_BITOP(change_bit,nr,p)
193 #define test_and_set_bit(nr,p) ATOMIC_BITOP(test_and_set_bit,nr,p)
194 #define test_and_clear_bit(nr,p) ATOMIC_BITOP(test_and_clear_bit,nr,p)
195 #define test_and_change_bit(nr,p) ATOMIC_BITOP(test_and_change_bit,nr,p)
199 * These are the little endian, atomic definitions.
201 #define find_first_zero_bit(p,sz) _find_first_zero_bit_le(p,sz)
202 #define find_next_zero_bit(p,sz,off) _find_next_zero_bit_le(p,sz,off)
203 #define find_first_bit(p,sz) _find_first_bit_le(p,sz)
204 #define find_next_bit(p,sz,off) _find_next_bit_le(p,sz,off)
208 * These are the big endian, atomic definitions.
210 #define find_first_zero_bit(p,sz) _find_first_zero_bit_be(p,sz)
211 #define find_next_zero_bit(p,sz,off) _find_next_zero_bit_be(p,sz,off)
212 #define find_first_bit(p,sz) _find_first_bit_be(p,sz)
213 #define find_next_bit(p,sz,off) _find_next_bit_be(p,sz,off)
217 #if __LINUX_ARM_ARCH__ < 5
219 #include <asm-generic/bitops/ffz.h>
220 #include <asm-generic/bitops/__fls.h>
221 #include <asm-generic/bitops/__ffs.h>
222 #include <asm-generic/bitops/fls.h>
223 #include <asm-generic/bitops/ffs.h>
227 static inline int constant_fls(int x
)
233 if (!(x
& 0xffff0000u
)) {
237 if (!(x
& 0xff000000u
)) {
241 if (!(x
& 0xf0000000u
)) {
245 if (!(x
& 0xc0000000u
)) {
249 if (!(x
& 0x80000000u
)) {
257 * On ARMv5 and above those functions can be implemented around
258 * the clz instruction for much better code efficiency.
261 static inline int fls(int x
)
265 if (__builtin_constant_p(x
))
266 return constant_fls(x
);
268 asm("clz\t%0, %1" : "=r" (ret
) : "r" (x
));
273 #define __fls(x) (fls(x) - 1)
274 #define ffs(x) ({ unsigned long __t = (x); fls(__t & -__t); })
275 #define __ffs(x) (ffs(x) - 1)
276 #define ffz(x) __ffs( ~(x) )
280 #include <asm-generic/bitops/fls64.h>
282 #include <asm-generic/bitops/sched.h>
283 #include <asm-generic/bitops/hweight.h>
284 #include <asm-generic/bitops/lock.h>
288 static inline int find_first_zero_bit_le(const void *p
, unsigned size
)
290 return _find_first_zero_bit_le(p
, size
);
292 #define find_first_zero_bit_le find_first_zero_bit_le
294 static inline int find_next_zero_bit_le(const void *p
, int size
, int offset
)
296 return _find_next_zero_bit_le(p
, size
, offset
);
298 #define find_next_zero_bit_le find_next_zero_bit_le
300 static inline int find_next_bit_le(const void *p
, int size
, int offset
)
302 return _find_next_bit_le(p
, size
, offset
);
304 #define find_next_bit_le find_next_bit_le
308 #include <asm-generic/bitops/le.h>
311 * Ext2 is defined to use little-endian byte ordering.
313 #include <asm-generic/bitops/ext2-atomic-setbit.h>
315 #endif /* __KERNEL__ */
317 #endif /* _ARM_BITOPS_H */