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