pass1.c revision 1.26
1 /* $NetBSD: pass1.c,v 1.26 2006/09/01 19:52:48 perseant 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/param.h> 33 #include <sys/time.h> 34 #include <sys/mount.h> 35 #include <sys/buf.h> 36 37 #include <ufs/ufs/inode.h> 38 #include <ufs/ufs/dir.h> 39 #define vnode uvnode 40 #include <ufs/lfs/lfs.h> 41 #undef vnode 42 43 #include <err.h> 44 #include <stdio.h> 45 #include <stdlib.h> 46 #include <string.h> 47 48 #include <signal.h> 49 50 #include "bufcache.h" 51 #include "vnode.h" 52 #include "lfs_user.h" 53 54 #include "fsck.h" 55 #include "extern.h" 56 #include "fsutil.h" 57 58 SEGUSE *seg_table; 59 extern ufs_daddr_t *din_table; 60 61 ufs_daddr_t badblk; 62 static ufs_daddr_t dupblk; 63 static int i_d_cmp(const void *, const void *); 64 65 struct ino_daddr { 66 ino_t ino; 67 ufs_daddr_t daddr; 68 }; 69 70 static int 71 i_d_cmp(const void *va, const void *vb) 72 { 73 const struct ino_daddr *a, *b; 74 75 a = *((const struct ino_daddr *const *) va); 76 b = *((const struct ino_daddr *const *) vb); 77 78 if (a->daddr == b->daddr) { 79 return (a->ino - b->ino); 80 } 81 if (a->daddr > b->daddr) { 82 return 1; 83 } 84 return -1; 85 } 86 87 void 88 pass1(void) 89 { 90 ino_t inumber; 91 int i; 92 struct inodesc idesc; 93 struct ufs1_dinode *tinode; 94 struct ifile *ifp; 95 struct ubuf *bp; 96 struct ino_daddr **dins; 97 98 /* 99 * Find all allocated blocks, initialize numdirs. 100 */ 101 memset(&idesc, 0, sizeof(struct inodesc)); 102 idesc.id_type = ADDR; 103 idesc.id_func = pass1check; 104 idesc.id_lblkno = 0; 105 inumber = 0; 106 n_files = n_blks = 0; 107 108 if (debug) 109 printf("creating sorted inode address table...\n"); 110 /* Sort by daddr */ 111 dins = (struct ino_daddr **) malloc(maxino * sizeof(*dins)); 112 if (dins == NULL) 113 err(1, NULL); 114 for (i = 0; i < maxino; i++) { 115 dins[i] = malloc(sizeof(**dins)); 116 if (dins[i] == NULL) 117 err(1, NULL); 118 dins[i]->ino = i; 119 if (i == fs->lfs_ifile) 120 dins[i]->daddr = fs->lfs_idaddr; 121 else { 122 LFS_IENTRY(ifp, fs, i, bp); 123 dins[i]->daddr = ifp->if_daddr; 124 brelse(bp); 125 } 126 } 127 qsort(dins, maxino, sizeof(*dins), i_d_cmp); 128 129 /* find a value for numdirs, fill in din_table */ 130 if (debug) 131 printf("counting dirs...\n"); 132 numdirs = 0; 133 for (i = 0; i < maxino; i++) { 134 inumber = dins[i]->ino; 135 if (inumber == 0 || dins[i]->daddr == 0) 136 continue; 137 tinode = ginode(inumber); 138 if (tinode && (tinode->di_mode & IFMT) == IFDIR) 139 numdirs++; 140 } 141 142 /* from setup.c */ 143 inplast = 0; 144 listmax = numdirs + 10; 145 inpsort = (struct inoinfo **) calloc((unsigned) listmax, 146 sizeof(struct inoinfo *)); 147 inphead = (struct inoinfo **) calloc((unsigned) numdirs, 148 sizeof(struct inoinfo *)); 149 if (inpsort == NULL || inphead == NULL) { 150 printf("cannot alloc %lu bytes for inphead\n", 151 (unsigned long) numdirs * sizeof(struct inoinfo *)); 152 exit(1); 153 } 154 if (debug) 155 printf("counting blocks...\n"); 156 157 for (i = 0; i < maxino; i++) { 158 inumber = dins[i]->ino; 159 if (inumber == 0 || dins[i]->daddr == 0) { 160 statemap[inumber] = USTATE; 161 continue; 162 } 163 if (dins[i]->daddr != LFS_UNUSED_DADDR) { 164 checkinode(inumber, &idesc); 165 } else { 166 statemap[inumber] = USTATE; 167 } 168 free(dins[i]); 169 } 170 free(dins); 171 } 172 173 void 174 checkinode(ino_t inumber, struct inodesc * idesc) 175 { 176 struct ufs1_dinode *dp; 177 struct uvnode *vp; 178 struct zlncnt *zlnp; 179 struct ubuf *bp; 180 IFILE *ifp; 181 int ndb, j; 182 mode_t mode; 183 184 vp = vget(fs, inumber); 185 if (vp) 186 dp = VTOD(vp); 187 else 188 dp = NULL; 189 190 if (dp == NULL) { 191 statemap[inumber] = USTATE; 192 return; 193 } 194 mode = dp->di_mode & IFMT; 195 196 /* XXX - LFS doesn't have this particular problem (?) */ 197 if (mode == 0) { 198 if (memcmp(dp->di_db, zino.di_db, NDADDR * sizeof(ufs_daddr_t)) || 199 memcmp(dp->di_ib, zino.di_ib, NIADDR * sizeof(ufs_daddr_t)) || 200 dp->di_mode || dp->di_size) { 201 pwarn("mode=o%o, ifmt=o%o\n", dp->di_mode, mode); 202 pfatal("PARTIALLY ALLOCATED INODE I=%llu", 203 (unsigned long long)inumber); 204 if (reply("CLEAR") == 1) { 205 vp = vget(fs, inumber); 206 clearinode(inumber); 207 vnode_destroy(vp); 208 } 209 } 210 statemap[inumber] = USTATE; 211 return; 212 } 213 lastino = inumber; 214 if (dp->di_size < 0 || dp->di_size + fs->lfs_bsize - 1 < dp->di_size) { 215 if (debug) 216 printf("bad size %llu:", 217 (unsigned long long) dp->di_size); 218 goto unknown; 219 } 220 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 221 vp = vget(fs, inumber); 222 dp = VTOD(vp); 223 dp->di_size = fs->lfs_fsize; 224 dp->di_mode = IFREG | 0600; 225 inodirty(VTOI(vp)); 226 } 227 ndb = howmany(dp->di_size, fs->lfs_bsize); 228 if (ndb < 0) { 229 if (debug) 230 printf("bad size %llu ndb %d:", 231 (unsigned long long) dp->di_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 (dp->di_size < fs->lfs_maxsymlinklen || 242 (fs->lfs_maxsymlinklen == 0 && dp->di_blocks == 0)) { 243 ndb = howmany(dp->di_size, sizeof(ufs_daddr_t)); 244 if (ndb > NDADDR) { 245 j = ndb - NDADDR; 246 for (ndb = 1; j > 1; j--) 247 ndb *= NINDIR(fs); 248 ndb += NDADDR; 249 } 250 } 251 } 252 for (j = ndb; j < NDADDR; j++) 253 if (dp->di_db[j] != 0) { 254 if (debug) 255 printf("bad direct addr for size %lld lbn %d: 0x%x\n", 256 (long long)dp->di_size, j, (unsigned)dp->di_db[j]); 257 goto unknown; 258 } 259 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 260 ndb /= NINDIR(fs); 261 for (; j < NIADDR; j++) 262 if (dp->di_ib[j] != 0) { 263 if (debug) 264 printf("bad indirect addr for size %lld # %d: 0x%x\n", 265 (long long)dp->di_size, j, (unsigned)dp->di_ib[j]); 266 goto unknown; 267 } 268 if (ftypeok(dp) == 0) 269 goto unknown; 270 n_files++; 271 lncntp[inumber] = dp->di_nlink; 272 if (dp->di_nlink <= 0) { 273 zlnp = (struct zlncnt *) malloc(sizeof *zlnp); 274 if (zlnp == NULL) { 275 pfatal("LINK COUNT TABLE OVERFLOW"); 276 if (reply("CONTINUE") == 0) 277 err(8, "%s", ""); 278 } else { 279 zlnp->zlncnt = inumber; 280 zlnp->next = zlnhead; 281 zlnhead = zlnp; 282 } 283 } 284 if (mode == IFDIR) { 285 if (dp->di_size == 0) 286 statemap[inumber] = DCLEAR; 287 else 288 statemap[inumber] = DSTATE; 289 cacheino(dp, inumber); 290 } else 291 statemap[inumber] = FSTATE; 292 293 /* 294 * Check for an orphaned file. These happen when the cleaner has 295 * to rewrite blocks from a file whose directory operation (removal) 296 * is in progress. 297 */ 298 if (dp->di_nlink <= 0) { 299 LFS_IENTRY(ifp, fs, inumber, bp); 300 if (ifp->if_nextfree == LFS_ORPHAN_NEXTFREE) { 301 statemap[inumber] = (mode == IFDIR ? DCLEAR : FCLEAR); 302 /* Add this to our list of orphans */ 303 zlnp = (struct zlncnt *) malloc(sizeof *zlnp); 304 if (zlnp == NULL) { 305 pfatal("LINK COUNT TABLE OVERFLOW"); 306 if (reply("CONTINUE") == 0) 307 err(8, "%s", ""); 308 } else { 309 zlnp->zlncnt = inumber; 310 zlnp->next = orphead; 311 orphead = zlnp; 312 } 313 } 314 brelse(bp); 315 } 316 317 typemap[inumber] = IFTODT(mode); 318 badblk = dupblk = 0; 319 idesc->id_number = inumber; 320 (void) ckinode(VTOD(vp), idesc); 321 if (dp->di_blocks != idesc->id_entryno) { 322 pwarn("INCORRECT BLOCK COUNT I=%llu (%d SHOULD BE %d)", 323 (unsigned long long)inumber, dp->di_blocks, 324 idesc->id_entryno); 325 if (preen) 326 printf(" (CORRECTED)\n"); 327 else if (reply("CORRECT") == 0) 328 return; 329 VTOI(vp)->i_ffs1_blocks = idesc->id_entryno; 330 inodirty(VTOI(vp)); 331 } 332 return; 333 unknown: 334 pfatal("UNKNOWN FILE TYPE I=%llu", (unsigned long long)inumber); 335 statemap[inumber] = FCLEAR; 336 if (reply("CLEAR") == 1) { 337 statemap[inumber] = USTATE; 338 vp = vget(fs, inumber); 339 clearinode(inumber); 340 vnode_destroy(vp); 341 } 342 } 343 344 int 345 pass1check(struct inodesc *idesc) 346 { 347 int res = KEEPON; 348 int anyout, ndblks; 349 daddr_t blkno = idesc->id_blkno; 350 struct dups *dlp; 351 struct dups *new; 352 353 if ((anyout = chkrange(blkno, fragstofsb(fs, idesc->id_numfrags))) != 0) { 354 blkerror(idesc->id_number, "BAD", blkno); 355 if (badblk++ >= MAXBAD) { 356 pwarn("EXCESSIVE BAD BLKS I=%llu", 357 (unsigned long long)idesc->id_number); 358 if (preen) 359 printf(" (SKIPPING)\n"); 360 else if (reply("CONTINUE") == 0) 361 err(8, "%s", ""); 362 return (STOP); 363 } 364 } else if (!testbmap(blkno)) { 365 seg_table[dtosn(fs, blkno)].su_nbytes += idesc->id_numfrags * fs->lfs_fsize; 366 } 367 for (ndblks = fragstofsb(fs, idesc->id_numfrags); ndblks > 0; blkno++, ndblks--) { 368 if (anyout && chkrange(blkno, 1)) { 369 res = SKIP; 370 } else if (!testbmap(blkno)) { 371 n_blks++; 372 #ifndef VERBOSE_BLOCKMAP 373 setbmap(blkno); 374 #else 375 setbmap(blkno, idesc->id_number); 376 #endif 377 } else { 378 blkerror(idesc->id_number, "DUP", blkno); 379 #ifdef VERBOSE_BLOCKMAP 380 pwarn("(lbn %lld: Holder is %lld)\n", 381 (long long)idesc->id_lblkno, 382 (long long)testbmap(blkno)); 383 #endif 384 if (dupblk++ >= MAXDUP) { 385 pwarn("EXCESSIVE DUP BLKS I=%llu", 386 (unsigned long long)idesc->id_number); 387 if (preen) 388 printf(" (SKIPPING)\n"); 389 else if (reply("CONTINUE") == 0) 390 err(8, "%s", ""); 391 return (STOP); 392 } 393 new = (struct dups *) malloc(sizeof(struct dups)); 394 if (new == NULL) { 395 pfatal("DUP TABLE OVERFLOW."); 396 if (reply("CONTINUE") == 0) 397 err(8, "%s", ""); 398 return (STOP); 399 } 400 new->dup = blkno; 401 if (muldup == 0) { 402 duplist = muldup = new; 403 new->next = 0; 404 } else { 405 new->next = muldup->next; 406 muldup->next = new; 407 } 408 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 409 if (dlp->dup == blkno) 410 break; 411 if (dlp == muldup && dlp->dup != blkno) 412 muldup = new; 413 } 414 /* 415 * count the number of blocks found in id_entryno 416 */ 417 idesc->id_entryno++; 418 } 419 return (res); 420 } 421
Indexes created Sat Oct 18 23:09:54 GMT 2025