aboutsummaryrefslogtreecommitdiffstats
path: root/include
diff options
context:
space:
mode:
authorAlexander van Heukelum <heukelum@mailshack.com>2008-04-01 05:46:19 -0400
committerIngo Molnar <mingo@elte.hu>2008-04-26 13:21:16 -0400
commit77b9bd9c49442407804c37bcc82021a35277f83c (patch)
tree251900d95c6c9c5371542d5dda7d89cb31cd0801 /include
parentd57594c203b1e7b54373080a797f0cbfa4aade68 (diff)
x86: generic versions of find_first_(zero_)bit, convert i386
Generic versions of __find_first_bit and __find_first_zero_bit are introduced as simplified versions of __find_next_bit and __find_next_zero_bit. Their compilation and use are guarded by a new config variable GENERIC_FIND_FIRST_BIT. The generic versions of find_first_bit and find_first_zero_bit are implemented in terms of the newly introduced __find_first_bit and __find_first_zero_bit. This patch does not remove the i386-specific implementation, but it does switch i386 to use the generic functions by setting GENERIC_FIND_FIRST_BIT=y for X86_32. Signed-off-by: Alexander van Heukelum <heukelum@fastmail.fm> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'include')
-rw-r--r--include/asm-x86/bitops_32.h2
-rw-r--r--include/linux/bitops.h34
2 files changed, 36 insertions, 0 deletions
diff --git a/include/asm-x86/bitops_32.h b/include/asm-x86/bitops_32.h
index 3ed64b21b765..ba2c0defafa8 100644
--- a/include/asm-x86/bitops_32.h
+++ b/include/asm-x86/bitops_32.h
@@ -5,6 +5,7 @@
5 * Copyright 1992, Linus Torvalds. 5 * Copyright 1992, Linus Torvalds.
6 */ 6 */
7 7
8#ifndef CONFIG_GENERIC_FIND_FIRST_BIT
8/** 9/**
9 * find_first_zero_bit - find the first zero bit in a memory region 10 * find_first_zero_bit - find the first zero bit in a memory region
10 * @addr: The address to start the search at 11 * @addr: The address to start the search at
@@ -59,6 +60,7 @@ static inline unsigned find_first_bit(const unsigned long *addr, unsigned size)
59 } 60 }
60 return x; 61 return x;
61} 62}
63#endif
62 64
63#ifdef __KERNEL__ 65#ifdef __KERNEL__
64 66
diff --git a/include/linux/bitops.h b/include/linux/bitops.h
index 3865f2c93bd8..355d67ba3bdc 100644
--- a/include/linux/bitops.h
+++ b/include/linux/bitops.h
@@ -113,6 +113,40 @@ static inline unsigned fls_long(unsigned long l)
113} 113}
114 114
115#ifdef __KERNEL__ 115#ifdef __KERNEL__
116#ifdef CONFIG_GENERIC_FIND_FIRST_BIT
117extern unsigned long __find_first_bit(const unsigned long *addr,
118 unsigned long size);
119
120/**
121 * find_first_bit - find the first set bit in a memory region
122 * @addr: The address to start the search at
123 * @size: The maximum size to search
124 *
125 * Returns the bit number of the first set bit.
126 */
127static __always_inline unsigned long
128find_first_bit(const unsigned long *addr, unsigned long size)
129{
130 return __find_first_bit(addr, size);
131}
132
133extern unsigned long __find_first_zero_bit(const unsigned long *addr,
134 unsigned long size);
135
136/**
137 * find_first_zero_bit - find the first cleared bit in a memory region
138 * @addr: The address to start the search at
139 * @size: The maximum size to search
140 *
141 * Returns the bit number of the first cleared bit.
142 */
143static __always_inline unsigned long
144find_first_zero_bit(const unsigned long *addr, unsigned long size)
145{
146 return __find_first_zero_bit(addr, size);
147}
148#endif /* CONFIG_GENERIC_FIND_FIRST_BIT */
149
116#ifdef CONFIG_GENERIC_FIND_NEXT_BIT 150#ifdef CONFIG_GENERIC_FIND_NEXT_BIT
117extern unsigned long __find_next_bit(const unsigned long *addr, 151extern unsigned long __find_next_bit(const unsigned long *addr,
118 unsigned long size, unsigned long offset); 152 unsigned long size, unsigned long offset);