pass4.c revision 41477 
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	"$Id: pass4.c,v 1.4 1998/06/15 07:07:19 charnier Exp $";
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()
54{
55	register ino_t inumber;
56	register struct zlncnt *zlnp;
57	struct 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		inumber = cg * sblock.fs_ipg;
66		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
67			if (inumber < ROOTINO)
68				continue;
69			idesc.id_number = inumber;
70			switch (inoinfo(inumber)->ino_state) {
71
72			case FSTATE:
73			case DFOUND:
74				n = inoinfo(inumber)->ino_linkcnt;
75				if (n) {
76					adjust(&idesc, (short)n);
77					break;
78				}
79				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
80					if (zlnp->zlncnt == inumber) {
81						zlnp->zlncnt = zlnhead->zlncnt;
82						zlnp = zlnhead;
83						zlnhead = zlnhead->next;
84						free((char *)zlnp);
85						clri(&idesc, "UNREF", 1);
86						break;
87					}
88				}
89				break;
90
91			case DSTATE:
92				clri(&idesc, "UNREF", 1);
93				break;
94
95			case DCLEAR:
96				dp = ginode(inumber);
97				if (dp->di_size == 0) {
98					clri(&idesc, "ZERO LENGTH", 1);
99					break;
100				}
101				/* fall through */
102			case FCLEAR:
103				clri(&idesc, "BAD/DUP", 1);
104				break;
105
106			case USTATE:
107				break;
108
109			default:
110				errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
111				    inoinfo(inumber)->ino_state, inumber);
112			}
113		}
114	}
115}
116
117int
118pass4check(idesc)
119	register struct inodesc *idesc;
120{
121	register struct dups *dlp;
122	int nfrags, res = KEEPON;
123	ufs_daddr_t blkno = idesc->id_blkno;
124
125	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
126		if (chkrange(blkno, 1)) {
127			res = SKIP;
128		} else if (testbmap(blkno)) {
129			for (dlp = duplist; dlp; dlp = dlp->next) {
130				if (dlp->dup != blkno)
131					continue;
132				dlp->dup = duplist->dup;
133				dlp = duplist;
134				duplist = duplist->next;
135				free((char *)dlp);
136				break;
137			}
138			if (dlp == 0) {
139				clrbmap(blkno);
140				n_blks--;
141			}
142		}
143	}
144	return (res);
145}
146