diff options
author | Matthew Wilcox <mawilcox@microsoft.com> | 2016-12-16 11:52:43 -0500 |
---|---|---|
committer | Matthew Wilcox <mawilcox@microsoft.com> | 2017-01-27 21:29:39 -0500 |
commit | c68a2aab3300df4106f368568bd7361d6f465993 (patch) | |
tree | deed685b65c643322a7213b16b1953b7e3b3acf9 /tools/testing/radix-tree/linux/bitops/find.h | |
parent | radix tree: constify some pointers (diff) | |
download | linux-dev-c68a2aab3300df4106f368568bd7361d6f465993.tar.xz linux-dev-c68a2aab3300df4106f368568bd7361d6f465993.zip |
radix tree test suite: Remove duplicate bitops code
By adding __set_bit and __clear_bit to the tools include directory, we
can share the bitops code. This reveals an include loop between kernel.h,
log2.h, bitmap.h and bitops.h. Break it the same way as the kernel does;
by moving the kernel.h include from bitops.h to bitmap.h.
Signed-off-by: Matthew Wilcox <mawilcox@microsoft.com>
Diffstat (limited to 'tools/testing/radix-tree/linux/bitops/find.h')
-rw-r--r-- | tools/testing/radix-tree/linux/bitops/find.h | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/tools/testing/radix-tree/linux/bitops/find.h b/tools/testing/radix-tree/linux/bitops/find.h deleted file mode 100644 index 72a51e5a12ef..000000000000 --- a/tools/testing/radix-tree/linux/bitops/find.h +++ /dev/null @@ -1,13 +0,0 @@ -#ifndef _ASM_GENERIC_BITOPS_FIND_H_ -#define _ASM_GENERIC_BITOPS_FIND_H_ - -extern unsigned long find_next_bit(const unsigned long *addr, unsigned long - size, unsigned long offset); - -extern unsigned long find_next_zero_bit(const unsigned long *addr, unsigned - long size, unsigned long offset); - -#define find_first_bit(addr, size) find_next_bit((addr), (size), 0) -#define find_first_zero_bit(addr, size) find_next_zero_bit((addr), (size), 0) - -#endif /*_ASM_GENERIC_BITOPS_FIND_H_ */ |