1 /* $NetBSD: pass1.c,v 1.13 2005/01/19 19:31:28 xtraeme 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.13 2005/01/19 19:31:28 xtraeme 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 || dp->e2di_size)) { 175 pfatal("PARTIALLY ALLOCATED INODE I=%u", inumber); 176 if (reply("CLEAR") == 1) { 177 dp = ginode(inumber); 178 clearinode(dp); 179 inodirty(); 180 } 181 } 182 #ifdef notyet /* it seems that dtime == 0 is valid for a unallocated inode */ 183 if (dp->e2di_dtime == 0) { 184 pwarn("DELETED INODE I=%u HAS A NULL DTIME", inumber); 185 if (preen) { 186 printf(" (CORRECTED)\n"); 187 } 188 if (preen || reply("CORRECT")) { 189 time_t t; 190 time(&t); 191 dp->e2di_dtime = h2fs32(t); 192 dp = ginode(inumber); 193 inodirty(); 194 } 195 } 196 #endif 197 statemap[inumber] = USTATE; 198 return; 199 } 200 lastino = inumber; 201 if (dp->e2di_dtime != 0) { 202 time_t t = fs2h32(dp->e2di_dtime); 203 char *p = ctime(&t); 204 pwarn("INODE I=%u HAS DTIME=%12.12s %4.4s", inumber, &p[4], &p[20]); 205 if (preen) { 206 printf(" (CORRECTED)\n"); 207 } 208 if (preen || reply("CORRECT")) { 209 dp = ginode(inumber); 210 dp->e2di_dtime = 0; 211 inodirty(); 212 } 213 } 214 if (/* dp->di_size < 0 || */ 215 fs2h32(dp->e2di_size) + sblock.e2fs_bsize - 1 < 216 fs2h32(dp->e2di_size)) { 217 if (debug) 218 printf("bad size %lu:", (u_long)fs2h32(dp->e2di_size)); 219 goto unknown; 220 } 221 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 222 dp = ginode(inumber); 223 dp->e2di_size = h2fs32(sblock.e2fs_bsize); 224 dp->e2di_mode = h2fs16(IFREG|0600); 225 inodirty(); 226 } 227 ndb = howmany(fs2h32(dp->e2di_size), sblock.e2fs_bsize); 228 if (ndb < 0) { 229 if (debug) 230 printf("bad size %lu ndb %d:", 231 (u_long)fs2h32(dp->e2di_size), ndb); 232 goto unknown; 233 } 234 if (mode == IFBLK || mode == IFCHR) 235 ndb++; 236 if (mode == IFLNK) { 237 /* 238 * Fake ndb value so direct/indirect block checks below 239 * will detect any garbage after symlink string. 240 */ 241 if (fs2h32(dp->e2di_size) < EXT2_MAXSYMLINKLEN || 242 (EXT2_MAXSYMLINKLEN == 0 && dp->e2di_blocks == 0)) { 243 ndb = howmany(fs2h32(dp->e2di_size), sizeof(u_int32_t)); 244 if (ndb > NDADDR) { 245 j = ndb - NDADDR; 246 for (ndb = 1; j > 1; j--) 247 ndb *= NINDIR(&sblock); 248 ndb += NDADDR; 249 } 250 } 251 } 252 /* Linux puts things in blocks for FIFO, so skip this check */ 253 if (mode != IFIFO) { 254 for (j = ndb; j < NDADDR; j++) 255 if (dp->e2di_blocks[j] != 0) { 256 if (debug) 257 printf("bad direct addr: %d\n", 258 fs2h32(dp->e2di_blocks[j])); 259 goto unknown; 260 } 261 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 262 ndb /= NINDIR(&sblock); 263 for (; j < NIADDR; j++) { 264 if (dp->e2di_blocks[j+NDADDR] != 0) { 265 if (debug) 266 printf("bad indirect addr: %d\n", 267 fs2h32(dp->e2di_blocks[j+NDADDR])); 268 goto unknown; 269 } 270 } 271 } 272 if (ftypeok(dp) == 0) 273 goto unknown; 274 n_files++; 275 lncntp[inumber] = fs2h16(dp->e2di_nlink); 276 if (dp->e2di_nlink == 0) { 277 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 278 if (zlnp == NULL) { 279 pfatal("LINK COUNT TABLE OVERFLOW"); 280 if (reply("CONTINUE") == 0) 281 errexit("%s\n", ""); 282 } else { 283 zlnp->zlncnt = inumber; 284 zlnp->next = zlnhead; 285 zlnhead = zlnp; 286 } 287 } 288 if (mode == IFDIR) { 289 if (dp->e2di_size == 0) 290 statemap[inumber] = DCLEAR; 291 else 292 statemap[inumber] = DSTATE; 293 cacheino(dp, inumber); 294 } else { 295 statemap[inumber] = FSTATE; 296 } 297 typemap[inumber] = E2IFTODT(mode); 298 badblk = dupblk = 0; 299 idesc->id_number = inumber; 300 (void)ckinode(dp, idesc); 301 idesc->id_entryno *= btodb(sblock.e2fs_bsize); 302 if (fs2h32(dp->e2di_nblock) != idesc->id_entryno) { 303 pwarn("INCORRECT BLOCK COUNT I=%u (%d should be %d)", 304 inumber, fs2h32(dp->e2di_nblock), idesc->id_entryno); 305 if (preen) 306 printf(" (CORRECTED)\n"); 307 else if (reply("CORRECT") == 0) 308 return; 309 dp = ginode(inumber); 310 dp->e2di_nblock = h2fs32(idesc->id_entryno); 311 inodirty(); 312 } 313 return; 314 unknown: 315 pfatal("UNKNOWN FILE TYPE I=%u", inumber); 316 statemap[inumber] = FCLEAR; 317 if (reply("CLEAR") == 1) { 318 statemap[inumber] = USTATE; 319 dp = ginode(inumber); 320 clearinode(dp); 321 inodirty(); 322 } 323 } 324 325 int 326 pass1check(struct inodesc *idesc) 327 { 328 int res = KEEPON; 329 int anyout, nfrags; 330 daddr_t blkno = idesc->id_blkno; 331 struct dups *dlp; 332 struct dups *new; 333 334 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 335 blkerror(idesc->id_number, "BAD", blkno); 336 if (badblk++ >= MAXBAD) { 337 pwarn("EXCESSIVE BAD BLKS I=%u", 338 idesc->id_number); 339 if (preen) 340 printf(" (SKIPPING)\n"); 341 else if (reply("CONTINUE") == 0) 342 errexit("%s\n", ""); 343 return (STOP); 344 } 345 } 346 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 347 if (anyout && chkrange(blkno, 1)) { 348 res = SKIP; 349 } else if (!testbmap(blkno)) { 350 n_blks++; 351 setbmap(blkno); 352 } else { 353 blkerror(idesc->id_number, "DUP", blkno); 354 if (dupblk++ >= MAXDUP) { 355 pwarn("EXCESSIVE DUP BLKS I=%u", 356 idesc->id_number); 357 if (preen) 358 printf(" (SKIPPING)\n"); 359 else if (reply("CONTINUE") == 0) 360 errexit("%s\n", ""); 361 return (STOP); 362 } 363 new = (struct dups *)malloc(sizeof(struct dups)); 364 if (new == NULL) { 365 pfatal("DUP TABLE OVERFLOW."); 366 if (reply("CONTINUE") == 0) 367 errexit("%s\n", ""); 368 return (STOP); 369 } 370 new->dup = blkno; 371 if (muldup == 0) { 372 duplist = muldup = new; 373 new->next = 0; 374 } else { 375 new->next = muldup->next; 376 muldup->next = new; 377 } 378 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 379 if (dlp->dup == blkno) 380 break; 381 if (dlp == muldup && dlp->dup != blkno) 382 muldup = new; 383 } 384 /* 385 * count the number of blocks found in id_entryno 386 */ 387 idesc->id_entryno++; 388 } 389 return (res); 390 } 391