From fc1d4be6b015e2c34847df3994d80f3eec44cc42 Mon Sep 17 00:00:00 2001 From: David Howells Date: Tue, 4 Jan 2005 05:14:46 -0800 Subject: [PATCH] out-of-line implementation of find_next_bit() The attached patch provides an out-of-line implementation of find_next_bit() and rearranges linux/bitops.h to avoid a dependency loop between inline functions in there and in asm/bitops.h trying to include one another. Signed-Off-By: David Howells Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds --- include/linux/bitops.h | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) (limited to 'include/linux') diff --git a/include/linux/bitops.h b/include/linux/bitops.h index bcb0b1e1bff1..48f87b979ca9 100644 --- a/include/linux/bitops.h +++ b/include/linux/bitops.h @@ -1,7 +1,6 @@ #ifndef _LINUX_BITOPS_H #define _LINUX_BITOPS_H #include -#include /* * ffs: find first bit set. This is defined the same way as @@ -71,6 +70,12 @@ static __inline__ int generic_fls(int x) return r; } +/* + * Include this here because some architectures need generic_ffs/fls in + * scope + */ +#include + static __inline__ int get_bitmask_order(unsigned int count) { int order; -- cgit v1.2.3