xref: /freebsd/sbin/fsck_ffs/pass4.c (revision e627b39baccd1ec9129690167cf5e6d860509655)
1 /*
2  * Copyright (c) 1980, 1986, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  * 3. All advertising materials mentioning features or use of this software
14  *    must display the following acknowledgement:
15  *	This product includes software developed by the University of
16  *	California, Berkeley and its contributors.
17  * 4. Neither the name of the University nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  */
33 
34 #ifndef lint
35 static const char sccsid[] = "@(#)pass4.c	8.1 (Berkeley) 6/5/93";
36 #endif /* not lint */
37 
38 #include <sys/param.h>
39 #include <sys/time.h>
40 #include <ufs/ufs/dinode.h>
41 #include <ufs/ffs/fs.h>
42 #include <stdlib.h>
43 #include <string.h>
44 #include "fsck.h"
45 
46 int	pass4check();
47 
48 void
49 pass4()
50 {
51 	register ino_t inumber;
52 	register struct zlncnt *zlnp;
53 	struct dinode *dp;
54 	struct inodesc idesc;
55 	int n;
56 
57 	bzero((char *)&idesc, sizeof(struct inodesc));
58 	idesc.id_type = ADDR;
59 	idesc.id_func = pass4check;
60 	for (inumber = ROOTINO; inumber <= lastino; inumber++) {
61 		idesc.id_number = inumber;
62 		switch (statemap[inumber]) {
63 
64 		case FSTATE:
65 		case DFOUND:
66 			n = lncntp[inumber];
67 			if (n)
68 				adjust(&idesc, (short)n);
69 			else {
70 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
71 					if (zlnp->zlncnt == inumber) {
72 						zlnp->zlncnt = zlnhead->zlncnt;
73 						zlnp = zlnhead;
74 						zlnhead = zlnhead->next;
75 						free((char *)zlnp);
76 						clri(&idesc, "UNREF", 1);
77 						break;
78 					}
79 			}
80 			break;
81 
82 		case DSTATE:
83 			clri(&idesc, "UNREF", 1);
84 			break;
85 
86 		case DCLEAR:
87 			dp = ginode(inumber);
88 			if (dp->di_size == 0) {
89 				clri(&idesc, "ZERO LENGTH", 1);
90 				break;
91 			}
92 			/* fall through */
93 		case FCLEAR:
94 			clri(&idesc, "BAD/DUP", 1);
95 			break;
96 
97 		case USTATE:
98 			break;
99 
100 		default:
101 			errexit("BAD STATE %d FOR INODE I=%d",
102 			    statemap[inumber], inumber);
103 		}
104 	}
105 }
106 
107 int
108 pass4check(idesc)
109 	register struct inodesc *idesc;
110 {
111 	register struct dups *dlp;
112 	int nfrags, res = KEEPON;
113 	daddr_t blkno = idesc->id_blkno;
114 
115 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
116 		if (chkrange(blkno, 1)) {
117 			res = SKIP;
118 		} else if (testbmap(blkno)) {
119 			for (dlp = duplist; dlp; dlp = dlp->next) {
120 				if (dlp->dup != blkno)
121 					continue;
122 				dlp->dup = duplist->dup;
123 				dlp = duplist;
124 				duplist = duplist->next;
125 				free((char *)dlp);
126 				break;
127 			}
128 			if (dlp == 0) {
129 				clrbmap(blkno);
130 				n_blks--;
131 			}
132 		}
133 	}
134 	return (res);
135 }
136