pass4.c revision 41474 
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
35static const char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
36#endif /* not lint */
37
38#include <sys/param.h>
39#include <sys/time.h>
40
41#include <ufs/ufs/dinode.h>
42#include <ufs/ffs/fs.h>
43
44#include <err.h>
45#include <string.h>
46
47#include "fsck.h"
48
49void
50pass4()
51{
52	register ino_t inumber;
53	register struct zlncnt *zlnp;
54	struct dinode *dp;
55	struct inodesc idesc;
56	int i, n, cg;
57
58	memset(&idesc, 0, sizeof(struct inodesc));
59	idesc.id_type = ADDR;
60	idesc.id_func = pass4check;
61	for (cg = 0; cg < sblock.fs_ncg; cg++) {
62		inumber = cg * sblock.fs_ipg;
63		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
64			if (inumber < 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
114int
115pass4check(idesc)
116	register struct inodesc *idesc;
117{
118	register struct dups *dlp;
119	int nfrags, res = KEEPON;
120	ufs_daddr_t blkno = idesc->id_blkno;
121
122	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
123		if (chkrange(blkno, 1)) {
124			res = SKIP;
125		} else if (testbmap(blkno)) {
126			for (dlp = duplist; dlp; dlp = dlp->next) {
127				if (dlp->dup != blkno)
128					continue;
129				dlp->dup = duplist->dup;
130				dlp = duplist;
131				duplist = duplist->next;
132				free((char *)dlp);
133				break;
134			}
135			if (dlp == 0) {
136				clrbmap(blkno);
137				n_blks--;
138			}
139		}
140	}
141	return (res);
142}
143