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