pass4.c revision 98542 
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#if 0
36static const char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
37#endif
38static const char rcsid[] =
39  "$FreeBSD: head/sbin/fsck_ffs/pass4.c 98542 2002-06-21 06:18:05Z mckusick $";
40#endif /* not lint */
41
42#include <sys/param.h>
43
44#include <ufs/ufs/dinode.h>
45#include <ufs/ffs/fs.h>
46
47#include <err.h>
48#include <string.h>
49
50#include "fsck.h"
51
52void
53pass4(void)
54{
55	ino_t inumber;
56	struct zlncnt *zlnp;
57	union dinode *dp;
58	struct inodesc idesc;
59	int i, n, cg;
60
61	memset(&idesc, 0, sizeof(struct inodesc));
62	idesc.id_type = ADDR;
63	idesc.id_func = pass4check;
64	for (cg = 0; cg < sblock.fs_ncg; cg++) {
65		if (got_siginfo) {
66			printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
67			    cdevname, cg, sblock.fs_ncg,
68			    cg * 100 / sblock.fs_ncg);
69			got_siginfo = 0;
70		}
71		inumber = cg * sblock.fs_ipg;
72		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
73			if (inumber < ROOTINO)
74				continue;
75			idesc.id_number = inumber;
76			switch (inoinfo(inumber)->ino_state) {
77
78			case FSTATE:
79			case DFOUND:
80				n = inoinfo(inumber)->ino_linkcnt;
81				if (n) {
82					adjust(&idesc, (short)n);
83					break;
84				}
85				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
86					if (zlnp->zlncnt == inumber) {
87						zlnp->zlncnt = zlnhead->zlncnt;
88						zlnp = zlnhead;
89						zlnhead = zlnhead->next;
90						free((char *)zlnp);
91						clri(&idesc, "UNREF", 1);
92						break;
93					}
94				}
95				break;
96
97			case DSTATE:
98				clri(&idesc, "UNREF", 1);
99				break;
100
101			case DCLEAR:
102				dp = ginode(inumber);
103				if (DIP(dp, di_size) == 0) {
104					clri(&idesc, "ZERO LENGTH", 1);
105					break;
106				}
107				/* fall through */
108			case FCLEAR:
109				clri(&idesc, "BAD/DUP", 1);
110				break;
111
112			case USTATE:
113				break;
114
115			default:
116				errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
117				    inoinfo(inumber)->ino_state, inumber);
118			}
119		}
120	}
121}
122
123int
124pass4check(struct inodesc *idesc)
125{
126	struct dups *dlp;
127	int nfrags, res = KEEPON;
128	ufs2_daddr_t blkno = idesc->id_blkno;
129
130	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
131		if (chkrange(blkno, 1)) {
132			res = SKIP;
133		} else if (testbmap(blkno)) {
134			for (dlp = duplist; dlp; dlp = dlp->next) {
135				if (dlp->dup != blkno)
136					continue;
137				dlp->dup = duplist->dup;
138				dlp = duplist;
139				duplist = duplist->next;
140				free((char *)dlp);
141				break;
142			}
143			if (dlp == 0) {
144				clrbmap(blkno);
145				n_blks--;
146			}
147		}
148	}
149	return (res);
150}
151