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