xref: /netbsd-src/sbin/fsck_ffs/pass1b.c (revision f298a94b738ab130659689d3f04c17f6991b6de5)
1 /*	$NetBSD: pass1b.c,v 1.24 2023/01/07 19:41:29 chs 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[] = "@(#)pass1b.c	8.4 (Berkeley) 4/28/95";
36 #else
37 __RCSID("$NetBSD: pass1b.c,v 1.24 2023/01/07 19:41:29 chs 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 <string.h>
48 
49 #include "fsck.h"
50 #include "extern.h"
51 #include "fsutil.h"
52 
53 static  struct dups *duphead;
54 static int pass1bcheck(struct inodesc *);
55 
56 void
pass1b(void)57 pass1b(void)
58 {
59 	uint32_t c, i;
60 	union dinode *dp;
61 	struct inodesc idesc;
62 	ino_t inumber;
63 
64 	memset(&idesc, 0, sizeof(struct inodesc));
65 	idesc.id_type = ADDR;
66 	idesc.id_func = pass1bcheck;
67 	duphead = duplist;
68 	inumber = 0;
69 	for (c = 0; c < sblock->fs_ncg; c++) {
70 		if (got_siginfo) {
71 			fprintf(stderr,
72 			    "%s: phase 1b: cyl group %d of %d (%d%%)\n",
73 			    cdevname(), c, sblock->fs_ncg,
74 			    c * 100 / sblock->fs_ncg);
75 			got_siginfo = 0;
76 		}
77 #ifdef PROGRESS
78 		progress_bar(cdevname(), "phase 1b", c, sblock->fs_ncg);
79 #endif /* PROGRESS */
80 		for (i = 0; i < sblock->fs_ipg; i++, inumber++) {
81 			if (inumber < UFS_ROOTINO)
82 				continue;
83 			dp = ginode(inumber);
84 			if (dp == NULL)
85 				continue;
86 			idesc.id_number = inumber;
87 			idesc.id_uid = iswap32(DIP(dp, uid));
88 			idesc.id_gid = iswap32(DIP(dp, gid));
89 			if (inoinfo(inumber)->ino_state != USTATE &&
90 			    (ckinode(dp, &idesc) & STOP))
91 				return;
92 		}
93 	}
94 #ifdef PROGRESS
95 	progress_done();
96 #endif /* PROGRESS */
97 }
98 
99 static int
pass1bcheck(struct inodesc * idesc)100 pass1bcheck(struct inodesc *idesc)
101 {
102 	struct dups *dlp;
103 	int nfrags, res = KEEPON;
104 	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 == 0 || duphead == muldup->next)
120 			return (STOP);
121 	}
122 	return (res);
123 }
124