xref: /freebsd/sbin/fsck_ffs/pass1b.c (revision 2b8331622f0b212cf3bb4fc4914a501e5321d506)
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[] = "@(#)pass1b.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 <string.h>
46 
47 #include "fsck.h"
48 
49 static  struct dups *duphead;
50 static int pass1bcheck(struct inodesc *);
51 
52 void
53 pass1b(void)
54 {
55 	int c, i;
56 	union dinode *dp;
57 	struct inodesc idesc;
58 	ino_t inumber, inosused;
59 
60 	memset(&idesc, 0, sizeof(struct inodesc));
61 	idesc.id_func = pass1bcheck;
62 	duphead = duplist;
63 	for (c = 0; c < sblock.fs_ncg; c++) {
64 		if (got_siginfo) {
65 			printf("%s: phase 1b: cyl group %d of %d (%d%%)\n",
66 			    cdevname, c, sblock.fs_ncg,
67 			    c * 100 / sblock.fs_ncg);
68 			got_siginfo = 0;
69 		}
70 		if (got_sigalarm) {
71 			setproctitle("%s p1b %d%%", cdevname,
72 			    c * 100 / sblock.fs_ncg);
73 			got_sigalarm = 0;
74 		}
75 		inosused = inostathead[c].il_numalloced;
76 		if (inosused == 0)
77 			continue;
78 		setinodebuf(c, inosused);
79 		inumber = c * sblock.fs_ipg;
80 		for (i = 0; i < inosused; i++, inumber++) {
81 			if (inumber < UFS_ROOTINO) {
82 				(void)getnextinode(inumber, 0);
83 				continue;
84 			}
85 			dp = getnextinode(inumber, 0);
86 			idesc.id_number = inumber;
87 			idesc.id_type = inoinfo(inumber)->ino_idtype;
88 			if (inoinfo(inumber)->ino_state != USTATE &&
89 			    (ckinode(dp, &idesc) & STOP)) {
90 				rerun = 1;
91 				freeinodebuf();
92 				return;
93 			}
94 		}
95 	}
96 	freeinodebuf();
97 }
98 
99 static int
100 pass1bcheck(struct inodesc *idesc)
101 {
102 	struct dups *dlp;
103 	int nfrags, res = KEEPON;
104 	ufs2_daddr_t blkno = idesc->id_blkno;
105 
106 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
107 		if (chkrange(blkno, 1))
108 			res = SKIP;
109 		for (dlp = duphead; dlp; dlp = dlp->next) {
110 			if (dlp->dup == blkno) {
111 				blkerror(idesc->id_number, "DUP", blkno);
112 				dlp->dup = duphead->dup;
113 				duphead->dup = blkno;
114 				duphead = duphead->next;
115 			}
116 			if (dlp == muldup)
117 				break;
118 		}
119 		if (muldup == NULL || duphead == muldup->next) {
120 			rerun = 1;
121 			return (STOP);
122 		}
123 	}
124 	return (res);
125 }
126