vitalif
/
e2fsprogs
mirror of https://github.com/vitalif/e2fsprogs
1
0
Fork 0
Code Issues Releases Wiki Activity

Flag continuation hashes in debugfs's htree command to make them 

easier to find.
bitmap-optimize
Theodore Ts'o 2002-09-22 15:27:28 -04:00
parent f9e4abf714
commit 42e5b5f987
2 changed files with 11 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
debugfs/ChangeLog
View File

@ -1,3 +1,8 @@
2002-09-22 root <tytso@mit.edu>
* htree.c (htree_dump_int_node): Flag continuation hashes to make
them easier to find.
2001-08-31 Theodore Tso <tytso@thunk.org>
* Release of E2fsprogs 1.28

10
debugfs/htree.c
View File

@ -104,7 +104,7 @@ static void htree_dump_int_node(ext2_filsys fs, ext2_ino_t ino,
{
struct ext2_dx_countlimit limit;
struct ext2_dx_entry e;
int i;
int hash, i;
limit = *((struct ext2_dx_countlimit *) ent);
@ -114,10 +114,12 @@ static void htree_dump_int_node(ext2_filsys fs, ext2_ino_t ino,
fprintf(pager, "Number of entries (count): %d\n", limit.count);
fprintf(pager, "Number of entries (limit): %d\n", limit.limit);
for (i=0; i < limit.count; i++)
fprintf(pager, "Entry #%d: Hash 0x%08x, block %d\n", i,
i ? ext2fs_le32_to_cpu(ent[i].hash) : 0,
for (i=0; i < limit.count; i++) {
hash = i ? ext2fs_le32_to_cpu(ent[i].hash) : 0;
fprintf(pager, "Entry #%d: Hash 0x%08x%s, block %d\n", i,
hash, (hash & 1) ? " (**)" : "",
ext2fs_le32_to_cpu(ent[i].block));
}
fprintf(pager, "\n");