pass1.c revision 1.25
1 /* $NetBSD: pass1.c,v 1.25 2006/07/18 23:37:13 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 int ndb, j; 180 mode_t mode; 181 182 vp = vget(fs, inumber); 183 if (vp) 184 dp = VTOD(vp); 185 else 186 dp = NULL; 187 188 if (dp == NULL) { 189 statemap[inumber] = USTATE; 190 return; 191 } 192 mode = dp->di_mode & IFMT; 193 194 /* XXX - LFS doesn't have this particular problem (?) */ 195 if (mode == 0) { 196 if (memcmp(dp->di_db, zino.di_db, NDADDR * sizeof(ufs_daddr_t)) || 197 memcmp(dp->di_ib, zino.di_ib, NIADDR * sizeof(ufs_daddr_t)) || 198 dp->di_mode || dp->di_size) { 199 pwarn("mode=o%o, ifmt=o%o\n", dp->di_mode, mode); 200 pfatal("PARTIALLY ALLOCATED INODE I=%llu", 201 (unsigned long long)inumber); 202 if (reply("CLEAR") == 1) { 203 vp = vget(fs, inumber); 204 clearinode(inumber); 205 vnode_destroy(vp); 206 } 207 } 208 statemap[inumber] = USTATE; 209 return; 210 } 211 lastino = inumber; 212 if (dp->di_size < 0 || dp->di_size + fs->lfs_bsize - 1 < dp->di_size) { 213 if (debug) 214 printf("bad size %llu:", 215 (unsigned long long) dp->di_size); 216 goto unknown; 217 } 218 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 219 vp = vget(fs, inumber); 220 dp = VTOD(vp); 221 dp->di_size = fs->lfs_fsize; 222 dp->di_mode = IFREG | 0600; 223 inodirty(VTOI(vp)); 224 } 225 ndb = howmany(dp->di_size, fs->lfs_bsize); 226 if (ndb < 0) { 227 if (debug) 228 printf("bad size %llu ndb %d:", 229 (unsigned long long) dp->di_size, ndb); 230 goto unknown; 231 } 232 if (mode == IFBLK || mode == IFCHR) 233 ndb++; 234 if (mode == IFLNK) { 235 /* 236 * Fake ndb value so direct/indirect block checks below 237 * will detect any garbage after symlink string. 238 */ 239 if (dp->di_size < fs->lfs_maxsymlinklen || 240 (fs->lfs_maxsymlinklen == 0 && dp->di_blocks == 0)) { 241 ndb = howmany(dp->di_size, sizeof(ufs_daddr_t)); 242 if (ndb > NDADDR) { 243 j = ndb - NDADDR; 244 for (ndb = 1; j > 1; j--) 245 ndb *= NINDIR(fs); 246 ndb += NDADDR; 247 } 248 } 249 } 250 for (j = ndb; j < NDADDR; j++) 251 if (dp->di_db[j] != 0) { 252 if (debug) 253 printf("bad direct addr for size %lld lbn %d: 0x%x\n", 254 (long long)dp->di_size, j, (unsigned)dp->di_db[j]); 255 goto unknown; 256 } 257 for (j = 0, ndb -= NDADDR; ndb > 0; j++) 258 ndb /= NINDIR(fs); 259 for (; j < NIADDR; j++) 260 if (dp->di_ib[j] != 0) { 261 if (debug) 262 printf("bad indirect addr for size %lld # %d: 0x%x\n", 263 (long long)dp->di_size, j, (unsigned)dp->di_ib[j]); 264 goto unknown; 265 } 266 if (ftypeok(dp) == 0) 267 goto unknown; 268 n_files++; 269 lncntp[inumber] = dp->di_nlink; 270 if (dp->di_nlink <= 0) { 271 zlnp = (struct zlncnt *) malloc(sizeof *zlnp); 272 if (zlnp == NULL) { 273 pfatal("LINK COUNT TABLE OVERFLOW"); 274 if (reply("CONTINUE") == 0) 275 err(8, "%s", ""); 276 } else { 277 zlnp->zlncnt = inumber; 278 zlnp->next = zlnhead; 279 zlnhead = zlnp; 280 } 281 } 282 if (mode == IFDIR) { 283 if (dp->di_size == 0) 284 statemap[inumber] = DCLEAR; 285 else 286 statemap[inumber] = DSTATE; 287 cacheino(dp, inumber); 288 } else 289 statemap[inumber] = FSTATE; 290 typemap[inumber] = IFTODT(mode); 291 badblk = dupblk = 0; 292 idesc->id_number = inumber; 293 (void) ckinode(VTOD(vp), idesc); 294 if (dp->di_blocks != idesc->id_entryno) { 295 pwarn("INCORRECT BLOCK COUNT I=%llu (%d SHOULD BE %d)", 296 (unsigned long long)inumber, dp->di_blocks, 297 idesc->id_entryno); 298 if (preen) 299 printf(" (CORRECTED)\n"); 300 else if (reply("CORRECT") == 0) 301 return; 302 VTOI(vp)->i_ffs1_blocks = idesc->id_entryno; 303 inodirty(VTOI(vp)); 304 } 305 return; 306 unknown: 307 pfatal("UNKNOWN FILE TYPE I=%llu", (unsigned long long)inumber); 308 statemap[inumber] = FCLEAR; 309 if (reply("CLEAR") == 1) { 310 statemap[inumber] = USTATE; 311 vp = vget(fs, inumber); 312 clearinode(inumber); 313 vnode_destroy(vp); 314 } 315 } 316 317 int 318 pass1check(struct inodesc *idesc) 319 { 320 int res = KEEPON; 321 int anyout, ndblks; 322 daddr_t blkno = idesc->id_blkno; 323 struct dups *dlp; 324 struct dups *new; 325 326 if ((anyout = chkrange(blkno, fragstofsb(fs, idesc->id_numfrags))) != 0) { 327 blkerror(idesc->id_number, "BAD", blkno); 328 if (badblk++ >= MAXBAD) { 329 pwarn("EXCESSIVE BAD BLKS I=%llu", 330 (unsigned long long)idesc->id_number); 331 if (preen) 332 printf(" (SKIPPING)\n"); 333 else if (reply("CONTINUE") == 0) 334 err(8, "%s", ""); 335 return (STOP); 336 } 337 } else if (!testbmap(blkno)) { 338 seg_table[dtosn(fs, blkno)].su_nbytes += idesc->id_numfrags * fs->lfs_fsize; 339 } 340 for (ndblks = fragstofsb(fs, idesc->id_numfrags); ndblks > 0; blkno++, ndblks--) { 341 if (anyout && chkrange(blkno, 1)) { 342 res = SKIP; 343 } else if (!testbmap(blkno)) { 344 n_blks++; 345 #ifndef VERBOSE_BLOCKMAP 346 setbmap(blkno); 347 #else 348 setbmap(blkno, idesc->id_number); 349 #endif 350 } else { 351 blkerror(idesc->id_number, "DUP", blkno); 352 #ifdef VERBOSE_BLOCKMAP 353 pwarn("(lbn %d: Holder is %d)\n", idesc->id_lblkno, 354 testbmap(blkno)); 355 #endif 356 if (dupblk++ >= MAXDUP) { 357 pwarn("EXCESSIVE DUP BLKS I=%llu", 358 (unsigned long long)idesc->id_number); 359 if (preen) 360 printf(" (SKIPPING)\n"); 361 else if (reply("CONTINUE") == 0) 362 err(8, "%s", ""); 363 return (STOP); 364 } 365 new = (struct dups *) malloc(sizeof(struct dups)); 366 if (new == NULL) { 367 pfatal("DUP TABLE OVERFLOW."); 368 if (reply("CONTINUE") == 0) 369 err(8, "%s", ""); 370 return (STOP); 371 } 372 new->dup = blkno; 373 if (muldup == 0) { 374 duplist = muldup = new; 375 new->next = 0; 376 } else { 377 new->next = muldup->next; 378 muldup->next = new; 379 } 380 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 381 if (dlp->dup == blkno) 382 break; 383 if (dlp == muldup && dlp->dup != blkno) 384 muldup = new; 385 } 386 /* 387 * count the number of blocks found in id_entryno 388 */ 389 idesc->id_entryno++; 390 } 391 return (res); 392 } 393
Indexes created Sat Oct 18 08:10:09 GMT 2025