pass1.c revision 1.34
1 /* $NetBSD: pass1.c,v 1.34 2005/01/13 19:56:02 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 #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.34 2005/01/13 19:56:02 christos 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 __P((ino_t, struct inodesc *)); 63 static ino_t lastino; 64 65 void 66 pass1() 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(inumber, idesc) 209 ino_t inumber; 210 struct inodesc *idesc; 211 { 212 union dinode *dp; 213 struct zlncnt *zlnp; 214 daddr_t ndb; 215 int j; 216 mode_t mode; 217 u_int64_t size, kernmaxfilesize; 218 int64_t blocks; 219 char symbuf[MAXBSIZE]; 220 struct inostat *info; 221 222 dp = getnextinode(inumber); 223 info = inoinfo(inumber); 224 mode = iswap16(DIP(dp, mode)) & IFMT; 225 size = iswap64(DIP(dp, size)); 226 if (mode == 0) { 227 if ((is_ufs2 && 228 (memcmp(dp->dp2.di_db, ufs2_zino.di_db, 229 NDADDR * sizeof(int64_t)) || 230 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib, 231 NIADDR * sizeof(int64_t)))) 232 || 233 (!is_ufs2 && 234 (memcmp(dp->dp1.di_db, ufs1_zino.di_db, 235 NDADDR * sizeof(int32_t)) || 236 memcmp(dp->dp1.di_ib, ufs1_zino.di_ib, 237 NIADDR * sizeof(int32_t)))) || 238 mode || size) { 239 pfatal("PARTIALLY ALLOCATED INODE I=%u", inumber); 240 if (reply("CLEAR") == 1) { 241 dp = ginode(inumber); 242 clearinode(dp); 243 inodirty(); 244 } else 245 markclean = 0; 246 } 247 info->ino_state = USTATE; 248 return; 249 } 250 lastino = inumber; 251 /* This should match the file size limit in ffs_mountfs(). */ 252 if (is_ufs2) 253 kernmaxfilesize = sblock->fs_maxfilesize; 254 else 255 kernmaxfilesize = (u_int64_t)0x80000000 * sblock->fs_bsize - 1; 256 if (size > kernmaxfilesize || size + sblock->fs_bsize - 1 < size || 257 (mode == IFDIR && size > MAXDIRSIZE)) { 258 if (debug) 259 printf("bad size %llu:",(unsigned long long)size); 260 goto unknown; 261 } 262 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 263 dp = ginode(inumber); 264 DIP(dp, size) = iswap64(sblock->fs_fsize); 265 size = sblock->fs_fsize; 266 DIP(dp, mode) = iswap16(IFREG|0600); 267 inodirty(); 268 } 269 ndb = howmany(size, sblock->fs_bsize); 270 if (ndb < 0) { 271 if (debug) 272 printf("bad size %llu ndb %lld:", 273 (unsigned long long)size, (long long)ndb); 274 goto unknown; 275 } 276 if (mode == IFBLK || mode == IFCHR) 277 ndb++; 278 if (mode == IFLNK) { 279 /* 280 * Note that the old fastlink format always had di_blocks set 281 * to 0. Other than that we no longer use the `spare' field 282 * (which is now the extended uid) for sanity checking, the 283 * new format is the same as the old. We simply ignore the 284 * conversion altogether. - mycroft, 19MAY1994 285 */ 286 if (!is_ufs2 && doinglevel2 && 287 size > 0 && size < MAXSYMLINKLEN_UFS1 && 288 DIP(dp, blocks) != 0) { 289 if (bread(fsreadfd, symbuf, 290 fsbtodb(sblock, iswap32(DIP(dp, db[0]))), 291 (long)secsize) != 0) 292 errx(EEXIT, "cannot read symlink"); 293 if (debug) { 294 symbuf[size] = 0; 295 printf("convert symlink %u(%s) of size %lld\n", 296 inumber, symbuf, 297 (unsigned long long)size); 298 } 299 dp = ginode(inumber); 300 memmove(dp->dp1.di_db, symbuf, (long)size); 301 DIP(dp, blocks) = 0; 302 inodirty(); 303 } 304 /* 305 * Fake ndb value so direct/indirect block checks below 306 * will detect any garbage after symlink string. 307 */ 308 if ((sblock->fs_maxsymlinklen < 0) || 309 (size < sblock->fs_maxsymlinklen) || 310 (isappleufs && (size < APPLEUFS_MAXSYMLINKLEN)) || 311 (sblock->fs_maxsymlinklen == 0 && DIP(dp, blocks) == 0)) { 312 if (is_ufs2) 313 ndb = howmany(size, sizeof(int64_t)); 314 else 315 ndb = howmany(size, sizeof(int32_t)); 316 if (ndb > NDADDR) { 317 j = ndb - NDADDR; 318 for (ndb = 1; j > 1; j--) 319 ndb *= NINDIR(sblock); 320 ndb += NDADDR; 321 } 322 } 323 } 324 for (j = ndb; j < NDADDR; j++) 325 if (DIP(dp, db[j]) != 0) { 326 if (debug) { 327 if (!is_ufs2) 328 printf("bad direct addr ix %d: %d [ndb %lld]\n", 329 j, iswap32(dp->dp1.di_db[j]), 330 (long long)ndb); 331 else 332 printf("bad direct addr ix %d: %lld [ndb %lld]\n", 333 j, (long long)iswap64(dp->dp2.di_db[j]), 334 (long long)ndb); 335 } 336 goto unknown; 337 } 338 339 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 340 ndb /= NINDIR(sblock); 341 342 for (; j < NIADDR; j++) 343 if (DIP(dp, ib[j]) != 0) { 344 if (debug) { 345 if (!is_ufs2) 346 printf("bad indirect addr: %d\n", 347 iswap32(dp->dp1.di_ib[j])); 348 else 349 printf("bad indirect addr: %lld\n", 350 (long long)iswap64(dp->dp2.di_ib[j])); 351 } 352 goto unknown; 353 } 354 if (ftypeok(dp) == 0) 355 goto unknown; 356 n_files++; 357 info->ino_linkcnt = iswap16(DIP(dp, nlink)); 358 if (info->ino_linkcnt <= 0) { 359 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 360 if (zlnp == NULL) { 361 markclean = 0; 362 pfatal("LINK COUNT TABLE OVERFLOW"); 363 if (reply("CONTINUE") == 0) { 364 ckfini(); 365 exit(EEXIT); 366 } 367 } else { 368 zlnp->zlncnt = inumber; 369 zlnp->next = zlnhead; 370 zlnhead = zlnp; 371 } 372 } 373 if (mode == IFDIR) { 374 if (size == 0) 375 info->ino_state = DCLEAR; 376 else 377 info->ino_state = DSTATE; 378 cacheino(dp, inumber); 379 countdirs++; 380 } else 381 info->ino_state = FSTATE; 382 info->ino_type = IFTODT(mode); 383 if (!is_ufs2 && doinglevel2 && 384 (iswap16(dp->dp1.di_ouid) != (u_short)-1 || 385 iswap16(dp->dp1.di_ogid) != (u_short)-1)) { 386 dp = ginode(inumber); 387 dp->dp1.di_uid = iswap32(iswap16(dp->dp1.di_ouid)); 388 dp->dp1.di_ouid = iswap16(-1); 389 dp->dp1.di_gid = iswap32(iswap16(dp->dp1.di_ogid)); 390 dp->dp1.di_ogid = iswap16(-1); 391 inodirty(); 392 } 393 badblk = dupblk = 0; 394 idesc->id_number = inumber; 395 if (iswap32(DIP(dp, flags)) & SF_SNAPSHOT) 396 idesc->id_type = SNAP; 397 else 398 idesc->id_type = ADDR; 399 (void)ckinode(dp, idesc); 400 idesc->id_entryno *= btodb(sblock->fs_fsize); 401 if (is_ufs2) 402 blocks = iswap64(dp->dp2.di_blocks); 403 else 404 blocks = iswap32(dp->dp1.di_blocks); 405 if (blocks != idesc->id_entryno) { 406 pwarn("INCORRECT BLOCK COUNT I=%u (%lld should be %lld)", 407 inumber, (long long)blocks, (long long)idesc->id_entryno); 408 if (preen) 409 printf(" (CORRECTED)\n"); 410 else if (reply("CORRECT") == 0) { 411 markclean = 0; 412 return; 413 } 414 dp = ginode(inumber); 415 if (is_ufs2) 416 dp->dp2.di_blocks = iswap64(idesc->id_entryno); 417 else 418 dp->dp1.di_blocks = iswap32((int32_t)idesc->id_entryno); 419 inodirty(); 420 } 421 return; 422 unknown: 423 pfatal("UNKNOWN FILE TYPE I=%u", inumber); 424 info->ino_state = FCLEAR; 425 if (reply("CLEAR") == 1) { 426 info->ino_state = USTATE; 427 dp = ginode(inumber); 428 clearinode(dp); 429 inodirty(); 430 } else 431 markclean = 0; 432 } 433 434 int 435 pass1check(idesc) 436 struct inodesc *idesc; 437 { 438 int res = KEEPON; 439 int anyout, nfrags; 440 daddr_t blkno = idesc->id_blkno; 441 struct dups *dlp; 442 struct dups *new; 443 444 if (idesc->id_type == SNAP) { 445 if (blkno == BLK_NOCOPY || blkno == BLK_SNAP) 446 return (KEEPON); 447 } 448 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 449 blkerror(idesc->id_number, "BAD", blkno); 450 if (badblk++ >= MAXBAD) { 451 pwarn("EXCESSIVE BAD BLKS I=%u", 452 idesc->id_number); 453 if (preen) 454 printf(" (SKIPPING)\n"); 455 else if (reply("CONTINUE") == 0) { 456 markclean = 0; 457 ckfini(); 458 exit(EEXIT); 459 } 460 return (STOP); 461 } 462 } 463 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 464 if (anyout && chkrange(blkno, 1)) { 465 res = SKIP; 466 } else if (!testbmap(blkno)) { 467 n_blks++; 468 setbmap(blkno); 469 } else { 470 blkerror(idesc->id_number, "DUP", blkno); 471 if (dupblk++ >= MAXDUP) { 472 pwarn("EXCESSIVE DUP BLKS I=%u", 473 idesc->id_number); 474 if (preen) 475 printf(" (SKIPPING)\n"); 476 else if (reply("CONTINUE") == 0) { 477 markclean = 0; 478 ckfini(); 479 exit(EEXIT); 480 } 481 return (STOP); 482 } 483 new = (struct dups *)malloc(sizeof(struct dups)); 484 if (new == NULL) { 485 markclean = 0; 486 pfatal("DUP TABLE OVERFLOW."); 487 if (reply("CONTINUE") == 0) { 488 markclean = 0; 489 ckfini(); 490 exit(EEXIT); 491 } 492 return (STOP); 493 } 494 new->dup = blkno; 495 if (muldup == 0) { 496 duplist = muldup = new; 497 new->next = 0; 498 } else { 499 new->next = muldup->next; 500 muldup->next = new; 501 } 502 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 503 if (dlp->dup == blkno) 504 break; 505 if (dlp == muldup && dlp->dup != blkno) 506 muldup = new; 507 } 508 /* 509 * count the number of blocks found in id_entryno 510 */ 511 idesc->id_entryno++; 512 } 513 return (res); 514 } 515
Indexes created Tue Sep 30 10:09:55 GMT 2025