diff options
| author | Andy Shevchenko <[email protected]> | 2018-02-06 23:38:20 +0000 |
|---|---|---|
| committer | Linus Torvalds <[email protected]> | 2018-02-07 02:32:44 +0000 |
| commit | 334cfa48d38f5416c125a71a57f72d6cf634d797 (patch) | |
| tree | fee2a87aa695e98d29fe0043b58525101a860c2f /lib/find_bit_benchmark.c | |
| parent | lib/test_bitmap.c: clean up test_zero_fill_copy() test case and rename (diff) | |
| download | kernel-334cfa48d38f5416c125a71a57f72d6cf634d797.tar.gz kernel-334cfa48d38f5416c125a71a57f72d6cf634d797.zip | |
include/linux/bitmap.h: make bitmap_fill() and bitmap_zero() consistent
Behaviour of bitmap_fill() differs from bitmap_zero() in a way how bits
behind bitmap are handed. bitmap_zero() clears entire bitmap by unsigned
long boundary, while bitmap_fill() mimics bitmap_set().
Here we change bitmap_fill() behaviour to be consistent with bitmap_zero()
and add a note to documentation.
The change might reveal some bugs in the code where unused bits are
handled differently and in such cases bitmap_set() has to be used.
Link: http://lkml.kernel.org/r/[email protected]
Signed-off-by: Andy Shevchenko <[email protected]>
Suggested-by: Rasmus Villemoes <[email protected]>
Cc: Randy Dunlap <[email protected]>
Cc: Yury Norov <[email protected]>
Signed-off-by: Andrew Morton <[email protected]>
Signed-off-by: Linus Torvalds <[email protected]>
Diffstat (limited to 'lib/find_bit_benchmark.c')
0 files changed, 0 insertions, 0 deletions