mirror of
https://github.com/Fishwaldo/Star64_linux.git
synced 2025-04-16 19:34:03 +00:00
1366c37ed8
This code is mostly from Andrew Morton and Nick Piggin; tarball downloaded from http://ozlabs.org/~akpm/rtth.tar.gz with sha1sum 0ce679db9ec047296b5d1ff7a1dfaa03a7bef1bd Some small modifications were necessary to the test harness to fix the build with the current Linux source code. I also made minor modifications to automatically test the radix-tree.c and radix-tree.h files that are in the current source tree, as opposed to a copied and slightly modified version. I am sure more could be done to tidy up the harness, as well as adding more tests. [koct9i@gmail.com: fix compilation] Signed-off-by: Matthew Wilcox <willy@linux.intel.com> Cc: Shuah Khan <shuahkh@osg.samsung.com> Cc: Johannes Weiner <hannes@cmpxchg.org> Cc: Matthew Wilcox <willy@linux.intel.com> Cc: "Kirill A. Shutemov" <kirill.shutemov@linux.intel.com> Cc: Ross Zwisler <ross.zwisler@linux.intel.com> Cc: Hugh Dickins <hughd@google.com> Signed-off-by: Konstantin Khlebnikov <koct9i@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
53 lines
1.8 KiB
C
53 lines
1.8 KiB
C
#ifndef _ASM_GENERIC_BITOPS_LE_H_
|
|
#define _ASM_GENERIC_BITOPS_LE_H_
|
|
|
|
#include <asm/types.h>
|
|
#include <asm/byteorder.h>
|
|
|
|
#define BITOP_WORD(nr) ((nr) / BITS_PER_LONG)
|
|
#define BITOP_LE_SWIZZLE ((BITS_PER_LONG-1) & ~0x7)
|
|
|
|
#if defined(__LITTLE_ENDIAN)
|
|
|
|
#define generic_test_le_bit(nr, addr) test_bit(nr, addr)
|
|
#define generic___set_le_bit(nr, addr) __set_bit(nr, addr)
|
|
#define generic___clear_le_bit(nr, addr) __clear_bit(nr, addr)
|
|
|
|
#define generic_test_and_set_le_bit(nr, addr) test_and_set_bit(nr, addr)
|
|
#define generic_test_and_clear_le_bit(nr, addr) test_and_clear_bit(nr, addr)
|
|
|
|
#define generic___test_and_set_le_bit(nr, addr) __test_and_set_bit(nr, addr)
|
|
#define generic___test_and_clear_le_bit(nr, addr) __test_and_clear_bit(nr, addr)
|
|
|
|
#define generic_find_next_zero_le_bit(addr, size, offset) find_next_zero_bit(addr, size, offset)
|
|
|
|
#elif defined(__BIG_ENDIAN)
|
|
|
|
#define generic_test_le_bit(nr, addr) \
|
|
test_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
#define generic___set_le_bit(nr, addr) \
|
|
__set_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
#define generic___clear_le_bit(nr, addr) \
|
|
__clear_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
|
|
#define generic_test_and_set_le_bit(nr, addr) \
|
|
test_and_set_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
#define generic_test_and_clear_le_bit(nr, addr) \
|
|
test_and_clear_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
|
|
#define generic___test_and_set_le_bit(nr, addr) \
|
|
__test_and_set_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
#define generic___test_and_clear_le_bit(nr, addr) \
|
|
__test_and_clear_bit((nr) ^ BITOP_LE_SWIZZLE, (addr))
|
|
|
|
extern unsigned long generic_find_next_zero_le_bit(const unsigned long *addr,
|
|
unsigned long size, unsigned long offset);
|
|
|
|
#else
|
|
#error "Please fix <asm/byteorder.h>"
|
|
#endif
|
|
|
|
#define generic_find_first_zero_le_bit(addr, size) \
|
|
generic_find_next_zero_le_bit((addr), (size), 0)
|
|
|
|
#endif /* _ASM_GENERIC_BITOPS_LE_H_ */
|