pass4.c revision 1.10 
1/* $NetBSD: pass4.c,v 1.10 2005/01/19 19:41:59 xtraeme Exp $	 */
2
3/*
4 * Copyright (c) 1980, 1986, 1993
5 *	The Regents of the University of California.  All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 *    may be used to endorse or promote products derived from this software
17 *    without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32#include <sys/param.h>
33#include <sys/time.h>
34#include <sys/mount.h>
35#include <ufs/ufs/inode.h>
36
37#define vnode uvnode
38#define buf ubuf
39#define panic call_panic
40#include <ufs/lfs/lfs.h>
41
42#include <err.h>
43#include <stdlib.h>
44#include <string.h>
45
46#include "bufcache.h"
47#include "vnode.h"
48#include "lfs.h"
49
50#include "fsutil.h"
51#include "fsck.h"
52#include "extern.h"
53
54extern SEGUSE *seg_table;
55
56void
57pass4(void)
58{
59	register ino_t inumber;
60	register struct zlncnt *zlnp;
61	struct ufs1_dinode *dp;
62	struct inodesc idesc;
63	int n;
64
65	memset(&idesc, 0, sizeof(struct inodesc));
66	idesc.id_type = ADDR;
67	idesc.id_func = pass4check;
68	for (inumber = ROOTINO; inumber <= lastino; inumber++) {
69		idesc.id_number = inumber;
70		switch (statemap[inumber]) {
71
72		case FSTATE:
73		case DFOUND:
74			n = lncntp[inumber];
75			if (n)
76				adjust(&idesc, (short) n);
77			else {
78				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
79					if (zlnp->zlncnt == inumber) {
80						zlnp->zlncnt = zlnhead->zlncnt;
81						zlnp = zlnhead;
82						zlnhead = zlnhead->next;
83						free((char *) zlnp);
84						clri(&idesc, "UNREF", 1);
85						break;
86					}
87			}
88			break;
89
90		case DSTATE:
91			clri(&idesc, "UNREF", 1);
92			break;
93
94		case DCLEAR:
95			dp = ginode(inumber);
96			if (dp->di_size == 0) {
97				clri(&idesc, "ZERO LENGTH", 1);
98				break;
99			}
100			/* fall through */
101		case FCLEAR:
102			clri(&idesc, "BAD/DUP", 1);
103			break;
104
105		case USTATE:
106			break;
107
108		default:
109			err(8, "BAD STATE %d FOR INODE I=%d\n",
110			    statemap[inumber], inumber);
111		}
112	}
113}
114
115int
116pass4check(struct inodesc * idesc)
117{
118	register struct dups *dlp;
119	int ndblks, res = KEEPON;
120	daddr_t blkno = idesc->id_blkno;
121	SEGUSE *sup;
122	struct ubuf *bp;
123	int sn, doanyway = 0;
124
125	sn = dtosn(fs, blkno);
126	/* If preening, bmap is not valid for non-active segs */
127	if (preen && !(seg_table[sn].su_flags & SEGUSE_ACTIVE))
128		doanyway = 1;
129	for (ndblks = fragstofsb(fs, idesc->id_numfrags); ndblks > 0; blkno++, ndblks--) {
130		if (chkrange(blkno, 1)) {
131			res = SKIP;
132		} else if (testbmap(blkno) || doanyway) {
133			for (dlp = duplist; dlp; dlp = dlp->next) {
134				if (dlp->dup != blkno)
135					continue;
136				dlp->dup = duplist->dup;
137				dlp = duplist;
138				duplist = duplist->next;
139				free((char *) dlp);
140				break;
141			}
142			if (dlp == 0) {
143				clrbmap(blkno);
144				LFS_SEGENTRY(sup, fs, sn, bp);
145				sup->su_nbytes -= fsbtob(fs, 1);
146				VOP_BWRITE(bp);
147				seg_table[sn].su_nbytes -= fsbtob(fs, 1);
148				++fs->lfs_bfree;
149				n_blks--;
150			}
151		}
152	}
153	return (res);
154}
155