1 #ifndef __ASM_SH64_BITOPS_H
2 #define __ASM_SH64_BITOPS_H
5 #include <asm/system.h>
7 #include <asm/byteorder.h>
9 static __inline__ void set_bit(int nr, volatile void * addr)
12 volatile unsigned int *a = addr;
16 mask = 1 << (nr & 0x1f);
22 static __inline__ void __set_bit(int nr, volatile void * addr)
25 volatile unsigned int *a = addr;
28 mask = 1 << (nr & 0x1f);
33 * clear_bit() doesn't provide any barrier for the compiler.
35 #define smp_mb__before_clear_bit() barrier()
36 #define smp_mb__after_clear_bit() barrier()
37 static __inline__ void clear_bit(int nr, volatile void * addr)
40 volatile unsigned int *a = addr;
44 mask = 1 << (nr & 0x1f);
50 static __inline__ void __clear_bit(int nr, volatile void * addr)
53 volatile unsigned int *a = addr;
56 mask = 1 << (nr & 0x1f);
60 static __inline__ void change_bit(int nr, volatile void * addr)
63 volatile unsigned int *a = addr;
67 mask = 1 << (nr & 0x1f);
73 static __inline__ void __change_bit(int nr, volatile void * addr)
76 volatile unsigned int *a = addr;
79 mask = 1 << (nr & 0x1f);
83 static __inline__ int test_and_set_bit(int nr, volatile void * addr)
86 volatile unsigned int *a = addr;
90 mask = 1 << (nr & 0x1f);
92 retval = (mask & *a) != 0;
99 static __inline__ int __test_and_set_bit(int nr, volatile void * addr)
102 volatile unsigned int *a = addr;
105 mask = 1 << (nr & 0x1f);
106 retval = (mask & *a) != 0;
112 static __inline__ int test_and_clear_bit(int nr, volatile void * addr)
115 volatile unsigned int *a = addr;
119 mask = 1 << (nr & 0x1f);
121 retval = (mask & *a) != 0;
123 restore_flags(flags);
128 static __inline__ int __test_and_clear_bit(int nr, volatile void * addr)
131 volatile unsigned int *a = addr;
134 mask = 1 << (nr & 0x1f);
135 retval = (mask & *a) != 0;
141 static __inline__ int test_and_change_bit(int nr, volatile void * addr)
144 volatile unsigned int *a = addr;
148 mask = 1 << (nr & 0x1f);
150 retval = (mask & *a) != 0;
152 restore_flags(flags);
157 static __inline__ int __test_and_change_bit(int nr, volatile void * addr)
160 volatile unsigned int *a = addr;
163 mask = 1 << (nr & 0x1f);
164 retval = (mask & *a) != 0;
170 static __inline__ int test_bit(int nr, const volatile void *addr)
172 return 1UL & (((const volatile unsigned int *) addr)[nr >> 5] >> (nr & 31));
175 static __inline__ unsigned long ffz(unsigned long word)
177 unsigned long result, __d2, __d3;
179 __asm__("gettr " __t0 ", %2\n\t"
180 "_pta 32, " __t0 "\n\t"
182 "beq %3, r63, " __t0 "\n\t"
185 "shlri.l %1, 1, %1\n\t"
188 "beqi %3, 1, " __t0 "\n"
190 "ptabs %2, " __t0 "\n\t"
191 : "=r" (result), "=r" (word), "=r" (__d2), "=r" (__d3)
192 : "0" (0L), "1" (word));
197 static __inline__ int find_next_zero_bit(void *addr, int size, int offset)
199 unsigned long *p = ((unsigned long *) addr) + (offset >> 5);
200 unsigned long result = offset & ~31UL;
209 tmp |= ~0UL >> (32-offset);
217 while (size & ~31UL) {
230 return result + ffz(tmp);
233 #define find_first_zero_bit(addr, size) \
234 find_next_zero_bit((addr), (size), 0)
237 * ffs: find first bit set. This is defined the same way as
238 * the libc and compiler builtin ffs routines, therefore
239 * differs in spirit from the above ffz (man ffs).
242 #define ffs(x) generic_ffs(x)
245 * hweightN: returns the hamming weight (i.e. the number
246 * of bits set) of a N-bit word
249 #define hweight32(x) generic_hweight32(x)
250 #define hweight16(x) generic_hweight16(x)
251 #define hweight8(x) generic_hweight8(x)
253 #ifdef __LITTLE_ENDIAN__
254 #define ext2_set_bit(nr, addr) test_and_set_bit((nr), (addr))
255 #define ext2_clear_bit(nr, addr) test_and_clear_bit((nr), (addr))
256 #define ext2_test_bit(nr, addr) test_bit((nr), (addr))
257 #define ext2_find_first_zero_bit(addr, size) find_first_zero_bit((addr), (size))
258 #define ext2_find_next_zero_bit(addr, size, offset) \
259 find_next_zero_bit((addr), (size), (offset))
261 static __inline__ int ext2_set_bit(int nr, volatile void * addr)
265 volatile unsigned char *ADDR = (unsigned char *) addr;
268 mask = 1 << (nr & 0x07);
270 retval = (mask & *ADDR) != 0;
272 restore_flags(flags);
276 static __inline__ int ext2_clear_bit(int nr, volatile void * addr)
280 volatile unsigned char *ADDR = (unsigned char *) addr;
283 mask = 1 << (nr & 0x07);
285 retval = (mask & *ADDR) != 0;
287 restore_flags(flags);
291 static __inline__ int ext2_test_bit(int nr, const volatile void * addr)
294 const volatile unsigned char *ADDR = (const unsigned char *) addr;
297 mask = 1 << (nr & 0x07);
298 return ((mask & *ADDR) != 0);
301 #define ext2_find_first_zero_bit(addr, size) \
302 ext2_find_next_zero_bit((addr), (size), 0)
304 static __inline__ unsigned long ext2_find_next_zero_bit(void *addr, unsigned long size, unsigned long offset)
306 unsigned long *p = ((unsigned long *) addr) + (offset >> 5);
307 unsigned long result = offset & ~31UL;
315 /* We hold the little endian value in tmp, but then the
316 * shift is illegal. So we could keep a big endian value
319 * tmp = __swab32(*(p++));
320 * tmp |= ~0UL >> (32-offset);
322 * but this would decrease preformance, so we change the
326 tmp |= __swab32(~0UL >> (32-offset));
334 while(size & ~31UL) {
345 /* tmp is little endian, so we would have to swab the shift,
346 * see above. But then we have to swab tmp below for ffz, so
347 * we might as well do this here.
349 return result + ffz(__swab32(tmp) | (~0UL << size));
351 return result + ffz(__swab32(tmp));
355 /* Bitmap functions for the minix filesystem. */
356 #define minix_test_and_set_bit(nr,addr) test_and_set_bit(nr,addr)
357 #define minix_set_bit(nr,addr) set_bit(nr,addr)
358 #define minix_test_and_clear_bit(nr,addr) test_and_clear_bit(nr,addr)
359 #define minix_test_bit(nr,addr) test_bit(nr,addr)
360 #define minix_find_first_zero_bit(addr,size) find_first_zero_bit(addr,size)
362 #endif /* __KERNEL__ */
364 #endif /* __ASM_SH64_BITOPS_H */