pass4.c revision 126345
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#if 0
35#ifndef lint
36static const char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
37#endif /* not lint */
38#endif
39#include <sys/cdefs.h>
40__FBSDID("$FreeBSD: head/sbin/fsck_ffs/pass4.c 126345 2004-02-28 07:50:42Z scottl $");
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		if (got_sigalarm) {
72			setproctitle("%s p4 %d%%", cdevname,
73			    cg * 100 / sblock.fs_ncg);
74			got_sigalarm = 0;
75		}
76		inumber = cg * sblock.fs_ipg;
77		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
78			if (inumber < ROOTINO)
79				continue;
80			idesc.id_number = inumber;
81			switch (inoinfo(inumber)->ino_state) {
82
83			case FSTATE:
84			case DFOUND:
85				n = inoinfo(inumber)->ino_linkcnt;
86				if (n) {
87					adjust(&idesc, (short)n);
88					break;
89				}
90				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
91					if (zlnp->zlncnt == inumber) {
92						zlnp->zlncnt = zlnhead->zlncnt;
93						zlnp = zlnhead;
94						zlnhead = zlnhead->next;
95						free((char *)zlnp);
96						clri(&idesc, "UNREF", 1);
97						break;
98					}
99				}
100				break;
101
102			case DSTATE:
103				clri(&idesc, "UNREF", 1);
104				break;
105
106			case DCLEAR:
107				dp = ginode(inumber);
108				if (DIP(dp, di_size) == 0) {
109					clri(&idesc, "ZERO LENGTH", 1);
110					break;
111				}
112				/* fall through */
113			case FCLEAR:
114				clri(&idesc, "BAD/DUP", 1);
115				break;
116
117			case USTATE:
118				break;
119
120			default:
121				errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
122				    inoinfo(inumber)->ino_state, inumber);
123			}
124		}
125	}
126}
127
128int
129pass4check(struct inodesc *idesc)
130{
131	struct dups *dlp;
132	int nfrags, res = KEEPON;
133	ufs2_daddr_t blkno = idesc->id_blkno;
134
135	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
136		if (chkrange(blkno, 1)) {
137			res = SKIP;
138		} else if (testbmap(blkno)) {
139			for (dlp = duplist; dlp; dlp = dlp->next) {
140				if (dlp->dup != blkno)
141					continue;
142				dlp->dup = duplist->dup;
143				dlp = duplist;
144				duplist = duplist->next;
145				free((char *)dlp);
146				break;
147			}
148			if (dlp == 0) {
149				clrbmap(blkno);
150				n_blks--;
151			}
152		}
153	}
154	return (res);
155}
156