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;
72 * Set file system reserved blocks in used block map.
74 for (c = 0; c < sblock.fs_ncg; c++) {
75 cgd = cgdmin(&sblock, c);
77 i = cgbase(&sblock, c);
79 i = cgsblock(&sblock, c);
84 cgd = i + howmany(sblock.fs_cssize, sblock.fs_fsize);
89 * Find all allocated blocks.
91 memset(&idesc, 0, sizeof(struct inodesc));
92 idesc.id_func = pass1check;
94 for (c = 0; c < sblock.fs_ncg; c++) {
95 inumber = c * sblock.fs_ipg;
98 cgp = cgbp->b_un.b_cg;
100 if (!check_cgmagic(c, cgbp))
102 if (!rebuildcg && sblock.fs_magic == FS_UFS2_MAGIC) {
103 inosused = cgp->cg_initediblk;
104 if (inosused > sblock.fs_ipg) {
105 pfatal("%s (%d > %d) %s %d\nReset to %d\n",
106 "Too many initialized inodes", inosused,
107 sblock.fs_ipg, "in cylinder group", c,
109 inosused = sblock.fs_ipg;
112 inosused = sblock.fs_ipg;
115 printf("%s: phase 1: cyl group %d of %d (%d%%)\n",
116 cdevname, c, sblock.fs_ncg,
117 c * 100 / sblock.fs_ncg);
121 setproctitle("%s p1 %d%%", cdevname,
122 c * 100 / sblock.fs_ncg);
126 * If we are using soft updates, then we can trust the
127 * cylinder group inode allocation maps to tell us which
128 * inodes are allocated. We will scan the used inode map
129 * to find the inodes that are really in use, and then
130 * read only those inodes in from disk.
132 if ((preen || inoopt) && usedsoftdep && !rebuildcg) {
133 cp = &cg_inosused(cgp)[(inosused - 1) / CHAR_BIT];
134 for ( ; inosused > 0; inosused -= CHAR_BIT, cp--) {
137 for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) {
148 * Allocate inoinfo structures for the allocated inodes.
150 inostathead[c].il_numalloced = inosused;
152 inostathead[c].il_stat = 0;
155 info = Calloc((unsigned)inosused, sizeof(struct inostat));
157 errx(EEXIT, "cannot alloc %u bytes for inoinfo",
158 (unsigned)(sizeof(struct inostat) * inosused));
159 inostathead[c].il_stat = info;
161 * Scan the allocated inodes.
163 for (i = 0; i < inosused; i++, inumber++) {
164 if (inumber < ROOTINO) {
165 (void)getnextinode(inumber, rebuildcg);
169 * NULL return indicates probable end of allocated
170 * inodes during cylinder group rebuild attempt.
171 * We always keep trying until we get to the minimum
172 * valid number for this cylinder group.
174 if (checkinode(inumber, &idesc, rebuildcg) == 0 &&
175 i > cgp->cg_initediblk)
179 * This optimization speeds up future runs of fsck
180 * by trimming down the number of inodes in cylinder
181 * groups that formerly had many inodes but now have
184 mininos = roundup(inosused + INOPB(&sblock), INOPB(&sblock));
185 if (inoopt && !preen && !rebuildcg &&
186 sblock.fs_magic == FS_UFS2_MAGIC &&
187 cgp->cg_initediblk > 2 * INOPB(&sblock) &&
188 mininos < cgp->cg_initediblk) {
189 i = cgp->cg_initediblk;
190 if (mininos < 2 * INOPB(&sblock))
191 cgp->cg_initediblk = 2 * INOPB(&sblock);
193 cgp->cg_initediblk = mininos;
194 pwarn("CYLINDER GROUP %d: RESET FROM %ju TO %d %s\n",
195 c, i, cgp->cg_initediblk, "VALID INODES");
198 if (inosused < sblock.fs_ipg)
201 if (lastino < (c * sblock.fs_ipg))
204 inosused = lastino - (c * sblock.fs_ipg);
205 if (rebuildcg && inosused > cgp->cg_initediblk &&
206 sblock.fs_magic == FS_UFS2_MAGIC) {
207 cgp->cg_initediblk = roundup(inosused, INOPB(&sblock));
208 pwarn("CYLINDER GROUP %d: FOUND %d VALID INODES\n", c,
212 * If we were not able to determine in advance which inodes
213 * were in use, then reduce the size of the inoinfo structure
214 * to the size necessary to describe the inodes that we
217 if (inumber == lastino)
219 inostathead[c].il_numalloced = inosused;
221 free(inostathead[c].il_stat);
222 inostathead[c].il_stat = 0;
225 info = Calloc((unsigned)inosused, sizeof(struct inostat));
227 errx(EEXIT, "cannot alloc %u bytes for inoinfo",
228 (unsigned)(sizeof(struct inostat) * inosused));
229 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info));
230 free(inostathead[c].il_stat);
231 inostathead[c].il_stat = info;
237 checkinode(ino_t inumber, struct inodesc *idesc, int rebuildcg)
240 off_t kernmaxfilesize;
245 if ((dp = getnextinode(inumber, rebuildcg)) == NULL)
247 mode = DIP(dp, di_mode) & IFMT;
249 if ((sblock.fs_magic == FS_UFS1_MAGIC &&
250 (memcmp(dp->dp1.di_db, ufs1_zino.di_db,
251 NDADDR * sizeof(ufs1_daddr_t)) ||
252 memcmp(dp->dp1.di_ib, ufs1_zino.di_ib,
253 NIADDR * sizeof(ufs1_daddr_t)) ||
254 dp->dp1.di_mode || dp->dp1.di_size)) ||
255 (sblock.fs_magic == FS_UFS2_MAGIC &&
256 (memcmp(dp->dp2.di_db, ufs2_zino.di_db,
257 NDADDR * sizeof(ufs2_daddr_t)) ||
258 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib,
259 NIADDR * sizeof(ufs2_daddr_t)) ||
260 dp->dp2.di_mode || dp->dp2.di_size))) {
261 pfatal("PARTIALLY ALLOCATED INODE I=%lu",
263 if (reply("CLEAR") == 1) {
264 dp = ginode(inumber);
269 inoinfo(inumber)->ino_state = USTATE;
273 /* This should match the file size limit in ffs_mountfs(). */
274 if (sblock.fs_magic == FS_UFS1_MAGIC)
275 kernmaxfilesize = (off_t)0x40000000 * sblock.fs_bsize - 1;
277 kernmaxfilesize = sblock.fs_maxfilesize;
278 if (DIP(dp, di_size) > kernmaxfilesize ||
279 DIP(dp, di_size) > sblock.fs_maxfilesize ||
280 (mode == IFDIR && DIP(dp, di_size) > MAXDIRSIZE)) {
282 printf("bad size %ju:", (uintmax_t)DIP(dp, di_size));
285 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
286 dp = ginode(inumber);
287 DIP_SET(dp, di_size, sblock.fs_fsize);
288 DIP_SET(dp, di_mode, IFREG|0600);
291 if ((mode == IFBLK || mode == IFCHR || mode == IFIFO ||
292 mode == IFSOCK) && DIP(dp, di_size) != 0) {
294 printf("bad special-file size %ju:",
295 (uintmax_t)DIP(dp, di_size));
298 if ((mode == IFBLK || mode == IFCHR) &&
299 (dev_t)DIP(dp, di_rdev) == NODEV) {
301 printf("bad special-file rdev NODEV:");
304 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize);
307 printf("bad size %ju ndb %ju:",
308 (uintmax_t)DIP(dp, di_size), (uintmax_t)ndb);
311 if (mode == IFBLK || mode == IFCHR)
315 * Fake ndb value so direct/indirect block checks below
316 * will detect any garbage after symlink string.
318 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) {
319 if (sblock.fs_magic == FS_UFS1_MAGIC)
320 ndb = howmany(DIP(dp, di_size),
321 sizeof(ufs1_daddr_t));
323 ndb = howmany(DIP(dp, di_size),
324 sizeof(ufs2_daddr_t));
327 for (ndb = 1; j > 1; j--)
328 ndb *= NINDIR(&sblock);
333 for (j = ndb; ndb < NDADDR && j < NDADDR; j++)
334 if (DIP(dp, di_db[j]) != 0) {
336 printf("bad direct addr[%d]: %ju\n", j,
337 (uintmax_t)DIP(dp, di_db[j]));
340 for (j = 0, ndb -= NDADDR; ndb > 0; j++)
341 ndb /= NINDIR(&sblock);
342 for (; j < NIADDR; j++)
343 if (DIP(dp, di_ib[j]) != 0) {
345 printf("bad indirect addr: %ju\n",
346 (uintmax_t)DIP(dp, di_ib[j]));
349 if (ftypeok(dp) == 0)
352 inoinfo(inumber)->ino_linkcnt = DIP(dp, di_nlink);
354 if (DIP(dp, di_size) == 0)
355 inoinfo(inumber)->ino_state = DCLEAR;
356 else if (DIP(dp, di_nlink) <= 0)
357 inoinfo(inumber)->ino_state = DZLINK;
359 inoinfo(inumber)->ino_state = DSTATE;
360 cacheino(dp, inumber);
362 } else if (DIP(dp, di_nlink) <= 0)
363 inoinfo(inumber)->ino_state = FZLINK;
365 inoinfo(inumber)->ino_state = FSTATE;
366 inoinfo(inumber)->ino_type = IFTODT(mode);
368 idesc->id_number = inumber;
369 if (DIP(dp, di_flags) & SF_SNAPSHOT)
370 idesc->id_type = SNAP;
372 idesc->id_type = ADDR;
373 (void)ckinode(dp, idesc);
374 if (sblock.fs_magic == FS_UFS2_MAGIC && dp->dp2.di_extsize > 0) {
375 idesc->id_type = ADDR;
376 ndb = howmany(dp->dp2.di_extsize, sblock.fs_bsize);
377 for (j = 0; j < NXADDR; j++) {
379 (offset = blkoff(&sblock, dp->dp2.di_extsize)) != 0)
380 idesc->id_numfrags = numfrags(&sblock,
381 fragroundup(&sblock, offset));
383 idesc->id_numfrags = sblock.fs_frag;
384 if (dp->dp2.di_extb[j] == 0)
386 idesc->id_blkno = dp->dp2.di_extb[j];
387 ret = (*idesc->id_func)(idesc);
392 if (sblock.fs_magic == FS_UFS2_MAGIC)
393 eascan(idesc, &dp->dp2);
394 idesc->id_entryno *= btodb(sblock.fs_fsize);
395 if (DIP(dp, di_blocks) != idesc->id_entryno) {
396 pwarn("INCORRECT BLOCK COUNT I=%lu (%ju should be %ju)",
397 (u_long)inumber, (uintmax_t)DIP(dp, di_blocks),
398 (uintmax_t)idesc->id_entryno);
400 printf(" (CORRECTED)\n");
401 else if (reply("CORRECT") == 0)
403 if (bkgrdflag == 0) {
404 dp = ginode(inumber);
405 DIP_SET(dp, di_blocks, idesc->id_entryno);
408 cmd.value = idesc->id_number;
409 cmd.size = idesc->id_entryno - DIP(dp, di_blocks);
411 printf("adjblkcnt ino %ju amount %lld\n",
412 (uintmax_t)cmd.value, (long long)cmd.size);
413 if (sysctl(adjblkcnt, MIBSIZE, 0, 0,
414 &cmd, sizeof cmd) == -1)
415 rwerror("ADJUST INODE BLOCK COUNT", cmd.value);
420 pfatal("UNKNOWN FILE TYPE I=%lu", (u_long)inumber);
421 inoinfo(inumber)->ino_state = FCLEAR;
422 if (reply("CLEAR") == 1) {
423 inoinfo(inumber)->ino_state = USTATE;
424 dp = ginode(inumber);
432 pass1check(struct inodesc *idesc)
436 ufs2_daddr_t blkno = idesc->id_blkno;
440 if (idesc->id_type == SNAP) {
441 if (blkno == BLK_NOCOPY)
443 if (idesc->id_number == cursnapshot) {
444 if (blkno == blkstofrags(&sblock, idesc->id_lbn))
446 if (blkno == BLK_SNAP) {
447 blkno = blkstofrags(&sblock, idesc->id_lbn);
448 idesc->id_entryno -= idesc->id_numfrags;
451 if (blkno == BLK_SNAP)
455 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
456 blkerror(idesc->id_number, "BAD", blkno);
457 if (badblk++ >= MAXBAD) {
458 pwarn("EXCESSIVE BAD BLKS I=%lu",
459 (u_long)idesc->id_number);
461 printf(" (SKIPPING)\n");
462 else if (reply("CONTINUE") == 0) {
469 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
470 if (anyout && chkrange(blkno, 1)) {
472 } else if (!testbmap(blkno)) {
476 blkerror(idesc->id_number, "DUP", blkno);
477 if (dupblk++ >= MAXDUP) {
478 pwarn("EXCESSIVE DUP BLKS I=%lu",
479 (u_long)idesc->id_number);
481 printf(" (SKIPPING)\n");
482 else if (reply("CONTINUE") == 0) {
488 new = (struct dups *)Malloc(sizeof(struct dups));
490 pfatal("DUP TABLE OVERFLOW.");
491 if (reply("CONTINUE") == 0) {
499 duplist = muldup = new;
502 new->next = muldup->next;
505 for (dlp = duplist; dlp != muldup; dlp = dlp->next)
506 if (dlp->dup == blkno)
508 if (dlp == muldup && dlp->dup != blkno)
512 * count the number of blocks found in id_entryno