Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1415884
| From | Martin Schwidefsky <schwidefsky@de.ibm.com> |
|---|---|
| Newsgroups | linux.kernel |
| Subject | [PATCH] bitmap: bitmap_equal memcmp optimization |
| Date | 2016-06-07 10:50 +0200 |
| Message-ID | <rHkRY-qE-19@gated-at.bofh.it> (permalink) |
| References | <rHkRY-qE-21@gated-at.bofh.it> |
| Organization | linux.* mail to news gateway |
The bitmap_equal function has optimized code for small bitmaps with less
than BITS_PER_LONG bits. For larger bitmaps the out-of-line function
__bitmap_equal is called.
For a constant number of bits divisible by BITS_PER_LONG the memcmp
function can be used. For s390 gcc knows how to optimize this function,
memcmp calls with up to 256 bytes / 2048 bits are translated into a
single instruction.
Reviewed-by: David Hildenbrand <dahi@linux.vnet.ibm.com>
Signed-off-by: Martin Schwidefsky <schwidefsky@de.ibm.com>
---
include/linux/bitmap.h | 4 ++++
1 file changed, 4 insertions(+)
diff --git a/include/linux/bitmap.h b/include/linux/bitmap.h
index e9b0b9a..27bfc0b 100644
--- a/include/linux/bitmap.h
+++ b/include/linux/bitmap.h
@@ -267,6 +267,10 @@ static inline int bitmap_equal(const unsigned long *src1,
{
if (small_const_nbits(nbits))
return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
+#ifdef CONFIG_S390
+ else if (__builtin_constant_p(nbits) && (nbits % BITS_PER_LONG) == 0)
+ return !memcmp(src1, src2, nbits / 8);
+#endif
else
return __bitmap_equal(src1, src2, nbits);
}
--
2.6.6
Back to linux.kernel | Previous | Next — Next in thread | Find similar | Unroll thread
[PATCH] bitmap: bitmap_equal memcmp optimization Martin Schwidefsky <schwidefsky@de.ibm.com> - 2016-06-07 10:50 +0200
Re: [PATCH] bitmap: bitmap_equal memcmp optimization Andrew Morton <akpm@linux-foundation.org> - 2016-06-08 22:50 +0200
Re: [PATCH] bitmap: bitmap_equal memcmp optimization Martin Schwidefsky <schwidefsky@de.ibm.com> - 2016-06-09 08:40 +0200
csiph-web