xref: /netbsd/sbin/fsck_ffs/pass4.c (revision bf9ec67e)
1 /*	$NetBSD: pass4.c,v 1.15 2002/05/06 03:17:43 lukem 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. All advertising materials mentioning features or use of this software
16  *    must display the following acknowledgement:
17  *	This product includes software developed by the University of
18  *	California, Berkeley and its contributors.
19  * 4. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
40 #else
41 __RCSID("$NetBSD: pass4.c,v 1.15 2002/05/06 03:17:43 lukem Exp $");
42 #endif
43 #endif /* not lint */
44 
45 #include <sys/param.h>
46 #include <sys/time.h>
47 
48 #include <ufs/ufs/dinode.h>
49 #include <ufs/ffs/fs.h>
50 
51 #include <err.h>
52 #include <stdlib.h>
53 #include <string.h>
54 
55 #include "fsutil.h"
56 #include "fsck.h"
57 #include "extern.h"
58 
59 void
60 pass4()
61 {
62 	ino_t inumber;
63 	struct zlncnt *zlnp;
64 	struct dinode *dp;
65 	struct inodesc idesc;
66 	int n;
67 
68 	memset(&idesc, 0, sizeof(struct inodesc));
69 	idesc.id_type = ADDR;
70 	idesc.id_func = pass4check;
71 	for (inumber = ROOTINO; inumber <= lastino; inumber++) {
72 		if (got_siginfo) {
73 			fprintf(stderr,
74 			    "%s: phase 4: cyl group %d of %d (%d%%)\n",
75 			    cdevname(), inumber, lastino,
76 			    inumber * 100 / lastino);
77 			got_siginfo = 0;
78 		}
79 		idesc.id_number = inumber;
80 		switch (statemap[inumber]) {
81 
82 		case FSTATE:
83 		case DFOUND:
84 			n = lncntp[inumber];
85 			if (n)
86 				adjust(&idesc, (short)n);
87 			else {
88 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
89 					if (zlnp->zlncnt == inumber) {
90 						zlnp->zlncnt = zlnhead->zlncnt;
91 						zlnp = zlnhead;
92 						zlnhead = zlnhead->next;
93 						free((char *)zlnp);
94 						clri(&idesc, "UNREF", 1);
95 						break;
96 					}
97 			}
98 			break;
99 
100 		case DSTATE:
101 			clri(&idesc, "UNREF", 1);
102 			break;
103 
104 		case DCLEAR:
105 			dp = ginode(inumber);
106 			if (dp->di_size == 0) {
107 				clri(&idesc, "ZERO LENGTH", 1);
108 				break;
109 			}
110 			/* fall through */
111 		case FCLEAR:
112 			clri(&idesc, "BAD/DUP", 1);
113 			break;
114 
115 		case USTATE:
116 			break;
117 
118 		default:
119 			errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
120 			    statemap[inumber], inumber);
121 		}
122 	}
123 }
124 
125 int
126 pass4check(idesc)
127 	struct inodesc *idesc;
128 {
129 	struct dups *dlp;
130 	int nfrags, res = KEEPON;
131 	ufs_daddr_t blkno = idesc->id_blkno;
132 
133 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
134 		if (chkrange(blkno, 1)) {
135 			res = SKIP;
136 		} else if (testbmap(blkno)) {
137 			for (dlp = duplist; dlp; dlp = dlp->next) {
138 				if (dlp->dup != blkno)
139 					continue;
140 				dlp->dup = duplist->dup;
141 				dlp = duplist;
142 				duplist = duplist->next;
143 				free((char *)dlp);
144 				break;
145 			}
146 			if (dlp == 0) {
147 				clrbmap(blkno);
148 				n_blks--;
149 			}
150 		}
151 	}
152 	return (res);
153 }
154