diff options
| author | Rasmus Villemoes <linux@rasmusvillemoes.dk> | 2014-08-06 19:10:01 -0400 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2014-08-06 21:01:26 -0400 |
| commit | 6dfe9799c2a03d225316a3e959b0447f3f50303e (patch) | |
| tree | d6783674de2f71bba8664e9e582f5d598bc45647 /lib | |
| parent | 2f9305eb31097fdd3dc86daca65d8097d1fcf2ff (diff) | |
lib: bitmap: make nbits parameter of bitmap_intersects unsigned
The compiler can generate slightly smaller and simpler code when it
knows that "nbits" is non-negative. Since no-one passes a negative
bit-count, this shouldn't affect the semantics.
Signed-off-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/bitmap.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/bitmap.c b/lib/bitmap.c index 03207373cc5a..e85daa90b237 100644 --- a/lib/bitmap.c +++ b/lib/bitmap.c | |||
| @@ -230,9 +230,9 @@ int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1, | |||
| 230 | EXPORT_SYMBOL(__bitmap_andnot); | 230 | EXPORT_SYMBOL(__bitmap_andnot); |
| 231 | 231 | ||
| 232 | int __bitmap_intersects(const unsigned long *bitmap1, | 232 | int __bitmap_intersects(const unsigned long *bitmap1, |
| 233 | const unsigned long *bitmap2, int bits) | 233 | const unsigned long *bitmap2, unsigned int bits) |
| 234 | { | 234 | { |
| 235 | int k, lim = bits/BITS_PER_LONG; | 235 | unsigned int k, lim = bits/BITS_PER_LONG; |
| 236 | for (k = 0; k < lim; ++k) | 236 | for (k = 0; k < lim; ++k) |
| 237 | if (bitmap1[k] & bitmap2[k]) | 237 | if (bitmap1[k] & bitmap2[k]) |
| 238 | return 1; | 238 | return 1; |
