diff options
author | Theodore Ts'o <tytso@mit.edu> | 2012-02-20 17:54:06 -0500 |
---|---|---|
committer | Theodore Ts'o <tytso@mit.edu> | 2012-02-20 17:54:06 -0500 |
commit | c5e8f3f3bc4b5e4a73b075ea7128f48c3f215168 (patch) | |
tree | 4470673bd261fe07189ff825957a3d1a14bee0a4 /fs/ext4/mballoc.c | |
parent | a0cc910f15027fbd731e78f3437cc076eebc22e9 (diff) |
ext4: remove EXT4_MB_{BITMAP,BUDDY} macros
The EXT4_MB_BITMAP and EXT4_MB_BUDDY macros obfuscate more than they
provide any abstraction. So remove them.
Signed-off-by: "Theodore Ts'o" <tytso@mit.edu>
Diffstat (limited to 'fs/ext4/mballoc.c')
-rw-r--r-- | fs/ext4/mballoc.c | 32 |
1 files changed, 16 insertions, 16 deletions
diff --git a/fs/ext4/mballoc.c b/fs/ext4/mballoc.c index 8e01214a4421..7e6fab9e889e 100644 --- a/fs/ext4/mballoc.c +++ b/fs/ext4/mballoc.c | |||
@@ -427,7 +427,7 @@ static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max) | |||
427 | { | 427 | { |
428 | char *bb; | 428 | char *bb; |
429 | 429 | ||
430 | BUG_ON(EXT4_MB_BITMAP(e4b) == EXT4_MB_BUDDY(e4b)); | 430 | BUG_ON(e4b->bd_bitmap == e4b->bd_buddy); |
431 | BUG_ON(max == NULL); | 431 | BUG_ON(max == NULL); |
432 | 432 | ||
433 | if (order > e4b->bd_blkbits + 1) { | 433 | if (order > e4b->bd_blkbits + 1) { |
@@ -438,10 +438,10 @@ static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max) | |||
438 | /* at order 0 we see each particular block */ | 438 | /* at order 0 we see each particular block */ |
439 | if (order == 0) { | 439 | if (order == 0) { |
440 | *max = 1 << (e4b->bd_blkbits + 3); | 440 | *max = 1 << (e4b->bd_blkbits + 3); |
441 | return EXT4_MB_BITMAP(e4b); | 441 | return e4b->bd_bitmap; |
442 | } | 442 | } |
443 | 443 | ||
444 | bb = EXT4_MB_BUDDY(e4b) + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order]; | 444 | bb = e4b->bd_buddy + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order]; |
445 | *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order]; | 445 | *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order]; |
446 | 446 | ||
447 | return bb; | 447 | return bb; |
@@ -590,7 +590,7 @@ static int __mb_check_buddy(struct ext4_buddy *e4b, char *file, | |||
590 | for (j = 0; j < (1 << order); j++) { | 590 | for (j = 0; j < (1 << order); j++) { |
591 | k = (i * (1 << order)) + j; | 591 | k = (i * (1 << order)) + j; |
592 | MB_CHECK_ASSERT( | 592 | MB_CHECK_ASSERT( |
593 | !mb_test_bit(k, EXT4_MB_BITMAP(e4b))); | 593 | !mb_test_bit(k, e4b->bd_bitmap)); |
594 | } | 594 | } |
595 | count++; | 595 | count++; |
596 | } | 596 | } |
@@ -1203,10 +1203,10 @@ static int mb_find_order_for_block(struct ext4_buddy *e4b, int block) | |||
1203 | int order = 1; | 1203 | int order = 1; |
1204 | void *bb; | 1204 | void *bb; |
1205 | 1205 | ||
1206 | BUG_ON(EXT4_MB_BITMAP(e4b) == EXT4_MB_BUDDY(e4b)); | 1206 | BUG_ON(e4b->bd_bitmap == e4b->bd_buddy); |
1207 | BUG_ON(block >= (1 << (e4b->bd_blkbits + 3))); | 1207 | BUG_ON(block >= (1 << (e4b->bd_blkbits + 3))); |
1208 | 1208 | ||
1209 | bb = EXT4_MB_BUDDY(e4b); | 1209 | bb = e4b->bd_buddy; |
1210 | while (order <= e4b->bd_blkbits + 1) { | 1210 | while (order <= e4b->bd_blkbits + 1) { |
1211 | block = block >> 1; | 1211 | block = block >> 1; |
1212 | if (!mb_test_bit(block, bb)) { | 1212 | if (!mb_test_bit(block, bb)) { |
@@ -1276,9 +1276,9 @@ static void mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b, | |||
1276 | 1276 | ||
1277 | /* let's maintain fragments counter */ | 1277 | /* let's maintain fragments counter */ |
1278 | if (first != 0) | 1278 | if (first != 0) |
1279 | block = !mb_test_bit(first - 1, EXT4_MB_BITMAP(e4b)); | 1279 | block = !mb_test_bit(first - 1, e4b->bd_bitmap); |
1280 | if (first + count < EXT4_SB(sb)->s_mb_maxs[0]) | 1280 | if (first + count < EXT4_SB(sb)->s_mb_maxs[0]) |
1281 | max = !mb_test_bit(first + count, EXT4_MB_BITMAP(e4b)); | 1281 | max = !mb_test_bit(first + count, e4b->bd_bitmap); |
1282 | if (block && max) | 1282 | if (block && max) |
1283 | e4b->bd_info->bb_fragments--; | 1283 | e4b->bd_info->bb_fragments--; |
1284 | else if (!block && !max) | 1284 | else if (!block && !max) |
@@ -1289,7 +1289,7 @@ static void mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b, | |||
1289 | block = first++; | 1289 | block = first++; |
1290 | order = 0; | 1290 | order = 0; |
1291 | 1291 | ||
1292 | if (!mb_test_bit(block, EXT4_MB_BITMAP(e4b))) { | 1292 | if (!mb_test_bit(block, e4b->bd_bitmap)) { |
1293 | ext4_fsblk_t blocknr; | 1293 | ext4_fsblk_t blocknr; |
1294 | 1294 | ||
1295 | blocknr = ext4_group_first_block_no(sb, e4b->bd_group); | 1295 | blocknr = ext4_group_first_block_no(sb, e4b->bd_group); |
@@ -1300,7 +1300,7 @@ static void mb_free_blocks(struct inode *inode, struct ext4_buddy *e4b, | |||
1300 | "freeing already freed block " | 1300 | "freeing already freed block " |
1301 | "(bit %u)", block); | 1301 | "(bit %u)", block); |
1302 | } | 1302 | } |
1303 | mb_clear_bit(block, EXT4_MB_BITMAP(e4b)); | 1303 | mb_clear_bit(block, e4b->bd_bitmap); |
1304 | e4b->bd_info->bb_counters[order]++; | 1304 | e4b->bd_info->bb_counters[order]++; |
1305 | 1305 | ||
1306 | /* start of the buddy */ | 1306 | /* start of the buddy */ |
@@ -1382,7 +1382,7 @@ static int mb_find_extent(struct ext4_buddy *e4b, int order, int block, | |||
1382 | break; | 1382 | break; |
1383 | 1383 | ||
1384 | next = (block + 1) * (1 << order); | 1384 | next = (block + 1) * (1 << order); |
1385 | if (mb_test_bit(next, EXT4_MB_BITMAP(e4b))) | 1385 | if (mb_test_bit(next, e4b->bd_bitmap)) |
1386 | break; | 1386 | break; |
1387 | 1387 | ||
1388 | order = mb_find_order_for_block(e4b, next); | 1388 | order = mb_find_order_for_block(e4b, next); |
@@ -1419,9 +1419,9 @@ static int mb_mark_used(struct ext4_buddy *e4b, struct ext4_free_extent *ex) | |||
1419 | 1419 | ||
1420 | /* let's maintain fragments counter */ | 1420 | /* let's maintain fragments counter */ |
1421 | if (start != 0) | 1421 | if (start != 0) |
1422 | mlen = !mb_test_bit(start - 1, EXT4_MB_BITMAP(e4b)); | 1422 | mlen = !mb_test_bit(start - 1, e4b->bd_bitmap); |
1423 | if (start + len < EXT4_SB(e4b->bd_sb)->s_mb_maxs[0]) | 1423 | if (start + len < EXT4_SB(e4b->bd_sb)->s_mb_maxs[0]) |
1424 | max = !mb_test_bit(start + len, EXT4_MB_BITMAP(e4b)); | 1424 | max = !mb_test_bit(start + len, e4b->bd_bitmap); |
1425 | if (mlen && max) | 1425 | if (mlen && max) |
1426 | e4b->bd_info->bb_fragments++; | 1426 | e4b->bd_info->bb_fragments++; |
1427 | else if (!mlen && !max) | 1427 | else if (!mlen && !max) |
@@ -1464,7 +1464,7 @@ static int mb_mark_used(struct ext4_buddy *e4b, struct ext4_free_extent *ex) | |||
1464 | } | 1464 | } |
1465 | mb_set_largest_free_order(e4b->bd_sb, e4b->bd_info); | 1465 | mb_set_largest_free_order(e4b->bd_sb, e4b->bd_info); |
1466 | 1466 | ||
1467 | ext4_set_bits(EXT4_MB_BITMAP(e4b), ex->fe_start, len0); | 1467 | ext4_set_bits(e4b->bd_bitmap, ex->fe_start, len0); |
1468 | mb_check_buddy(e4b); | 1468 | mb_check_buddy(e4b); |
1469 | 1469 | ||
1470 | return ret; | 1470 | return ret; |
@@ -1763,7 +1763,7 @@ void ext4_mb_complex_scan_group(struct ext4_allocation_context *ac, | |||
1763 | struct ext4_buddy *e4b) | 1763 | struct ext4_buddy *e4b) |
1764 | { | 1764 | { |
1765 | struct super_block *sb = ac->ac_sb; | 1765 | struct super_block *sb = ac->ac_sb; |
1766 | void *bitmap = EXT4_MB_BITMAP(e4b); | 1766 | void *bitmap = e4b->bd_bitmap; |
1767 | struct ext4_free_extent ex; | 1767 | struct ext4_free_extent ex; |
1768 | int i; | 1768 | int i; |
1769 | int free; | 1769 | int free; |
@@ -1823,7 +1823,7 @@ void ext4_mb_scan_aligned(struct ext4_allocation_context *ac, | |||
1823 | { | 1823 | { |
1824 | struct super_block *sb = ac->ac_sb; | 1824 | struct super_block *sb = ac->ac_sb; |
1825 | struct ext4_sb_info *sbi = EXT4_SB(sb); | 1825 | struct ext4_sb_info *sbi = EXT4_SB(sb); |
1826 | void *bitmap = EXT4_MB_BITMAP(e4b); | 1826 | void *bitmap = e4b->bd_bitmap; |
1827 | struct ext4_free_extent ex; | 1827 | struct ext4_free_extent ex; |
1828 | ext4_fsblk_t first_group_block; | 1828 | ext4_fsblk_t first_group_block; |
1829 | ext4_fsblk_t a; | 1829 | ext4_fsblk_t a; |