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; inosused -= CHAR_BIT, cp--) {
139 for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) {
150 * Allocate inoinfo structures for the allocated inodes.
152 inostathead[c].il_numalloced = inosused;
154 inostathead[c].il_stat = 0;
157 info = Calloc((unsigned)inosused, sizeof(struct inostat));
159 errx(EEXIT, "cannot alloc %u bytes for inoinfo",
160 (unsigned)(sizeof(struct inostat) * inosused));
161 inostathead[c].il_stat = info;
163 * Scan the allocated inodes.
165 for (i = 0; i < inosused; i++, inumber++) {
166 if (inumber < ROOTINO) {
167 (void)getnextinode(inumber, rebuildcg);
171 * NULL return indicates probable end of allocated
172 * inodes during cylinder group rebuild attempt.
173 * We always keep trying until we get to the minimum
174 * valid number for this cylinder group.
176 if (checkinode(inumber, &idesc, rebuildcg) == 0 &&
177 i > cgp->cg_initediblk)
181 * This optimization speeds up future runs of fsck
182 * by trimming down the number of inodes in cylinder
183 * groups that formerly had many inodes but now have
186 mininos = roundup(inosused + INOPB(&sblock), INOPB(&sblock));
187 if (inoopt && !preen && !rebuildcg &&
188 sblock.fs_magic == FS_UFS2_MAGIC &&
189 cgp->cg_initediblk > 2 * INOPB(&sblock) &&
190 mininos < cgp->cg_initediblk) {
191 i = cgp->cg_initediblk;
192 if (mininos < 2 * INOPB(&sblock))
193 cgp->cg_initediblk = 2 * INOPB(&sblock);
195 cgp->cg_initediblk = mininos;
196 pwarn("CYLINDER GROUP %d: RESET FROM %ju TO %d %s\n",
197 c, i, cgp->cg_initediblk, "VALID INODES");
200 if (inosused < sblock.fs_ipg)
203 if (lastino < (c * sblock.fs_ipg))
206 inosused = lastino - (c * sblock.fs_ipg);
207 if (rebuildcg && inosused > cgp->cg_initediblk &&
208 sblock.fs_magic == FS_UFS2_MAGIC) {
209 cgp->cg_initediblk = roundup(inosused, INOPB(&sblock));
210 pwarn("CYLINDER GROUP %d: FOUND %d VALID INODES\n", c,
214 * If we were not able to determine in advance which inodes
215 * were in use, then reduce the size of the inoinfo structure
216 * to the size necessary to describe the inodes that we
219 if (inumber == lastino)
221 inostathead[c].il_numalloced = inosused;
223 free(inostathead[c].il_stat);
224 inostathead[c].il_stat = 0;
227 info = Calloc((unsigned)inosused, sizeof(struct inostat));
229 errx(EEXIT, "cannot alloc %u bytes for inoinfo",
230 (unsigned)(sizeof(struct inostat) * inosused));
231 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info));
232 free(inostathead[c].il_stat);
233 inostathead[c].il_stat = info;
239 checkinode(ino_t inumber, struct inodesc *idesc, int rebuildcg)
242 off_t kernmaxfilesize;
247 if ((dp = getnextinode(inumber, rebuildcg)) == NULL)
249 mode = DIP(dp, di_mode) & IFMT;
251 if ((sblock.fs_magic == FS_UFS1_MAGIC &&
252 (memcmp(dp->dp1.di_db, ufs1_zino.di_db,
253 NDADDR * sizeof(ufs1_daddr_t)) ||
254 memcmp(dp->dp1.di_ib, ufs1_zino.di_ib,
255 NIADDR * sizeof(ufs1_daddr_t)) ||
256 dp->dp1.di_mode || dp->dp1.di_size)) ||
257 (sblock.fs_magic == FS_UFS2_MAGIC &&
258 (memcmp(dp->dp2.di_db, ufs2_zino.di_db,
259 NDADDR * sizeof(ufs2_daddr_t)) ||
260 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib,
261 NIADDR * sizeof(ufs2_daddr_t)) ||
262 dp->dp2.di_mode || dp->dp2.di_size))) {
263 pfatal("PARTIALLY ALLOCATED INODE I=%lu",
265 if (reply("CLEAR") == 1) {
266 dp = ginode(inumber);
271 inoinfo(inumber)->ino_state = USTATE;
275 /* This should match the file size limit in ffs_mountfs(). */
276 if (sblock.fs_magic == FS_UFS1_MAGIC)
277 kernmaxfilesize = (off_t)0x40000000 * sblock.fs_bsize - 1;
279 kernmaxfilesize = sblock.fs_maxfilesize;
280 if (DIP(dp, di_size) > kernmaxfilesize ||
281 DIP(dp, di_size) > sblock.fs_maxfilesize ||
282 (mode == IFDIR && DIP(dp, di_size) > MAXDIRSIZE)) {
284 printf("bad size %ju:", (uintmax_t)DIP(dp, di_size));
287 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
288 dp = ginode(inumber);
289 DIP_SET(dp, di_size, sblock.fs_fsize);
290 DIP_SET(dp, di_mode, IFREG|0600);
293 if ((mode == IFBLK || mode == IFCHR || mode == IFIFO ||
294 mode == IFSOCK) && DIP(dp, di_size) != 0) {
296 printf("bad special-file size %ju:",
297 (uintmax_t)DIP(dp, di_size));
300 if ((mode == IFBLK || mode == IFCHR) &&
301 (dev_t)DIP(dp, di_rdev) == NODEV) {
303 printf("bad special-file rdev NODEV:");
306 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize);
309 printf("bad size %ju ndb %ju:",
310 (uintmax_t)DIP(dp, di_size), (uintmax_t)ndb);
313 if (mode == IFBLK || mode == IFCHR)
317 * Fake ndb value so direct/indirect block checks below
318 * will detect any garbage after symlink string.
320 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) {
321 if (sblock.fs_magic == FS_UFS1_MAGIC)
322 ndb = howmany(DIP(dp, di_size),
323 sizeof(ufs1_daddr_t));
325 ndb = howmany(DIP(dp, di_size),
326 sizeof(ufs2_daddr_t));
329 for (ndb = 1; j > 1; j--)
330 ndb *= NINDIR(&sblock);
335 for (j = ndb; ndb < NDADDR && j < NDADDR; j++)
336 if (DIP(dp, di_db[j]) != 0) {
338 printf("bad direct addr[%d]: %ju\n", j,
339 (uintmax_t)DIP(dp, di_db[j]));
342 for (j = 0, ndb -= NDADDR; ndb > 0; j++)
343 ndb /= NINDIR(&sblock);
344 for (; j < NIADDR; j++)
345 if (DIP(dp, di_ib[j]) != 0) {
347 printf("bad indirect addr: %ju\n",
348 (uintmax_t)DIP(dp, di_ib[j]));
351 if (ftypeok(dp) == 0)
354 inoinfo(inumber)->ino_linkcnt = DIP(dp, di_nlink);
356 if (DIP(dp, di_size) == 0)
357 inoinfo(inumber)->ino_state = DCLEAR;
358 else if (DIP(dp, di_nlink) <= 0)
359 inoinfo(inumber)->ino_state = DZLINK;
361 inoinfo(inumber)->ino_state = DSTATE;
362 cacheino(dp, inumber);
364 } else if (DIP(dp, di_nlink) <= 0)
365 inoinfo(inumber)->ino_state = FZLINK;
367 inoinfo(inumber)->ino_state = FSTATE;
368 inoinfo(inumber)->ino_type = IFTODT(mode);
370 idesc->id_number = inumber;
371 if (DIP(dp, di_flags) & SF_SNAPSHOT)
372 idesc->id_type = SNAP;
374 idesc->id_type = ADDR;
375 (void)ckinode(dp, idesc);
376 if (sblock.fs_magic == FS_UFS2_MAGIC && dp->dp2.di_extsize > 0) {
377 idesc->id_type = ADDR;
378 ndb = howmany(dp->dp2.di_extsize, sblock.fs_bsize);
379 for (j = 0; j < NXADDR; j++) {
381 (offset = blkoff(&sblock, dp->dp2.di_extsize)) != 0)
382 idesc->id_numfrags = numfrags(&sblock,
383 fragroundup(&sblock, offset));
385 idesc->id_numfrags = sblock.fs_frag;
386 if (dp->dp2.di_extb[j] == 0)
388 idesc->id_blkno = dp->dp2.di_extb[j];
389 ret = (*idesc->id_func)(idesc);
394 if (sblock.fs_magic == FS_UFS2_MAGIC)
395 eascan(idesc, &dp->dp2);
396 idesc->id_entryno *= btodb(sblock.fs_fsize);
397 if (DIP(dp, di_blocks) != idesc->id_entryno) {
398 pwarn("INCORRECT BLOCK COUNT I=%lu (%ju should be %ju)",
399 (u_long)inumber, (uintmax_t)DIP(dp, di_blocks),
400 (uintmax_t)idesc->id_entryno);
402 printf(" (CORRECTED)\n");
403 else if (reply("CORRECT") == 0)
405 if (bkgrdflag == 0) {
406 dp = ginode(inumber);
407 DIP_SET(dp, di_blocks, idesc->id_entryno);
410 cmd.value = idesc->id_number;
411 cmd.size = idesc->id_entryno - DIP(dp, di_blocks);
413 printf("adjblkcnt ino %ju amount %lld\n",
414 (uintmax_t)cmd.value, (long long)cmd.size);
415 if (sysctl(adjblkcnt, MIBSIZE, 0, 0,
416 &cmd, sizeof cmd) == -1)
417 rwerror("ADJUST INODE BLOCK COUNT", cmd.value);
422 pfatal("UNKNOWN FILE TYPE I=%lu", (u_long)inumber);
423 inoinfo(inumber)->ino_state = FCLEAR;
424 if (reply("CLEAR") == 1) {
425 inoinfo(inumber)->ino_state = USTATE;
426 dp = ginode(inumber);
434 pass1check(struct inodesc *idesc)
438 ufs2_daddr_t blkno = idesc->id_blkno;
442 if (idesc->id_type == SNAP) {
443 if (blkno == BLK_NOCOPY)
445 if (idesc->id_number == cursnapshot) {
446 if (blkno == blkstofrags(&sblock, idesc->id_lbn))
448 if (blkno == BLK_SNAP) {
449 blkno = blkstofrags(&sblock, idesc->id_lbn);
450 idesc->id_entryno -= idesc->id_numfrags;
453 if (blkno == BLK_SNAP)
457 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
458 blkerror(idesc->id_number, "BAD", blkno);
459 if (badblk++ >= MAXBAD) {
460 pwarn("EXCESSIVE BAD BLKS I=%lu",
461 (u_long)idesc->id_number);
463 printf(" (SKIPPING)\n");
464 else if (reply("CONTINUE") == 0) {
472 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
473 if (anyout && chkrange(blkno, 1)) {
475 } else if (!testbmap(blkno)) {
479 blkerror(idesc->id_number, "DUP", blkno);
480 if (dupblk++ >= MAXDUP) {
481 pwarn("EXCESSIVE DUP BLKS I=%lu",
482 (u_long)idesc->id_number);
484 printf(" (SKIPPING)\n");
485 else if (reply("CONTINUE") == 0) {
492 new = (struct dups *)Malloc(sizeof(struct dups));
494 pfatal("DUP TABLE OVERFLOW.");
495 if (reply("CONTINUE") == 0) {
504 duplist = muldup = new;
507 new->next = muldup->next;
510 for (dlp = duplist; dlp != muldup; dlp = dlp->next)
511 if (dlp->dup == blkno)
513 if (dlp == muldup && dlp->dup != blkno)
517 * count the number of blocks found in id_entryno