aboutsummaryrefslogtreecommitdiffstats
path: root/include
diff options
context:
space:
mode:
authorAlexander van Heukelum <heukelum@mailshack.com>2008-04-01 11:42:21 -0400
committerIngo Molnar <mingo@elte.hu>2008-04-26 13:21:17 -0400
commit3a48305028aa38afba93fc05066c71a6ee668ad8 (patch)
tree5fd5b9bd9b4daa7cafb87c2706693fe57bc8af51 /include
parent2aba6925fdb96428d1129a61b1233597a03a387b (diff)
x86: optimize find_first_bit for small bitmaps
Avoid a call to find_first_bit if the bitmap size is know at compile time and small enough to fit in a single long integer. Modeled after an optimization in the original x86_64-specific code. 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/linux/bitops.h29
1 files changed, 29 insertions, 0 deletions
diff --git a/include/linux/bitops.h b/include/linux/bitops.h
index 355d67ba3bdc..48bde600a2db 100644
--- a/include/linux/bitops.h
+++ b/include/linux/bitops.h
@@ -127,6 +127,20 @@ extern unsigned long __find_first_bit(const unsigned long *addr,
127static __always_inline unsigned long 127static __always_inline unsigned long
128find_first_bit(const unsigned long *addr, unsigned long size) 128find_first_bit(const unsigned long *addr, unsigned long size)
129{ 129{
130 /* Avoid a function call if the bitmap size is a constant */
131 /* and not bigger than BITS_PER_LONG. */
132
133 /* insert a sentinel so that __ffs returns size if there */
134 /* are no set bits in the bitmap */
135 if (__builtin_constant_p(size) && (size < BITS_PER_LONG))
136 return __ffs((*addr) | (1ul << size));
137
138 /* the result of __ffs(0) is undefined, so it needs to be */
139 /* handled separately */
140 if (__builtin_constant_p(size) && (size == BITS_PER_LONG))
141 return ((*addr) == 0) ? BITS_PER_LONG : __ffs(*addr);
142
143 /* size is not constant or too big */
130 return __find_first_bit(addr, size); 144 return __find_first_bit(addr, size);
131} 145}
132 146
@@ -143,6 +157,21 @@ extern unsigned long __find_first_zero_bit(const unsigned long *addr,
143static __always_inline unsigned long 157static __always_inline unsigned long
144find_first_zero_bit(const unsigned long *addr, unsigned long size) 158find_first_zero_bit(const unsigned long *addr, unsigned long size)
145{ 159{
160 /* Avoid a function call if the bitmap size is a constant */
161 /* and not bigger than BITS_PER_LONG. */
162
163 /* insert a sentinel so that __ffs returns size if there */
164 /* are no set bits in the bitmap */
165 if (__builtin_constant_p(size) && (size < BITS_PER_LONG)) {
166 return __ffs(~(*addr) | (1ul << size));
167 }
168
169 /* the result of __ffs(0) is undefined, so it needs to be */
170 /* handled separately */
171 if (__builtin_constant_p(size) && (size == BITS_PER_LONG))
172 return (~(*addr) == 0) ? BITS_PER_LONG : __ffs(~(*addr));
173
174 /* size is not constant or too big */
146 return __find_first_zero_bit(addr, size); 175 return __find_first_zero_bit(addr, size);
147} 176}
148#endif /* CONFIG_GENERIC_FIND_FIRST_BIT */ 177#endif /* CONFIG_GENERIC_FIND_FIRST_BIT */