pass1.c revision 96483
1/* 2 * Copyright (c) 1980, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34#ifndef lint 35#if 0 36static const char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95"; 37#endif 38static const char rcsid[] = 39 "$FreeBSD: head/sbin/fsck_ffs/pass1.c 96483 2002-05-12 23:44:15Z phk $"; 40#endif /* not lint */ 41 42#include <sys/param.h> 43#include <sys/stat.h> 44#include <sys/sysctl.h> 45 46#include <ufs/ufs/dinode.h> 47#include <ufs/ufs/dir.h> 48#include <ufs/ffs/fs.h> 49 50#include <err.h> 51#include <string.h> 52 53#include "fsck.h" 54 55static ufs_daddr_t badblk; 56static ufs_daddr_t dupblk; 57static ino_t lastino; /* last inode in use */ 58 59static void checkinode(ino_t inumber, struct inodesc *); 60 61void 62pass1(void) 63{ 64 u_int8_t *cp; 65 ino_t inumber; 66 int c, i, cgd, inosused; 67 struct inostat *info; 68 struct inodesc idesc; 69 70 /* 71 * Set file system reserved blocks in used block map. 72 */ 73 for (c = 0; c < sblock.fs_ncg; c++) { 74 cgd = cgdmin(&sblock, c); 75 if (c == 0) { 76 i = cgbase(&sblock, c); 77 } else 78 i = cgsblock(&sblock, c); 79 for (; i < cgd; i++) 80 setbmap(i); 81 } 82 i = sblock.fs_csaddr; 83 cgd = i + howmany(sblock.fs_cssize, sblock.fs_fsize); 84 for (; i < cgd; i++) 85 setbmap(i); 86 87 /* 88 * Find all allocated blocks. 89 */ 90 memset(&idesc, 0, sizeof(struct inodesc)); 91 idesc.id_func = pass1check; 92 n_files = n_blks = 0; 93 for (c = 0; c < sblock.fs_ncg; c++) { 94 inumber = c * sblock.fs_ipg; 95 setinodebuf(inumber); 96 inosused = sblock.fs_ipg; 97 if (got_siginfo) { 98 printf("%s: phase 1: cyl group %d of %d (%d%%)\n", 99 cdevname, c, sblock.fs_ncg, 100 c * 100 / sblock.fs_ncg); 101 got_siginfo = 0; 102 } 103 /* 104 * If we are using soft updates, then we can trust the 105 * cylinder group inode allocation maps to tell us which 106 * inodes are allocated. We will scan the used inode map 107 * to find the inodes that are really in use, and then 108 * read only those inodes in from disk. 109 */ 110 if (preen && usedsoftdep) { 111 getblk(&cgblk, cgtod(&sblock, c), sblock.fs_cgsize); 112 if (!cg_chkmagic(&cgrp)) 113 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 114 cp = &cg_inosused(&cgrp)[(sblock.fs_ipg - 1) / NBBY]; 115 for ( ; inosused > 0; inosused -= NBBY, cp--) { 116 if (*cp == 0) 117 continue; 118 for (i = 1 << (NBBY - 1); i > 0; i >>= 1) { 119 if (*cp & i) 120 break; 121 inosused--; 122 } 123 break; 124 } 125 if (inosused < 0) 126 inosused = 0; 127 } 128 /* 129 * Allocate inoinfo structures for the allocated inodes. 130 */ 131 inostathead[c].il_numalloced = inosused; 132 if (inosused == 0) { 133 inostathead[c].il_stat = 0; 134 continue; 135 } 136 info = calloc((unsigned)inosused, sizeof(struct inostat)); 137 if (info == NULL) 138 pfatal("cannot alloc %u bytes for inoinfo\n", 139 (unsigned)(sizeof(struct inostat) * inosused)); 140 inostathead[c].il_stat = info; 141 /* 142 * Scan the allocated inodes. 143 */ 144 for (i = 0; i < inosused; i++, inumber++) { 145 if (inumber < ROOTINO) { 146 (void)getnextinode(inumber); 147 continue; 148 } 149 checkinode(inumber, &idesc); 150 } 151 lastino += 1; 152 if (inosused < sblock.fs_ipg || inumber == lastino) 153 continue; 154 /* 155 * If we were not able to determine in advance which inodes 156 * were in use, then reduce the size of the inoinfo structure 157 * to the size necessary to describe the inodes that we 158 * really found. 159 */ 160 inosused = lastino - (c * sblock.fs_ipg); 161 if (inosused < 0) 162 inosused = 0; 163 inostathead[c].il_numalloced = inosused; 164 if (inosused == 0) { 165 free(inostathead[c].il_stat); 166 inostathead[c].il_stat = 0; 167 continue; 168 } 169 info = calloc((unsigned)inosused, sizeof(struct inostat)); 170 if (info == NULL) 171 pfatal("cannot alloc %u bytes for inoinfo\n", 172 (unsigned)(sizeof(struct inostat) * inosused)); 173 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info)); 174 free(inostathead[c].il_stat); 175 inostathead[c].il_stat = info; 176 } 177 freeinodebuf(); 178} 179 180static void 181checkinode(ino_t inumber, struct inodesc *idesc) 182{ 183 struct dinode *dp; 184 struct zlncnt *zlnp; 185 u_int64_t kernmaxfilesize; 186 ufs_daddr_t ndb, j; 187 mode_t mode; 188 char *symbuf; 189 190 dp = getnextinode(inumber); 191 mode = dp->di_mode & IFMT; 192 if (mode == 0) { 193 if (memcmp(dp->di_db, zino.di_db, 194 NDADDR * sizeof(ufs_daddr_t)) || 195 memcmp(dp->di_ib, zino.di_ib, 196 NIADDR * sizeof(ufs_daddr_t)) || 197 dp->di_mode || dp->di_size) { 198 pfatal("PARTIALLY ALLOCATED INODE I=%lu", 199 (u_long)inumber); 200 if (reply("CLEAR") == 1) { 201 dp = ginode(inumber); 202 clearinode(dp); 203 inodirty(); 204 } 205 } 206 inoinfo(inumber)->ino_state = USTATE; 207 return; 208 } 209 lastino = inumber; 210 /* This should match the file size limit in ffs_mountfs(). */ 211 kernmaxfilesize = (u_int64_t)0x40000000 * sblock.fs_bsize - 1; 212 if (dp->di_size > kernmaxfilesize || 213 dp->di_size > sblock.fs_maxfilesize || 214 (mode == IFDIR && dp->di_size > MAXDIRSIZE)) { 215 if (debug) 216 printf("bad size %qu:", dp->di_size); 217 goto unknown; 218 } 219 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 220 dp = ginode(inumber); 221 dp->di_size = sblock.fs_fsize; 222 dp->di_mode = IFREG|0600; 223 inodirty(); 224 } 225 if ((mode == IFBLK || mode == IFCHR || mode == IFIFO || 226 mode == IFSOCK) && dp->di_size != 0) { 227 if (debug) 228 printf("bad special-file size %qu:", dp->di_size); 229 goto unknown; 230 } 231 if ((mode == IFBLK || mode == IFCHR) && (dev_t)dp->di_rdev == NODEV) { 232 if (debug) 233 printf("bad special-file rdev NODEV:"); 234 goto unknown; 235 } 236 ndb = howmany(dp->di_size, sblock.fs_bsize); 237 if (ndb < 0) { 238 if (debug) 239 printf("bad size %qu ndb %d:", 240 dp->di_size, ndb); 241 goto unknown; 242 } 243 if (mode == IFBLK || mode == IFCHR) 244 ndb++; 245 if (mode == IFLNK) { 246 /* 247 * Fake ndb value so direct/indirect block checks below 248 * will detect any garbage after symlink string. 249 */ 250 if (dp->di_size < (u_int64_t)sblock.fs_maxsymlinklen) { 251 ndb = howmany(dp->di_size, sizeof(ufs_daddr_t)); 252 if (ndb > NDADDR) { 253 j = ndb - NDADDR; 254 for (ndb = 1; j > 1; j--) 255 ndb *= NINDIR(&sblock); 256 ndb += NDADDR; 257 } 258 } 259 } 260 for (j = ndb; j < NDADDR; j++) 261 if (dp->di_db[j] != 0) { 262 if (debug) 263 printf("bad direct addr: %ld\n", 264 (long)dp->di_db[j]); 265 goto unknown; 266 } 267 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 268 ndb /= NINDIR(&sblock); 269 for (; j < NIADDR; j++) 270 if (dp->di_ib[j] != 0) { 271 if (debug) 272 printf("bad indirect addr: %ld\n", 273 (long)dp->di_ib[j]); 274 goto unknown; 275 } 276 if (ftypeok(dp) == 0) 277 goto unknown; 278 n_files++; 279 inoinfo(inumber)->ino_linkcnt = dp->di_nlink; 280 if (dp->di_nlink <= 0) { 281 zlnp = (struct zlncnt *)malloc(sizeof *zlnp); 282 if (zlnp == NULL) { 283 pfatal("LINK COUNT TABLE OVERFLOW"); 284 if (reply("CONTINUE") == 0) { 285 ckfini(0); 286 exit(EEXIT); 287 } 288 } else { 289 zlnp->zlncnt = inumber; 290 zlnp->next = zlnhead; 291 zlnhead = zlnp; 292 } 293 } 294 if (mode == IFDIR) { 295 if (dp->di_size == 0) 296 inoinfo(inumber)->ino_state = DCLEAR; 297 else 298 inoinfo(inumber)->ino_state = DSTATE; 299 cacheino(dp, inumber); 300 countdirs++; 301 } else 302 inoinfo(inumber)->ino_state = FSTATE; 303 inoinfo(inumber)->ino_type = IFTODT(mode); 304 badblk = dupblk = 0; 305 idesc->id_number = inumber; 306 if (dp->di_flags & SF_SNAPSHOT) 307 idesc->id_type = SNAP; 308 else 309 idesc->id_type = ADDR; 310 (void)ckinode(dp, idesc); 311 idesc->id_entryno *= btodb(sblock.fs_fsize); 312 if (dp->di_blocks != idesc->id_entryno) { 313 pwarn("INCORRECT BLOCK COUNT I=%lu (%ld should be %ld)", 314 (u_long)inumber, (long)dp->di_blocks, 315 (long)idesc->id_entryno); 316 if (preen) 317 printf(" (CORRECTED)\n"); 318 else if (reply("CORRECT") == 0) 319 return; 320 if (bkgrdflag == 0) { 321 dp = ginode(inumber); 322 dp->di_blocks = idesc->id_entryno; 323 inodirty(); 324 } else { 325 cmd.value = idesc->id_number; 326 cmd.size = idesc->id_entryno - dp->di_blocks; 327 if (debug) 328 printf("adjblkcnt ino %ld amount %ld\n", 329 (long)cmd.value, cmd.size); 330 if (sysctl(adjblkcnt, MIBSIZE, 0, 0, 331 &cmd, sizeof cmd) == -1) 332 rwerror("ADJUST INODE BLOCK COUNT", cmd.value); 333 } 334 } 335 return; 336unknown: 337 pfatal("UNKNOWN FILE TYPE I=%lu", (u_long)inumber); 338 inoinfo(inumber)->ino_state = FCLEAR; 339 if (reply("CLEAR") == 1) { 340 inoinfo(inumber)->ino_state = USTATE; 341 dp = ginode(inumber); 342 clearinode(dp); 343 inodirty(); 344 } 345} 346 347int 348pass1check(struct inodesc *idesc) 349{ 350 int res = KEEPON; 351 int anyout, nfrags; 352 ufs_daddr_t blkno = idesc->id_blkno; 353 struct dups *dlp; 354 struct dups *new; 355 356 if (idesc->id_type == SNAP) { 357 if (blkno == BLK_NOCOPY) 358 return (KEEPON); 359 if (idesc->id_number == cursnapshot) { 360 if (blkno == blkstofrags(&sblock, idesc->id_lbn)) 361 return (KEEPON); 362 if (blkno == BLK_SNAP) { 363 blkno = blkstofrags(&sblock, idesc->id_lbn); 364 idesc->id_entryno -= idesc->id_numfrags; 365 } 366 } else { 367 if (blkno == BLK_SNAP) 368 return (KEEPON); 369 } 370 } 371 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 372 blkerror(idesc->id_number, "BAD", blkno); 373 if (badblk++ >= MAXBAD) { 374 pwarn("EXCESSIVE BAD BLKS I=%lu", 375 (u_long)idesc->id_number); 376 if (preen) 377 printf(" (SKIPPING)\n"); 378 else if (reply("CONTINUE") == 0) { 379 ckfini(0); 380 exit(EEXIT); 381 } 382 return (STOP); 383 } 384 } 385 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 386 if (anyout && chkrange(blkno, 1)) { 387 res = SKIP; 388 } else if (!testbmap(blkno)) { 389 n_blks++; 390 setbmap(blkno); 391 } else { 392 blkerror(idesc->id_number, "DUP", blkno); 393 if (dupblk++ >= MAXDUP) { 394 pwarn("EXCESSIVE DUP BLKS I=%lu", 395 (u_long)idesc->id_number); 396 if (preen) 397 printf(" (SKIPPING)\n"); 398 else if (reply("CONTINUE") == 0) { 399 ckfini(0); 400 exit(EEXIT); 401 } 402 return (STOP); 403 } 404 new = (struct dups *)malloc(sizeof(struct dups)); 405 if (new == NULL) { 406 pfatal("DUP TABLE OVERFLOW."); 407 if (reply("CONTINUE") == 0) { 408 ckfini(0); 409 exit(EEXIT); 410 } 411 return (STOP); 412 } 413 new->dup = blkno; 414 if (muldup == 0) { 415 duplist = muldup = new; 416 new->next = 0; 417 } else { 418 new->next = muldup->next; 419 muldup->next = new; 420 } 421 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 422 if (dlp->dup == blkno) 423 break; 424 if (dlp == muldup && dlp->dup != blkno) 425 muldup = new; 426 } 427 /* 428 * count the number of blocks found in id_entryno 429 */ 430 idesc->id_entryno++; 431 } 432 return (res); 433} 434