pass0.c revision 1.16 1 1.16 agc /* $NetBSD: pass0.c,v 1.16 2003/08/07 10:04:23 agc Exp $ */
2 1.3 kleink
3 1.14 perseant /*-
4 1.14 perseant * Copyright (c) 1999, 2000, 2001, 2002, 2003 The NetBSD Foundation, Inc.
5 1.14 perseant * All rights reserved.
6 1.14 perseant *
7 1.14 perseant * This code is derived from software contributed to The NetBSD Foundation
8 1.14 perseant * by Konrad E. Schroder <perseant (at) hhhh.org>.
9 1.14 perseant *
10 1.14 perseant * Redistribution and use in source and binary forms, with or without
11 1.14 perseant * modification, are permitted provided that the following conditions
12 1.14 perseant * are met:
13 1.14 perseant * 1. Redistributions of source code must retain the above copyright
14 1.14 perseant * notice, this list of conditions and the following disclaimer.
15 1.14 perseant * 2. Redistributions in binary form must reproduce the above copyright
16 1.14 perseant * notice, this list of conditions and the following disclaimer in the
17 1.14 perseant * documentation and/or other materials provided with the distribution.
18 1.14 perseant * 3. All advertising materials mentioning features or use of this software
19 1.14 perseant * must display the following acknowledgement:
20 1.14 perseant * This product includes software developed by the NetBSD
21 1.14 perseant * Foundation, Inc. and its contributors.
22 1.14 perseant * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.14 perseant * contributors may be used to endorse or promote products derived
24 1.14 perseant * from this software without specific prior written permission.
25 1.14 perseant *
26 1.14 perseant * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.14 perseant * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.14 perseant * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.14 perseant * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.14 perseant * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.14 perseant * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.14 perseant * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.14 perseant * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.14 perseant * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.14 perseant * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.14 perseant * POSSIBILITY OF SUCH DAMAGE.
37 1.14 perseant */
38 1.14 perseant /*-
39 1.1 perseant * Copyright (c) 1980, 1986, 1993
40 1.1 perseant * The Regents of the University of California. All rights reserved.
41 1.1 perseant *
42 1.1 perseant * Redistribution and use in source and binary forms, with or without
43 1.1 perseant * modification, are permitted provided that the following conditions
44 1.1 perseant * are met:
45 1.1 perseant * 1. Redistributions of source code must retain the above copyright
46 1.1 perseant * notice, this list of conditions and the following disclaimer.
47 1.1 perseant * 2. Redistributions in binary form must reproduce the above copyright
48 1.1 perseant * notice, this list of conditions and the following disclaimer in the
49 1.1 perseant * documentation and/or other materials provided with the distribution.
50 1.16 agc * 3. Neither the name of the University nor the names of its contributors
51 1.1 perseant * may be used to endorse or promote products derived from this software
52 1.1 perseant * without specific prior written permission.
53 1.1 perseant *
54 1.1 perseant * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 1.1 perseant * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 1.1 perseant * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 1.1 perseant * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 1.1 perseant * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 1.1 perseant * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 1.1 perseant * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 1.1 perseant * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 1.1 perseant * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 1.1 perseant * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 1.1 perseant * SUCH DAMAGE.
65 1.1 perseant */
66 1.1 perseant
67 1.14 perseant #include <sys/types.h>
68 1.1 perseant #include <sys/param.h>
69 1.1 perseant #include <sys/time.h>
70 1.14 perseant #include <sys/buf.h>
71 1.14 perseant #include <sys/mount.h>
72 1.14 perseant
73 1.14 perseant #include <ufs/ufs/inode.h>
74 1.1 perseant #include <ufs/ufs/dir.h>
75 1.14 perseant #define vnode uvnode
76 1.1 perseant #include <ufs/lfs/lfs.h>
77 1.14 perseant #undef vnode
78 1.1 perseant
79 1.1 perseant #include <stdio.h>
80 1.1 perseant #include <stdlib.h>
81 1.1 perseant #include <string.h>
82 1.1 perseant
83 1.14 perseant #include "bufcache.h"
84 1.14 perseant #include "vnode.h"
85 1.14 perseant #include "lfs.h"
86 1.14 perseant
87 1.1 perseant #include "fsck.h"
88 1.1 perseant #include "extern.h"
89 1.1 perseant #include "fsutil.h"
90 1.1 perseant
91 1.14 perseant extern int fake_cleanseg;
92 1.1 perseant
93 1.1 perseant /*
94 1.1 perseant * Pass 0. Check the LFS partial segments for valid checksums, correcting
95 1.1 perseant * if necessary. Also check for valid offsets for inode and finfo blocks.
96 1.1 perseant */
97 1.5 perseant /*
98 1.5 perseant * XXX more could be done here---consistency between inode-held blocks and
99 1.5 perseant * finfo blocks, for one thing.
100 1.5 perseant */
101 1.1 perseant
102 1.14 perseant #define dbshift (fs->lfs_bshift - fs->lfs_blktodb)
103 1.1 perseant
104 1.6 perseant void
105 1.6 perseant pass0()
106 1.1 perseant {
107 1.14 perseant daddr_t daddr;
108 1.15 perseant CLEANERINFO *cip;
109 1.14 perseant IFILE *ifp;
110 1.14 perseant struct ubuf *bp;
111 1.14 perseant ino_t ino, plastino, nextino, *visited;
112 1.15 perseant int writeit = 0;
113 1.5 perseant
114 1.5 perseant /*
115 1.6 perseant * Check the inode free list for inuse inodes, and cycles.
116 1.6 perseant * Make sure that all free inodes are in fact on the list.
117 1.5 perseant */
118 1.14 perseant visited = (ino_t *) malloc(maxino * sizeof(ino_t));
119 1.7 perseant memset(visited, 0, maxino * sizeof(ino_t));
120 1.6 perseant
121 1.10 lukem plastino = 0;
122 1.14 perseant ino = fs->lfs_freehd;
123 1.5 perseant while (ino) {
124 1.7 perseant if (ino >= maxino) {
125 1.7 perseant printf("! Ino %d out of range (last was %d)\n", ino,
126 1.14 perseant plastino);
127 1.7 perseant break;
128 1.7 perseant }
129 1.6 perseant if (visited[ino]) {
130 1.6 perseant pwarn("! Ino %d already found on the free list!\n",
131 1.14 perseant ino);
132 1.6 perseant if (preen || reply("FIX") == 1) {
133 1.10 lukem /* plastino can't be zero */
134 1.14 perseant LFS_IENTRY(ifp, fs, plastino, bp);
135 1.6 perseant ifp->if_nextfree = 0;
136 1.14 perseant VOP_BWRITE(bp);
137 1.6 perseant }
138 1.6 perseant break;
139 1.6 perseant }
140 1.6 perseant ++visited[ino];
141 1.14 perseant LFS_IENTRY(ifp, fs, ino, bp);
142 1.5 perseant nextino = ifp->if_nextfree;
143 1.5 perseant daddr = ifp->if_daddr;
144 1.14 perseant brelse(bp);
145 1.5 perseant if (daddr) {
146 1.12 fvdl pwarn("! Ino %d with daddr 0x%llx is on the free list!\n",
147 1.14 perseant ino, (long long) daddr);
148 1.5 perseant if (preen || reply("FIX") == 1) {
149 1.10 lukem if (plastino == 0) {
150 1.14 perseant fs->lfs_freehd = nextino;
151 1.5 perseant sbdirty();
152 1.5 perseant } else {
153 1.14 perseant LFS_IENTRY(ifp, fs, plastino, bp);
154 1.5 perseant ifp->if_nextfree = nextino;
155 1.14 perseant VOP_BWRITE(bp);
156 1.5 perseant }
157 1.5 perseant ino = nextino;
158 1.5 perseant continue;
159 1.5 perseant }
160 1.5 perseant }
161 1.10 lukem plastino = ino;
162 1.5 perseant ino = nextino;
163 1.6 perseant }
164 1.15 perseant
165 1.15 perseant
166 1.6 perseant /*
167 1.6 perseant * Make sure all free inodes were found on the list
168 1.6 perseant */
169 1.14 perseant for (ino = ROOTINO + 1; ino < maxino; ++ino) {
170 1.6 perseant if (visited[ino])
171 1.6 perseant continue;
172 1.6 perseant
173 1.14 perseant LFS_IENTRY(ifp, fs, ino, bp);
174 1.6 perseant if (ifp->if_daddr) {
175 1.14 perseant brelse(bp);
176 1.6 perseant continue;
177 1.6 perseant }
178 1.6 perseant pwarn("! Ino %d free, but not on the free list\n", ino);
179 1.6 perseant if (preen || reply("FIX") == 1) {
180 1.14 perseant ifp->if_nextfree = fs->lfs_freehd;
181 1.14 perseant fs->lfs_freehd = ino;
182 1.6 perseant sbdirty();
183 1.14 perseant VOP_BWRITE(bp);
184 1.14 perseant } else
185 1.14 perseant brelse(bp);
186 1.5 perseant }
187 1.15 perseant
188 1.15 perseant LFS_CLEANERINFO(cip, fs, bp);
189 1.15 perseant if (cip->free_head != fs->lfs_freehd) {
190 1.15 perseant pwarn("! Free list head should be %d (was %d)\n",
191 1.15 perseant fs->lfs_freehd, cip->free_head);
192 1.15 perseant if (preen || reply("FIX")) {
193 1.15 perseant cip->free_head = fs->lfs_freehd;
194 1.15 perseant writeit = 1;
195 1.15 perseant }
196 1.15 perseant }
197 1.15 perseant if (cip->free_tail != plastino) {
198 1.15 perseant pwarn("! Free list tail should be %d (was %d)\n", plastino,
199 1.15 perseant cip->free_tail);
200 1.15 perseant if (preen || reply("FIX")) {
201 1.15 perseant cip->free_tail = plastino;
202 1.15 perseant writeit = 1;
203 1.15 perseant }
204 1.15 perseant }
205 1.15 perseant LFS_SYNC_CLEANERINFO(cip, fs, bp, writeit);
206 1.1 perseant }
207