xref: /netbsd-src/sbin/fsck_ffs/pass4.c (revision 274254cdae52594c1aa480a736aef78313d15c9c)
1 /*	$NetBSD: pass4.c,v 1.25 2008/07/31 05:38:04 simonb Exp $	*/
2 
3 /*
4  * Copyright (c) 1980, 1986, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. Neither the name of the University nor the names of its contributors
16  *    may be used to endorse or promote products derived from this software
17  *    without specific prior written permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29  * SUCH DAMAGE.
30  */
31 
32 #include <sys/cdefs.h>
33 #ifndef lint
34 #if 0
35 static char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
36 #else
37 __RCSID("$NetBSD: pass4.c,v 1.25 2008/07/31 05:38:04 simonb Exp $");
38 #endif
39 #endif /* not lint */
40 
41 #include <sys/param.h>
42 #include <sys/time.h>
43 
44 #include <ufs/ufs/dinode.h>
45 #include <ufs/ffs/fs.h>
46 
47 #include <err.h>
48 #include <stdlib.h>
49 #include <string.h>
50 
51 #include "fsutil.h"
52 #include "fsck.h"
53 #include "extern.h"
54 
55 void
56 pass4(void)
57 {
58 	ino_t inumber;
59 	struct zlncnt *zlnp;
60 	union dinode *dp;
61 	struct inodesc idesc;
62 	int n, i, cg;
63 	struct inostat *info;
64 
65 	memset(&idesc, 0, sizeof(struct inodesc));
66 	idesc.id_type = ADDR;
67 	idesc.id_func = pass4check;
68 
69 	for (cg = 0; cg < sblock->fs_ncg; cg++) {
70 		if (got_siginfo) {
71 			fprintf(stderr,
72 			    "%s: phase 4: cyl group %d of %d (%d%%)\n",
73 			    cdevname(), cg, sblock->fs_ncg,
74 			    cg * 100 / sblock->fs_ncg);
75 			got_siginfo = 0;
76 		}
77 #ifdef PROGRESS
78 		progress_bar(cdevname(), preen ? NULL : "phase 4",
79 			    cg, sblock->fs_ncg);
80 #endif /* PROGRESS */
81 		inumber = cg * sblock->fs_ipg;
82 		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
83 			if (inumber < ROOTINO)
84 				continue;
85 			info = inoinfo(inumber);
86 			idesc.id_number = inumber;
87 			switch (info->ino_state) {
88 			case FSTATE:
89 			case DFOUND:
90 				n = info->ino_linkcnt;
91 				if (n) {
92 					if (is_journal_inode(inumber)) {
93 						if (debug)
94 							printf(
95     "skipping unreferenced journal inode %" PRId64 "\n", inumber);
96 						break;
97 					} else {
98 						adjust(&idesc, (short)n);
99 					}
100 					break;
101 				}
102 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
103 					if (zlnp->zlncnt == inumber) {
104 						zlnp->zlncnt = zlnhead->zlncnt;
105 						zlnp = zlnhead;
106 						zlnhead = zlnhead->next;
107 						free((char *)zlnp);
108 						clri(&idesc, "UNREF", 1);
109 						break;
110 					}
111 				break;
112 
113 			case DSTATE:
114 				clri(&idesc, "UNREF", 1);
115 				break;
116 
117 			case DCLEAR:
118 				dp = ginode(inumber);
119 				if (DIP(dp, size) == 0) {
120 					clri(&idesc, "ZERO LENGTH", 1);
121 					break;
122 				}
123 				/* fall through */
124 			case FCLEAR:
125 				clri(&idesc, "BAD/DUP", 1);
126 				break;
127 
128 			case USTATE:
129 				break;
130 
131 			default:
132 				errexit("BAD STATE %d FOR INODE I=%llu",
133 				    info->ino_state,
134 				    (unsigned long long)inumber);
135 			}
136 		}
137 	}
138 #ifdef PROGRESS
139 	if (!preen)
140 		progress_done();
141 #endif /* PROGRESS */
142 }
143 
144 int
145 pass4check(struct inodesc *idesc)
146 {
147 	struct dups *dlp;
148 	int nfrags, res = KEEPON;
149 	daddr_t blkno = idesc->id_blkno;
150 
151 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
152 		if (chkrange(blkno, 1)) {
153 			res = SKIP;
154 		} else if (testbmap(blkno)) {
155 			for (dlp = duplist; dlp; dlp = dlp->next) {
156 				if (dlp->dup != blkno)
157 					continue;
158 				dlp->dup = duplist->dup;
159 				dlp = duplist;
160 				duplist = duplist->next;
161 				free((char *)dlp);
162 				break;
163 			}
164 			if (dlp == 0) {
165 				clrbmap(blkno);
166 				n_blks--;
167 			}
168 		}
169 	}
170 	return (res);
171 }
172