Introduce little-endian bit operations by renaming native ext2 bit operations. The ext2 bit operations are kept as wrapper macros using little-endian bit operations to maintain bisectability until the conversions are finished. Signed-off-by: Akinobu Mita <akinobu.mita@xxxxxxxxx> Acked-by: Russell King <rmk+kernel@xxxxxxxxxxxxxxxx> Cc: linux-arm-kernel@xxxxxxxxxxxxxxxxxxx --- No change from previous submission arch/arm/include/asm/bitops.h | 46 +++++++++++++++++++++++++++++----------- 1 files changed, 33 insertions(+), 13 deletions(-) diff --git a/arch/arm/include/asm/bitops.h b/arch/arm/include/asm/bitops.h index 338ff19..29adaca 100644 --- a/arch/arm/include/asm/bitops.h +++ b/arch/arm/include/asm/bitops.h @@ -303,41 +303,61 @@ static inline int fls(int x) #include <asm-generic/bitops/hweight.h> #include <asm-generic/bitops/lock.h> +#define __set_le_bit(nr, p) \ + __set_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define __clear_le_bit(nr, p) \ + __clear_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define __test_and_set_le_bit(nr, p) \ + __test_and_set_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define test_and_set_le_bit(nr, p) \ + test_and_set_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define __test_and_clear_le_bit(nr, p) \ + __test_and_clear_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define test_and_clear_le_bit(nr, p) \ + test_and_clear_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define test_le_bit(nr, p) \ + test_bit(WORD_BITOFF_TO_LE(nr), (p)) +#define find_first_zero_le_bit(p, sz) \ + _find_first_zero_bit_le(p, sz) +#define find_next_zero_le_bit(p, sz, off) \ + _find_next_zero_bit_le(p, sz, off) +#define find_next_le_bit(p, sz, off) \ + _find_next_bit_le(p, sz, off) /* * Ext2 is defined to use little-endian byte ordering. * These do not need to be atomic. */ #define ext2_set_bit(nr,p) \ - __test_and_set_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + __test_and_set_le_bit(nr, (unsigned long *)(p)) #define ext2_set_bit_atomic(lock,nr,p) \ - test_and_set_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + test_and_set_le_bit(nr, (unsigned long *)(p)) #define ext2_clear_bit(nr,p) \ - __test_and_clear_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + __test_and_clear_le_bit(nr, (unsigned long *)(p)) #define ext2_clear_bit_atomic(lock,nr,p) \ - test_and_clear_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + test_and_clear_le_bit(nr, (unsigned long *)(p)) #define ext2_test_bit(nr,p) \ - test_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + test_le_bit(nr, (unsigned long *)(p)) #define ext2_find_first_zero_bit(p,sz) \ - _find_first_zero_bit_le(p,sz) + find_first_zero_le_bit((unsigned long *)(p), sz) #define ext2_find_next_zero_bit(p,sz,off) \ - _find_next_zero_bit_le(p,sz,off) + find_next_zero_le_bit((unsigned long *)(p), sz, off) #define ext2_find_next_bit(p, sz, off) \ - _find_next_bit_le(p, sz, off) + find_next_le_bit((unsigned long *)(p), sz, off) /* * Minix is defined to use little-endian byte ordering. * These do not need to be atomic. */ #define minix_set_bit(nr,p) \ - __set_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + __set_le_bit(nr, (unsigned long *)(p)) #define minix_test_bit(nr,p) \ - test_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + test_le_bit(nr, (unsigned long *)(p)) #define minix_test_and_set_bit(nr,p) \ - __test_and_set_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + __test_and_set_le_bit(nr, (unsigned long *)(p)) #define minix_test_and_clear_bit(nr,p) \ - __test_and_clear_bit(WORD_BITOFF_TO_LE(nr), (unsigned long *)(p)) + __test_and_clear_le_bit(nr, (unsigned long *)(p)) #define minix_find_first_zero_bit(p,sz) \ - _find_first_zero_bit_le(p,sz) + find_first_zero_le_bit((unsigned long *)(p), sz) #endif /* __KERNEL__ */ -- 1.7.3.2 -- To unsubscribe from this list: send the line "unsubscribe linux-arch" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
