2 * rehash.c --- rebuild hash tree directories
4 * Copyright (C) 2002 Theodore Ts'o
7 * This file may be redistributed under the terms of the GNU Public
11 * This algorithm is designed for simplicity of implementation and to
12 * pack the directory as much as possible. It however requires twice
13 * as much memory as the size of the directory. The maximum size
14 * directory supported using a 4k blocksize is roughly a gigabyte, and
15 * so there may very well be problems with machines that don't have
16 * virtual memory, and obscenely large directories.
18 * An alternate algorithm which is much more disk intensive could be
19 * written, and probably will need to be written in the future. The
20 * design goals of such an algorithm are: (a) use (roughly) constant
21 * amounts of memory, no matter how large the directory, (b) the
22 * directory must be safe at all times, even if e2fsck is interrupted
23 * in the middle, (c) we must use minimal amounts of extra disk
24 * blocks. This pretty much requires an incremental approach, where
25 * we are reading from one part of the directory, and inserting into
26 * the front half. So the algorithm will have to keep track of a
27 * moving block boundary between the new tree and the old tree, and
28 * files will need to be moved from the old directory and inserted
29 * into the new tree. If the new directory requires space which isn't
30 * yet available, blocks from the beginning part of the old directory
31 * may need to be moved to the end of the directory to make room for
34 * --------------------------------------------------------
35 * | new tree | | old tree |
36 * --------------------------------------------------------
40 * This is going to be a pain in the tuckus to implement, and will
41 * require a lot more disk accesses. So I'm going to skip it for now;
42 * it's only really going to be an issue for really, really big
43 * filesystems (when we reach the level of tens of millions of files
44 * in a single directory). It will probably be easier to simply
45 * require that e2fsck use VM first.
55 /* Schedule a dir to be rebuilt during pass 3A. */
56 void e2fsck_rehash_dir_later(e2fsck_t ctx, ext2_ino_t ino)
58 if (!ctx->dirs_to_hash)
59 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50);
60 if (ctx->dirs_to_hash)
61 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
64 /* Ask if a dir will be rebuilt during pass 3A. */
65 int e2fsck_dir_will_be_rehashed(e2fsck_t ctx, ext2_ino_t ino)
67 if (ctx->options & E2F_OPT_COMPRESS_DIRS)
69 if (!ctx->dirs_to_hash)
71 return ext2fs_u32_list_test(ctx->dirs_to_hash, ino);
76 struct fill_dir_struct {
78 struct ext2_inode *inode;
82 struct hash_entry *harray;
83 blk_t max_array, num_array;
84 ext2_off64_t dir_size;
92 ext2_dirhash_t minor_hash;
94 struct ext2_dir_entry *dir;
101 ext2_dirhash_t *hashes;
104 static int fill_dir_block(ext2_filsys fs,
106 e2_blkcnt_t blockcnt,
107 blk64_t ref_block EXT2FS_ATTR((unused)),
108 int ref_offset EXT2FS_ATTR((unused)),
111 struct fill_dir_struct *fd = (struct fill_dir_struct *) priv_data;
112 struct hash_entry *new_array, *ent;
113 struct ext2_dir_entry *dirent;
115 unsigned int offset, dir_offset, rec_len, name_len;
116 int hash_alg, hash_flags;
121 offset = blockcnt * fs->blocksize;
122 if (offset + fs->blocksize > fd->inode->i_size) {
123 fd->err = EXT2_ET_DIR_CORRUPTED;
127 dir = (fd->buf+offset);
128 if (*block_nr == 0) {
129 memset(dir, 0, fs->blocksize);
130 dirent = (struct ext2_dir_entry *) dir;
131 (void) ext2fs_set_rec_len(fs, fs->blocksize, dirent);
133 int flags = fs->flags;
134 fs->flags |= EXT2_FLAG_IGNORE_CSUM_ERRORS;
135 fd->err = ext2fs_read_dir_block4(fs, *block_nr, dir, 0,
137 fs->flags = (flags & EXT2_FLAG_IGNORE_CSUM_ERRORS) |
138 (fs->flags & ~EXT2_FLAG_IGNORE_CSUM_ERRORS);
142 hash_flags = fd->inode->i_flags & EXT4_CASEFOLD_FL;
143 hash_alg = fs->super->s_def_hash_version;
144 if ((hash_alg <= EXT2_HASH_TEA) &&
145 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
147 /* While the directory block is "hot", index it. */
149 while (dir_offset < fs->blocksize) {
150 dirent = (struct ext2_dir_entry *) (dir + dir_offset);
151 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
152 name_len = ext2fs_dirent_name_len(dirent);
153 if (((dir_offset + rec_len) > fs->blocksize) ||
155 ((rec_len % 4) != 0) ||
156 (name_len + 8 > rec_len)) {
157 fd->err = EXT2_ET_DIR_CORRUPTED;
160 dir_offset += rec_len;
161 if (dirent->inode == 0)
163 if ((name_len) == 0) {
164 fd->err = EXT2_ET_DIR_CORRUPTED;
167 if (!fd->compress && (name_len == 1) &&
168 (dirent->name[0] == '.'))
170 if (!fd->compress && (name_len == 2) &&
171 (dirent->name[0] == '.') && (dirent->name[1] == '.')) {
172 fd->parent = dirent->inode;
175 if (fd->num_array >= fd->max_array) {
178 retval = ext2fs_resize_array(sizeof(struct hash_entry),
186 fd->max_array += 500;
188 ent = fd->harray + fd->num_array++;
190 fd->dir_size += EXT2_DIR_REC_LEN(name_len);
191 ent->ino = dirent->inode;
193 ent->hash = ent->minor_hash = 0;
195 fd->err = ext2fs_dirhash2(hash_alg,
196 dirent->name, name_len,
197 fs->encoding, hash_flags,
198 fs->super->s_hash_seed,
199 &ent->hash, &ent->minor_hash);
208 /* Used for sorting the hash entry */
209 static EXT2_QSORT_TYPE ino_cmp(const void *a, const void *b)
211 const struct hash_entry *he_a = (const struct hash_entry *) a;
212 const struct hash_entry *he_b = (const struct hash_entry *) b;
214 return (he_a->ino - he_b->ino);
217 /* Used for sorting the hash entry */
218 static EXT2_QSORT_TYPE name_cmp(const void *a, const void *b)
220 const struct hash_entry *he_a = (const struct hash_entry *) a;
221 const struct hash_entry *he_b = (const struct hash_entry *) b;
222 unsigned int he_a_len, he_b_len, min_len;
225 he_a_len = ext2fs_dirent_name_len(he_a->dir);
226 he_b_len = ext2fs_dirent_name_len(he_b->dir);
228 if (min_len > he_b_len)
231 ret = memcmp(he_a->dir->name, he_b->dir->name, min_len);
233 if (he_a_len > he_b_len)
235 else if (he_a_len < he_b_len)
238 ret = he_b->dir->inode - he_a->dir->inode;
243 /* Used for sorting the hash entry */
244 static EXT2_QSORT_TYPE hash_cmp(const void *a, const void *b)
246 const struct hash_entry *he_a = (const struct hash_entry *) a;
247 const struct hash_entry *he_b = (const struct hash_entry *) b;
250 if (he_a->hash > he_b->hash)
252 else if (he_a->hash < he_b->hash)
255 if (he_a->minor_hash > he_b->minor_hash)
257 else if (he_a->minor_hash < he_b->minor_hash)
260 ret = name_cmp(a, b);
265 static errcode_t alloc_size_dir(ext2_filsys fs, struct out_dir *outdir,
271 retval = ext2fs_resize_array(fs->blocksize, outdir->max, blocks,
275 retval = ext2fs_resize_array(sizeof(ext2_dirhash_t),
281 retval = ext2fs_get_array(fs->blocksize, blocks, &outdir->buf);
284 retval = ext2fs_get_array(sizeof(ext2_dirhash_t), blocks,
290 outdir->max = blocks;
294 static void free_out_dir(struct out_dir *outdir)
297 free(outdir->hashes);
302 static errcode_t get_next_block(ext2_filsys fs, struct out_dir *outdir,
307 if (outdir->num >= outdir->max) {
308 int increment = outdir->max / 10;
312 retval = alloc_size_dir(fs, outdir, outdir->max + increment);
316 *ret = outdir->buf + (size_t)outdir->num++ * fs->blocksize;
317 memset(*ret, 0, fs->blocksize);
322 * This function is used to make a unique filename. We do this by
323 * appending ~0, and then incrementing the number. However, we cannot
324 * expand the length of the filename beyond the padding available in
325 * the directory entry.
327 static void mutate_name(char *str, unsigned int *len)
330 unsigned int l = *len;
333 * First check to see if it looks the name has been mutated
336 for (i = l-1; i > 0; i--) {
337 if (!isdigit(str[i]))
340 if ((i == (int)l - 1) || (str[i] != '~')) {
350 for (i = l-1; i >= 0; i--) {
351 if (isdigit(str[i])) {
363 else if (str[0] == 'Z') {
381 static int duplicate_search_and_fix(e2fsck_t ctx, ext2_filsys fs,
383 struct fill_dir_struct *fd)
385 struct problem_context pctx;
386 struct hash_entry *ent, *prev;
390 unsigned int new_len;
392 int hash_flags = fd->inode->i_flags & EXT4_CASEFOLD_FL;
394 clear_problem_context(&pctx);
397 hash_alg = fs->super->s_def_hash_version;
398 if ((hash_alg <= EXT2_HASH_TEA) &&
399 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
402 for (i=1; i < fd->num_array; i++) {
403 ent = fd->harray + i;
405 if (!ent->dir->inode ||
406 (ext2fs_dirent_name_len(ent->dir) !=
407 ext2fs_dirent_name_len(prev->dir)) ||
408 memcmp(ent->dir->name, prev->dir->name,
409 ext2fs_dirent_name_len(ent->dir)))
411 pctx.dirent = ent->dir;
412 if ((ent->dir->inode == prev->dir->inode) &&
413 fix_problem(ctx, PR_2_DUPLICATE_DIRENT, &pctx)) {
414 e2fsck_adjust_inode_count(ctx, ent->dir->inode, -1);
419 new_len = ext2fs_dirent_name_len(ent->dir);
421 /* should never happen */
422 ext2fs_unmark_valid(fs);
425 memcpy(new_name, ent->dir->name, new_len);
426 mutate_name(new_name, &new_len);
427 for (j=0; j < fd->num_array; j++) {
430 (unsigned) ext2fs_dirent_name_len(fd->harray[j].dir)) ||
431 memcmp(new_name, fd->harray[j].dir->name, new_len))
433 mutate_name(new_name, &new_len);
437 new_name[new_len] = 0;
439 if (fix_problem(ctx, PR_2_NON_UNIQUE_FILE, &pctx)) {
440 memcpy(ent->dir->name, new_name, new_len);
441 ext2fs_dirent_set_name_len(ent->dir, new_len);
442 ext2fs_dirhash2(hash_alg, new_name, new_len,
443 fs->encoding, hash_flags,
444 fs->super->s_hash_seed,
445 &ent->hash, &ent->minor_hash);
453 static errcode_t copy_dir_entries(e2fsck_t ctx,
454 struct fill_dir_struct *fd,
455 struct out_dir *outdir)
457 ext2_filsys fs = ctx->fs;
460 struct hash_entry *ent;
461 struct ext2_dir_entry *dirent;
462 unsigned int rec_len, prev_rec_len, left, slack, offset;
464 ext2_dirhash_t prev_hash;
466 struct ext2_dir_entry_tail *t;
468 if (ctx->htree_slack_percentage == 255) {
469 profile_get_uint(ctx->profile, "options",
470 "indexed_dir_slack_percentage",
472 &ctx->htree_slack_percentage);
473 if (ctx->htree_slack_percentage > 100)
474 ctx->htree_slack_percentage = 20;
477 if (ext2fs_has_feature_metadata_csum(fs->super))
478 csum_size = sizeof(struct ext2_dir_entry_tail);
481 retval = alloc_size_dir(fs, outdir,
482 (fd->dir_size / fs->blocksize) + 2);
485 outdir->num = fd->compress ? 0 : 1;
487 outdir->hashes[0] = 0;
489 if ((retval = get_next_block(fs, outdir, &block_start)))
491 dirent = (struct ext2_dir_entry *) block_start;
494 left = fs->blocksize - csum_size;
495 slack = fd->compress ? 12 :
496 ((fs->blocksize - csum_size) * ctx->htree_slack_percentage)/100;
499 for (i = 0; i < fd->num_array; i++) {
500 ent = fd->harray + i;
501 if (ent->dir->inode == 0)
503 rec_len = EXT2_DIR_REC_LEN(ext2fs_dirent_name_len(ent->dir));
504 if (rec_len > left) {
506 left += prev_rec_len;
507 retval = ext2fs_set_rec_len(fs, left, dirent);
512 t = EXT2_DIRENT_TAIL(block_start,
514 ext2fs_initialize_dirent_tail(fs, t);
516 if ((retval = get_next_block(fs, outdir,
521 left = (fs->blocksize - csum_size) - offset;
522 dirent = (struct ext2_dir_entry *) (block_start + offset);
524 if (ent->hash == prev_hash)
525 outdir->hashes[outdir->num-1] = ent->hash | 1;
527 outdir->hashes[outdir->num-1] = ent->hash;
529 dirent->inode = ent->dir->inode;
530 ext2fs_dirent_set_name_len(dirent,
531 ext2fs_dirent_name_len(ent->dir));
532 ext2fs_dirent_set_file_type(dirent,
533 ext2fs_dirent_file_type(ent->dir));
534 retval = ext2fs_set_rec_len(fs, rec_len, dirent);
537 prev_rec_len = rec_len;
538 memcpy(dirent->name, ent->dir->name,
539 ext2fs_dirent_name_len(dirent));
543 prev_rec_len += left;
544 retval = ext2fs_set_rec_len(fs, prev_rec_len, dirent);
550 prev_hash = ent->hash;
553 retval = ext2fs_set_rec_len(fs, rec_len + left, dirent);
555 t = EXT2_DIRENT_TAIL(block_start, fs->blocksize);
556 ext2fs_initialize_dirent_tail(fs, t);
563 static struct ext2_dx_root_info *set_root_node(ext2_filsys fs, char *buf,
564 ext2_ino_t ino, ext2_ino_t parent)
566 struct ext2_dir_entry *dir;
567 struct ext2_dx_root_info *root;
568 struct ext2_dx_countlimit *limits;
572 if (ext2fs_has_feature_filetype(fs->super))
573 filetype = EXT2_FT_DIR;
575 memset(buf, 0, fs->blocksize);
576 dir = (struct ext2_dir_entry *) buf;
579 ext2fs_dirent_set_name_len(dir, 1);
580 ext2fs_dirent_set_file_type(dir, filetype);
582 dir = (struct ext2_dir_entry *) (buf + 12);
586 ext2fs_dirent_set_name_len(dir, 2);
587 ext2fs_dirent_set_file_type(dir, filetype);
588 dir->rec_len = fs->blocksize - 12;
590 root = (struct ext2_dx_root_info *) (buf+24);
591 root->reserved_zero = 0;
592 root->hash_version = fs->super->s_def_hash_version;
593 root->info_length = 8;
594 root->indirect_levels = 0;
595 root->unused_flags = 0;
597 if (ext2fs_has_feature_metadata_csum(fs->super))
598 csum_size = sizeof(struct ext2_dx_tail);
600 limits = (struct ext2_dx_countlimit *) (buf+32);
601 limits->limit = (fs->blocksize - (32 + csum_size)) /
602 sizeof(struct ext2_dx_entry);
609 static struct ext2_dx_entry *set_int_node(ext2_filsys fs, char *buf)
611 struct ext2_dir_entry *dir;
612 struct ext2_dx_countlimit *limits;
615 memset(buf, 0, fs->blocksize);
616 dir = (struct ext2_dir_entry *) buf;
618 (void) ext2fs_set_rec_len(fs, fs->blocksize, dir);
620 if (ext2fs_has_feature_metadata_csum(fs->super))
621 csum_size = sizeof(struct ext2_dx_tail);
623 limits = (struct ext2_dx_countlimit *) (buf+8);
624 limits->limit = (fs->blocksize - (8 + csum_size)) /
625 sizeof(struct ext2_dx_entry);
628 return (struct ext2_dx_entry *) limits;
631 static int alloc_blocks(ext2_filsys fs,
632 struct ext2_dx_countlimit **limit,
633 struct ext2_dx_entry **prev_ent,
634 struct ext2_dx_entry **next_ent,
635 int *prev_offset, int *next_offset,
636 struct out_dir *outdir, int i,
637 int *prev_count, int *next_count)
643 (*limit)->limit = (*limit)->count =
644 ext2fs_cpu_to_le16((*limit)->limit);
645 *prev_ent = (struct ext2_dx_entry *) (outdir->buf + *prev_offset);
646 (*prev_ent)->block = ext2fs_cpu_to_le32(outdir->num);
650 ext2fs_cpu_to_le32(outdir->hashes[i]);
652 retval = get_next_block(fs, outdir, &block_start);
656 /* outdir->buf might be reallocated */
657 *prev_ent = (struct ext2_dx_entry *) (outdir->buf + *prev_offset);
659 *next_ent = set_int_node(fs, block_start);
660 *limit = (struct ext2_dx_countlimit *)(*next_ent);
662 *next_offset = ((char *) *next_ent - outdir->buf);
664 *next_count = (*limit)->limit;
665 (*prev_offset) += sizeof(struct ext2_dx_entry);
672 * This function takes the leaf nodes which have been written in
673 * outdir, and populates the root node and any necessary interior nodes.
675 static errcode_t calculate_tree(ext2_filsys fs,
676 struct out_dir *outdir,
680 struct ext2_dx_root_info *root_info;
681 struct ext2_dx_entry *root, *int_ent, *dx_ent = 0;
682 struct ext2_dx_countlimit *root_limit, *int_limit, *limit;
684 int i, c1, c2, c3, nblks;
685 int limit_offset, int_offset, root_offset;
687 root_info = set_root_node(fs, outdir->buf, ino, parent);
688 root_offset = limit_offset = ((char *) root_info - outdir->buf) +
689 root_info->info_length;
690 root_limit = (struct ext2_dx_countlimit *) (outdir->buf + limit_offset);
691 c1 = root_limit->limit;
694 /* Write out the pointer blocks */
695 if (nblks - 1 <= c1) {
696 /* Just write out the root block, and we're done */
697 root = (struct ext2_dx_entry *) (outdir->buf + root_offset);
698 for (i=1; i < nblks; i++) {
699 root->block = ext2fs_cpu_to_le32(i);
702 ext2fs_cpu_to_le32(outdir->hashes[i]);
706 } else if (nblks - 1 <= ext2fs_htree_intnode_maxrecs(fs, c1)) {
709 root_info->indirect_levels = 1;
710 for (i=1; i < nblks; i++) {
711 if (c2 == 0 && c1 == 0)
714 retval = alloc_blocks(fs, &limit, &root,
715 &dx_ent, &root_offset,
716 NULL, outdir, i, &c1,
721 dx_ent->block = ext2fs_cpu_to_le32(i);
722 if (c2 != limit->limit)
724 ext2fs_cpu_to_le32(outdir->hashes[i]);
728 limit->count = ext2fs_cpu_to_le16(limit->limit - c2);
729 limit->limit = ext2fs_cpu_to_le16(limit->limit);
735 root_info->indirect_levels = 2;
736 for (i = 1; i < nblks; i++) {
737 if (c3 == 0 && c2 == 0 && c1 == 0)
739 if (c3 == 0 && c2 == 0) {
740 retval = alloc_blocks(fs, &int_limit, &root,
741 &int_ent, &root_offset,
742 &int_offset, outdir, i,
748 int delta1 = (char *)int_limit - outdir->buf;
749 int delta2 = (char *)root - outdir->buf;
751 retval = alloc_blocks(fs, &limit, &int_ent,
752 &dx_ent, &int_offset,
753 NULL, outdir, i, &c2,
758 /* outdir->buf might be reallocated */
759 int_limit = (struct ext2_dx_countlimit *)
760 (outdir->buf + delta1);
761 root = (struct ext2_dx_entry *)
762 (outdir->buf + delta2);
764 dx_ent->block = ext2fs_cpu_to_le32(i);
765 if (c3 != limit->limit)
767 ext2fs_cpu_to_le32(outdir->hashes[i]);
771 int_limit->count = ext2fs_cpu_to_le16(limit->limit - c2);
772 int_limit->limit = ext2fs_cpu_to_le16(limit->limit);
774 limit->count = ext2fs_cpu_to_le16(limit->limit - c3);
775 limit->limit = ext2fs_cpu_to_le16(limit->limit);
778 root_limit = (struct ext2_dx_countlimit *) (outdir->buf + limit_offset);
779 root_limit->count = ext2fs_cpu_to_le16(root_limit->limit - c1);
780 root_limit->limit = ext2fs_cpu_to_le16(root_limit->limit);
785 struct write_dir_struct {
786 struct out_dir *outdir;
794 * Helper function which writes out a directory block.
796 static int write_dir_block(ext2_filsys fs,
798 e2_blkcnt_t blockcnt,
799 blk64_t ref_block EXT2FS_ATTR((unused)),
800 int ref_offset EXT2FS_ATTR((unused)),
803 struct write_dir_struct *wd = (struct write_dir_struct *) priv_data;
807 printf("%u: write_dir_block %lld:%lld", wd->ino, blockcnt, *block_nr);
809 if ((*block_nr == 0) || (blockcnt < 0)) {
815 if (blockcnt < wd->outdir->num)
816 dir = wd->outdir->buf + (blockcnt * fs->blocksize);
817 else if (wd->ctx->lost_and_found == wd->dir) {
818 /* Don't release any extra directory blocks for lost+found */
819 wd->err = ext2fs_new_dir_block(fs, 0, 0, &buf);
825 /* Don't free blocks at the end of the directory, they
826 * will be truncated by the caller. */
828 printf(" - not freed\n");
832 wd->err = ext2fs_write_dir_block4(fs, *block_nr, dir, 0, wd->dir);
834 ext2fs_free_mem(&buf);
837 printf(" - write (%d)\n", wd->err);
844 static errcode_t write_directory(e2fsck_t ctx, ext2_filsys fs,
845 struct out_dir *outdir,
846 ext2_ino_t ino, struct ext2_inode *inode,
849 struct write_dir_struct wd;
852 retval = e2fsck_expand_directory(ctx, ino, -1, outdir->num);
862 retval = ext2fs_block_iterate3(fs, ino, 0, NULL,
863 write_dir_block, &wd);
869 e2fsck_read_inode(ctx, ino, inode, "rehash_dir");
871 inode->i_flags &= ~EXT2_INDEX_FL;
873 inode->i_flags |= EXT2_INDEX_FL;
875 printf("%u: set inode size to %u blocks = %u bytes\n",
876 ino, outdir->num, outdir->num * fs->blocksize);
878 retval = ext2fs_inode_size_set(fs, inode, (ext2_off64_t)outdir->num *
883 /* ext2fs_punch() calls ext2fs_write_inode() which writes the size */
884 return ext2fs_punch(fs, ino, inode, NULL, outdir->num, ~0ULL);
887 errcode_t e2fsck_rehash_dir(e2fsck_t ctx, ext2_ino_t ino,
888 struct problem_context *pctx)
890 ext2_filsys fs = ctx->fs;
892 struct ext2_inode inode;
894 struct fill_dir_struct fd = { NULL, NULL, 0, 0, 0, NULL,
896 struct out_dir outdir = { 0, 0, 0, 0 };
898 e2fsck_read_inode(ctx, ino, &inode, "rehash_dir");
900 if (ext2fs_has_feature_inline_data(fs->super) &&
901 (inode.i_flags & EXT4_INLINE_DATA_FL))
904 retval = ext2fs_get_mem(inode.i_size, &dir_buf);
908 fd.max_array = inode.i_size / 32;
909 retval = ext2fs_get_array(sizeof(struct hash_entry),
910 fd.max_array, &fd.harray);
919 if (!ext2fs_has_feature_dir_index(fs->super) ||
920 (inode.i_size / fs->blocksize) < 2)
925 /* Read in the entire directory into memory */
926 retval = ext2fs_block_iterate3(fs, ino, 0, 0,
927 fill_dir_block, &fd);
934 * If the entries read are less than a block, then don't index
937 if (!fd.compress && (fd.dir_size < (fs->blocksize - 24))) {
945 printf("%d entries (%d bytes) found in inode %d\n",
946 fd.num_array, fd.dir_size, ino);
951 if (fd.compress && fd.num_array > 1)
952 qsort(fd.harray+2, fd.num_array-2, sizeof(struct hash_entry),
955 qsort(fd.harray, fd.num_array, sizeof(struct hash_entry),
959 * Look for duplicates
961 if (duplicate_search_and_fix(ctx, fs, ino, &fd))
964 if (ctx->options & E2F_OPT_NO) {
969 /* Sort non-hashed directories by inode number */
970 if (fd.compress && fd.num_array > 1)
971 qsort(fd.harray+2, fd.num_array-2,
972 sizeof(struct hash_entry), ino_cmp);
975 * Copy the directory entries. In a htree directory these
976 * will become the leaf nodes.
978 retval = copy_dir_entries(ctx, &fd, &outdir);
982 free(dir_buf); dir_buf = 0;
985 /* Calculate the interior nodes */
986 retval = calculate_tree(fs, &outdir, ino, fd.parent);
991 retval = write_directory(ctx, fs, &outdir, ino, &inode, fd.compress);
995 if (ctx->options & E2F_OPT_CONVERT_BMAP)
996 retval = e2fsck_rebuild_extents_later(ctx, ino);
998 retval = e2fsck_check_rebuild_extents(ctx, ino, &inode, pctx);
1000 ext2fs_free_mem(&dir_buf);
1001 ext2fs_free_mem(&fd.harray);
1003 free_out_dir(&outdir);
1007 void e2fsck_rehash_directories(e2fsck_t ctx)
1009 struct problem_context pctx;
1010 #ifdef RESOURCE_TRACK
1011 struct resource_track rtrack;
1013 struct dir_info *dir;
1014 ext2_u32_iterate iter;
1015 struct dir_info_iter * dirinfo_iter = 0;
1018 int cur, max, all_dirs, first = 1;
1020 init_resource_track(&rtrack, ctx->fs->io);
1021 all_dirs = ctx->options & E2F_OPT_COMPRESS_DIRS;
1023 if (!ctx->dirs_to_hash && !all_dirs)
1026 (void) e2fsck_get_lost_and_found(ctx, 0);
1028 clear_problem_context(&pctx);
1032 dirinfo_iter = e2fsck_dir_info_iter_begin(ctx);
1033 max = e2fsck_get_num_dirinfo(ctx);
1035 retval = ext2fs_u32_list_iterate_begin(ctx->dirs_to_hash,
1038 pctx.errcode = retval;
1039 fix_problem(ctx, PR_3A_OPTIMIZE_ITER, &pctx);
1042 max = ext2fs_u32_list_count(ctx->dirs_to_hash);
1046 if ((dir = e2fsck_dir_info_iter(ctx,
1047 dirinfo_iter)) == 0)
1051 if (!ext2fs_u32_list_iterate(iter, &ino))
1054 if (!ext2fs_test_inode_bitmap2(ctx->inode_dir_map, ino))
1059 fix_problem(ctx, PR_3A_PASS_HEADER, &pctx);
1063 fix_problem(ctx, PR_3A_OPTIMIZE_DIR, &pctx);
1065 pctx.errcode = e2fsck_rehash_dir(ctx, ino, &pctx);
1067 end_problem_latch(ctx, PR_LATCH_OPTIMIZE_DIR);
1068 fix_problem(ctx, PR_3A_OPTIMIZE_DIR_ERR, &pctx);
1070 if (ctx->progress && !ctx->progress_fd)
1071 e2fsck_simple_progress(ctx, "Rebuilding directory",
1072 100.0 * (float) (++cur) / (float) max, ino);
1074 end_problem_latch(ctx, PR_LATCH_OPTIMIZE_DIR);
1076 e2fsck_dir_info_iter_end(ctx, dirinfo_iter);
1078 ext2fs_u32_list_iterate_end(iter);
1080 if (ctx->dirs_to_hash)
1081 ext2fs_u32_list_free(ctx->dirs_to_hash);
1082 ctx->dirs_to_hash = 0;
1084 print_resource_track(ctx, "Pass 3A", &rtrack, ctx->fs->io);