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