URL
https://opencores.org/ocsvn/or1k/or1k/trunk
Subversion Repositories or1k
[/] [or1k/] [trunk/] [linux/] [linux-2.4/] [include/] [asm-sh64/] [bitops.h] - Rev 1276
Go to most recent revision | Compare with Previous | Blame | View Log
#ifndef __ASM_SH64_BITOPS_H #define __ASM_SH64_BITOPS_H #ifdef __KERNEL__ #include <asm/system.h> /* For __swab32 */ #include <asm/byteorder.h> static __inline__ void set_bit(int nr, volatile void * addr) { int mask; volatile unsigned int *a = addr; unsigned long flags; a += nr >> 5; mask = 1 << (nr & 0x1f); save_and_cli(flags); *a |= mask; restore_flags(flags); } static __inline__ void __set_bit(int nr, volatile void * addr) { int mask; volatile unsigned int *a = addr; a += nr >> 5; mask = 1 << (nr & 0x1f); *a |= mask; } /* * clear_bit() doesn't provide any barrier for the compiler. */ #define smp_mb__before_clear_bit() barrier() #define smp_mb__after_clear_bit() barrier() static __inline__ void clear_bit(int nr, volatile void * addr) { int mask; volatile unsigned int *a = addr; unsigned long flags; a += nr >> 5; mask = 1 << (nr & 0x1f); save_and_cli(flags); *a &= ~mask; restore_flags(flags); } static __inline__ void __clear_bit(int nr, volatile void * addr) { int mask; volatile unsigned int *a = addr; a += nr >> 5; mask = 1 << (nr & 0x1f); *a &= ~mask; } static __inline__ void change_bit(int nr, volatile void * addr) { int mask; volatile unsigned int *a = addr; unsigned long flags; a += nr >> 5; mask = 1 << (nr & 0x1f); save_and_cli(flags); *a ^= mask; restore_flags(flags); } static __inline__ void __change_bit(int nr, volatile void * addr) { int mask; volatile unsigned int *a = addr; a += nr >> 5; mask = 1 << (nr & 0x1f); *a ^= mask; } static __inline__ int test_and_set_bit(int nr, volatile void * addr) { int mask, retval; volatile unsigned int *a = addr; unsigned long flags; a += nr >> 5; mask = 1 << (nr & 0x1f); save_and_cli(flags); retval = (mask & *a) != 0; *a |= mask; restore_flags(flags); return retval; } static __inline__ int __test_and_set_bit(int nr, volatile void * addr) { int mask, retval; volatile unsigned int *a = addr; a += nr >> 5; mask = 1 << (nr & 0x1f); retval = (mask & *a) != 0; *a |= mask; return retval; } static __inline__ int test_and_clear_bit(int nr, volatile void * addr) { int mask, retval; volatile unsigned int *a = addr; unsigned long flags; a += nr >> 5; mask = 1 << (nr & 0x1f); save_and_cli(flags); retval = (mask & *a) != 0; *a &= ~mask; restore_flags(flags); return retval; } static __inline__ int __test_and_clear_bit(int nr, volatile void * addr) { int mask, retval; volatile unsigned int *a = addr; a += nr >> 5; mask = 1 << (nr & 0x1f); retval = (mask & *a) != 0; *a &= ~mask; return retval; } static __inline__ int test_and_change_bit(int nr, volatile void * addr) { int mask, retval; volatile unsigned int *a = addr; unsigned long flags; a += nr >> 5; mask = 1 << (nr & 0x1f); save_and_cli(flags); retval = (mask & *a) != 0; *a ^= mask; restore_flags(flags); return retval; } static __inline__ int __test_and_change_bit(int nr, volatile void * addr) { int mask, retval; volatile unsigned int *a = addr; a += nr >> 5; mask = 1 << (nr & 0x1f); retval = (mask & *a) != 0; *a ^= mask; return retval; } static __inline__ int test_bit(int nr, const volatile void *addr) { return 1UL & (((const volatile unsigned int *) addr)[nr >> 5] >> (nr & 31)); } static __inline__ unsigned long ffz(unsigned long word) { unsigned long result, __d2, __d3; __asm__("gettr " __t0 ", %2\n\t" "_pta 32, " __t0 "\n\t" "andi %1, 1, %3\n\t" "beq %3, r63, " __t0 "\n\t" "_pta 4, " __t0 "\n" "0:\n\t" "shlri.l %1, 1, %1\n\t" "addi %0, 1, %0\n\t" "andi %1, 1, %3\n\t" "beqi %3, 1, " __t0 "\n" "1:\n\t" "ptabs %2, " __t0 "\n\t" : "=r" (result), "=r" (word), "=r" (__d2), "=r" (__d3) : "0" (0L), "1" (word)); return result; } static __inline__ int find_next_zero_bit(void *addr, int size, int offset) { unsigned long *p = ((unsigned long *) addr) + (offset >> 5); unsigned long result = offset & ~31UL; unsigned long tmp; if (offset >= size) return size; size -= result; offset &= 31UL; if (offset) { tmp = *(p++); tmp |= ~0UL >> (32-offset); if (size < 32) goto found_first; if (~tmp) goto found_middle; size -= 32; result += 32; } while (size & ~31UL) { if (~(tmp = *(p++))) goto found_middle; result += 32; size -= 32; } if (!size) return result; tmp = *p; found_first: tmp |= ~0UL << size; found_middle: return result + ffz(tmp); } #define find_first_zero_bit(addr, size) \ find_next_zero_bit((addr), (size), 0) /* * ffs: find first bit set. This is defined the same way as * the libc and compiler builtin ffs routines, therefore * differs in spirit from the above ffz (man ffs). */ #define ffs(x) generic_ffs(x) /* * hweightN: returns the hamming weight (i.e. the number * of bits set) of a N-bit word */ #define hweight32(x) generic_hweight32(x) #define hweight16(x) generic_hweight16(x) #define hweight8(x) generic_hweight8(x) #ifdef __LITTLE_ENDIAN__ #define ext2_set_bit(nr, addr) test_and_set_bit((nr), (addr)) #define ext2_clear_bit(nr, addr) test_and_clear_bit((nr), (addr)) #define ext2_test_bit(nr, addr) test_bit((nr), (addr)) #define ext2_find_first_zero_bit(addr, size) find_first_zero_bit((addr), (size)) #define ext2_find_next_zero_bit(addr, size, offset) \ find_next_zero_bit((addr), (size), (offset)) #else static __inline__ int ext2_set_bit(int nr, volatile void * addr) { int mask, retval; unsigned long flags; volatile unsigned char *ADDR = (unsigned char *) addr; ADDR += nr >> 3; mask = 1 << (nr & 0x07); save_and_cli(flags); retval = (mask & *ADDR) != 0; *ADDR |= mask; restore_flags(flags); return retval; } static __inline__ int ext2_clear_bit(int nr, volatile void * addr) { int mask, retval; unsigned long flags; volatile unsigned char *ADDR = (unsigned char *) addr; ADDR += nr >> 3; mask = 1 << (nr & 0x07); save_and_cli(flags); retval = (mask & *ADDR) != 0; *ADDR &= ~mask; restore_flags(flags); return retval; } static __inline__ int ext2_test_bit(int nr, const volatile void * addr) { int mask; const volatile unsigned char *ADDR = (const unsigned char *) addr; ADDR += nr >> 3; mask = 1 << (nr & 0x07); return ((mask & *ADDR) != 0); } #define ext2_find_first_zero_bit(addr, size) \ ext2_find_next_zero_bit((addr), (size), 0) static __inline__ unsigned long ext2_find_next_zero_bit(void *addr, unsigned long size, unsigned long offset) { unsigned long *p = ((unsigned long *) addr) + (offset >> 5); unsigned long result = offset & ~31UL; unsigned long tmp; if (offset >= size) return size; size -= result; offset &= 31UL; if(offset) { /* We hold the little endian value in tmp, but then the * shift is illegal. So we could keep a big endian value * in tmp, like this: * * tmp = __swab32(*(p++)); * tmp |= ~0UL >> (32-offset); * * but this would decrease preformance, so we change the * shift: */ tmp = *(p++); tmp |= __swab32(~0UL >> (32-offset)); if(size < 32) goto found_first; if(~tmp) goto found_middle; size -= 32; result += 32; } while(size & ~31UL) { if(~(tmp = *(p++))) goto found_middle; result += 32; size -= 32; } if(!size) return result; tmp = *p; found_first: /* tmp is little endian, so we would have to swab the shift, * see above. But then we have to swab tmp below for ffz, so * we might as well do this here. */ return result + ffz(__swab32(tmp) | (~0UL << size)); found_middle: return result + ffz(__swab32(tmp)); } #endif /* Bitmap functions for the minix filesystem. */ #define minix_test_and_set_bit(nr,addr) test_and_set_bit(nr,addr) #define minix_set_bit(nr,addr) set_bit(nr,addr) #define minix_test_and_clear_bit(nr,addr) test_and_clear_bit(nr,addr) #define minix_test_bit(nr,addr) test_bit(nr,addr) #define minix_find_first_zero_bit(addr,size) find_first_zero_bit(addr,size) #endif /* __KERNEL__ */ #endif /* __ASM_SH64_BITOPS_H */
Go to most recent revision | Compare with Previous | Blame | View Log