xref: /freebsd/sbin/fsck_ffs/pass4.c (revision 39beb93c3f8bdbf72a61fda42300b5ebed7390c8)
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  * 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.
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 
30 #if 0
31 #ifndef lint
32 static const char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
33 #endif /* not lint */
34 #endif
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
37 
38 #include <sys/param.h>
39 
40 #include <ufs/ufs/dinode.h>
41 #include <ufs/ffs/fs.h>
42 
43 #include <err.h>
44 #include <string.h>
45 
46 #include "fsck.h"
47 
48 void
49 pass4(void)
50 {
51 	ino_t inumber;
52 	union dinode *dp;
53 	struct inodesc idesc;
54 	int i, n, cg;
55 
56 	memset(&idesc, 0, sizeof(struct inodesc));
57 	idesc.id_type = ADDR;
58 	idesc.id_func = pass4check;
59 	for (cg = 0; cg < sblock.fs_ncg; cg++) {
60 		if (got_siginfo) {
61 			printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
62 			    cdevname, cg, sblock.fs_ncg,
63 			    cg * 100 / sblock.fs_ncg);
64 			got_siginfo = 0;
65 		}
66 		if (got_sigalarm) {
67 			setproctitle("%s p4 %d%%", cdevname,
68 			    cg * 100 / sblock.fs_ncg);
69 			got_sigalarm = 0;
70 		}
71 		inumber = cg * sblock.fs_ipg;
72 		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
73 			if (inumber < ROOTINO)
74 				continue;
75 			idesc.id_number = inumber;
76 			switch (inoinfo(inumber)->ino_state) {
77 
78 			case FZLINK:
79 			case DZLINK:
80 				if (inoinfo(inumber)->ino_linkcnt == 0) {
81 					clri(&idesc, "UNREF", 1);
82 					break;
83 				}
84 				/* fall through */
85 
86 			case FSTATE:
87 			case DFOUND:
88 				n = inoinfo(inumber)->ino_linkcnt;
89 				if (n) {
90 					adjust(&idesc, (short)n);
91 					break;
92 				}
93 				break;
94 
95 			case DSTATE:
96 				clri(&idesc, "UNREF", 1);
97 				break;
98 
99 			case DCLEAR:
100 				dp = ginode(inumber);
101 				if (DIP(dp, di_size) == 0) {
102 					clri(&idesc, "ZERO LENGTH", 1);
103 					break;
104 				}
105 				/* fall through */
106 			case FCLEAR:
107 				clri(&idesc, "BAD/DUP", 1);
108 				break;
109 
110 			case USTATE:
111 				break;
112 
113 			default:
114 				errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
115 				    inoinfo(inumber)->ino_state, inumber);
116 			}
117 		}
118 	}
119 }
120 
121 int
122 pass4check(struct inodesc *idesc)
123 {
124 	struct dups *dlp;
125 	int nfrags, res = KEEPON;
126 	ufs2_daddr_t blkno = idesc->id_blkno;
127 
128 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
129 		if (chkrange(blkno, 1)) {
130 			res = SKIP;
131 		} else if (testbmap(blkno)) {
132 			for (dlp = duplist; dlp; dlp = dlp->next) {
133 				if (dlp->dup != blkno)
134 					continue;
135 				dlp->dup = duplist->dup;
136 				dlp = duplist;
137 				duplist = duplist->next;
138 				free((char *)dlp);
139 				break;
140 			}
141 			if (dlp == 0) {
142 				clrbmap(blkno);
143 				n_blks--;
144 			}
145 		}
146 	}
147 	return (res);
148 }
149