2 * htree.c --- hash tree routines
4 * Copyright (C) 2002 Theodore Ts'o. This file may be redistributed
5 * under the terms of the GNU Public License.
18 #include <sys/types.h>
27 #include "uuid/uuid.h"
32 static void htree_dump_leaf_node(ext2_filsys fs
, ext2_ino_t ino
,
33 struct ext2_inode
*inode
,
34 struct ext2_dx_root_info
* rootnode
,
35 blk64_t blk
, char *buf
)
38 struct ext2_dir_entry
*dirent
;
40 unsigned int offset
= 0;
41 char name
[EXT2_NAME_LEN
+ 1];
42 char tmp
[EXT2_NAME_LEN
+ 64];
44 ext2_dirhash_t hash
, minor_hash
;
47 int hash_flags
= inode
->i_flags
& EXT4_CASEFOLD_FL
;
50 if (ext2fs_has_feature_metadata_csum(fs
->super
))
51 csum_size
= sizeof(struct ext2_dir_entry_tail
);
53 errcode
= ext2fs_bmap2(fs
, ino
, inode
, buf
, 0, blk
, 0, &pblk
);
55 com_err("htree_dump_leaf_node", errcode
,
56 "while mapping logical block %llu\n", blk
);
60 fprintf(pager
, "Reading directory block %llu, phys %llu\n", blk
, pblk
);
61 errcode
= ext2fs_read_dir_block4(current_fs
, pblk
, buf
, 0, ino
);
63 com_err("htree_dump_leaf_node", errcode
,
64 "while reading block %llu (%llu)\n",
68 hash_alg
= rootnode
->hash_version
;
69 if ((hash_alg
<= EXT2_HASH_TEA
) &&
70 (fs
->super
->s_flags
& EXT2_FLAGS_UNSIGNED_HASH
))
73 while (offset
< fs
->blocksize
) {
74 dirent
= (struct ext2_dir_entry
*) (buf
+ offset
);
75 errcode
= ext2fs_get_rec_len(fs
, dirent
, &rec_len
);
77 com_err("htree_dump_leaf_inode", errcode
,
78 "while getting rec_len for block %lu",
82 thislen
= ext2fs_dirent_name_len(dirent
);
83 if (((offset
+ rec_len
) > fs
->blocksize
) ||
85 ((rec_len
% 4) != 0) ||
86 ((unsigned) thislen
+ 8 > rec_len
)) {
87 fprintf(pager
, "Corrupted directory block (%llu)!\n",
91 strncpy(name
, dirent
->name
, thislen
);
93 errcode
= ext2fs_dirhash2(hash_alg
, name
, thislen
,
94 fs
->encoding
, hash_flags
,
95 fs
->super
->s_hash_seed
,
98 com_err("htree_dump_leaf_node", errcode
,
99 "while calculating hash");
100 if ((offset
== fs
->blocksize
- csum_size
) &&
101 (dirent
->inode
== 0) &&
102 (dirent
->rec_len
== csum_size
) &&
103 (dirent
->name_len
== EXT2_DIR_NAME_LEN_CSUM
)) {
104 struct ext2_dir_entry_tail
*t
;
106 t
= (struct ext2_dir_entry_tail
*) dirent
;
108 snprintf(tmp
, EXT2_NAME_LEN
+ 64,
109 "leaf block checksum: 0x%08x ",
112 snprintf(tmp
, EXT2_NAME_LEN
+ 64,
113 "%u 0x%08x-%08x (%d) %s ",
114 dirent
->inode
, hash
, minor_hash
,
117 thislen
= strlen(tmp
);
118 if (col
+ thislen
> 80) {
119 fprintf(pager
, "\n");
122 fprintf(pager
, "%s", tmp
);
126 fprintf(pager
, "\n");
130 static void htree_dump_int_block(ext2_filsys fs
, ext2_ino_t ino
,
131 struct ext2_inode
*inode
,
132 struct ext2_dx_root_info
* rootnode
,
133 blk64_t blk
, char *buf
, int level
);
136 static void htree_dump_int_node(ext2_filsys fs
, ext2_ino_t ino
,
137 struct ext2_inode
*inode
,
138 struct ext2_dx_root_info
* rootnode
,
139 struct ext2_dx_entry
*ent
,
140 char *buf
, int level
)
142 struct ext2_dx_countlimit dx_countlimit
;
143 struct ext2_dx_tail
*tail
;
148 dx_countlimit
= *((struct ext2_dx_countlimit
*) ent
);
149 count
= ext2fs_le16_to_cpu(dx_countlimit
.count
);
150 limit
= ext2fs_le16_to_cpu(dx_countlimit
.limit
);
152 fprintf(pager
, "Number of entries (count): %d\n", count
);
153 fprintf(pager
, "Number of entries (limit): %d\n", limit
);
155 remainder
= fs
->blocksize
- (limit
* sizeof(struct ext2_dx_entry
));
156 if (ent
== (struct ext2_dx_entry
*)(rootnode
+ 1))
157 remainder
-= sizeof(struct ext2_dx_root_info
) + 24;
160 if (ext2fs_has_feature_metadata_csum(fs
->super
) &&
161 remainder
== sizeof(struct ext2_dx_tail
)) {
162 tail
= (struct ext2_dx_tail
*)(ent
+ limit
);
163 fprintf(pager
, "Checksum: 0x%08x\n",
164 ext2fs_le32_to_cpu(tail
->dt_checksum
));
167 for (i
=0; i
< count
; i
++) {
168 hash
= i
? ext2fs_le32_to_cpu(ent
[i
].hash
) : 0;
169 fprintf(pager
, "Entry #%d: Hash 0x%08x%s, block %u\n", i
,
170 hash
, (hash
& 1) ? " (**)" : "",
171 ext2fs_le32_to_cpu(ent
[i
].block
));
174 fprintf(pager
, "\n");
176 for (i
=0; i
< count
; i
++) {
177 unsigned int hashval
, block
;
179 hashval
= ext2fs_le32_to_cpu(ent
[i
].hash
);
180 block
= ext2fs_le32_to_cpu(ent
[i
].block
);
181 fprintf(pager
, "Entry #%d: Hash 0x%08x, block %u\n", i
,
182 i
? hashval
: 0, block
);
184 htree_dump_int_block(fs
, ino
, inode
, rootnode
,
185 block
, buf
, level
-1);
187 htree_dump_leaf_node(fs
, ino
, inode
, rootnode
,
191 fprintf(pager
, "---------------------\n");
194 static void htree_dump_int_block(ext2_filsys fs
, ext2_ino_t ino
,
195 struct ext2_inode
*inode
,
196 struct ext2_dx_root_info
* rootnode
,
197 blk64_t blk
, char *buf
, int level
)
203 cbuf
= malloc(fs
->blocksize
);
205 fprintf(pager
, "Couldn't allocate child block.\n");
209 errcode
= ext2fs_bmap2(fs
, ino
, inode
, buf
, 0, blk
, 0, &pblk
);
211 com_err("htree_dump_int_block", errcode
,
212 "while mapping logical block %llu\n", blk
);
216 errcode
= io_channel_read_blk64(current_fs
->io
, pblk
, 1, buf
);
218 com_err("htree_dump_int_block", errcode
,
219 "while reading block %llu\n", blk
);
223 htree_dump_int_node(fs
, ino
, inode
, rootnode
,
224 (struct ext2_dx_entry
*) (buf
+8),
232 void do_htree_dump(int argc
, char *argv
[], int sci_idx
EXT2FS_ATTR((unused
)),
233 void *infop
EXT2FS_ATTR((unused
)))
236 struct ext2_inode inode
;
239 struct ext2_dx_root_info
*rootnode
;
240 struct ext2_dx_entry
*ent
;
243 if (check_fs_open(argv
[0]))
246 pager
= open_pager();
248 if (common_inode_args_process(argc
, argv
, &ino
, 0))
251 if (debugfs_read_inode(ino
, &inode
, argv
[1]))
254 if (!LINUX_S_ISDIR(inode
.i_mode
)) {
255 com_err(argv
[0], 0, "Not a directory");
259 if ((inode
.i_flags
& EXT2_BTREE_FL
) == 0) {
260 com_err(argv
[0], 0, "Not a hash-indexed directory");
264 buf
= malloc(2*current_fs
->blocksize
);
266 com_err(argv
[0], 0, "Couldn't allocate htree buffer");
270 errcode
= ext2fs_bmap2(current_fs
, ino
, &inode
, buf
, 0, 0, 0, &blk
);
272 com_err("do_htree_block", errcode
,
273 "while mapping logical block 0\n");
277 errcode
= io_channel_read_blk64(current_fs
->io
, blk
,
280 com_err(argv
[0], errcode
, "Error reading root node");
284 rootnode
= (struct ext2_dx_root_info
*) (buf
+ 24);
286 fprintf(pager
, "Root node dump:\n");
287 fprintf(pager
, "\t Reserved zero: %u\n", rootnode
->reserved_zero
);
288 fprintf(pager
, "\t Hash Version: %d\n", rootnode
->hash_version
);
289 fprintf(pager
, "\t Info length: %d\n", rootnode
->info_length
);
290 fprintf(pager
, "\t Indirect levels: %d\n", rootnode
->indirect_levels
);
291 fprintf(pager
, "\t Flags: %d\n", rootnode
->unused_flags
);
293 ent
= (struct ext2_dx_entry
*)
294 ((char *)rootnode
+ rootnode
->info_length
);
296 htree_dump_int_node(current_fs
, ino
, &inode
, rootnode
, ent
,
297 buf
+ current_fs
->blocksize
,
298 rootnode
->indirect_levels
);
306 * This function prints the hash of a given file.
308 void do_dx_hash(int argc
, char *argv
[], int sci_idx
EXT2FS_ATTR((unused
)),
309 void *infop
EXT2FS_ATTR((unused
)))
311 ext2_dirhash_t hash
, minor_hash
;
314 int hash_version
= 0;
317 const struct ext2fs_nls_table
*encoding
= NULL
;
319 hash_seed
[0] = hash_seed
[1] = hash_seed
[2] = hash_seed
[3] = 0;
322 while ((c
= getopt(argc
, argv
, "h:s:ce:")) != EOF
) {
325 hash_version
= e2p_string2hash(optarg
);
326 if (hash_version
< 0)
327 hash_version
= atoi(optarg
);
330 if (uuid_parse(optarg
, (unsigned char *) hash_seed
)) {
331 fprintf(stderr
, "Invalid UUID format: %s\n",
337 hash_flags
|= EXT4_CASEFOLD_FL
;
340 encoding
= ext2fs_load_nls_table(e2p_str2encoding(optarg
));
342 fprintf(stderr
, "Invalid encoding: %s\n",
351 if (optind
!= argc
-1) {
353 com_err(argv
[0], 0, "usage: dx_hash [-h hash_alg] "
354 "[-s hash_seed] [-c] [-e encoding] filename");
357 err
= ext2fs_dirhash2(hash_version
, argv
[optind
],
358 strlen(argv
[optind
]), encoding
, hash_flags
,
359 hash_seed
, &hash
, &minor_hash
);
362 com_err(argv
[0], err
, "while calculating hash");
365 printf("Hash of %s is 0x%0x (minor 0x%0x)\n", argv
[optind
],
370 * Search for particular directory entry (useful for debugging very
371 * large hash tree directories that have lost some blocks from the
374 struct process_block_struct
{
380 static int search_dir_block(ext2_filsys fs
, blk64_t
*blocknr
,
381 e2_blkcnt_t blockcnt
, blk64_t ref_blk
,
382 int ref_offset
, void *priv_data
);
384 void do_dirsearch(int argc
, char *argv
[], int sci_idx
EXT2FS_ATTR((unused
)),
385 void *infop
EXT2FS_ATTR((unused
)))
388 struct process_block_struct pb
;
390 if (check_fs_open(argv
[0]))
394 com_err(0, 0, "Usage: dirsearch dir filename");
398 inode
= string_to_inode(argv
[1]);
402 pb
.buf
= malloc(current_fs
->blocksize
);
404 com_err("dirsearch", 0, "Couldn't allocate buffer");
407 pb
.search_name
= argv
[2];
408 pb
.len
= strlen(pb
.search_name
);
410 ext2fs_block_iterate3(current_fs
, inode
, BLOCK_FLAG_READ_ONLY
, 0,
411 search_dir_block
, &pb
);
417 static int search_dir_block(ext2_filsys fs
, blk64_t
*blocknr
,
418 e2_blkcnt_t blockcnt
,
419 blk64_t ref_blk
EXT2FS_ATTR((unused
)),
420 int ref_offset
EXT2FS_ATTR((unused
)),
423 struct process_block_struct
*p
;
424 struct ext2_dir_entry
*dirent
;
426 unsigned int offset
= 0;
427 unsigned int rec_len
;
432 p
= (struct process_block_struct
*) priv_data
;
434 errcode
= io_channel_read_blk64(current_fs
->io
, *blocknr
, 1, p
->buf
);
436 com_err("search_dir_block", errcode
,
437 "while reading block %lu", (unsigned long) *blocknr
);
441 while (offset
< fs
->blocksize
) {
442 dirent
= (struct ext2_dir_entry
*) (p
->buf
+ offset
);
443 errcode
= ext2fs_get_rec_len(fs
, dirent
, &rec_len
);
445 com_err("htree_dump_leaf_inode", errcode
,
446 "while getting rec_len for block %lu",
447 (unsigned long) *blocknr
);
451 p
->len
== ext2fs_dirent_name_len(dirent
) &&
452 strncmp(p
->search_name
, dirent
->name
,
454 printf("Entry found at logical block %lld, "
455 "phys %llu, offset %u\n", (long long)blockcnt
,
457 printf("offset %u\n", offset
);