pass1.c revision 1.46.10.1
1 /* $NetBSD: pass1.c,v 1.46.10.1 2013/01/13 16:55:29 bouyer 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 #include <sys/cdefs.h> 33 #ifndef lint 34 #if 0 35 static char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95"; 36 #else 37 __RCSID("$NetBSD: pass1.c,v 1.46.10.1 2013/01/13 16:55:29 bouyer Exp $"); 38 #endif 39 #endif /* not lint */ 40 41 #include <sys/param.h> 42 #include <sys/stat.h> 43 #include <sys/time.h> 44 45 #include <ufs/ufs/dinode.h> 46 #include <ufs/ufs/dir.h> 47 #include <ufs/ffs/fs.h> 48 #include <ufs/ufs/ufs_bswap.h> 49 #include <ufs/ffs/ffs_extern.h> 50 51 #include <err.h> 52 #include <stdio.h> 53 #include <stdlib.h> 54 #include <string.h> 55 56 #include "fsck.h" 57 #include "extern.h" 58 #include "fsutil.h" 59 #include "exitvalues.h" 60 61 static daddr_t badblk; 62 static daddr_t dupblk; 63 static void checkinode(ino_t, struct inodesc *); 64 static ino_t lastino; 65 66 void 67 pass1(void) 68 { 69 ino_t inumber, inosused, ninosused; 70 size_t inospace; 71 int c; 72 daddr_t i, cgd; 73 struct inodesc idesc; 74 struct cg *cgp = cgrp; 75 struct inostat *info; 76 uint8_t *cp; 77 78 /* 79 * Set file system reserved blocks in used block map. 80 */ 81 for (c = 0; c < sblock->fs_ncg; c++) { 82 cgd = cgdmin(sblock, c); 83 if (c == 0) 84 i = cgbase(sblock, c); 85 else 86 i = cgsblock(sblock, c); 87 for (; i < cgd; i++) 88 setbmap(i); 89 } 90 i = sblock->fs_csaddr; 91 cgd = i + howmany(sblock->fs_cssize, sblock->fs_fsize); 92 for (; i < cgd; i++) 93 setbmap(i); 94 /* 95 * Find all allocated blocks. 96 */ 97 memset(&idesc, 0, sizeof(struct inodesc)); 98 idesc.id_func = pass1check; 99 n_files = n_blks = 0; 100 for (c = 0; c < sblock->fs_ncg; c++) { 101 inumber = c * sblock->fs_ipg; 102 setinodebuf(inumber); 103 getblk(&cgblk, cgtod(sblock, c), sblock->fs_cgsize); 104 memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize); 105 if((doswap && !needswap) || (!doswap && needswap)) 106 ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock); 107 if (is_ufs2) 108 inosused = cgp->cg_initediblk; 109 else 110 inosused = sblock->fs_ipg; 111 if (got_siginfo) { 112 fprintf(stderr, 113 "%s: phase 1: cyl group %d of %d (%d%%)\n", 114 cdevname(), c, sblock->fs_ncg, 115 c * 100 / sblock->fs_ncg); 116 got_siginfo = 0; 117 } 118 #ifdef PROGRESS 119 progress_bar(cdevname(), preen ? NULL : "phase 1", 120 c, sblock->fs_ncg); 121 #endif /* PROGRESS */ 122 /* 123 * If we are using soft updates, then we can trust the 124 * cylinder group inode allocation maps to tell us which 125 * inodes are allocated. We will scan the used inode map 126 * to find the inodes that are really in use, and then 127 * read only those inodes in from disk. 128 */ 129 if (preen && usedsoftdep) { 130 if (!cg_chkmagic(cgp, 0)) 131 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 132 cp = &cg_inosused(cgp, 0)[(inosused - 1) / CHAR_BIT]; 133 for ( ; inosused > 0; inosused -= CHAR_BIT, cp--) { 134 if (*cp == 0) 135 continue; 136 for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) { 137 if (*cp & i) 138 break; 139 inosused--; 140 } 141 break; 142 } 143 #ifdef notdef 144 if (inosused < 0) 145 inosused = 0; 146 #endif 147 } 148 /* 149 * Allocate inoinfo structures for the allocated inodes. 150 */ 151 inostathead[c].il_numalloced = inosused; 152 if (inosused == 0) { 153 inostathead[c].il_stat = 0; 154 continue; 155 } 156 inospace = inosused * sizeof(*info); 157 if (inospace / sizeof(*info) != inosused) { 158 pfatal("too many inodes %llu\n", (unsigned long long) 159 inosused); 160 exit(FSCK_EXIT_CHECK_FAILED); 161 } 162 info = malloc(inospace); 163 if (info == NULL) { 164 pfatal("cannot alloc %zu bytes for inoinfo\n", 165 inospace); 166 exit(FSCK_EXIT_CHECK_FAILED); 167 } 168 (void)memset(info, 0, inospace); 169 inostathead[c].il_stat = info; 170 /* 171 * Scan the allocated inodes. 172 */ 173 for (i = 0; i < inosused; i++, inumber++) { 174 if (inumber < ROOTINO) { 175 (void)getnextinode(inumber); 176 continue; 177 } 178 checkinode(inumber, &idesc); 179 } 180 lastino += 1; 181 if (inosused < sblock->fs_ipg || inumber == lastino) 182 continue; 183 /* 184 * If we were not able to determine in advance which inodes 185 * were in use, then reduce the size of the inoinfo structure 186 * to the size necessary to describe the inodes that we 187 * really found. 188 */ 189 if (lastino < (c * sblock->fs_ipg)) 190 ninosused = 0; 191 else 192 ninosused = lastino - (c * sblock->fs_ipg); 193 inostathead[c].il_numalloced = ninosused; 194 if (ninosused == 0) { 195 free(inostathead[c].il_stat); 196 inostathead[c].il_stat = 0; 197 continue; 198 } 199 if (ninosused != inosused) { 200 struct inostat *ninfo; 201 size_t ninospace = ninosused * sizeof(*ninfo); 202 if (ninospace / sizeof(*info) != ninosused) { 203 pfatal("too many inodes %llu\n", 204 (unsigned long long)ninosused); 205 exit(FSCK_EXIT_CHECK_FAILED); 206 } 207 ninfo = realloc(info, ninospace); 208 if (ninfo == NULL) { 209 pfatal("cannot realloc %zu bytes to %zu " 210 "for inoinfo\n", inospace, ninospace); 211 exit(FSCK_EXIT_CHECK_FAILED); 212 } 213 if (ninosused > inosused) 214 (void)memset(&ninfo[inosused], 0, ninospace - inospace); 215 inostathead[c].il_stat = ninfo; 216 } 217 } 218 #ifdef PROGRESS 219 if (!preen) 220 progress_done(); 221 #endif /* PROGRESS */ 222 freeinodebuf(); 223 do_blkswap = 0; /* has been done */ 224 } 225 226 static void 227 checkinode(ino_t inumber, struct inodesc *idesc) 228 { 229 union dinode *dp; 230 struct zlncnt *zlnp; 231 daddr_t ndb; 232 int j; 233 mode_t mode; 234 u_int64_t size, kernmaxfilesize; 235 int64_t blocks; 236 char symbuf[MAXBSIZE]; 237 struct inostat *info; 238 239 dp = getnextinode(inumber); 240 info = inoinfo(inumber); 241 mode = iswap16(DIP(dp, mode)) & IFMT; 242 size = iswap64(DIP(dp, size)); 243 if (mode == 0) { 244 if ((is_ufs2 && 245 (memcmp(dp->dp2.di_db, ufs2_zino.di_db, 246 NDADDR * sizeof(int64_t)) || 247 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib, 248 NIADDR * sizeof(int64_t)))) 249 || 250 (!is_ufs2 && 251 (memcmp(dp->dp1.di_db, ufs1_zino.di_db, 252 NDADDR * sizeof(int32_t)) || 253 memcmp(dp->dp1.di_ib, ufs1_zino.di_ib, 254 NIADDR * sizeof(int32_t)))) || 255 mode || size) { 256 pfatal("PARTIALLY ALLOCATED INODE I=%llu", 257 (unsigned long long)inumber); 258 if (reply("CLEAR") == 1) { 259 dp = ginode(inumber); 260 clearinode(dp); 261 inodirty(); 262 } else 263 markclean = 0; 264 } 265 info->ino_state = USTATE; 266 return; 267 } 268 lastino = inumber; 269 /* This should match the file size limit in ffs_mountfs(). */ 270 if (is_ufs2) 271 kernmaxfilesize = sblock->fs_maxfilesize; 272 else 273 kernmaxfilesize = (u_int64_t)0x80000000 * sblock->fs_bsize - 1; 274 if (size > kernmaxfilesize || size + sblock->fs_bsize - 1 < size || 275 (mode == IFDIR && size > MAXDIRSIZE)) { 276 if (debug) 277 printf("bad size %llu:",(unsigned long long)size); 278 goto unknown; 279 } 280 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 281 dp = ginode(inumber); 282 DIP_SET(dp, size, iswap64(sblock->fs_fsize)); 283 size = sblock->fs_fsize; 284 DIP_SET(dp, mode, iswap16(IFREG|0600)); 285 inodirty(); 286 } 287 ndb = howmany(size, sblock->fs_bsize); 288 if (ndb < 0) { 289 if (debug) 290 printf("bad size %llu ndb %lld:", 291 (unsigned long long)size, (long long)ndb); 292 goto unknown; 293 } 294 if (mode == IFBLK || mode == IFCHR) 295 ndb++; 296 if (mode == IFLNK) { 297 /* 298 * Note that the old fastlink format always had di_blocks set 299 * to 0. Other than that we no longer use the `spare' field 300 * (which is now the extended uid) for sanity checking, the 301 * new format is the same as the old. We simply ignore the 302 * conversion altogether. - mycroft, 19MAY1994 303 */ 304 if (!is_ufs2 && doinglevel2 && 305 size > 0 && size < MAXSYMLINKLEN_UFS1 && 306 DIP(dp, blocks) != 0) { 307 if (bread(fsreadfd, symbuf, 308 fsbtodb(sblock, iswap32(DIP(dp, db[0]))), 309 (long)secsize) != 0) 310 errexit("cannot read symlink"); 311 if (debug) { 312 symbuf[size] = 0; 313 printf("convert symlink %llu(%s) " 314 "of size %lld\n", 315 (unsigned long long)inumber, symbuf, 316 (unsigned long long)size); 317 } 318 dp = ginode(inumber); 319 memmove(dp->dp1.di_db, symbuf, (long)size); 320 DIP_SET(dp, blocks, 0); 321 inodirty(); 322 } 323 /* 324 * Fake ndb value so direct/indirect block checks below 325 * will detect any garbage after symlink string. 326 */ 327 if ((sblock->fs_maxsymlinklen < 0) || 328 (size < sblock->fs_maxsymlinklen) || 329 (isappleufs && (size < APPLEUFS_MAXSYMLINKLEN)) || 330 (sblock->fs_maxsymlinklen == 0 && DIP(dp, blocks) == 0)) { 331 if (is_ufs2) 332 ndb = howmany(size, sizeof(int64_t)); 333 else 334 ndb = howmany(size, sizeof(int32_t)); 335 if (ndb > NDADDR) { 336 j = ndb - NDADDR; 337 for (ndb = 1; j > 1; j--) 338 ndb *= NINDIR(sblock); 339 ndb += NDADDR; 340 } 341 } 342 } 343 if (ndb < NDADDR) { 344 for (j = ndb; j < NDADDR; j++) 345 if (DIP(dp, db[j]) != 0) { 346 if (debug) { 347 if (!is_ufs2) 348 printf("bad direct addr ix %d: %d [ndb %lld]\n", 349 j, iswap32(dp->dp1.di_db[j]), 350 (long long)ndb); 351 else 352 printf("bad direct addr ix %d: %lld [ndb %lld]\n", 353 j, (long long)iswap64(dp->dp2.di_db[j]), 354 (long long)ndb); 355 } 356 goto unknown; 357 } 358 } 359 360 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 361 ndb /= NINDIR(sblock); 362 363 for (; j < NIADDR; j++) 364 if (DIP(dp, ib[j]) != 0) { 365 if (debug) { 366 if (!is_ufs2) 367 printf("bad indirect addr: %d\n", 368 iswap32(dp->dp1.di_ib[j])); 369 else 370 printf("bad indirect addr: %lld\n", 371 (long long)iswap64(dp->dp2.di_ib[j])); 372 } 373 goto unknown; 374 } 375 if (ftypeok(dp) == 0) 376 goto unknown; 377 n_files++; 378 info->ino_linkcnt = iswap16(DIP(dp, nlink)); 379 if (info->ino_linkcnt <= 0) { 380 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 381 if (zlnp == NULL) { 382 markclean = 0; 383 pfatal("LINK COUNT TABLE OVERFLOW"); 384 if (reply("CONTINUE") == 0) { 385 ckfini(); 386 exit(FSCK_EXIT_CHECK_FAILED); 387 } 388 } else { 389 zlnp->zlncnt = inumber; 390 zlnp->next = zlnhead; 391 zlnhead = zlnp; 392 } 393 } 394 if (mode == IFDIR) { 395 if (size == 0) 396 info->ino_state = DCLEAR; 397 else 398 info->ino_state = DSTATE; 399 cacheino(dp, inumber); 400 countdirs++; 401 } else 402 info->ino_state = FSTATE; 403 info->ino_type = IFTODT(mode); 404 if (!is_ufs2 && doinglevel2 && 405 (iswap16(dp->dp1.di_ouid) != (u_short)-1 || 406 iswap16(dp->dp1.di_ogid) != (u_short)-1)) { 407 dp = ginode(inumber); 408 dp->dp1.di_uid = iswap32(iswap16(dp->dp1.di_ouid)); 409 dp->dp1.di_ouid = iswap16(-1); 410 dp->dp1.di_gid = iswap32(iswap16(dp->dp1.di_ogid)); 411 dp->dp1.di_ogid = iswap16(-1); 412 inodirty(); 413 } 414 badblk = dupblk = 0; 415 idesc->id_number = inumber; 416 if (iswap32(DIP(dp, flags)) & SF_SNAPSHOT) 417 idesc->id_type = SNAP; 418 else 419 idesc->id_type = ADDR; 420 (void)ckinode(dp, idesc); 421 #ifdef notyet 422 if (is_ufs2 && iswap32(dp->dp2.di_extsize) > 0) { 423 int ret, offset; 424 idesc->id_type = ADDR; 425 ndb = howmany(iswap32(dp->dp2.di_extsize), sblock->fs_bsize); 426 for (j = 0; j < NXADDR; j++) { 427 if (--ndb == 0 && 428 (offset = blkoff(sblock, iswap32(dp->dp2.di_extsize))) != 0) 429 idesc->id_numfrags = numfrags(sblock, 430 fragroundup(sblock, offset)); 431 else 432 idesc->id_numfrags = sblock->fs_frag; 433 if (dp->dp2.di_extb[j] == 0) 434 continue; 435 idesc->id_blkno = iswap64(dp->dp2.di_extb[j]); 436 ret = (*idesc->id_func)(idesc); 437 if (ret & STOP) 438 break; 439 } 440 } 441 #endif 442 idesc->id_entryno *= btodb(sblock->fs_fsize); 443 if (is_ufs2) 444 blocks = iswap64(dp->dp2.di_blocks); 445 else 446 blocks = iswap32(dp->dp1.di_blocks); 447 if (blocks != idesc->id_entryno) { 448 pwarn("INCORRECT BLOCK COUNT I=%llu (%lld should be %lld)", 449 (unsigned long long)inumber, (long long)blocks, 450 (long long)idesc->id_entryno); 451 if (preen) 452 printf(" (CORRECTED)\n"); 453 else if (reply("CORRECT") == 0) { 454 markclean = 0; 455 return; 456 } 457 dp = ginode(inumber); 458 if (is_ufs2) 459 dp->dp2.di_blocks = iswap64(idesc->id_entryno); 460 else 461 dp->dp1.di_blocks = iswap32((int32_t)idesc->id_entryno); 462 inodirty(); 463 } 464 return; 465 unknown: 466 pfatal("UNKNOWN FILE TYPE I=%llu", (unsigned long long)inumber); 467 info->ino_state = FCLEAR; 468 if (reply("CLEAR") == 1) { 469 info->ino_state = USTATE; 470 dp = ginode(inumber); 471 clearinode(dp); 472 inodirty(); 473 } else 474 markclean = 0; 475 } 476 477 int 478 pass1check(struct inodesc *idesc) 479 { 480 int res = KEEPON; 481 int anyout, nfrags; 482 daddr_t blkno = idesc->id_blkno; 483 struct dups *dlp; 484 struct dups *new; 485 486 if (idesc->id_type == SNAP) { 487 if (blkno == BLK_NOCOPY || blkno == BLK_SNAP) 488 return (KEEPON); 489 } 490 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 491 blkerror(idesc->id_number, "BAD", blkno); 492 if (badblk++ >= MAXBAD) { 493 pwarn("EXCESSIVE BAD BLKS I=%llu", 494 (unsigned long long)idesc->id_number); 495 if (preen) 496 printf(" (SKIPPING)\n"); 497 else if (reply("CONTINUE") == 0) { 498 markclean = 0; 499 ckfini(); 500 exit(FSCK_EXIT_CHECK_FAILED); 501 } 502 return (STOP); 503 } 504 } 505 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 506 if (anyout && chkrange(blkno, 1)) { 507 res = SKIP; 508 } else if (!testbmap(blkno)) { 509 n_blks++; 510 setbmap(blkno); 511 } else { 512 blkerror(idesc->id_number, "DUP", blkno); 513 if (dupblk++ >= MAXDUP) { 514 pwarn("EXCESSIVE DUP BLKS I=%llu", 515 (unsigned long long)idesc->id_number); 516 if (preen) 517 printf(" (SKIPPING)\n"); 518 else if (reply("CONTINUE") == 0) { 519 markclean = 0; 520 ckfini(); 521 exit(FSCK_EXIT_CHECK_FAILED); 522 } 523 return (STOP); 524 } 525 new = (struct dups *)malloc(sizeof(struct dups)); 526 if (new == NULL) { 527 markclean = 0; 528 pfatal("DUP TABLE OVERFLOW."); 529 if (reply("CONTINUE") == 0) { 530 markclean = 0; 531 ckfini(); 532 exit(FSCK_EXIT_CHECK_FAILED); 533 } 534 return (STOP); 535 } 536 new->dup = blkno; 537 if (muldup == 0) { 538 duplist = muldup = new; 539 new->next = 0; 540 } else { 541 new->next = muldup->next; 542 muldup->next = new; 543 } 544 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 545 if (dlp->dup == blkno) 546 break; 547 if (dlp == muldup && dlp->dup != blkno) 548 muldup = new; 549 } 550 /* 551 * count the number of blocks found in id_entryno 552 */ 553 idesc->id_entryno++; 554 } 555 return (res); 556 } 557
Indexes created Wed Oct 22 13:09:56 GMT 2025