Deleted Added
sdiff udiff text old ( 37443 ) new ( 41474 )
full compact
pass1.c (37443) pass1.c (41474)
1/*
2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 18 unchanged lines hidden (view full) ---

27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
1/*
2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 18 unchanged lines hidden (view full) ---

27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35#if 0
36static const char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95";
35static const char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95";
37#endif
38static const char rcsid[] =
39 "$Id: pass1.c,v 1.11 1998/06/15 07:07:16 charnier Exp $";
40#endif /* not lint */
41
42#include <sys/param.h>
36#endif /* not lint */
37
38#include <sys/param.h>
39#include <sys/time.h>
43
44#include <ufs/ufs/dinode.h>
45#include <ufs/ufs/dir.h>
46#include <ufs/ffs/fs.h>
47
48#include <err.h>
49#include <string.h>
50
51#include "fsck.h"
52
53static ufs_daddr_t badblk;
54static ufs_daddr_t dupblk;
40
41#include <ufs/ufs/dinode.h>
42#include <ufs/ufs/dir.h>
43#include <ufs/ffs/fs.h>
44
45#include <err.h>
46#include <string.h>
47
48#include "fsck.h"
49
50static ufs_daddr_t badblk;
51static ufs_daddr_t dupblk;
52static ino_t lastino; /* last inode in use */
55
56static void checkinode __P((ino_t inumber, struct inodesc *));
57
58void
59pass1()
60{
53
54static void checkinode __P((ino_t inumber, struct inodesc *));
55
56void
57pass1()
58{
59 u_int8_t *cp;
61 ino_t inumber;
60 ino_t inumber;
62 int c, i, cgd;
61 int c, i, cgd, inosused;
62 struct inostat *info;
63 struct inodesc idesc;
64
65 /*
66 * Set file system reserved blocks in used block map.
67 */
68 for (c = 0; c < sblock.fs_ncg; c++) {
69 cgd = cgdmin(&sblock, c);
70 if (c == 0) {

--- 5 unchanged lines hidden (view full) ---

76 setbmap(i);
77 }
78 /*
79 * Find all allocated blocks.
80 */
81 memset(&idesc, 0, sizeof(struct inodesc));
82 idesc.id_type = ADDR;
83 idesc.id_func = pass1check;
63 struct inodesc idesc;
64
65 /*
66 * Set file system reserved blocks in used block map.
67 */
68 for (c = 0; c < sblock.fs_ncg; c++) {
69 cgd = cgdmin(&sblock, c);
70 if (c == 0) {

--- 5 unchanged lines hidden (view full) ---

76 setbmap(i);
77 }
78 /*
79 * Find all allocated blocks.
80 */
81 memset(&idesc, 0, sizeof(struct inodesc));
82 idesc.id_type = ADDR;
83 idesc.id_func = pass1check;
84 inumber = 0;
85 n_files = n_blks = 0;
84 n_files = n_blks = 0;
86 resetinodebuf();
87 for (c = 0; c < sblock.fs_ncg; c++) {
85 for (c = 0; c < sblock.fs_ncg; c++) {
88 for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
89 if (inumber < ROOTINO)
86 inumber = c * sblock.fs_ipg;
87 setinodebuf(inumber);
88 inosused = sblock.fs_ipg;
89 /*
90 * If we are using soft updates, then we can trust the
91 * cylinder group inode allocation maps to tell us which
92 * inodes are allocated. We will scan the used inode map
93 * to find the inodes that are really in use, and then
94 * read only those inodes in from disk.
95 */
96 if (preen && usedsoftdep) {
97 getblk(&cgblk, cgtod(&sblock, c), sblock.fs_cgsize);
98 if (!cg_chkmagic(&cgrp))
99 pfatal("CG %d: BAD MAGIC NUMBER\n", c);
100 cp = &cg_inosused(&cgrp)[(sblock.fs_ipg - 1) / NBBY];
101 for ( ; inosused > 0; inosused -= NBBY, cp--) {
102 if (*cp == 0)
103 continue;
104 for (i = 1 << (NBBY - 1); i > 0; i >>= 1) {
105 if (*cp & i)
106 break;
107 inosused--;
108 }
109 break;
110 }
111 if (inosused < 0)
112 inosused = 0;
113 }
114 /*
115 * Allocate inoinfo structures for the allocated inodes.
116 */
117 inostathead[c].il_numalloced = inosused;
118 if (inosused == 0) {
119 inostathead[c].il_stat = 0;
120 continue;
121 }
122 info = calloc((unsigned)inosused, sizeof(struct inostat));
123 if (info == NULL)
124 pfatal("cannot alloc %u bytes for inoinfo\n",
125 (unsigned)(sizeof(struct inostat) * inosused));
126 inostathead[c].il_stat = info;
127 /*
128 * Scan the allocated inodes.
129 */
130 for (i = 0; i < inosused; i++, inumber++) {
131 if (inumber < ROOTINO) {
132 (void)getnextinode(inumber);
90 continue;
133 continue;
134 }
91 checkinode(inumber, &idesc);
92 }
135 checkinode(inumber, &idesc);
136 }
137 lastino += 1;
138 if (inosused < sblock.fs_ipg || inumber == lastino)
139 continue;
140 /*
141 * If we were not able to determine in advance which inodes
142 * were in use, then reduce the size of the inoinfo structure
143 * to the size necessary to describe the inodes that we
144 * really found.
145 */
146 inosused = lastino - (c * sblock.fs_ipg);
147 if (inosused < 0)
148 inosused = 0;
149 inostathead[c].il_numalloced = inosused;
150 if (inosused == 0) {
151 free(inostathead[c].il_stat);
152 inostathead[c].il_stat = 0;
153 continue;
154 }
155 info = calloc((unsigned)inosused, sizeof(struct inostat));
156 if (info == NULL)
157 pfatal("cannot alloc %u bytes for inoinfo\n",
158 (unsigned)(sizeof(struct inostat) * inosused));
159 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info));
160 free(inostathead[c].il_stat);
161 inostathead[c].il_stat = info;
93 }
94 freeinodebuf();
95}
96
97static void
98checkinode(inumber, idesc)
99 ino_t inumber;
100 register struct inodesc *idesc;

--- 14 unchanged lines hidden (view full) ---

115 dp->di_mode || dp->di_size) {
116 pfatal("PARTIALLY ALLOCATED INODE I=%lu", inumber);
117 if (reply("CLEAR") == 1) {
118 dp = ginode(inumber);
119 clearinode(dp);
120 inodirty();
121 }
122 }
162 }
163 freeinodebuf();
164}
165
166static void
167checkinode(inumber, idesc)
168 ino_t inumber;
169 register struct inodesc *idesc;

--- 14 unchanged lines hidden (view full) ---

184 dp->di_mode || dp->di_size) {
185 pfatal("PARTIALLY ALLOCATED INODE I=%lu", inumber);
186 if (reply("CLEAR") == 1) {
187 dp = ginode(inumber);
188 clearinode(dp);
189 inodirty();
190 }
191 }
123 statemap[inumber] = USTATE;
192 inoinfo(inumber)->ino_state = USTATE;
124 return;
125 }
126 lastino = inumber;
127 if (/* dp->di_size < 0 || */
128 dp->di_size + sblock.fs_bsize - 1 < dp->di_size ||
129 (mode == IFDIR && dp->di_size > MAXDIRSIZE)) {
130 if (debug)
131 printf("bad size %qu:", dp->di_size);

--- 21 unchanged lines hidden (view full) ---

153 symbuf = alloca(secsize);
154 if (bread(fsreadfd, symbuf,
155 fsbtodb(&sblock, dp->di_db[0]),
156 (long)secsize) != 0)
157 errx(EEXIT, "cannot read symlink");
158 if (debug) {
159 symbuf[dp->di_size] = 0;
160 printf("convert symlink %lu(%s) of size %ld\n",
193 return;
194 }
195 lastino = inumber;
196 if (/* dp->di_size < 0 || */
197 dp->di_size + sblock.fs_bsize - 1 < dp->di_size ||
198 (mode == IFDIR && dp->di_size > MAXDIRSIZE)) {
199 if (debug)
200 printf("bad size %qu:", dp->di_size);

--- 21 unchanged lines hidden (view full) ---

222 symbuf = alloca(secsize);
223 if (bread(fsreadfd, symbuf,
224 fsbtodb(&sblock, dp->di_db[0]),
225 (long)secsize) != 0)
226 errx(EEXIT, "cannot read symlink");
227 if (debug) {
228 symbuf[dp->di_size] = 0;
229 printf("convert symlink %lu(%s) of size %ld\n",
161 (u_long)inumber, symbuf,
162 (long)dp->di_size);
230 (u_long)inumber, symbuf, (long)dp->di_size);
163 }
164 dp = ginode(inumber);
165 memmove(dp->di_shortlink, symbuf, (long)dp->di_size);
166 dp->di_blocks = 0;
167 inodirty();
168 }
169 /*
170 * Fake ndb value so direct/indirect block checks below
171 * will detect any garbage after symlink string.
172 */
231 }
232 dp = ginode(inumber);
233 memmove(dp->di_shortlink, symbuf, (long)dp->di_size);
234 dp->di_blocks = 0;
235 inodirty();
236 }
237 /*
238 * Fake ndb value so direct/indirect block checks below
239 * will detect any garbage after symlink string.
240 */
173 if (dp->di_size < sblock.fs_maxsymlinklen ||
174 dp->di_blocks == 0) {
241 if (dp->di_size < sblock.fs_maxsymlinklen) {
175 ndb = howmany(dp->di_size, sizeof(ufs_daddr_t));
176 if (ndb > NDADDR) {
177 j = ndb - NDADDR;
178 for (ndb = 1; j > 1; j--)
179 ndb *= NINDIR(&sblock);
180 ndb += NDADDR;
181 }
182 }

--- 12 unchanged lines hidden (view full) ---

195 if (debug)
196 printf("bad indirect addr: %ld\n",
197 (long)dp->di_ib[j]);
198 goto unknown;
199 }
200 if (ftypeok(dp) == 0)
201 goto unknown;
202 n_files++;
242 ndb = howmany(dp->di_size, sizeof(ufs_daddr_t));
243 if (ndb > NDADDR) {
244 j = ndb - NDADDR;
245 for (ndb = 1; j > 1; j--)
246 ndb *= NINDIR(&sblock);
247 ndb += NDADDR;
248 }
249 }

--- 12 unchanged lines hidden (view full) ---

262 if (debug)
263 printf("bad indirect addr: %ld\n",
264 (long)dp->di_ib[j]);
265 goto unknown;
266 }
267 if (ftypeok(dp) == 0)
268 goto unknown;
269 n_files++;
203 lncntp[inumber] = dp->di_nlink;
270 inoinfo(inumber)->ino_linkcnt = dp->di_nlink;
204 if (dp->di_nlink <= 0) {
205 zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
206 if (zlnp == NULL) {
207 pfatal("LINK COUNT TABLE OVERFLOW");
208 if (reply("CONTINUE") == 0) {
209 ckfini(0);
210 exit(EEXIT);
211 }
212 } else {
213 zlnp->zlncnt = inumber;
214 zlnp->next = zlnhead;
215 zlnhead = zlnp;
216 }
217 }
218 if (mode == IFDIR) {
219 if (dp->di_size == 0)
271 if (dp->di_nlink <= 0) {
272 zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
273 if (zlnp == NULL) {
274 pfatal("LINK COUNT TABLE OVERFLOW");
275 if (reply("CONTINUE") == 0) {
276 ckfini(0);
277 exit(EEXIT);
278 }
279 } else {
280 zlnp->zlncnt = inumber;
281 zlnp->next = zlnhead;
282 zlnhead = zlnp;
283 }
284 }
285 if (mode == IFDIR) {
286 if (dp->di_size == 0)
220 statemap[inumber] = DCLEAR;
287 inoinfo(inumber)->ino_state = DCLEAR;
221 else
288 else
222 statemap[inumber] = DSTATE;
289 inoinfo(inumber)->ino_state = DSTATE;
223 cacheino(dp, inumber);
290 cacheino(dp, inumber);
291 countdirs++;
224 } else
292 } else
225 statemap[inumber] = FSTATE;
226 typemap[inumber] = IFTODT(mode);
293 inoinfo(inumber)->ino_state = FSTATE;
294 inoinfo(inumber)->ino_type = IFTODT(mode);
227 if (doinglevel2 &&
228 (dp->di_ouid != (u_short)-1 || dp->di_ogid != (u_short)-1)) {
229 dp = ginode(inumber);
230 dp->di_uid = dp->di_ouid;
231 dp->di_ouid = -1;
232 dp->di_gid = dp->di_ogid;
233 dp->di_ogid = -1;
234 inodirty();

--- 11 unchanged lines hidden (view full) ---

246 return;
247 dp = ginode(inumber);
248 dp->di_blocks = idesc->id_entryno;
249 inodirty();
250 }
251 return;
252unknown:
253 pfatal("UNKNOWN FILE TYPE I=%lu", inumber);
295 if (doinglevel2 &&
296 (dp->di_ouid != (u_short)-1 || dp->di_ogid != (u_short)-1)) {
297 dp = ginode(inumber);
298 dp->di_uid = dp->di_ouid;
299 dp->di_ouid = -1;
300 dp->di_gid = dp->di_ogid;
301 dp->di_ogid = -1;
302 inodirty();

--- 11 unchanged lines hidden (view full) ---

314 return;
315 dp = ginode(inumber);
316 dp->di_blocks = idesc->id_entryno;
317 inodirty();
318 }
319 return;
320unknown:
321 pfatal("UNKNOWN FILE TYPE I=%lu", inumber);
254 statemap[inumber] = FCLEAR;
322 inoinfo(inumber)->ino_state = FCLEAR;
255 if (reply("CLEAR") == 1) {
323 if (reply("CLEAR") == 1) {
256 statemap[inumber] = USTATE;
324 inoinfo(inumber)->ino_state = USTATE;
257 dp = ginode(inumber);
258 clearinode(dp);
259 inodirty();
260 }
261}
262
263int
264pass1check(idesc)

--- 71 unchanged lines hidden --- 		325 dp = ginode(inumber);
326 clearinode(dp);
327 inodirty();
328 }
329}
330
331int
332pass1check(idesc)

--- 71 unchanged lines hidden ---