]>
Commit | Line | Data |
---|---|---|
b7a00563 TT |
1 | /* |
2 | * rehash.c --- rebuild hash tree directories | |
efc6f628 | 3 | * |
b7a00563 TT |
4 | * Copyright (C) 2002 Theodore Ts'o |
5 | * | |
6 | * %Begin-Header% | |
7 | * This file may be redistributed under the terms of the GNU Public | |
8 | * License. | |
9 | * %End-Header% | |
efc6f628 | 10 | * |
b7a00563 TT |
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. | |
17 | * | |
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 | |
32 | * the new tree: | |
33 | * | |
34 | * -------------------------------------------------------- | |
35 | * | new tree | | old tree | | |
36 | * -------------------------------------------------------- | |
37 | * ^ ptr ^ptr | |
38 | * tail new head old | |
efc6f628 | 39 | * |
b7a00563 TT |
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. | |
46 | */ | |
47 | ||
d1154eb4 | 48 | #include "config.h" |
520ead37 TT |
49 | #include <string.h> |
50 | #include <ctype.h> | |
b7a00563 TT |
51 | #include <errno.h> |
52 | #include "e2fsck.h" | |
53 | #include "problem.h" | |
54 | ||
55 | struct fill_dir_struct { | |
56 | char *buf; | |
57 | struct ext2_inode *inode; | |
58 | int err; | |
59 | e2fsck_t ctx; | |
60 | struct hash_entry *harray; | |
61 | int max_array, num_array; | |
62 | int dir_size; | |
850d05e9 | 63 | int compress; |
b7a00563 TT |
64 | ino_t parent; |
65 | }; | |
66 | ||
67 | struct hash_entry { | |
68 | ext2_dirhash_t hash; | |
69 | ext2_dirhash_t minor_hash; | |
d66c3832 | 70 | ino_t ino; |
b7a00563 TT |
71 | struct ext2_dir_entry *dir; |
72 | }; | |
73 | ||
74 | struct out_dir { | |
75 | int num; | |
76 | int max; | |
77 | char *buf; | |
78 | ext2_dirhash_t *hashes; | |
79 | }; | |
80 | ||
81 | static int fill_dir_block(ext2_filsys fs, | |
6dc64392 | 82 | blk64_t *block_nr, |
b7a00563 | 83 | e2_blkcnt_t blockcnt, |
6dc64392 | 84 | blk64_t ref_block EXT2FS_ATTR((unused)), |
54434927 | 85 | int ref_offset EXT2FS_ATTR((unused)), |
b7a00563 TT |
86 | void *priv_data) |
87 | { | |
88 | struct fill_dir_struct *fd = (struct fill_dir_struct *) priv_data; | |
89 | struct hash_entry *new_array, *ent; | |
90 | struct ext2_dir_entry *dirent; | |
91 | char *dir; | |
8a480350 TT |
92 | unsigned int offset, dir_offset, rec_len; |
93 | int hash_alg; | |
efc6f628 | 94 | |
b7a00563 TT |
95 | if (blockcnt < 0) |
96 | return 0; | |
97 | ||
98 | offset = blockcnt * fs->blocksize; | |
99 | if (offset + fs->blocksize > fd->inode->i_size) { | |
100 | fd->err = EXT2_ET_DIR_CORRUPTED; | |
101 | return BLOCK_ABORT; | |
102 | } | |
103 | dir = (fd->buf+offset); | |
104 | if (HOLE_BLKADDR(*block_nr)) { | |
105 | memset(dir, 0, fs->blocksize); | |
106 | dirent = (struct ext2_dir_entry *) dir; | |
8a480350 | 107 | (void) ext2fs_set_rec_len(fs, fs->blocksize, dirent); |
b7a00563 | 108 | } else { |
6dc64392 | 109 | fd->err = ext2fs_read_dir_block3(fs, *block_nr, dir, 0); |
b7a00563 TT |
110 | if (fd->err) |
111 | return BLOCK_ABORT; | |
112 | } | |
f77704e4 TT |
113 | hash_alg = fs->super->s_def_hash_version; |
114 | if ((hash_alg <= EXT2_HASH_TEA) && | |
115 | (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH)) | |
116 | hash_alg += 3; | |
b7a00563 TT |
117 | /* While the directory block is "hot", index it. */ |
118 | dir_offset = 0; | |
119 | while (dir_offset < fs->blocksize) { | |
120 | dirent = (struct ext2_dir_entry *) (dir + dir_offset); | |
8a480350 | 121 | (void) ext2fs_get_rec_len(fs, dirent, &rec_len); |
5dd77dbe TT |
122 | if (((dir_offset + rec_len) > fs->blocksize) || |
123 | (rec_len < 8) || | |
124 | ((rec_len % 4) != 0) || | |
125 | (((dirent->name_len & 0xFF)+8) > rec_len)) { | |
b7a00563 TT |
126 | fd->err = EXT2_ET_DIR_CORRUPTED; |
127 | return BLOCK_ABORT; | |
128 | } | |
5dd77dbe | 129 | dir_offset += rec_len; |
b7a00563 | 130 | if (dirent->inode == 0) |
850d05e9 TT |
131 | continue; |
132 | if (!fd->compress && ((dirent->name_len&0xFF) == 1) && | |
133 | (dirent->name[0] == '.')) | |
134 | continue; | |
135 | if (!fd->compress && ((dirent->name_len&0xFF) == 2) && | |
b7a00563 TT |
136 | (dirent->name[0] == '.') && (dirent->name[1] == '.')) { |
137 | fd->parent = dirent->inode; | |
850d05e9 | 138 | continue; |
b7a00563 TT |
139 | } |
140 | if (fd->num_array >= fd->max_array) { | |
141 | new_array = realloc(fd->harray, | |
142 | sizeof(struct hash_entry) * (fd->max_array+500)); | |
143 | if (!new_array) { | |
144 | fd->err = ENOMEM; | |
145 | return BLOCK_ABORT; | |
146 | } | |
147 | fd->harray = new_array; | |
148 | fd->max_array += 500; | |
149 | } | |
850d05e9 | 150 | ent = fd->harray + fd->num_array++; |
b7a00563 | 151 | ent->dir = dirent; |
b7a00563 | 152 | fd->dir_size += EXT2_DIR_REC_LEN(dirent->name_len & 0xFF); |
d66c3832 | 153 | ent->ino = dirent->inode; |
850d05e9 TT |
154 | if (fd->compress) |
155 | ent->hash = ent->minor_hash = 0; | |
156 | else { | |
f77704e4 | 157 | fd->err = ext2fs_dirhash(hash_alg, dirent->name, |
850d05e9 TT |
158 | dirent->name_len & 0xFF, |
159 | fs->super->s_hash_seed, | |
160 | &ent->hash, &ent->minor_hash); | |
161 | if (fd->err) | |
162 | return BLOCK_ABORT; | |
163 | } | |
b7a00563 | 164 | } |
efc6f628 | 165 | |
b7a00563 TT |
166 | return 0; |
167 | } | |
168 | ||
d66c3832 TT |
169 | /* Used for sorting the hash entry */ |
170 | static EXT2_QSORT_TYPE ino_cmp(const void *a, const void *b) | |
171 | { | |
172 | const struct hash_entry *he_a = (const struct hash_entry *) a; | |
173 | const struct hash_entry *he_b = (const struct hash_entry *) b; | |
174 | ||
175 | return (he_a->ino - he_b->ino); | |
176 | } | |
177 | ||
b7a00563 | 178 | /* Used for sorting the hash entry */ |
b0700a1b | 179 | static EXT2_QSORT_TYPE name_cmp(const void *a, const void *b) |
b7a00563 TT |
180 | { |
181 | const struct hash_entry *he_a = (const struct hash_entry *) a; | |
182 | const struct hash_entry *he_b = (const struct hash_entry *) b; | |
183 | int ret; | |
b0700a1b TT |
184 | int min_len; |
185 | ||
186 | min_len = he_a->dir->name_len; | |
187 | if (min_len > he_b->dir->name_len) | |
188 | min_len = he_b->dir->name_len; | |
189 | ||
190 | ret = strncmp(he_a->dir->name, he_b->dir->name, min_len); | |
191 | if (ret == 0) { | |
192 | if (he_a->dir->name_len > he_b->dir->name_len) | |
b7a00563 | 193 | ret = 1; |
b0700a1b | 194 | else if (he_a->dir->name_len < he_b->dir->name_len) |
b7a00563 TT |
195 | ret = -1; |
196 | else | |
12dd69f5 | 197 | ret = he_b->dir->inode - he_a->dir->inode; |
b7a00563 TT |
198 | } |
199 | return ret; | |
200 | } | |
201 | ||
850d05e9 | 202 | /* Used for sorting the hash entry */ |
b0700a1b | 203 | static EXT2_QSORT_TYPE hash_cmp(const void *a, const void *b) |
850d05e9 TT |
204 | { |
205 | const struct hash_entry *he_a = (const struct hash_entry *) a; | |
206 | const struct hash_entry *he_b = (const struct hash_entry *) b; | |
207 | int ret; | |
efc6f628 | 208 | |
b0700a1b TT |
209 | if (he_a->hash > he_b->hash) |
210 | ret = 1; | |
211 | else if (he_a->hash < he_b->hash) | |
212 | ret = -1; | |
213 | else { | |
214 | if (he_a->minor_hash > he_b->minor_hash) | |
850d05e9 | 215 | ret = 1; |
b0700a1b | 216 | else if (he_a->minor_hash < he_b->minor_hash) |
850d05e9 TT |
217 | ret = -1; |
218 | else | |
b0700a1b | 219 | ret = name_cmp(a, b); |
850d05e9 TT |
220 | } |
221 | return ret; | |
222 | } | |
223 | ||
efc6f628 | 224 | static errcode_t alloc_size_dir(ext2_filsys fs, struct out_dir *outdir, |
b7a00563 TT |
225 | int blocks) |
226 | { | |
227 | void *new_mem; | |
228 | ||
229 | if (outdir->max) { | |
230 | new_mem = realloc(outdir->buf, blocks * fs->blocksize); | |
231 | if (!new_mem) | |
232 | return ENOMEM; | |
233 | outdir->buf = new_mem; | |
234 | new_mem = realloc(outdir->hashes, | |
235 | blocks * sizeof(ext2_dirhash_t)); | |
236 | if (!new_mem) | |
237 | return ENOMEM; | |
238 | outdir->hashes = new_mem; | |
239 | } else { | |
240 | outdir->buf = malloc(blocks * fs->blocksize); | |
241 | outdir->hashes = malloc(blocks * sizeof(ext2_dirhash_t)); | |
242 | outdir->num = 0; | |
243 | } | |
244 | outdir->max = blocks; | |
245 | return 0; | |
246 | } | |
247 | ||
248 | static void free_out_dir(struct out_dir *outdir) | |
249 | { | |
45e338f5 JM |
250 | free(outdir->buf); |
251 | free(outdir->hashes); | |
b7a00563 TT |
252 | outdir->max = 0; |
253 | outdir->num =0; | |
254 | } | |
255 | ||
850d05e9 | 256 | static errcode_t get_next_block(ext2_filsys fs, struct out_dir *outdir, |
b7a00563 TT |
257 | char ** ret) |
258 | { | |
259 | errcode_t retval; | |
260 | ||
261 | if (outdir->num >= outdir->max) { | |
262 | retval = alloc_size_dir(fs, outdir, outdir->max + 50); | |
263 | if (retval) | |
264 | return retval; | |
265 | } | |
266 | *ret = outdir->buf + (outdir->num++ * fs->blocksize); | |
850d05e9 | 267 | memset(*ret, 0, fs->blocksize); |
b7a00563 TT |
268 | return 0; |
269 | } | |
270 | ||
b0700a1b TT |
271 | /* |
272 | * This function is used to make a unique filename. We do this by | |
273 | * appending ~0, and then incrementing the number. However, we cannot | |
274 | * expand the length of the filename beyond the padding available in | |
275 | * the directory entry. | |
276 | */ | |
277 | static void mutate_name(char *str, __u16 *len) | |
278 | { | |
279 | int i; | |
280 | __u16 l = *len & 0xFF, h = *len & 0xff00; | |
efc6f628 | 281 | |
b0700a1b TT |
282 | /* |
283 | * First check to see if it looks the name has been mutated | |
284 | * already | |
285 | */ | |
286 | for (i = l-1; i > 0; i--) { | |
287 | if (!isdigit(str[i])) | |
288 | break; | |
289 | } | |
290 | if ((i == l-1) || (str[i] != '~')) { | |
291 | if (((l-1) & 3) < 2) | |
292 | l += 2; | |
293 | else | |
294 | l = (l+3) & ~3; | |
295 | str[l-2] = '~'; | |
296 | str[l-1] = '0'; | |
297 | *len = l | h; | |
298 | return; | |
299 | } | |
300 | for (i = l-1; i >= 0; i--) { | |
301 | if (isdigit(str[i])) { | |
302 | if (str[i] == '9') | |
303 | str[i] = '0'; | |
304 | else { | |
305 | str[i]++; | |
306 | return; | |
307 | } | |
308 | continue; | |
309 | } | |
310 | if (i == 1) { | |
311 | if (str[0] == 'z') | |
312 | str[0] = 'A'; | |
313 | else if (str[0] == 'Z') { | |
314 | str[0] = '~'; | |
315 | str[1] = '0'; | |
316 | } else | |
317 | str[0]++; | |
318 | } else if (i > 0) { | |
319 | str[i] = '1'; | |
320 | str[i-1] = '~'; | |
321 | } else { | |
322 | if (str[0] == '~') | |
323 | str[0] = 'a'; | |
efc6f628 | 324 | else |
b0700a1b TT |
325 | str[0]++; |
326 | } | |
327 | break; | |
328 | } | |
329 | } | |
330 | ||
331 | static int duplicate_search_and_fix(e2fsck_t ctx, ext2_filsys fs, | |
332 | ext2_ino_t ino, | |
333 | struct fill_dir_struct *fd) | |
334 | { | |
335 | struct problem_context pctx; | |
336 | struct hash_entry *ent, *prev; | |
337 | int i, j; | |
338 | int fixed = 0; | |
339 | char new_name[256]; | |
340 | __u16 new_len; | |
f77704e4 | 341 | int hash_alg; |
efc6f628 | 342 | |
b0700a1b TT |
343 | clear_problem_context(&pctx); |
344 | pctx.ino = ino; | |
345 | ||
f77704e4 TT |
346 | hash_alg = fs->super->s_def_hash_version; |
347 | if ((hash_alg <= EXT2_HASH_TEA) && | |
348 | (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH)) | |
349 | hash_alg += 3; | |
350 | ||
b0700a1b TT |
351 | for (i=1; i < fd->num_array; i++) { |
352 | ent = fd->harray + i; | |
353 | prev = ent - 1; | |
354 | if (!ent->dir->inode || | |
355 | ((ent->dir->name_len & 0xFF) != | |
356 | (prev->dir->name_len & 0xFF)) || | |
357 | (strncmp(ent->dir->name, prev->dir->name, | |
358 | ent->dir->name_len & 0xFF))) | |
359 | continue; | |
360 | pctx.dirent = ent->dir; | |
361 | if ((ent->dir->inode == prev->dir->inode) && | |
362 | fix_problem(ctx, PR_2_DUPLICATE_DIRENT, &pctx)) { | |
363 | e2fsck_adjust_inode_count(ctx, ent->dir->inode, -1); | |
364 | ent->dir->inode = 0; | |
365 | fixed++; | |
366 | continue; | |
367 | } | |
368 | memcpy(new_name, ent->dir->name, ent->dir->name_len & 0xFF); | |
369 | new_len = ent->dir->name_len; | |
370 | mutate_name(new_name, &new_len); | |
371 | for (j=0; j < fd->num_array; j++) { | |
372 | if ((i==j) || | |
32d4eb2b | 373 | ((new_len & 0xFF) != |
b0700a1b TT |
374 | (fd->harray[j].dir->name_len & 0xFF)) || |
375 | (strncmp(new_name, fd->harray[j].dir->name, | |
376 | new_len & 0xFF))) | |
377 | continue; | |
378 | mutate_name(new_name, &new_len); | |
efc6f628 | 379 | |
b0700a1b TT |
380 | j = -1; |
381 | } | |
382 | new_name[new_len & 0xFF] = 0; | |
383 | pctx.str = new_name; | |
384 | if (fix_problem(ctx, PR_2_NON_UNIQUE_FILE, &pctx)) { | |
385 | memcpy(ent->dir->name, new_name, new_len & 0xFF); | |
386 | ent->dir->name_len = new_len; | |
f77704e4 | 387 | ext2fs_dirhash(hash_alg, ent->dir->name, |
b0700a1b TT |
388 | ent->dir->name_len & 0xFF, |
389 | fs->super->s_hash_seed, | |
390 | &ent->hash, &ent->minor_hash); | |
391 | fixed++; | |
392 | } | |
393 | } | |
394 | return fixed; | |
395 | } | |
396 | ||
b7a00563 | 397 | |
7dca4c88 | 398 | static errcode_t copy_dir_entries(e2fsck_t ctx, |
850d05e9 TT |
399 | struct fill_dir_struct *fd, |
400 | struct out_dir *outdir) | |
401 | { | |
7dca4c88 | 402 | ext2_filsys fs = ctx->fs; |
850d05e9 TT |
403 | errcode_t retval; |
404 | char *block_start; | |
405 | struct hash_entry *ent; | |
406 | struct ext2_dir_entry *dirent; | |
8a480350 TT |
407 | unsigned int rec_len, prev_rec_len; |
408 | int i, left; | |
850d05e9 | 409 | ext2_dirhash_t prev_hash; |
7dca4c88 TT |
410 | int offset, slack; |
411 | ||
412 | if (ctx->htree_slack_percentage == 255) { | |
413 | profile_get_uint(ctx->profile, "options", | |
414 | "indexed_dir_slack_percentage", | |
415 | 0, 20, | |
416 | &ctx->htree_slack_percentage); | |
417 | if (ctx->htree_slack_percentage > 100) | |
418 | ctx->htree_slack_percentage = 20; | |
419 | } | |
efc6f628 | 420 | |
850d05e9 TT |
421 | outdir->max = 0; |
422 | retval = alloc_size_dir(fs, outdir, | |
423 | (fd->dir_size / fs->blocksize) + 2); | |
424 | if (retval) | |
425 | return retval; | |
426 | outdir->num = fd->compress ? 0 : 1; | |
427 | offset = 0; | |
428 | outdir->hashes[0] = 0; | |
429 | prev_hash = 1; | |
430 | if ((retval = get_next_block(fs, outdir, &block_start))) | |
431 | return retval; | |
432 | dirent = (struct ext2_dir_entry *) block_start; | |
8a480350 | 433 | prev_rec_len = 0; |
cf5301d7 | 434 | rec_len = 0; |
850d05e9 | 435 | left = fs->blocksize; |
7dca4c88 TT |
436 | slack = fd->compress ? 12 : |
437 | (fs->blocksize * ctx->htree_slack_percentage)/100; | |
438 | if (slack < 12) | |
439 | slack = 12; | |
cf5301d7 | 440 | for (i = 0; i < fd->num_array; i++) { |
850d05e9 | 441 | ent = fd->harray + i; |
b0700a1b TT |
442 | if (ent->dir->inode == 0) |
443 | continue; | |
850d05e9 | 444 | rec_len = EXT2_DIR_REC_LEN(ent->dir->name_len & 0xFF); |
850d05e9 | 445 | if (rec_len > left) { |
8a480350 TT |
446 | if (left) { |
447 | left += prev_rec_len; | |
448 | retval = ext2fs_set_rec_len(fs, left, dirent); | |
449 | if (retval) | |
450 | return retval; | |
451 | } | |
850d05e9 TT |
452 | if ((retval = get_next_block(fs, outdir, |
453 | &block_start))) | |
454 | return retval; | |
fe5b72d1 | 455 | offset = 0; |
850d05e9 | 456 | } |
fe5b72d1 TT |
457 | left = fs->blocksize - offset; |
458 | dirent = (struct ext2_dir_entry *) (block_start + offset); | |
850d05e9 TT |
459 | if (offset == 0) { |
460 | if (ent->hash == prev_hash) | |
461 | outdir->hashes[outdir->num-1] = ent->hash | 1; | |
462 | else | |
463 | outdir->hashes[outdir->num-1] = ent->hash; | |
464 | } | |
465 | dirent->inode = ent->dir->inode; | |
466 | dirent->name_len = ent->dir->name_len; | |
8a480350 TT |
467 | retval = ext2fs_set_rec_len(fs, rec_len, dirent); |
468 | if (retval) | |
469 | return retval; | |
470 | prev_rec_len = rec_len; | |
850d05e9 TT |
471 | memcpy(dirent->name, ent->dir->name, dirent->name_len & 0xFF); |
472 | offset += rec_len; | |
473 | left -= rec_len; | |
7dca4c88 | 474 | if (left < slack) { |
8a480350 TT |
475 | prev_rec_len += left; |
476 | retval = ext2fs_set_rec_len(fs, prev_rec_len, dirent); | |
477 | if (retval) | |
478 | return retval; | |
850d05e9 | 479 | offset += left; |
cf3909ed | 480 | left = 0; |
850d05e9 TT |
481 | } |
482 | prev_hash = ent->hash; | |
483 | } | |
484 | if (left) | |
8a480350 | 485 | retval = ext2fs_set_rec_len(fs, rec_len + left, dirent); |
850d05e9 | 486 | |
8a480350 | 487 | return retval; |
850d05e9 TT |
488 | } |
489 | ||
490 | ||
491 | static struct ext2_dx_root_info *set_root_node(ext2_filsys fs, char *buf, | |
b7a00563 TT |
492 | ext2_ino_t ino, ext2_ino_t parent) |
493 | { | |
494 | struct ext2_dir_entry *dir; | |
495 | struct ext2_dx_root_info *root; | |
496 | struct ext2_dx_countlimit *limits; | |
850d05e9 | 497 | int filetype = 0; |
b7a00563 TT |
498 | |
499 | if (fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_FILETYPE) | |
500 | filetype = EXT2_FT_DIR << 8; | |
efc6f628 | 501 | |
b7a00563 TT |
502 | memset(buf, 0, fs->blocksize); |
503 | dir = (struct ext2_dir_entry *) buf; | |
504 | dir->inode = ino; | |
505 | dir->name[0] = '.'; | |
506 | dir->name_len = 1 | filetype; | |
507 | dir->rec_len = 12; | |
508 | dir = (struct ext2_dir_entry *) (buf + 12); | |
509 | dir->inode = parent; | |
510 | dir->name[0] = '.'; | |
511 | dir->name[1] = '.'; | |
512 | dir->name_len = 2 | filetype; | |
513 | dir->rec_len = fs->blocksize - 12; | |
efc6f628 | 514 | |
b7a00563 TT |
515 | root = (struct ext2_dx_root_info *) (buf+24); |
516 | root->reserved_zero = 0; | |
517 | root->hash_version = fs->super->s_def_hash_version; | |
518 | root->info_length = 8; | |
519 | root->indirect_levels = 0; | |
520 | root->unused_flags = 0; | |
521 | ||
522 | limits = (struct ext2_dx_countlimit *) (buf+32); | |
523 | limits->limit = (fs->blocksize - 32) / sizeof(struct ext2_dx_entry); | |
524 | limits->count = 0; | |
525 | ||
526 | return root; | |
527 | } | |
528 | ||
529 | ||
850d05e9 | 530 | static struct ext2_dx_entry *set_int_node(ext2_filsys fs, char *buf) |
b7a00563 TT |
531 | { |
532 | struct ext2_dir_entry *dir; | |
533 | struct ext2_dx_countlimit *limits; | |
534 | ||
535 | memset(buf, 0, fs->blocksize); | |
536 | dir = (struct ext2_dir_entry *) buf; | |
537 | dir->inode = 0; | |
8a480350 | 538 | (void) ext2fs_set_rec_len(fs, fs->blocksize, dir); |
efc6f628 | 539 | |
b7a00563 TT |
540 | limits = (struct ext2_dx_countlimit *) (buf+8); |
541 | limits->limit = (fs->blocksize - 8) / sizeof(struct ext2_dx_entry); | |
542 | limits->count = 0; | |
543 | ||
544 | return (struct ext2_dx_entry *) limits; | |
545 | } | |
546 | ||
850d05e9 TT |
547 | /* |
548 | * This function takes the leaf nodes which have been written in | |
549 | * outdir, and populates the root node and any necessary interior nodes. | |
550 | */ | |
551 | static errcode_t calculate_tree(ext2_filsys fs, | |
552 | struct out_dir *outdir, | |
553 | ext2_ino_t ino, | |
554 | ext2_ino_t parent) | |
555 | { | |
556 | struct ext2_dx_root_info *root_info; | |
557 | struct ext2_dx_entry *root, *dx_ent = 0; | |
558 | struct ext2_dx_countlimit *root_limit, *limit; | |
559 | errcode_t retval; | |
560 | char * block_start; | |
561 | int i, c1, c2, nblks; | |
562 | int limit_offset, root_offset; | |
efc6f628 | 563 | |
850d05e9 TT |
564 | root_info = set_root_node(fs, outdir->buf, ino, parent); |
565 | root_offset = limit_offset = ((char *) root_info - outdir->buf) + | |
566 | root_info->info_length; | |
567 | root_limit = (struct ext2_dx_countlimit *) (outdir->buf + limit_offset); | |
568 | c1 = root_limit->limit; | |
569 | nblks = outdir->num; | |
570 | ||
571 | /* Write out the pointer blocks */ | |
572 | if (nblks-1 <= c1) { | |
573 | /* Just write out the root block, and we're done */ | |
574 | root = (struct ext2_dx_entry *) (outdir->buf + root_offset); | |
575 | for (i=1; i < nblks; i++) { | |
576 | root->block = ext2fs_cpu_to_le32(i); | |
577 | if (i != 1) | |
578 | root->hash = | |
579 | ext2fs_cpu_to_le32(outdir->hashes[i]); | |
580 | root++; | |
581 | c1--; | |
582 | } | |
583 | } else { | |
584 | c2 = 0; | |
585 | limit = 0; | |
586 | root_info->indirect_levels = 1; | |
587 | for (i=1; i < nblks; i++) { | |
588 | if (c1 == 0) | |
589 | return ENOSPC; | |
590 | if (c2 == 0) { | |
591 | if (limit) | |
efc6f628 | 592 | limit->limit = limit->count = |
850d05e9 TT |
593 | ext2fs_cpu_to_le16(limit->limit); |
594 | root = (struct ext2_dx_entry *) | |
595 | (outdir->buf + root_offset); | |
596 | root->block = ext2fs_cpu_to_le32(outdir->num); | |
597 | if (i != 1) | |
598 | root->hash = | |
599 | ext2fs_cpu_to_le32(outdir->hashes[i]); | |
600 | if ((retval = get_next_block(fs, outdir, | |
601 | &block_start))) | |
602 | return retval; | |
603 | dx_ent = set_int_node(fs, block_start); | |
604 | limit = (struct ext2_dx_countlimit *) dx_ent; | |
605 | c2 = limit->limit; | |
606 | root_offset += sizeof(struct ext2_dx_entry); | |
607 | c1--; | |
608 | } | |
609 | dx_ent->block = ext2fs_cpu_to_le32(i); | |
610 | if (c2 != limit->limit) | |
611 | dx_ent->hash = | |
612 | ext2fs_cpu_to_le32(outdir->hashes[i]); | |
613 | dx_ent++; | |
614 | c2--; | |
615 | } | |
616 | limit->count = ext2fs_cpu_to_le16(limit->limit - c2); | |
617 | limit->limit = ext2fs_cpu_to_le16(limit->limit); | |
618 | } | |
619 | root_limit = (struct ext2_dx_countlimit *) (outdir->buf + limit_offset); | |
620 | root_limit->count = ext2fs_cpu_to_le16(root_limit->limit - c1); | |
621 | root_limit->limit = ext2fs_cpu_to_le16(root_limit->limit); | |
622 | ||
623 | return 0; | |
624 | } | |
b7a00563 TT |
625 | |
626 | struct write_dir_struct { | |
627 | struct out_dir *outdir; | |
628 | errcode_t err; | |
629 | e2fsck_t ctx; | |
630 | int cleared; | |
631 | }; | |
632 | ||
633 | /* | |
850d05e9 | 634 | * Helper function which writes out a directory block. |
b7a00563 TT |
635 | */ |
636 | static int write_dir_block(ext2_filsys fs, | |
6dc64392 | 637 | blk64_t *block_nr, |
b7a00563 | 638 | e2_blkcnt_t blockcnt, |
6dc64392 | 639 | blk64_t ref_block EXT2FS_ATTR((unused)), |
efc6f628 | 640 | int ref_offset EXT2FS_ATTR((unused)), |
b7a00563 TT |
641 | void *priv_data) |
642 | { | |
643 | struct write_dir_struct *wd = (struct write_dir_struct *) priv_data; | |
6dc64392 | 644 | blk64_t blk; |
b7a00563 | 645 | char *dir; |
b7a00563 TT |
646 | |
647 | if (*block_nr == 0) | |
648 | return 0; | |
649 | if (blockcnt >= wd->outdir->num) { | |
650 | e2fsck_read_bitmaps(wd->ctx); | |
651 | blk = *block_nr; | |
c5d2f50d | 652 | ext2fs_unmark_block_bitmap2(wd->ctx->block_found_map, blk); |
48f23054 | 653 | ext2fs_block_alloc_stats2(fs, blk, -1); |
b7a00563 TT |
654 | *block_nr = 0; |
655 | wd->cleared++; | |
656 | return BLOCK_CHANGED; | |
657 | } | |
658 | if (blockcnt < 0) | |
659 | return 0; | |
660 | ||
661 | dir = wd->outdir->buf + (blockcnt * fs->blocksize); | |
6dc64392 | 662 | wd->err = ext2fs_write_dir_block3(fs, *block_nr, dir, 0); |
b7a00563 TT |
663 | if (wd->err) |
664 | return BLOCK_ABORT; | |
665 | return 0; | |
666 | } | |
667 | ||
b7a00563 | 668 | static errcode_t write_directory(e2fsck_t ctx, ext2_filsys fs, |
850d05e9 TT |
669 | struct out_dir *outdir, |
670 | ext2_ino_t ino, int compress) | |
b7a00563 TT |
671 | { |
672 | struct write_dir_struct wd; | |
673 | errcode_t retval; | |
674 | struct ext2_inode inode; | |
675 | ||
676 | retval = e2fsck_expand_directory(ctx, ino, -1, outdir->num); | |
677 | if (retval) | |
678 | return retval; | |
679 | ||
680 | wd.outdir = outdir; | |
681 | wd.err = 0; | |
682 | wd.ctx = ctx; | |
683 | wd.cleared = 0; | |
684 | ||
6dc64392 | 685 | retval = ext2fs_block_iterate3(fs, ino, 0, 0, |
b7a00563 TT |
686 | write_dir_block, &wd); |
687 | if (retval) | |
688 | return retval; | |
689 | if (wd.err) | |
690 | return wd.err; | |
691 | ||
692 | e2fsck_read_inode(ctx, ino, &inode, "rehash_dir"); | |
e70ae99e TT |
693 | if (compress) |
694 | inode.i_flags &= ~EXT2_INDEX_FL; | |
695 | else | |
850d05e9 | 696 | inode.i_flags |= EXT2_INDEX_FL; |
b7a00563 | 697 | inode.i_size = outdir->num * fs->blocksize; |
1ca1059f | 698 | ext2fs_iblk_sub_blocks(fs, &inode, wd.cleared); |
b7a00563 TT |
699 | e2fsck_write_inode(ctx, ino, &inode, "rehash_dir"); |
700 | ||
701 | return 0; | |
702 | } | |
703 | ||
704 | errcode_t e2fsck_rehash_dir(e2fsck_t ctx, ext2_ino_t ino) | |
705 | { | |
706 | ext2_filsys fs = ctx->fs; | |
707 | errcode_t retval; | |
708 | struct ext2_inode inode; | |
850d05e9 | 709 | char *dir_buf = 0; |
b7a00563 | 710 | struct fill_dir_struct fd; |
b7a00563 | 711 | struct out_dir outdir; |
efc6f628 | 712 | |
1d2eef42 TT |
713 | outdir.max = outdir.num = 0; |
714 | outdir.buf = 0; | |
715 | outdir.hashes = 0; | |
b7a00563 | 716 | e2fsck_read_inode(ctx, ino, &inode, "rehash_dir"); |
b7a00563 TT |
717 | |
718 | retval = ENOMEM; | |
719 | fd.harray = 0; | |
720 | dir_buf = malloc(inode.i_size); | |
721 | if (!dir_buf) | |
722 | goto errout; | |
723 | ||
724 | fd.max_array = inode.i_size / 32; | |
725 | fd.num_array = 0; | |
726 | fd.harray = malloc(fd.max_array * sizeof(struct hash_entry)); | |
727 | if (!fd.harray) | |
728 | goto errout; | |
729 | ||
730 | fd.ctx = ctx; | |
731 | fd.buf = dir_buf; | |
732 | fd.inode = &inode; | |
733 | fd.err = 0; | |
734 | fd.dir_size = 0; | |
850d05e9 TT |
735 | fd.compress = 0; |
736 | if (!(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX) || | |
e70ae99e | 737 | (inode.i_size / fs->blocksize) < 2) |
850d05e9 | 738 | fd.compress = 1; |
b7a00563 TT |
739 | fd.parent = 0; |
740 | ||
f4e14505 | 741 | retry_nohash: |
b7a00563 | 742 | /* Read in the entire directory into memory */ |
6dc64392 | 743 | retval = ext2fs_block_iterate3(fs, ino, 0, 0, |
b7a00563 TT |
744 | fill_dir_block, &fd); |
745 | if (fd.err) { | |
746 | retval = fd.err; | |
747 | goto errout; | |
748 | } | |
749 | ||
f4e14505 TT |
750 | /* |
751 | * If the entries read are less than a block, then don't index | |
752 | * the directory | |
753 | */ | |
754 | if (!fd.compress && (fd.dir_size < (fs->blocksize - 24))) { | |
755 | fd.compress = 1; | |
756 | fd.dir_size = 0; | |
757 | fd.num_array = 0; | |
758 | goto retry_nohash; | |
759 | } | |
760 | ||
b7a00563 TT |
761 | #if 0 |
762 | printf("%d entries (%d bytes) found in inode %d\n", | |
763 | fd.num_array, fd.dir_size, ino); | |
764 | #endif | |
765 | ||
850d05e9 | 766 | /* Sort the list */ |
b0700a1b | 767 | resort: |
53fbfb2b TT |
768 | if (fd.compress) |
769 | qsort(fd.harray+2, fd.num_array-2, sizeof(struct hash_entry), | |
770 | hash_cmp); | |
771 | else | |
772 | qsort(fd.harray, fd.num_array, sizeof(struct hash_entry), | |
773 | hash_cmp); | |
850d05e9 | 774 | |
b0700a1b TT |
775 | /* |
776 | * Look for duplicates | |
777 | */ | |
778 | if (duplicate_search_and_fix(ctx, fs, ino, &fd)) | |
779 | goto resort; | |
780 | ||
1d2eef42 TT |
781 | if (ctx->options & E2F_OPT_NO) { |
782 | retval = 0; | |
783 | goto errout; | |
784 | } | |
785 | ||
b71e0183 TT |
786 | /* Sort non-hashed directories by inode number */ |
787 | if (fd.compress) | |
788 | qsort(fd.harray+2, fd.num_array-2, | |
789 | sizeof(struct hash_entry), ino_cmp); | |
790 | ||
850d05e9 TT |
791 | /* |
792 | * Copy the directory entries. In a htree directory these | |
793 | * will become the leaf nodes. | |
794 | */ | |
7dca4c88 | 795 | retval = copy_dir_entries(ctx, &fd, &outdir); |
b7a00563 TT |
796 | if (retval) |
797 | goto errout; | |
efc6f628 | 798 | |
b7a00563 TT |
799 | free(dir_buf); dir_buf = 0; |
800 | ||
850d05e9 TT |
801 | if (!fd.compress) { |
802 | /* Calculate the interior nodes */ | |
803 | retval = calculate_tree(fs, &outdir, ino, fd.parent); | |
804 | if (retval) | |
805 | goto errout; | |
b7a00563 | 806 | } |
efc6f628 | 807 | |
850d05e9 | 808 | retval = write_directory(ctx, fs, &outdir, ino, fd.compress); |
b7a00563 TT |
809 | if (retval) |
810 | goto errout; | |
811 | ||
812 | errout: | |
45e338f5 JM |
813 | free(dir_buf); |
814 | free(fd.harray); | |
850d05e9 | 815 | |
b7a00563 TT |
816 | free_out_dir(&outdir); |
817 | return retval; | |
818 | } | |
819 | ||
820 | void e2fsck_rehash_directories(e2fsck_t ctx) | |
821 | { | |
b7a00563 | 822 | struct problem_context pctx; |
850d05e9 TT |
823 | #ifdef RESOURCE_TRACK |
824 | struct resource_track rtrack; | |
825 | #endif | |
826 | struct dir_info *dir; | |
827 | ext2_u32_iterate iter; | |
28db82a8 | 828 | struct dir_info_iter * dirinfo_iter = 0; |
850d05e9 TT |
829 | ext2_ino_t ino; |
830 | errcode_t retval; | |
e3507739 | 831 | int cur, max, all_dirs, first = 1; |
850d05e9 | 832 | |
6d96b00d | 833 | init_resource_track(&rtrack, ctx->fs->io); |
850d05e9 TT |
834 | all_dirs = ctx->options & E2F_OPT_COMPRESS_DIRS; |
835 | ||
836 | if (!ctx->dirs_to_hash && !all_dirs) | |
b7a00563 TT |
837 | return; |
838 | ||
850d05e9 | 839 | e2fsck_get_lost_and_found(ctx, 0); |
efc6f628 | 840 | |
b7a00563 | 841 | clear_problem_context(&pctx); |
850d05e9 | 842 | |
b0700a1b TT |
843 | cur = 0; |
844 | if (all_dirs) { | |
28db82a8 | 845 | dirinfo_iter = e2fsck_dir_info_iter_begin(ctx); |
b0700a1b TT |
846 | max = e2fsck_get_num_dirinfo(ctx); |
847 | } else { | |
efc6f628 | 848 | retval = ext2fs_u32_list_iterate_begin(ctx->dirs_to_hash, |
850d05e9 TT |
849 | &iter); |
850 | if (retval) { | |
851 | pctx.errcode = retval; | |
852 | fix_problem(ctx, PR_3A_OPTIMIZE_ITER, &pctx); | |
853 | return; | |
854 | } | |
b0700a1b | 855 | max = ext2fs_u32_list_count(ctx->dirs_to_hash); |
b7a00563 | 856 | } |
850d05e9 TT |
857 | while (1) { |
858 | if (all_dirs) { | |
efc6f628 | 859 | if ((dir = e2fsck_dir_info_iter(ctx, |
28db82a8 | 860 | dirinfo_iter)) == 0) |
850d05e9 TT |
861 | break; |
862 | ino = dir->ino; | |
863 | } else { | |
864 | if (!ext2fs_u32_list_iterate(iter, &ino)) | |
865 | break; | |
866 | } | |
867 | if (ino == ctx->lost_and_found) | |
b7a00563 TT |
868 | continue; |
869 | pctx.dir = ino; | |
870 | if (first) { | |
871 | fix_problem(ctx, PR_3A_PASS_HEADER, &pctx); | |
872 | first = 0; | |
873 | } | |
b0700a1b | 874 | #if 0 |
850d05e9 | 875 | fix_problem(ctx, PR_3A_OPTIMIZE_DIR, &pctx); |
b0700a1b | 876 | #endif |
b7a00563 TT |
877 | pctx.errcode = e2fsck_rehash_dir(ctx, ino); |
878 | if (pctx.errcode) { | |
850d05e9 TT |
879 | end_problem_latch(ctx, PR_LATCH_OPTIMIZE_DIR); |
880 | fix_problem(ctx, PR_3A_OPTIMIZE_DIR_ERR, &pctx); | |
b7a00563 | 881 | } |
52734dc5 TT |
882 | if (ctx->progress && !ctx->progress_fd) |
883 | e2fsck_simple_progress(ctx, "Rebuilding directory", | |
1d2eef42 | 884 | 100.0 * (float) (++cur) / (float) max, ino); |
b7a00563 | 885 | } |
850d05e9 | 886 | end_problem_latch(ctx, PR_LATCH_OPTIMIZE_DIR); |
28db82a8 TT |
887 | if (all_dirs) |
888 | e2fsck_dir_info_iter_end(ctx, dirinfo_iter); | |
889 | else | |
850d05e9 | 890 | ext2fs_u32_list_iterate_end(iter); |
efc6f628 | 891 | |
850d05e9 TT |
892 | if (ctx->dirs_to_hash) |
893 | ext2fs_u32_list_free(ctx->dirs_to_hash); | |
b7a00563 | 894 | ctx->dirs_to_hash = 0; |
850d05e9 | 895 | |
9facd076 | 896 | print_resource_track(ctx, "Pass 3A", &rtrack, ctx->fs->io); |
b7a00563 | 897 | } |