1 /*
2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
16 *
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
27 * SUCH DAMAGE.
28 *
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 $
31 */
32
33 #include <sys/param.h>
34
35 #include <vfs/ufs/dinode.h>
36 #include <vfs/ufs/fs.h>
37
38 #include <err.h>
39 #include <string.h>
40
41 #include "fsck.h"
42
43 struct dups *duplist; /* head of dup list */
44 struct zlncnt *zlnhead; /* head of zero link count list */
45
46 void
pass4(void)47 pass4(void)
48 {
49 ufs1_ino_t inumber;
50 struct zlncnt *zlnp;
51 struct ufs1_dinode *dp;
52 struct inodesc idesc;
53 int i, n, cg;
54
55 memset(&idesc, 0, sizeof(struct inodesc));
56 idesc.id_type = ADDR;
57 idesc.id_func = pass4check;
58 for (cg = 0; cg < sblock.fs_ncg; cg++) {
59 if (got_siginfo) {
60 printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
61 cdevname, cg, sblock.fs_ncg,
62 cg * 100 / sblock.fs_ncg);
63 got_siginfo = 0;
64 }
65 inumber = cg * sblock.fs_ipg;
66 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
67 if (inumber < UFS_ROOTINO)
68 continue;
69 idesc.id_number = inumber;
70 switch (inoinfo(inumber)->ino_state) {
71
72 case FSTATE:
73 case DFOUND:
74 n = inoinfo(inumber)->ino_linkcnt;
75 if (n) {
76 adjust(&idesc, (short)n);
77 break;
78 }
79 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
80 if (zlnp->zlncnt == inumber) {
81 zlnp->zlncnt = zlnhead->zlncnt;
82 zlnp = zlnhead;
83 zlnhead = zlnhead->next;
84 free((char *)zlnp);
85 clri(&idesc, "UNREF", 1);
86 break;
87 }
88 }
89 break;
90
91 case DSTATE:
92 clri(&idesc, "UNREF", 1);
93 break;
94
95 case DCLEAR:
96 dp = ginode(inumber);
97 if (dp->di_size == 0) {
98 clri(&idesc, "ZERO LENGTH", 1);
99 break;
100 }
101 /* fall through */
102 case FCLEAR:
103 clri(&idesc, "BAD/DUP", 1);
104 break;
105
106 case USTATE:
107 break;
108
109 default:
110 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
111 inoinfo(inumber)->ino_state, inumber);
112 }
113 }
114 }
115 }
116
117 int
pass4check(struct inodesc * idesc)118 pass4check(struct inodesc *idesc)
119 {
120 struct dups *dlp;
121 int nfrags, res = KEEPON;
122 ufs_daddr_t blkno = idesc->id_blkno;
123
124 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
125 if (chkrange(blkno, 1)) {
126 res = SKIP;
127 } else if (testbmap(blkno)) {
128 for (dlp = duplist; dlp; dlp = dlp->next) {
129 if (dlp->dup != blkno)
130 continue;
131 dlp->dup = duplist->dup;
132 dlp = duplist;
133 duplist = duplist->next;
134 free((char *)dlp);
135 break;
136 }
137 if (dlp == NULL) {
138 clrbmap(blkno);
139 n_blks--;
140 }
141 }
142 }
143 return (res);
144 }
145