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 * 3. 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
29 * @(#)pass4.c 8.4 (Berkeley) 4/28/95
30 * $FreeBSD: src/sbin/fsck/pass4.c,v 1.7.2.1 2001/01/23 23:11:07 iedowse Exp $
33 #include <sys/param.h>
35 #include <vfs/ufs/dinode.h>
36 #include <vfs/ufs/fs.h>
48 struct ufs1_dinode *dp;
52 memset(&idesc, 0, sizeof(struct inodesc));
54 idesc.id_func = pass4check;
55 for (cg = 0; cg < sblock.fs_ncg; cg++) {
57 printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
58 cdevname, cg, sblock.fs_ncg,
59 cg * 100 / sblock.fs_ncg);
62 inumber = cg * sblock.fs_ipg;
63 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
64 if (inumber < ROOTINO)
66 idesc.id_number = inumber;
67 switch (inoinfo(inumber)->ino_state) {
71 n = inoinfo(inumber)->ino_linkcnt;
73 adjust(&idesc, (short)n);
76 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
77 if (zlnp->zlncnt == inumber) {
78 zlnp->zlncnt = zlnhead->zlncnt;
80 zlnhead = zlnhead->next;
82 clri(&idesc, "UNREF", 1);
89 clri(&idesc, "UNREF", 1);
94 if (dp->di_size == 0) {
95 clri(&idesc, "ZERO LENGTH", 1);
100 clri(&idesc, "BAD/DUP", 1);
107 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
108 inoinfo(inumber)->ino_state, inumber);
115 pass4check(struct inodesc *idesc)
118 int nfrags, res = KEEPON;
119 ufs_daddr_t blkno = idesc->id_blkno;
121 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
122 if (chkrange(blkno, 1)) {
124 } else if (testbmap(blkno)) {
125 for (dlp = duplist; dlp; dlp = dlp->next) {
126 if (dlp->dup != blkno)
128 dlp->dup = duplist->dup;
130 duplist = duplist->next;