diff options
Diffstat (limited to 'util-linux/mkfs_ext2.c')
-rw-r--r-- | util-linux/mkfs_ext2.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/util-linux/mkfs_ext2.c b/util-linux/mkfs_ext2.c index 3258d7eee..f91a0b4bf 100644 --- a/util-linux/mkfs_ext2.c +++ b/util-linux/mkfs_ext2.c | |||
@@ -116,7 +116,7 @@ static void allocate(uint8_t *bitmap, uint32_t blocksize, uint32_t start, uint32 | |||
116 | { | 116 | { |
117 | uint32_t i; | 117 | uint32_t i; |
118 | 118 | ||
119 | //bb_info_msg("ALLOC: [%u][%u][%u]: [%u-%u]:=[%x],[%x]", blocksize, start, end, start/8, blocksize - end/8 - 1, (1 << (start & 7)) - 1, (uint8_t)(0xFF00 >> (end & 7))); | 119 | //bb_error_msg("ALLOC: [%u][%u][%u]: [%u-%u]:=[%x],[%x]", blocksize, start, end, start/8, blocksize - end/8 - 1, (1 << (start & 7)) - 1, (uint8_t)(0xFF00 >> (end & 7))); |
120 | memset(bitmap, 0, blocksize); | 120 | memset(bitmap, 0, blocksize); |
121 | i = start / 8; | 121 | i = start / 8; |
122 | memset(bitmap, 0xFF, i); | 122 | memset(bitmap, 0xFF, i); |
@@ -151,7 +151,7 @@ static uint32_t has_super(uint32_t x) | |||
151 | 151 | ||
152 | static void PUT(uint64_t off, void *buf, uint32_t size) | 152 | static void PUT(uint64_t off, void *buf, uint32_t size) |
153 | { | 153 | { |
154 | // bb_info_msg("PUT[%llu]:[%u]", off, size); | 154 | //bb_error_msg("PUT[%llu]:[%u]", off, size); |
155 | xlseek(fd, off, SEEK_SET); | 155 | xlseek(fd, off, SEEK_SET); |
156 | xwrite(fd, buf, size); | 156 | xwrite(fd, buf, size); |
157 | } | 157 | } |
@@ -412,7 +412,7 @@ int mkfs_ext2_main(int argc UNUSED_PARAM, char **argv) | |||
412 | // (a bit after 8M image size), but it works for two->three groups | 412 | // (a bit after 8M image size), but it works for two->three groups |
413 | // transition (at 16M). | 413 | // transition (at 16M). |
414 | if (remainder && (remainder < overhead + 50)) { | 414 | if (remainder && (remainder < overhead + 50)) { |
415 | //bb_info_msg("CHOP[%u]", remainder); | 415 | //bb_error_msg("CHOP[%u]", remainder); |
416 | nblocks -= remainder; | 416 | nblocks -= remainder; |
417 | goto retry; | 417 | goto retry; |
418 | } | 418 | } |
@@ -568,7 +568,7 @@ int mkfs_ext2_main(int argc UNUSED_PARAM, char **argv) | |||
568 | free_blocks = (n < blocks_per_group ? n : blocks_per_group) - overhead; | 568 | free_blocks = (n < blocks_per_group ? n : blocks_per_group) - overhead; |
569 | 569 | ||
570 | // mark preallocated blocks as allocated | 570 | // mark preallocated blocks as allocated |
571 | //bb_info_msg("ALLOC: [%u][%u][%u]", blocksize, overhead, blocks_per_group - (free_blocks + overhead)); | 571 | //bb_error_msg("ALLOC: [%u][%u][%u]", blocksize, overhead, blocks_per_group - (free_blocks + overhead)); |
572 | allocate(buf, blocksize, | 572 | allocate(buf, blocksize, |
573 | // reserve "overhead" blocks | 573 | // reserve "overhead" blocks |
574 | overhead, | 574 | overhead, |
@@ -647,7 +647,7 @@ int mkfs_ext2_main(int argc UNUSED_PARAM, char **argv) | |||
647 | n = FETCH_LE32(inode->i_block[0]) + 1; | 647 | n = FETCH_LE32(inode->i_block[0]) + 1; |
648 | for (i = 0; i < lost_and_found_blocks; ++i) | 648 | for (i = 0; i < lost_and_found_blocks; ++i) |
649 | STORE_LE(inode->i_block[i], i + n); // use next block | 649 | STORE_LE(inode->i_block[i], i + n); // use next block |
650 | //bb_info_msg("LAST BLOCK USED[%u]", i + n); | 650 | //bb_error_msg("LAST BLOCK USED[%u]", i + n); |
651 | PUT(((uint64_t)FETCH_LE32(gd[0].bg_inode_table) * blocksize) + (EXT2_GOOD_OLD_FIRST_INO-1) * inodesize, | 651 | PUT(((uint64_t)FETCH_LE32(gd[0].bg_inode_table) * blocksize) + (EXT2_GOOD_OLD_FIRST_INO-1) * inodesize, |
652 | buf, inodesize); | 652 | buf, inodesize); |
653 | 653 | ||