reiserfs: use proper little-endian bitops
Using __test_and_{set,clear}_bit_le() with ignoring its return value can be replaced with __{set,clear}_bit_le(). This introduces reiserfs_{set,clear}_le_bit for __{set,clear}_bit_le and does the above change with them. Signed-off-by: Akinobu Mita <akinobu.mita@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
committed by
Linus Torvalds
parent
29df8d8f87
commit
0c2fd1bfb1
@ -2332,7 +2332,9 @@ __u32 keyed_hash(const signed char *msg, int len);
|
||||
__u32 yura_hash(const signed char *msg, int len);
|
||||
__u32 r5_hash(const signed char *msg, int len);
|
||||
|
||||
#define reiserfs_set_le_bit __set_bit_le
|
||||
#define reiserfs_test_and_set_le_bit __test_and_set_bit_le
|
||||
#define reiserfs_clear_le_bit __clear_bit_le
|
||||
#define reiserfs_test_and_clear_le_bit __test_and_clear_bit_le
|
||||
#define reiserfs_test_le_bit test_bit_le
|
||||
#define reiserfs_find_next_zero_le_bit find_next_zero_bit_le
|
||||
|
Reference in New Issue
Block a user