pass4.c revision 1.4 1 1.4 bouyer /* $NetBSD: pass4.c,v 1.4 2003/10/05 17:48:49 bouyer Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*
4 1.1 bouyer * Copyright (c) 1980, 1986, 1993
5 1.1 bouyer * The Regents of the University of California. All rights reserved.
6 1.1 bouyer *
7 1.1 bouyer * Redistribution and use in source and binary forms, with or without
8 1.1 bouyer * modification, are permitted provided that the following conditions
9 1.1 bouyer * are met:
10 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
11 1.1 bouyer * notice, this list of conditions and the following disclaimer.
12 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
14 1.1 bouyer * documentation and/or other materials provided with the distribution.
15 1.3 agc * 3. Neither the name of the University nor the names of its contributors
16 1.3 agc * may be used to endorse or promote products derived from this software
17 1.3 agc * without specific prior written permission.
18 1.3 agc *
19 1.3 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.3 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.3 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.3 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.3 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.3 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.3 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.3 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.3 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.3 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.3 agc * SUCH DAMAGE.
30 1.3 agc */
31 1.3 agc
32 1.3 agc /*
33 1.3 agc * Copyright (c) 1997 Manuel Bouyer.
34 1.3 agc *
35 1.3 agc * Redistribution and use in source and binary forms, with or without
36 1.3 agc * modification, are permitted provided that the following conditions
37 1.3 agc * are met:
38 1.3 agc * 1. Redistributions of source code must retain the above copyright
39 1.3 agc * notice, this list of conditions and the following disclaimer.
40 1.3 agc * 2. Redistributions in binary form must reproduce the above copyright
41 1.3 agc * notice, this list of conditions and the following disclaimer in the
42 1.3 agc * documentation and/or other materials provided with the distribution.
43 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
44 1.1 bouyer * must display the following acknowledgement:
45 1.4 bouyer * This product includes software developed by Manuel Bouyer.
46 1.4 bouyer * 4. The name of the author may not be used to endorse or promote products
47 1.4 bouyer * derived from this software without specific prior written permission.
48 1.1 bouyer *
49 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 1.1 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 1.1 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 1.1 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 1.1 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 1.1 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 1.1 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 1.1 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 1.1 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 1.1 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 1.1 bouyer * SUCH DAMAGE.
60 1.1 bouyer */
61 1.1 bouyer
62 1.2 lukem #include <sys/cdefs.h>
63 1.1 bouyer #ifndef lint
64 1.1 bouyer #if 0
65 1.1 bouyer static char sccsid[] = "@(#)pass4.c 8.1 (Berkeley) 6/5/93";
66 1.1 bouyer #else
67 1.4 bouyer __RCSID("$NetBSD: pass4.c,v 1.4 2003/10/05 17:48:49 bouyer Exp $");
68 1.1 bouyer #endif
69 1.1 bouyer #endif /* not lint */
70 1.1 bouyer
71 1.1 bouyer #include <sys/param.h>
72 1.1 bouyer #include <sys/time.h>
73 1.1 bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
74 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
75 1.1 bouyer #include <stdlib.h>
76 1.1 bouyer #include <string.h>
77 1.1 bouyer
78 1.1 bouyer #include "fsutil.h"
79 1.1 bouyer #include "fsck.h"
80 1.1 bouyer #include "extern.h"
81 1.1 bouyer
82 1.1 bouyer void
83 1.1 bouyer pass4()
84 1.1 bouyer {
85 1.2 lukem ino_t inumber;
86 1.2 lukem struct zlncnt *zlnp;
87 1.1 bouyer struct ext2fs_dinode *dp;
88 1.1 bouyer struct inodesc idesc;
89 1.1 bouyer int n;
90 1.1 bouyer
91 1.1 bouyer memset(&idesc, 0, sizeof(struct inodesc));
92 1.1 bouyer idesc.id_type = ADDR;
93 1.1 bouyer idesc.id_func = pass4check;
94 1.1 bouyer for (inumber = EXT2_ROOTINO; inumber <= lastino; inumber++) {
95 1.1 bouyer if (inumber < EXT2_FIRSTINO && inumber > EXT2_ROOTINO)
96 1.1 bouyer continue;
97 1.1 bouyer idesc.id_number = inumber;
98 1.1 bouyer switch (statemap[inumber]) {
99 1.1 bouyer
100 1.1 bouyer case FSTATE:
101 1.1 bouyer case DFOUND:
102 1.1 bouyer n = lncntp[inumber];
103 1.1 bouyer if (n)
104 1.1 bouyer adjust(&idesc, (short)n);
105 1.1 bouyer else {
106 1.1 bouyer for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
107 1.1 bouyer if (zlnp->zlncnt == inumber) {
108 1.1 bouyer zlnp->zlncnt = zlnhead->zlncnt;
109 1.1 bouyer zlnp = zlnhead;
110 1.1 bouyer zlnhead = zlnhead->next;
111 1.1 bouyer free((char *)zlnp);
112 1.1 bouyer clri(&idesc, "UNREF", 1);
113 1.1 bouyer break;
114 1.1 bouyer }
115 1.1 bouyer }
116 1.1 bouyer break;
117 1.1 bouyer
118 1.1 bouyer case DSTATE:
119 1.1 bouyer clri(&idesc, "UNREF", 1);
120 1.1 bouyer break;
121 1.1 bouyer
122 1.1 bouyer case DCLEAR:
123 1.1 bouyer dp = ginode(inumber);
124 1.1 bouyer if (dp->e2di_size == 0) {
125 1.1 bouyer clri(&idesc, "ZERO LENGTH", 1);
126 1.1 bouyer break;
127 1.1 bouyer }
128 1.1 bouyer /* fall through */
129 1.1 bouyer case FCLEAR:
130 1.1 bouyer clri(&idesc, "BAD/DUP", 1);
131 1.1 bouyer break;
132 1.1 bouyer
133 1.1 bouyer case USTATE:
134 1.1 bouyer break;
135 1.1 bouyer
136 1.1 bouyer default:
137 1.1 bouyer errexit("BAD STATE %d FOR INODE I=%d\n",
138 1.1 bouyer statemap[inumber], inumber);
139 1.1 bouyer }
140 1.1 bouyer }
141 1.1 bouyer }
142 1.1 bouyer
143 1.1 bouyer int
144 1.1 bouyer pass4check(idesc)
145 1.2 lukem struct inodesc *idesc;
146 1.1 bouyer {
147 1.2 lukem struct dups *dlp;
148 1.1 bouyer int nfrags, res = KEEPON;
149 1.1 bouyer daddr_t blkno = idesc->id_blkno;
150 1.1 bouyer
151 1.1 bouyer for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
152 1.1 bouyer if (chkrange(blkno, 1)) {
153 1.1 bouyer res = SKIP;
154 1.1 bouyer } else if (testbmap(blkno)) {
155 1.1 bouyer for (dlp = duplist; dlp; dlp = dlp->next) {
156 1.1 bouyer if (dlp->dup != blkno)
157 1.1 bouyer continue;
158 1.1 bouyer dlp->dup = duplist->dup;
159 1.1 bouyer dlp = duplist;
160 1.1 bouyer duplist = duplist->next;
161 1.1 bouyer free((char *)dlp);
162 1.1 bouyer break;
163 1.1 bouyer }
164 1.1 bouyer if (dlp == 0) {
165 1.1 bouyer clrbmap(blkno);
166 1.1 bouyer n_blks--;
167 1.1 bouyer }
168 1.1 bouyer }
169 1.1 bouyer }
170 1.1 bouyer return (res);
171 1.1 bouyer }
172