Commit 0c2fd1bf authored by Akinobu Mita's avatar Akinobu Mita Committed by Linus Torvalds

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: default avatarAkinobu Mita <akinobu.mita@gmail.com>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent 29df8d8f
...@@ -214,7 +214,7 @@ static int scan_bitmap_block(struct reiserfs_transaction_handle *th, ...@@ -214,7 +214,7 @@ static int scan_bitmap_block(struct reiserfs_transaction_handle *th,
} }
/* otherwise we clear all bit were set ... */ /* otherwise we clear all bit were set ... */
while (--i >= *beg) while (--i >= *beg)
reiserfs_test_and_clear_le_bit reiserfs_clear_le_bit
(i, bh->b_data); (i, bh->b_data);
reiserfs_restore_prepared_buffer(s, bh); reiserfs_restore_prepared_buffer(s, bh);
*beg = org; *beg = org;
......
...@@ -136,7 +136,7 @@ int reiserfs_resize(struct super_block *s, unsigned long block_count_new) ...@@ -136,7 +136,7 @@ int reiserfs_resize(struct super_block *s, unsigned long block_count_new)
return -EIO; return -EIO;
} }
memset(bh->b_data, 0, sb_blocksize(sb)); memset(bh->b_data, 0, sb_blocksize(sb));
reiserfs_test_and_set_le_bit(0, bh->b_data); reiserfs_set_le_bit(0, bh->b_data);
reiserfs_cache_bitmap_metadata(s, bh, bitmap + i); reiserfs_cache_bitmap_metadata(s, bh, bitmap + i);
set_buffer_uptodate(bh); set_buffer_uptodate(bh);
...@@ -172,7 +172,7 @@ int reiserfs_resize(struct super_block *s, unsigned long block_count_new) ...@@ -172,7 +172,7 @@ int reiserfs_resize(struct super_block *s, unsigned long block_count_new)
reiserfs_prepare_for_journal(s, bh, 1); reiserfs_prepare_for_journal(s, bh, 1);
for (i = block_r; i < s->s_blocksize * 8; i++) for (i = block_r; i < s->s_blocksize * 8; i++)
reiserfs_test_and_clear_le_bit(i, bh->b_data); reiserfs_clear_le_bit(i, bh->b_data);
info->free_count += s->s_blocksize * 8 - block_r; info->free_count += s->s_blocksize * 8 - block_r;
journal_mark_dirty(&th, s, bh); journal_mark_dirty(&th, s, bh);
...@@ -190,7 +190,7 @@ int reiserfs_resize(struct super_block *s, unsigned long block_count_new) ...@@ -190,7 +190,7 @@ int reiserfs_resize(struct super_block *s, unsigned long block_count_new)
reiserfs_prepare_for_journal(s, bh, 1); reiserfs_prepare_for_journal(s, bh, 1);
for (i = block_r_new; i < s->s_blocksize * 8; i++) for (i = block_r_new; i < s->s_blocksize * 8; i++)
reiserfs_test_and_set_le_bit(i, bh->b_data); reiserfs_set_le_bit(i, bh->b_data);
journal_mark_dirty(&th, s, bh); journal_mark_dirty(&th, s, bh);
brelse(bh); brelse(bh);
......
...@@ -2332,7 +2332,9 @@ __u32 keyed_hash(const signed char *msg, int len); ...@@ -2332,7 +2332,9 @@ __u32 keyed_hash(const signed char *msg, int len);
__u32 yura_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); __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_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_and_clear_le_bit __test_and_clear_bit_le
#define reiserfs_test_le_bit test_bit_le #define reiserfs_test_le_bit test_bit_le
#define reiserfs_find_next_zero_le_bit find_next_zero_bit_le #define reiserfs_find_next_zero_le_bit find_next_zero_bit_le
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment