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