mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-09-27 12:57:53 +00:00
lib: bitmap: make nbits parameter of bitmap_equal 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>
This commit is contained in:
parent
8397927c80
commit
5e06806931
2 changed files with 3 additions and 3 deletions
|
@ -91,7 +91,7 @@
|
||||||
extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits);
|
extern int __bitmap_empty(const unsigned long *bitmap, unsigned int nbits);
|
||||||
extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits);
|
extern int __bitmap_full(const unsigned long *bitmap, unsigned int nbits);
|
||||||
extern int __bitmap_equal(const unsigned long *bitmap1,
|
extern int __bitmap_equal(const unsigned long *bitmap1,
|
||||||
const unsigned long *bitmap2, int bits);
|
const unsigned long *bitmap2, unsigned int nbits);
|
||||||
extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
|
extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
|
||||||
int bits);
|
int bits);
|
||||||
extern void __bitmap_shift_right(unsigned long *dst,
|
extern void __bitmap_shift_right(unsigned long *dst,
|
||||||
|
|
|
@ -71,9 +71,9 @@ int __bitmap_full(const unsigned long *bitmap, unsigned int bits)
|
||||||
EXPORT_SYMBOL(__bitmap_full);
|
EXPORT_SYMBOL(__bitmap_full);
|
||||||
|
|
||||||
int __bitmap_equal(const unsigned long *bitmap1,
|
int __bitmap_equal(const unsigned long *bitmap1,
|
||||||
const unsigned long *bitmap2, int bits)
|
const unsigned long *bitmap2, unsigned int bits)
|
||||||
{
|
{
|
||||||
int k, lim = bits/BITS_PER_LONG;
|
unsigned int k, lim = bits/BITS_PER_LONG;
|
||||||
for (k = 0; k < lim; ++k)
|
for (k = 0; k < lim; ++k)
|
||||||
if (bitmap1[k] != bitmap2[k])
|
if (bitmap1[k] != bitmap2[k])
|
||||||
return 0;
|
return 0;
|
||||||
|
|
Loading…
Reference in a new issue