2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 static const char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95";
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
38 #include <sys/param.h>
40 #include <sys/sysctl.h>
42 #include <ufs/ufs/dinode.h>
43 #include <ufs/ufs/dir.h>
44 #include <ufs/ffs/fs.h>
53 static ufs2_daddr_t badblk;
54 static ufs2_daddr_t dupblk;
55 static ino_t lastino; /* last inode in use */
57 static int checkinode(ino_t inumber, struct inodesc *, int rebuildcg);
66 ino_t inumber, inosused, mininos;
71 badblk = dupblk = lastino = 0;
74 * Set file system reserved blocks in used block map.
76 for (c = 0; c < sblock.fs_ncg; c++) {
77 cgd = cgdmin(&sblock, c);
79 i = cgbase(&sblock, c);
81 i = cgsblock(&sblock, c);
86 cgd = i + howmany(sblock.fs_cssize, sblock.fs_fsize);
91 * Find all allocated blocks.
93 memset(&idesc, 0, sizeof(struct inodesc));
94 idesc.id_func = pass1check;
96 for (c = 0; c < sblock.fs_ncg; c++) {
97 inumber = c * sblock.fs_ipg;
100 cgp = cgbp->b_un.b_cg;
102 if (!check_cgmagic(c, cgbp))
104 if (!rebuildcg && sblock.fs_magic == FS_UFS2_MAGIC) {
105 inosused = cgp->cg_initediblk;
106 if (inosused > sblock.fs_ipg) {
108 "Too many initialized inodes (%ju > %d) in cylinder group %d\nReset to %d\n",
110 sblock.fs_ipg, c, sblock.fs_ipg);
111 inosused = sblock.fs_ipg;
114 inosused = sblock.fs_ipg;
117 printf("%s: phase 1: cyl group %d of %d (%d%%)\n",
118 cdevname, c, sblock.fs_ncg,
119 c * 100 / sblock.fs_ncg);
123 setproctitle("%s p1 %d%%", cdevname,
124 c * 100 / sblock.fs_ncg);
128 * If we are using soft updates, then we can trust the
129 * cylinder group inode allocation maps to tell us which
130 * inodes are allocated. We will scan the used inode map
131 * to find the inodes that are really in use, and then
132 * read only those inodes in from disk.
134 if ((preen || inoopt) && usedsoftdep && !rebuildcg) {
135 cp = &cg_inosused(cgp)[(inosused - 1) / CHAR_BIT];
136 for ( ; inosused != 0; cp--) {
138 if (inosused > CHAR_BIT)
139 inosused -= CHAR_BIT;
144 for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) {
153 * Allocate inoinfo structures for the allocated inodes.
155 inostathead[c].il_numalloced = inosused;
157 inostathead[c].il_stat = NULL;
160 info = Calloc((unsigned)inosused, sizeof(struct inostat));
162 errx(EEXIT, "cannot alloc %u bytes for inoinfo",
163 (unsigned)(sizeof(struct inostat) * inosused));
164 inostathead[c].il_stat = info;
166 * Scan the allocated inodes.
168 for (i = 0; i < inosused; i++, inumber++) {
169 if (inumber < ROOTINO) {
170 (void)getnextinode(inumber, rebuildcg);
174 * NULL return indicates probable end of allocated
175 * inodes during cylinder group rebuild attempt.
176 * We always keep trying until we get to the minimum
177 * valid number for this cylinder group.
179 if (checkinode(inumber, &idesc, rebuildcg) == 0 &&
180 i > cgp->cg_initediblk)
184 * This optimization speeds up future runs of fsck
185 * by trimming down the number of inodes in cylinder
186 * groups that formerly had many inodes but now have
189 mininos = roundup(inosused + INOPB(&sblock), INOPB(&sblock));
190 if (inoopt && !preen && !rebuildcg &&
191 sblock.fs_magic == FS_UFS2_MAGIC &&
192 cgp->cg_initediblk > 2 * INOPB(&sblock) &&
193 mininos < cgp->cg_initediblk) {
194 i = cgp->cg_initediblk;
195 if (mininos < 2 * INOPB(&sblock))
196 cgp->cg_initediblk = 2 * INOPB(&sblock);
198 cgp->cg_initediblk = mininos;
199 pwarn("CYLINDER GROUP %d: RESET FROM %ju TO %d %s\n",
200 c, i, cgp->cg_initediblk, "VALID INODES");
203 if (inosused < sblock.fs_ipg)
206 if (lastino < (c * sblock.fs_ipg))
209 inosused = lastino - (c * sblock.fs_ipg);
210 if (rebuildcg && inosused > cgp->cg_initediblk &&
211 sblock.fs_magic == FS_UFS2_MAGIC) {
212 cgp->cg_initediblk = roundup(inosused, INOPB(&sblock));
213 pwarn("CYLINDER GROUP %d: FOUND %d VALID INODES\n", c,
217 * If we were not able to determine in advance which inodes
218 * were in use, then reduce the size of the inoinfo structure
219 * to the size necessary to describe the inodes that we
222 if (inumber == lastino)
224 inostathead[c].il_numalloced = inosused;
226 free(inostathead[c].il_stat);
227 inostathead[c].il_stat = NULL;
230 info = Calloc((unsigned)inosused, sizeof(struct inostat));
232 errx(EEXIT, "cannot alloc %u bytes for inoinfo",
233 (unsigned)(sizeof(struct inostat) * inosused));
234 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info));
235 free(inostathead[c].il_stat);
236 inostathead[c].il_stat = info;
242 checkinode(ino_t inumber, struct inodesc *idesc, int rebuildcg)
245 off_t kernmaxfilesize;
251 if ((dp = getnextinode(inumber, rebuildcg)) == NULL)
253 mode = DIP(dp, di_mode) & IFMT;
255 if ((sblock.fs_magic == FS_UFS1_MAGIC &&
256 (memcmp(dp->dp1.di_db, ufs1_zino.di_db,
257 NDADDR * sizeof(ufs1_daddr_t)) ||
258 memcmp(dp->dp1.di_ib, ufs1_zino.di_ib,
259 NIADDR * sizeof(ufs1_daddr_t)) ||
260 dp->dp1.di_mode || dp->dp1.di_size)) ||
261 (sblock.fs_magic == FS_UFS2_MAGIC &&
262 (memcmp(dp->dp2.di_db, ufs2_zino.di_db,
263 NDADDR * sizeof(ufs2_daddr_t)) ||
264 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib,
265 NIADDR * sizeof(ufs2_daddr_t)) ||
266 dp->dp2.di_mode || dp->dp2.di_size))) {
267 pfatal("PARTIALLY ALLOCATED INODE I=%lu",
269 if (reply("CLEAR") == 1) {
270 dp = ginode(inumber);
275 inoinfo(inumber)->ino_state = USTATE;
279 /* This should match the file size limit in ffs_mountfs(). */
280 if (sblock.fs_magic == FS_UFS1_MAGIC)
281 kernmaxfilesize = (off_t)0x40000000 * sblock.fs_bsize - 1;
283 kernmaxfilesize = sblock.fs_maxfilesize;
284 if (DIP(dp, di_size) > kernmaxfilesize ||
285 DIP(dp, di_size) > sblock.fs_maxfilesize ||
286 (mode == IFDIR && DIP(dp, di_size) > MAXDIRSIZE)) {
288 printf("bad size %ju:", (uintmax_t)DIP(dp, di_size));
291 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
292 dp = ginode(inumber);
293 DIP_SET(dp, di_size, sblock.fs_fsize);
294 DIP_SET(dp, di_mode, IFREG|0600);
297 if ((mode == IFBLK || mode == IFCHR || mode == IFIFO ||
298 mode == IFSOCK) && DIP(dp, di_size) != 0) {
300 printf("bad special-file size %ju:",
301 (uintmax_t)DIP(dp, di_size));
304 if ((mode == IFBLK || mode == IFCHR) &&
305 (dev_t)DIP(dp, di_rdev) == NODEV) {
307 printf("bad special-file rdev NODEV:");
310 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize);
313 printf("bad size %ju ndb %ju:",
314 (uintmax_t)DIP(dp, di_size), (uintmax_t)ndb);
317 if (mode == IFBLK || mode == IFCHR)
321 * Fake ndb value so direct/indirect block checks below
322 * will detect any garbage after symlink string.
324 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) {
325 if (sblock.fs_magic == FS_UFS1_MAGIC)
326 ndb = howmany(DIP(dp, di_size),
327 sizeof(ufs1_daddr_t));
329 ndb = howmany(DIP(dp, di_size),
330 sizeof(ufs2_daddr_t));
333 for (ndb = 1; j > 1; j--)
334 ndb *= NINDIR(&sblock);
339 for (j = ndb; ndb < NDADDR && j < NDADDR; j++)
340 if (DIP(dp, di_db[j]) != 0) {
342 printf("bad direct addr[%d]: %ju\n", j,
343 (uintmax_t)DIP(dp, di_db[j]));
346 for (j = 0, ndb -= NDADDR; ndb > 0; j++)
347 ndb /= NINDIR(&sblock);
348 for (; j < NIADDR; j++)
349 if (DIP(dp, di_ib[j]) != 0) {
351 printf("bad indirect addr: %ju\n",
352 (uintmax_t)DIP(dp, di_ib[j]));
355 if (ftypeok(dp) == 0)
358 inoinfo(inumber)->ino_linkcnt = DIP(dp, di_nlink);
360 if (DIP(dp, di_size) == 0)
361 inoinfo(inumber)->ino_state = DCLEAR;
362 else if (DIP(dp, di_nlink) <= 0)
363 inoinfo(inumber)->ino_state = DZLINK;
365 inoinfo(inumber)->ino_state = DSTATE;
366 cacheino(dp, inumber);
368 } else if (DIP(dp, di_nlink) <= 0)
369 inoinfo(inumber)->ino_state = FZLINK;
371 inoinfo(inumber)->ino_state = FSTATE;
372 inoinfo(inumber)->ino_type = IFTODT(mode);
374 idesc->id_number = inumber;
375 if (DIP(dp, di_flags) & SF_SNAPSHOT)
376 idesc->id_type = SNAP;
378 idesc->id_type = ADDR;
379 idesc->id_lballoc = -1;
380 (void)ckinode(dp, idesc);
381 if (sblock.fs_magic == FS_UFS2_MAGIC && dp->dp2.di_extsize > 0) {
382 idesc->id_type = ADDR;
383 ndb = howmany(dp->dp2.di_extsize, sblock.fs_bsize);
384 for (j = 0; j < NXADDR; j++) {
386 (offset = blkoff(&sblock, dp->dp2.di_extsize)) != 0)
387 idesc->id_numfrags = numfrags(&sblock,
388 fragroundup(&sblock, offset));
390 idesc->id_numfrags = sblock.fs_frag;
391 if (dp->dp2.di_extb[j] == 0)
393 idesc->id_blkno = dp->dp2.di_extb[j];
394 ret = (*idesc->id_func)(idesc);
399 if (sblock.fs_magic == FS_UFS2_MAGIC)
400 eascan(idesc, &dp->dp2);
401 idesc->id_entryno *= btodb(sblock.fs_fsize);
402 if (DIP(dp, di_blocks) != idesc->id_entryno) {
403 pwarn("INCORRECT BLOCK COUNT I=%lu (%ju should be %ju)",
404 (u_long)inumber, (uintmax_t)DIP(dp, di_blocks),
405 (uintmax_t)idesc->id_entryno);
407 printf(" (CORRECTED)\n");
408 else if (reply("CORRECT") == 0)
410 if (bkgrdflag == 0) {
411 dp = ginode(inumber);
412 DIP_SET(dp, di_blocks, idesc->id_entryno);
415 cmd.value = idesc->id_number;
416 cmd.size = idesc->id_entryno - DIP(dp, di_blocks);
418 printf("adjblkcnt ino %ju amount %lld\n",
419 (uintmax_t)cmd.value, (long long)cmd.size);
420 if (sysctl(adjblkcnt, MIBSIZE, 0, 0,
421 &cmd, sizeof cmd) == -1)
422 rwerror("ADJUST INODE BLOCK COUNT", cmd.value);
426 * Soft updates will always ensure that the file size is correct
427 * for files that contain only direct block pointers. However
428 * soft updates does not roll back sizes for files with indirect
429 * blocks that it has set to unallocated because their contents
430 * have not yet been written to disk. Hence, the file can appear
431 * to have a hole at its end because the block pointer has been
432 * rolled back to zero. Thus, id_lballoc tracks the last allocated
433 * block in the file. Here, for files that extend into indirect
434 * blocks, we check for a size past the last allocated block of
435 * the file and if that is found, shorten the file to reference
436 * the last allocated block to avoid having it reference a hole
439 if (DIP(dp, di_size) > UFS_NDADDR * sblock.fs_bsize &&
440 idesc->id_lballoc < lblkno(&sblock, DIP(dp, di_size) - 1)) {
441 fixsize = lblktosize(&sblock, idesc->id_lballoc + 1);
442 pwarn("INODE %lu: FILE SIZE %ju BEYOND END OF ALLOCATED FILE, "
443 "SIZE SHOULD BE %ju", (u_long)inumber,
444 (uintmax_t)DIP(dp, di_size), fixsize);
446 printf(" (ADJUSTED)\n");
447 else if (reply("ADJUST") == 0)
449 if (bkgrdflag == 0) {
450 dp = ginode(inumber);
451 DIP_SET(dp, di_size, fixsize);
454 cmd.value = idesc->id_number;
457 printf("setsize ino %ju size set to %ju\n",
458 (uintmax_t)cmd.value, (uintmax_t)cmd.size);
459 if (sysctl(setsize, MIBSIZE, 0, 0,
460 &cmd, sizeof cmd) == -1)
461 rwerror("SET INODE SIZE", cmd.value);
467 pfatal("UNKNOWN FILE TYPE I=%lu", (u_long)inumber);
468 inoinfo(inumber)->ino_state = FCLEAR;
469 if (reply("CLEAR") == 1) {
470 inoinfo(inumber)->ino_state = USTATE;
471 dp = ginode(inumber);
479 pass1check(struct inodesc *idesc)
483 ufs2_daddr_t blkno = idesc->id_blkno;
487 if (idesc->id_type == SNAP) {
488 if (blkno == BLK_NOCOPY)
490 if (idesc->id_number == cursnapshot) {
491 if (blkno == blkstofrags(&sblock, idesc->id_lbn))
493 if (blkno == BLK_SNAP) {
494 blkno = blkstofrags(&sblock, idesc->id_lbn);
495 idesc->id_entryno -= idesc->id_numfrags;
498 if (blkno == BLK_SNAP)
502 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
503 blkerror(idesc->id_number, "BAD", blkno);
504 if (badblk++ >= MAXBAD) {
505 pwarn("EXCESSIVE BAD BLKS I=%lu",
506 (u_long)idesc->id_number);
508 printf(" (SKIPPING)\n");
509 else if (reply("CONTINUE") == 0) {
517 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
518 if (anyout && chkrange(blkno, 1)) {
520 } else if (!testbmap(blkno)) {
524 blkerror(idesc->id_number, "DUP", blkno);
525 if (dupblk++ >= MAXDUP) {
526 pwarn("EXCESSIVE DUP BLKS I=%lu",
527 (u_long)idesc->id_number);
529 printf(" (SKIPPING)\n");
530 else if (reply("CONTINUE") == 0) {
537 new = (struct dups *)Malloc(sizeof(struct dups));
539 pfatal("DUP TABLE OVERFLOW.");
540 if (reply("CONTINUE") == 0) {
548 if (muldup == NULL) {
549 duplist = muldup = new;
552 new->next = muldup->next;
555 for (dlp = duplist; dlp != muldup; dlp = dlp->next)
556 if (dlp->dup == blkno)
558 if (dlp == muldup && dlp->dup != blkno)
562 * count the number of blocks found in id_entryno
566 if (idesc->id_lballoc == -1 || idesc->id_lballoc < idesc->id_lbn)
567 idesc->id_lballoc = idesc->id_lbn;