pass4.c revision 1.26 1 1.26 dholland /* $NetBSD: pass4.c,v 1.26 2015/08/12 18:28:00 dholland Exp $ */
2 1.1 perseant
3 1.1 perseant /*
4 1.1 perseant * Copyright (c) 1980, 1986, 1993
5 1.1 perseant * The Regents of the University of California. All rights reserved.
6 1.1 perseant *
7 1.1 perseant * Redistribution and use in source and binary forms, with or without
8 1.1 perseant * modification, are permitted provided that the following conditions
9 1.1 perseant * are met:
10 1.1 perseant * 1. Redistributions of source code must retain the above copyright
11 1.1 perseant * notice, this list of conditions and the following disclaimer.
12 1.1 perseant * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 perseant * notice, this list of conditions and the following disclaimer in the
14 1.1 perseant * documentation and/or other materials provided with the distribution.
15 1.9 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 perseant * may be used to endorse or promote products derived from this software
17 1.1 perseant * without specific prior written permission.
18 1.1 perseant *
19 1.1 perseant * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 perseant * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 perseant * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 perseant * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 perseant * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 perseant * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 perseant * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 perseant * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 perseant * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 perseant * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 perseant * SUCH DAMAGE.
30 1.1 perseant */
31 1.1 perseant
32 1.1 perseant #include <sys/param.h>
33 1.1 perseant #include <sys/time.h>
34 1.1 perseant #include <sys/mount.h>
35 1.6 perseant
36 1.6 perseant #define vnode uvnode
37 1.6 perseant #define buf ubuf
38 1.6 perseant #define panic call_panic
39 1.1 perseant #include <ufs/lfs/lfs.h>
40 1.25 dholland #include <ufs/lfs/lfs_accessors.h>
41 1.21 dholland #include <ufs/lfs/lfs_inode.h>
42 1.6 perseant
43 1.6 perseant #include <err.h>
44 1.1 perseant #include <stdlib.h>
45 1.1 perseant #include <string.h>
46 1.1 perseant
47 1.6 perseant #include "bufcache.h"
48 1.6 perseant #include "vnode.h"
49 1.13 christos #include "lfs_user.h"
50 1.6 perseant
51 1.1 perseant #include "fsutil.h"
52 1.1 perseant #include "fsck.h"
53 1.1 perseant #include "extern.h"
54 1.1 perseant
55 1.6 perseant extern SEGUSE *seg_table;
56 1.6 perseant
57 1.15 perseant static int check_orphan(struct inodesc *idp);
58 1.15 perseant
59 1.15 perseant static int
60 1.15 perseant check_orphan(struct inodesc *idp)
61 1.15 perseant {
62 1.15 perseant struct zlncnt *zlnp;
63 1.15 perseant ino_t inumber = idp->id_number;
64 1.15 perseant
65 1.15 perseant for (zlnp = orphead; zlnp; zlnp = zlnp->next) {
66 1.15 perseant if (zlnp->zlncnt == inumber) {
67 1.15 perseant /* Swap this with head */
68 1.15 perseant zlnp->zlncnt = orphead->zlncnt;
69 1.15 perseant zlnp = orphead;
70 1.15 perseant orphead = orphead->next;
71 1.15 perseant /* Free old head */
72 1.15 perseant free((char *) zlnp);
73 1.15 perseant clri(idp, "PROPERLY ORPHANED", 1);
74 1.15 perseant return 1;
75 1.15 perseant }
76 1.15 perseant }
77 1.15 perseant return 0;
78 1.15 perseant }
79 1.15 perseant
80 1.1 perseant void
81 1.10 xtraeme pass4(void)
82 1.1 perseant {
83 1.11 perry ino_t inumber;
84 1.11 perry struct zlncnt *zlnp;
85 1.26 dholland union lfs_dinode *dp;
86 1.6 perseant struct inodesc idesc;
87 1.6 perseant int n;
88 1.1 perseant
89 1.1 perseant memset(&idesc, 0, sizeof(struct inodesc));
90 1.1 perseant idesc.id_type = ADDR;
91 1.1 perseant idesc.id_func = pass4check;
92 1.19 dholland for (inumber = ULFS_ROOTINO; inumber <= lastino; inumber++) {
93 1.1 perseant idesc.id_number = inumber;
94 1.1 perseant switch (statemap[inumber]) {
95 1.1 perseant
96 1.1 perseant case FSTATE:
97 1.1 perseant case DFOUND:
98 1.1 perseant n = lncntp[inumber];
99 1.1 perseant if (n)
100 1.6 perseant adjust(&idesc, (short) n);
101 1.1 perseant else {
102 1.1 perseant for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
103 1.1 perseant if (zlnp->zlncnt == inumber) {
104 1.1 perseant zlnp->zlncnt = zlnhead->zlncnt;
105 1.1 perseant zlnp = zlnhead;
106 1.1 perseant zlnhead = zlnhead->next;
107 1.6 perseant free((char *) zlnp);
108 1.1 perseant clri(&idesc, "UNREF", 1);
109 1.1 perseant break;
110 1.1 perseant }
111 1.1 perseant }
112 1.1 perseant break;
113 1.1 perseant
114 1.1 perseant case DSTATE:
115 1.1 perseant clri(&idesc, "UNREF", 1);
116 1.1 perseant break;
117 1.1 perseant
118 1.1 perseant case DCLEAR:
119 1.15 perseant if (check_orphan(&idesc))
120 1.15 perseant break;
121 1.1 perseant dp = ginode(inumber);
122 1.26 dholland if (lfs_dino_getsize(fs, dp) == 0) {
123 1.15 perseant const char * msg = (lncntp[inumber] ?
124 1.15 perseant "ZERO LENGTH" : "UNREF ZERO LENGTH");
125 1.15 perseant clri(&idesc, msg, 1);
126 1.1 perseant break;
127 1.1 perseant }
128 1.15 perseant clri(&idesc, "BAD/DUP", 1);
129 1.15 perseant break;
130 1.15 perseant
131 1.1 perseant case FCLEAR:
132 1.15 perseant if (check_orphan(&idesc))
133 1.15 perseant break;
134 1.1 perseant clri(&idesc, "BAD/DUP", 1);
135 1.1 perseant break;
136 1.1 perseant
137 1.1 perseant case USTATE:
138 1.1 perseant break;
139 1.1 perseant
140 1.1 perseant default:
141 1.23 christos err(EEXIT, "BAD STATE %d FOR INODE I=%llu",
142 1.12 christos statemap[inumber], (unsigned long long)inumber);
143 1.1 perseant }
144 1.1 perseant }
145 1.1 perseant }
146 1.1 perseant
147 1.1 perseant int
148 1.3 perseant pass4check(struct inodesc * idesc)
149 1.1 perseant {
150 1.11 perry struct dups *dlp;
151 1.6 perseant int ndblks, res = KEEPON;
152 1.6 perseant daddr_t blkno = idesc->id_blkno;
153 1.6 perseant SEGUSE *sup;
154 1.6 perseant struct ubuf *bp;
155 1.14 perseant int sn;
156 1.1 perseant
157 1.22 christos sn = lfs_dtosn(fs, blkno);
158 1.17 mlelstv for (ndblks = idesc->id_numfrags; ndblks > 0; blkno++, ndblks--) {
159 1.1 perseant if (chkrange(blkno, 1)) {
160 1.1 perseant res = SKIP;
161 1.14 perseant } else if (testbmap(blkno) || preen) {
162 1.1 perseant for (dlp = duplist; dlp; dlp = dlp->next) {
163 1.1 perseant if (dlp->dup != blkno)
164 1.1 perseant continue;
165 1.1 perseant dlp->dup = duplist->dup;
166 1.1 perseant dlp = duplist;
167 1.1 perseant duplist = duplist->next;
168 1.6 perseant free((char *) dlp);
169 1.1 perseant break;
170 1.1 perseant }
171 1.1 perseant if (dlp == 0) {
172 1.1 perseant clrbmap(blkno);
173 1.6 perseant LFS_SEGENTRY(sup, fs, sn, bp);
174 1.22 christos sup->su_nbytes -= lfs_fsbtob(fs, 1);
175 1.6 perseant VOP_BWRITE(bp);
176 1.22 christos seg_table[sn].su_nbytes -= lfs_fsbtob(fs, 1);
177 1.24 dholland lfs_sb_addbfree(fs, 1);
178 1.1 perseant n_blks--;
179 1.1 perseant }
180 1.1 perseant }
181 1.1 perseant }
182 1.1 perseant return (res);
183 1.1 perseant }
184