pass1.c revision 1.15
1 /* $NetBSD: pass1.c,v 1.15 2005/08/19 02:07:18 christos Exp $ */ 2 3 /* 4 * Copyright (c) 1980, 1986, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 /* 33 * Copyright (c) 1997 Manuel Bouyer. 34 * 35 * Redistribution and use in source and binary forms, with or without 36 * modification, are permitted provided that the following conditions 37 * are met: 38 * 1. Redistributions of source code must retain the above copyright 39 * notice, this list of conditions and the following disclaimer. 40 * 2. Redistributions in binary form must reproduce the above copyright 41 * notice, this list of conditions and the following disclaimer in the 42 * documentation and/or other materials provided with the distribution. 43 * 3. All advertising materials mentioning features or use of this software 44 * must display the following acknowledgement: 45 * This product includes software developed by Manuel Bouyer. 46 * 4. The name of the author may not be used to endorse or promote products 47 * derived from this software without specific prior written permission. 48 * 49 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 50 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 51 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 52 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 53 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 54 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 55 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 56 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 57 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 58 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 59 */ 60 61 #include <sys/cdefs.h> 62 #ifndef lint 63 #if 0 64 static char sccsid[] = "@(#)pass1.c 8.1 (Berkeley) 6/5/93"; 65 #else 66 __RCSID("$NetBSD: pass1.c,v 1.15 2005/08/19 02:07:18 christos Exp $"); 67 #endif 68 #endif /* not lint */ 69 70 #include <sys/param.h> 71 #include <sys/time.h> 72 #include <ufs/ext2fs/ext2fs_dinode.h> 73 #include <ufs/ext2fs/ext2fs_dir.h> 74 #include <ufs/ext2fs/ext2fs.h> 75 76 #include <ufs/ufs/dinode.h> /* for IFMT & friends */ 77 78 #include <stdio.h> 79 #include <stdlib.h> 80 #include <string.h> 81 #include <time.h> 82 83 #include "fsck.h" 84 #include "extern.h" 85 #include "fsutil.h" 86 87 static daddr_t badblk; 88 static daddr_t dupblk; 89 static void checkinode(ino_t, struct inodesc *); 90 91 void 92 pass1(void) 93 { 94 ino_t inumber; 95 int c, i; 96 daddr_t dbase; 97 struct inodesc idesc; 98 99 /* 100 * Set file system reserved blocks in used block map. 101 */ 102 for (c = 0; c < sblock.e2fs_ncg; c++) { 103 dbase = c * sblock.e2fs.e2fs_bpg + 104 sblock.e2fs.e2fs_first_dblock; 105 /* Mark the blocks used for the inode table */ 106 if (fs2h32(sblock.e2fs_gd[c].ext2bgd_i_tables) >= dbase) { 107 for (i = 0; i < sblock.e2fs_itpg; i++) 108 setbmap( 109 fs2h32(sblock.e2fs_gd[c].ext2bgd_i_tables) 110 + i); 111 } 112 /* Mark the blocks used for the block bitmap */ 113 if (fs2h32(sblock.e2fs_gd[c].ext2bgd_b_bitmap) >= dbase) 114 setbmap(fs2h32(sblock.e2fs_gd[c].ext2bgd_b_bitmap)); 115 /* Mark the blocks used for the inode bitmap */ 116 if (fs2h32(sblock.e2fs_gd[c].ext2bgd_i_bitmap) >= dbase) 117 setbmap(fs2h32(sblock.e2fs_gd[c].ext2bgd_i_bitmap)); 118 119 if (sblock.e2fs.e2fs_rev == E2FS_REV0 || 120 (sblock.e2fs.e2fs_features_rocompat & 121 EXT2F_ROCOMPAT_SPARSESUPER) == 0 || 122 cg_has_sb(c)) { 123 /* Mark copuy of SB and descriptors */ 124 setbmap(dbase); 125 for (i = 1; i <= sblock.e2fs_ngdb; i++) 126 setbmap(dbase+i); 127 } 128 129 130 if (c == 0) { 131 for(i = 0; i < dbase; i++) 132 setbmap(i); 133 } 134 } 135 136 /* 137 * Find all allocated blocks. 138 */ 139 memset(&idesc, 0, sizeof(struct inodesc)); 140 idesc.id_type = ADDR; 141 idesc.id_func = pass1check; 142 inumber = 1; 143 n_files = n_blks = 0; 144 resetinodebuf(); 145 for (c = 0; c < sblock.e2fs_ncg; c++) { 146 for (i = 0; 147 i < sblock.e2fs.e2fs_ipg && inumber <= sblock.e2fs.e2fs_icount; 148 i++, inumber++) { 149 if (inumber < EXT2_ROOTINO) /* XXX */ 150 continue; 151 checkinode(inumber, &idesc); 152 } 153 } 154 freeinodebuf(); 155 } 156 157 static void 158 checkinode(ino_t inumber, struct inodesc *idesc) 159 { 160 struct ext2fs_dinode *dp; 161 struct zlncnt *zlnp; 162 int ndb, j; 163 mode_t mode; 164 165 dp = getnextinode(inumber); 166 if (inumber < EXT2_FIRSTINO && inumber != EXT2_ROOTINO) 167 return; 168 169 mode = fs2h16(dp->e2di_mode) & IFMT; 170 if (mode == 0 || (dp->e2di_dtime != 0 && dp->e2di_nlink == 0)) { 171 if (mode == 0 && ( 172 memcmp(dp->e2di_blocks, zino.e2di_blocks, 173 (NDADDR + NIADDR) * sizeof(u_int32_t)) || 174 dp->e2di_mode || inosize(dp))) { 175 pfatal("PARTIALLY ALLOCATED INODE I=%llu", 176 (unsigned long long)inumber); 177 if (reply("CLEAR") == 1) { 178 dp = ginode(inumber); 179 clearinode(dp); 180 inodirty(); 181 } 182 } 183 #ifdef notyet /* it seems that dtime == 0 is valid for a unallocated inode */ 184 if (dp->e2di_dtime == 0) { 185 pwarn("DELETED INODE I=%llu HAS A NULL DTIME", 186 (unsigned long long)inumber); 187 if (preen) { 188 printf(" (CORRECTED)\n"); 189 } 190 if (preen || reply("CORRECT")) { 191 time_t t; 192 time(&t); 193 dp->e2di_dtime = h2fs32(t); 194 dp = ginode(inumber); 195 inodirty(); 196 } 197 } 198 #endif 199 statemap[inumber] = USTATE; 200 return; 201 } 202 lastino = inumber; 203 if (dp->e2di_dtime != 0) { 204 time_t t = fs2h32(dp->e2di_dtime); 205 char *p = ctime(&t); 206 pwarn("INODE I=%llu HAS DTIME=%12.12s %4.4s", 207 (unsigned long long)inumber, &p[4], &p[20]); 208 if (preen) { 209 printf(" (CORRECTED)\n"); 210 } 211 if (preen || reply("CORRECT")) { 212 dp = ginode(inumber); 213 dp->e2di_dtime = 0; 214 inodirty(); 215 } 216 } 217 if (inosize(dp) + sblock.e2fs_bsize - 1 < inosize(dp)) { 218 if (debug) 219 printf("bad size %llu:", (unsigned long long)inosize(dp)); 220 goto unknown; 221 } 222 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 223 dp = ginode(inumber); 224 dp->e2di_mode = h2fs16(IFREG|0600); 225 inossize(dp, sblock.e2fs_bsize); 226 inodirty(); 227 } 228 ndb = howmany(inosize(dp), sblock.e2fs_bsize); 229 if (ndb < 0) { 230 if (debug) 231 printf("bad size %llu ndb %d:", 232 (unsigned long long)inosize(dp), ndb); 233 goto unknown; 234 } 235 if (mode == IFBLK || mode == IFCHR) 236 ndb++; 237 if (mode == IFLNK) { 238 /* 239 * Fake ndb value so direct/indirect block checks below 240 * will detect any garbage after symlink string. 241 */ 242 if (inosize(dp) < EXT2_MAXSYMLINKLEN || 243 (EXT2_MAXSYMLINKLEN == 0 && dp->e2di_blocks == 0)) { 244 ndb = howmany(inosize(dp), sizeof(u_int32_t)); 245 if (ndb > NDADDR) { 246 j = ndb - NDADDR; 247 for (ndb = 1; j > 1; j--) 248 ndb *= NINDIR(&sblock); 249 ndb += NDADDR; 250 } 251 } 252 } 253 /* Linux puts things in blocks for FIFO, so skip this check */ 254 if (mode != IFIFO) { 255 for (j = ndb; j < NDADDR; j++) 256 if (dp->e2di_blocks[j] != 0) { 257 if (debug) 258 printf("bad direct addr: %d\n", 259 fs2h32(dp->e2di_blocks[j])); 260 goto unknown; 261 } 262 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 263 ndb /= NINDIR(&sblock); 264 for (; j < NIADDR; j++) { 265 if (dp->e2di_blocks[j+NDADDR] != 0) { 266 if (debug) 267 printf("bad indirect addr: %d\n", 268 fs2h32(dp->e2di_blocks[j+NDADDR])); 269 goto unknown; 270 } 271 } 272 } 273 if (ftypeok(dp) == 0) 274 goto unknown; 275 n_files++; 276 lncntp[inumber] = fs2h16(dp->e2di_nlink); 277 if (dp->e2di_nlink == 0) { 278 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 279 if (zlnp == NULL) { 280 pfatal("LINK COUNT TABLE OVERFLOW"); 281 if (reply("CONTINUE") == 0) 282 errexit("%s\n", ""); 283 } else { 284 zlnp->zlncnt = inumber; 285 zlnp->next = zlnhead; 286 zlnhead = zlnp; 287 } 288 } 289 if (mode == IFDIR) { 290 if (inosize(dp) == 0) 291 statemap[inumber] = DCLEAR; 292 else 293 statemap[inumber] = DSTATE; 294 cacheino(dp, inumber); 295 } else { 296 statemap[inumber] = FSTATE; 297 } 298 typemap[inumber] = E2IFTODT(mode); 299 badblk = dupblk = 0; 300 idesc->id_number = inumber; 301 (void)ckinode(dp, idesc); 302 idesc->id_entryno *= btodb(sblock.e2fs_bsize); 303 if (fs2h32(dp->e2di_nblock) != idesc->id_entryno) { 304 pwarn("INCORRECT BLOCK COUNT I=%llu (%d should be %d)", 305 (unsigned long long)inumber, fs2h32(dp->e2di_nblock), 306 idesc->id_entryno); 307 if (preen) 308 printf(" (CORRECTED)\n"); 309 else if (reply("CORRECT") == 0) 310 return; 311 dp = ginode(inumber); 312 dp->e2di_nblock = h2fs32(idesc->id_entryno); 313 inodirty(); 314 } 315 return; 316 unknown: 317 pfatal("UNKNOWN FILE TYPE I=%llu", (unsigned long long)inumber); 318 statemap[inumber] = FCLEAR; 319 if (reply("CLEAR") == 1) { 320 statemap[inumber] = USTATE; 321 dp = ginode(inumber); 322 clearinode(dp); 323 inodirty(); 324 } 325 } 326 327 int 328 pass1check(struct inodesc *idesc) 329 { 330 int res = KEEPON; 331 int anyout, nfrags; 332 daddr_t blkno = idesc->id_blkno; 333 struct dups *dlp; 334 struct dups *new; 335 336 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 337 blkerror(idesc->id_number, "BAD", blkno); 338 if (badblk++ >= MAXBAD) { 339 pwarn("EXCESSIVE BAD BLKS I=%llu", 340 (unsigned long long)idesc->id_number); 341 if (preen) 342 printf(" (SKIPPING)\n"); 343 else if (reply("CONTINUE") == 0) 344 errexit("%s\n", ""); 345 return (STOP); 346 } 347 } 348 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 349 if (anyout && chkrange(blkno, 1)) { 350 res = SKIP; 351 } else if (!testbmap(blkno)) { 352 n_blks++; 353 setbmap(blkno); 354 } else { 355 blkerror(idesc->id_number, "DUP", blkno); 356 if (dupblk++ >= MAXDUP) { 357 pwarn("EXCESSIVE DUP BLKS I=%llu", 358 (unsigned long long)idesc->id_number); 359 if (preen) 360 printf(" (SKIPPING)\n"); 361 else if (reply("CONTINUE") == 0) 362 errexit("%s\n", ""); 363 return (STOP); 364 } 365 new = (struct dups *)malloc(sizeof(struct dups)); 366 if (new == NULL) { 367 pfatal("DUP TABLE OVERFLOW."); 368 if (reply("CONTINUE") == 0) 369 errexit("%s\n", ""); 370 return (STOP); 371 } 372 new->dup = blkno; 373 if (muldup == 0) { 374 duplist = muldup = new; 375 new->next = 0; 376 } else { 377 new->next = muldup->next; 378 muldup->next = new; 379 } 380 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 381 if (dlp->dup == blkno) 382 break; 383 if (dlp == muldup && dlp->dup != blkno) 384 muldup = new; 385 } 386 /* 387 * count the number of blocks found in id_entryno 388 */ 389 idesc->id_entryno++; 390 } 391 return (res); 392 } 393
Indexes created Fri Sep 26 08:10:20 GMT 2025