Commit | Line | Data |
---|---|---|
76797561 | 1 | /* |
fe32782c KM |
2 | * Copyright (c) 1980, 1986 The Regents of the University of California. |
3 | * All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms are permitted | |
6 | * provided that the above copyright notice and this paragraph are | |
7 | * duplicated in all such forms and that any documentation, | |
8 | * advertising materials, and other materials related to such | |
9 | * distribution and use acknowledge that the software was developed | |
10 | * by the University of California, Berkeley. The name of the | |
11 | * University may not be used to endorse or promote products derived | |
12 | * from this software without specific prior written permission. | |
13 | * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR | |
14 | * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED | |
15 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. | |
76797561 DF |
16 | */ |
17 | ||
19052d90 | 18 | #ifndef lint |
57117c0f | 19 | static char sccsid[] = "@(#)pass1.c 5.10 (Berkeley) %G%"; |
fe32782c | 20 | #endif /* not lint */ |
19052d90 KM |
21 | |
22 | #include <sys/param.h> | |
72e5286b | 23 | #include <ufs/dinode.h> |
4d7f4685 | 24 | #include <ufs/fs.h> |
19052d90 KM |
25 | #include "fsck.h" |
26 | ||
993a756c KM |
27 | static daddr_t badblk; |
28 | static daddr_t dupblk; | |
29 | int pass1check(); | |
19052d90 KM |
30 | |
31 | pass1() | |
32 | { | |
993a756c | 33 | register int c, i, j; |
569ec282 | 34 | register struct dinode *dp; |
82dc9a9e | 35 | struct zlncnt *zlnp; |
569ec282 | 36 | int ndb, cgd; |
19052d90 KM |
37 | struct inodesc idesc; |
38 | ino_t inumber; | |
39 | ||
7718c0e6 KM |
40 | /* |
41 | * Set file system reserved blocks in used block map. | |
42 | */ | |
43 | for (c = 0; c < sblock.fs_ncg; c++) { | |
44 | cgd = cgdmin(&sblock, c); | |
45 | if (c == 0) { | |
46 | i = cgbase(&sblock, c); | |
47 | cgd += howmany(sblock.fs_cssize, sblock.fs_fsize); | |
48 | } else | |
49 | i = cgsblock(&sblock, c); | |
50 | for (; i < cgd; i++) | |
51 | setbmap(i); | |
52 | } | |
53 | /* | |
54 | * Find all allocated blocks. | |
55 | */ | |
19052d90 KM |
56 | bzero((char *)&idesc, sizeof(struct inodesc)); |
57 | idesc.id_type = ADDR; | |
58 | idesc.id_func = pass1check; | |
59 | inumber = 0; | |
993a756c | 60 | n_files = n_blks = 0; |
19052d90 | 61 | for (c = 0; c < sblock.fs_ncg; c++) { |
19052d90 | 62 | for (i = 0; i < sblock.fs_ipg; i++, inumber++) { |
993a756c | 63 | if (inumber < ROOTINO) |
19052d90 | 64 | continue; |
39c18287 | 65 | dp = ginode(inumber); |
569ec282 | 66 | if ((dp->di_mode & IFMT) == 0) { |
993a756c KM |
67 | if (bcmp((char *)dp->di_db, (char *)zino.di_db, |
68 | NDADDR * sizeof(daddr_t)) || | |
69 | bcmp((char *)dp->di_ib, (char *)zino.di_ib, | |
70 | NIADDR * sizeof(daddr_t)) || | |
71 | dp->di_mode || dp->di_size) { | |
19052d90 KM |
72 | pfatal("PARTIALLY ALLOCATED INODE I=%u", |
73 | inumber); | |
74 | if (reply("CLEAR") == 1) { | |
569ec282 | 75 | clearinode(dp); |
19052d90 | 76 | inodirty(); |
19052d90 KM |
77 | } |
78 | } | |
993a756c KM |
79 | statemap[inumber] = USTATE; |
80 | continue; | |
81 | } | |
82 | lastino = inumber; | |
98061440 KM |
83 | if (dp->di_size < 0 || |
84 | dp->di_size + sblock.fs_bsize - 1 < 0) { | |
993a756c KM |
85 | if (debug) |
86 | printf("bad size %d:", dp->di_size); | |
87 | goto unknown; | |
88 | } | |
958be3d3 KM |
89 | if (!preen && (dp->di_mode & IFMT) == IFMT && |
90 | reply("HOLD BAD BLOCK") == 1) { | |
91 | dp->di_size = sblock.fs_fsize; | |
92 | dp->di_mode = IFREG|0600; | |
93 | inodirty(); | |
94 | } | |
993a756c | 95 | ndb = howmany(dp->di_size, sblock.fs_bsize); |
dad05901 KM |
96 | if (ndb < 0) { |
97 | if (debug) | |
98 | printf("bad size %d ndb %d:", | |
99 | dp->di_size, ndb); | |
100 | goto unknown; | |
101 | } | |
569ec282 KM |
102 | if ((dp->di_mode & IFMT) == IFBLK || |
103 | (dp->di_mode & IFMT) == IFCHR) | |
993a756c KM |
104 | ndb++; |
105 | for (j = ndb; j < NDADDR; j++) | |
106 | if (dp->di_db[j] != 0) { | |
107 | if (debug) | |
108 | printf("bad direct addr: %d\n", | |
109 | dp->di_db[j]); | |
110 | goto unknown; | |
111 | } | |
112 | for (j = 0, ndb -= NDADDR; ndb > 0; j++) | |
113 | ndb /= NINDIR(&sblock); | |
114 | for (; j < NIADDR; j++) | |
115 | if (dp->di_ib[j] != 0) { | |
116 | if (debug) | |
117 | printf("bad indirect addr: %d\n", | |
118 | dp->di_ib[j]); | |
119 | goto unknown; | |
120 | } | |
958be3d3 | 121 | if (ftypeok(dp) == 0) |
993a756c KM |
122 | goto unknown; |
123 | n_files++; | |
124 | lncntp[inumber] = dp->di_nlink; | |
125 | if (dp->di_nlink <= 0) { | |
82dc9a9e KM |
126 | zlnp = (struct zlncnt *)malloc(sizeof *zlnp); |
127 | if (zlnp == NULL) { | |
993a756c KM |
128 | pfatal("LINK COUNT TABLE OVERFLOW"); |
129 | if (reply("CONTINUE") == 0) | |
130 | errexit(""); | |
82dc9a9e KM |
131 | } else { |
132 | zlnp->zlncnt = inumber; | |
133 | zlnp->next = zlnhead; | |
134 | zlnhead = zlnp; | |
993a756c KM |
135 | } |
136 | } | |
57117c0f KM |
137 | if ((dp->di_mode & IFMT) == IFDIR) { |
138 | statemap[inumber] = DSTATE; | |
139 | cacheino(dp, inumber); | |
140 | } else | |
141 | statemap[inumber] = FSTATE; | |
569ec282 | 142 | badblk = dupblk = 0; |
993a756c | 143 | idesc.id_number = inumber; |
993a756c | 144 | (void)ckinode(dp, &idesc); |
f0ed004a KM |
145 | idesc.id_entryno *= btodb(sblock.fs_fsize); |
146 | if (dp->di_blocks != idesc.id_entryno) { | |
993a756c | 147 | pwarn("INCORRECT BLOCK COUNT I=%u (%ld should be %ld)", |
f0ed004a | 148 | inumber, dp->di_blocks, idesc.id_entryno); |
993a756c KM |
149 | if (preen) |
150 | printf(" (CORRECTED)\n"); | |
151 | else if (reply("CORRECT") == 0) | |
152 | continue; | |
f0ed004a | 153 | dp->di_blocks = idesc.id_entryno; |
993a756c KM |
154 | inodirty(); |
155 | } | |
156 | continue; | |
157 | unknown: | |
158 | pfatal("UNKNOWN FILE TYPE I=%u", inumber); | |
7b9b1d1f | 159 | statemap[inumber] = FCLEAR; |
993a756c | 160 | if (reply("CLEAR") == 1) { |
7b9b1d1f | 161 | statemap[inumber] = USTATE; |
569ec282 | 162 | clearinode(dp); |
993a756c | 163 | inodirty(); |
19052d90 KM |
164 | } |
165 | } | |
19052d90 KM |
166 | } |
167 | } | |
168 | ||
169 | pass1check(idesc) | |
170 | register struct inodesc *idesc; | |
171 | { | |
19052d90 KM |
172 | int res = KEEPON; |
173 | int anyout, nfrags; | |
174 | daddr_t blkno = idesc->id_blkno; | |
62e6c152 KM |
175 | register struct dups *dlp; |
176 | struct dups *new; | |
19052d90 | 177 | |
569ec282 KM |
178 | if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { |
179 | blkerror(idesc->id_number, "BAD", blkno); | |
7718c0e6 KM |
180 | if (++badblk >= MAXBAD) { |
181 | pwarn("EXCESSIVE BAD BLKS I=%u", | |
182 | idesc->id_number); | |
183 | if (preen) | |
184 | printf(" (SKIPPING)\n"); | |
185 | else if (reply("CONTINUE") == 0) | |
186 | errexit(""); | |
187 | return (STOP); | |
188 | } | |
189 | } | |
19052d90 | 190 | for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { |
569ec282 | 191 | if (anyout && chkrange(blkno, 1)) { |
19052d90 | 192 | res = SKIP; |
569ec282 | 193 | } else if (!testbmap(blkno)) { |
7718c0e6 KM |
194 | n_blks++; |
195 | setbmap(blkno); | |
196 | } else { | |
569ec282 | 197 | blkerror(idesc->id_number, "DUP", blkno); |
19052d90 KM |
198 | if (++dupblk >= MAXDUP) { |
199 | pwarn("EXCESSIVE DUP BLKS I=%u", | |
200 | idesc->id_number); | |
201 | if (preen) | |
202 | printf(" (SKIPPING)\n"); | |
203 | else if (reply("CONTINUE") == 0) | |
204 | errexit(""); | |
205 | return (STOP); | |
206 | } | |
62e6c152 KM |
207 | new = (struct dups *)malloc(sizeof(struct dups)); |
208 | if (new == NULL) { | |
19052d90 KM |
209 | pfatal("DUP TABLE OVERFLOW."); |
210 | if (reply("CONTINUE") == 0) | |
211 | errexit(""); | |
212 | return (STOP); | |
213 | } | |
62e6c152 KM |
214 | new->dup = blkno; |
215 | if (muldup == 0) { | |
216 | duplist = muldup = new; | |
217 | new->next = 0; | |
218 | } else { | |
219 | new->next = muldup->next; | |
220 | muldup->next = new; | |
19052d90 | 221 | } |
62e6c152 KM |
222 | for (dlp = duplist; dlp != muldup; dlp = dlp->next) |
223 | if (dlp->dup == blkno) | |
224 | break; | |
225 | if (dlp == muldup && dlp->dup != blkno) | |
226 | muldup = new; | |
19052d90 | 227 | } |
f0ed004a KM |
228 | /* |
229 | * count the number of blocks found in id_entryno | |
230 | */ | |
231 | idesc->id_entryno++; | |
19052d90 KM |
232 | } |
233 | return (res); | |
234 | } |