1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 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 #if 0 33 #ifndef lint 34 static const char sccsid[] = "@(#)inode.c 8.8 (Berkeley) 4/28/95"; 35 #endif /* not lint */ 36 #endif 37 #include <sys/cdefs.h> 38 __FBSDID("$FreeBSD$"); 39 40 #include <sys/param.h> 41 #include <sys/stdint.h> 42 #include <sys/sysctl.h> 43 44 #include <ufs/ufs/dinode.h> 45 #include <ufs/ufs/dir.h> 46 #include <ufs/ffs/fs.h> 47 48 #include <err.h> 49 #include <pwd.h> 50 #include <string.h> 51 #include <time.h> 52 #include <libufs.h> 53 54 #include "fsck.h" 55 56 static ino_t startinum; 57 58 static int iblock(struct inodesc *, long ilevel, off_t isize, int type); 59 60 int 61 ckinode(union dinode *dp, struct inodesc *idesc) 62 { 63 off_t remsize, sizepb; 64 int i, offset, ret; 65 union dinode dino; 66 ufs2_daddr_t ndb; 67 mode_t mode; 68 char pathbuf[MAXPATHLEN + 1]; 69 70 if (idesc->id_fix != IGNORE) 71 idesc->id_fix = DONTKNOW; 72 idesc->id_lbn = -1; 73 idesc->id_entryno = 0; 74 idesc->id_filesize = DIP(dp, di_size); 75 mode = DIP(dp, di_mode) & IFMT; 76 if (mode == IFBLK || mode == IFCHR || (mode == IFLNK && 77 DIP(dp, di_size) < (unsigned)sblock.fs_maxsymlinklen)) 78 return (KEEPON); 79 if (sblock.fs_magic == FS_UFS1_MAGIC) 80 dino.dp1 = dp->dp1; 81 else 82 dino.dp2 = dp->dp2; 83 ndb = howmany(DIP(&dino, di_size), sblock.fs_bsize); 84 for (i = 0; i < UFS_NDADDR; i++) { 85 idesc->id_lbn++; 86 if (--ndb == 0 && 87 (offset = blkoff(&sblock, DIP(&dino, di_size))) != 0) 88 idesc->id_numfrags = 89 numfrags(&sblock, fragroundup(&sblock, offset)); 90 else 91 idesc->id_numfrags = sblock.fs_frag; 92 if (DIP(&dino, di_db[i]) == 0) { 93 if (idesc->id_type == DATA && ndb >= 0) { 94 /* An empty block in a directory XXX */ 95 getpathname(pathbuf, idesc->id_number, 96 idesc->id_number); 97 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS", 98 pathbuf); 99 if (reply("ADJUST LENGTH") == 1) { 100 dp = ginode(idesc->id_number); 101 DIP_SET(dp, di_size, 102 i * sblock.fs_bsize); 103 printf( 104 "YOU MUST RERUN FSCK AFTERWARDS\n"); 105 rerun = 1; 106 inodirty(dp); 107 108 } 109 } 110 continue; 111 } 112 idesc->id_blkno = DIP(&dino, di_db[i]); 113 if (idesc->id_type != DATA) 114 ret = (*idesc->id_func)(idesc); 115 else 116 ret = dirscan(idesc); 117 if (ret & STOP) 118 return (ret); 119 } 120 idesc->id_numfrags = sblock.fs_frag; 121 remsize = DIP(&dino, di_size) - sblock.fs_bsize * UFS_NDADDR; 122 sizepb = sblock.fs_bsize; 123 for (i = 0; i < UFS_NIADDR; i++) { 124 sizepb *= NINDIR(&sblock); 125 if (DIP(&dino, di_ib[i])) { 126 idesc->id_blkno = DIP(&dino, di_ib[i]); 127 ret = iblock(idesc, i + 1, remsize, BT_LEVEL1 + i); 128 if (ret & STOP) 129 return (ret); 130 } else { 131 idesc->id_lbn += sizepb / sblock.fs_bsize; 132 if (idesc->id_type == DATA && remsize > 0) { 133 /* An empty block in a directory XXX */ 134 getpathname(pathbuf, idesc->id_number, 135 idesc->id_number); 136 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS", 137 pathbuf); 138 if (reply("ADJUST LENGTH") == 1) { 139 dp = ginode(idesc->id_number); 140 DIP_SET(dp, di_size, 141 DIP(dp, di_size) - remsize); 142 remsize = 0; 143 printf( 144 "YOU MUST RERUN FSCK AFTERWARDS\n"); 145 rerun = 1; 146 inodirty(dp); 147 break; 148 } 149 } 150 } 151 remsize -= sizepb; 152 } 153 return (KEEPON); 154 } 155 156 static int 157 iblock(struct inodesc *idesc, long ilevel, off_t isize, int type) 158 { 159 struct bufarea *bp; 160 int i, n, (*func)(struct inodesc *), nif; 161 off_t sizepb; 162 char buf[BUFSIZ]; 163 char pathbuf[MAXPATHLEN + 1]; 164 union dinode *dp; 165 166 if (idesc->id_type != DATA) { 167 func = idesc->id_func; 168 if (((n = (*func)(idesc)) & KEEPON) == 0) 169 return (n); 170 } else 171 func = dirscan; 172 if (chkrange(idesc->id_blkno, idesc->id_numfrags)) 173 return (SKIP); 174 bp = getdatablk(idesc->id_blkno, sblock.fs_bsize, type); 175 ilevel--; 176 for (sizepb = sblock.fs_bsize, i = 0; i < ilevel; i++) 177 sizepb *= NINDIR(&sblock); 178 if (howmany(isize, sizepb) > NINDIR(&sblock)) 179 nif = NINDIR(&sblock); 180 else 181 nif = howmany(isize, sizepb); 182 if (idesc->id_func == pass1check && nif < NINDIR(&sblock)) { 183 for (i = nif; i < NINDIR(&sblock); i++) { 184 if (IBLK(bp, i) == 0) 185 continue; 186 (void)sprintf(buf, "PARTIALLY TRUNCATED INODE I=%lu", 187 (u_long)idesc->id_number); 188 if (preen) { 189 pfatal("%s", buf); 190 } else if (dofix(idesc, buf)) { 191 IBLK_SET(bp, i, 0); 192 dirty(bp); 193 } 194 } 195 flush(fswritefd, bp); 196 } 197 for (i = 0; i < nif; i++) { 198 if (ilevel == 0) 199 idesc->id_lbn++; 200 if (IBLK(bp, i)) { 201 idesc->id_blkno = IBLK(bp, i); 202 if (ilevel == 0) 203 n = (*func)(idesc); 204 else 205 n = iblock(idesc, ilevel, isize, type); 206 if (n & STOP) { 207 bp->b_flags &= ~B_INUSE; 208 return (n); 209 } 210 } else { 211 if (idesc->id_type == DATA && isize > 0) { 212 /* An empty block in a directory XXX */ 213 getpathname(pathbuf, idesc->id_number, 214 idesc->id_number); 215 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS", 216 pathbuf); 217 if (reply("ADJUST LENGTH") == 1) { 218 dp = ginode(idesc->id_number); 219 DIP_SET(dp, di_size, 220 DIP(dp, di_size) - isize); 221 isize = 0; 222 printf( 223 "YOU MUST RERUN FSCK AFTERWARDS\n"); 224 rerun = 1; 225 inodirty(dp); 226 bp->b_flags &= ~B_INUSE; 227 return(STOP); 228 } 229 } 230 } 231 isize -= sizepb; 232 } 233 bp->b_flags &= ~B_INUSE; 234 return (KEEPON); 235 } 236 237 /* 238 * Check that a block in a legal block number. 239 * Return 0 if in range, 1 if out of range. 240 */ 241 int 242 chkrange(ufs2_daddr_t blk, int cnt) 243 { 244 int c; 245 246 if (cnt <= 0 || blk <= 0 || blk > maxfsblock || 247 cnt - 1 > maxfsblock - blk) 248 return (1); 249 if (cnt > sblock.fs_frag || 250 fragnum(&sblock, blk) + cnt > sblock.fs_frag) { 251 if (debug) 252 printf("bad size: blk %ld, offset %i, size %d\n", 253 (long)blk, (int)fragnum(&sblock, blk), cnt); 254 return (1); 255 } 256 c = dtog(&sblock, blk); 257 if (blk < cgdmin(&sblock, c)) { 258 if ((blk + cnt) > cgsblock(&sblock, c)) { 259 if (debug) { 260 printf("blk %ld < cgdmin %ld;", 261 (long)blk, (long)cgdmin(&sblock, c)); 262 printf(" blk + cnt %ld > cgsbase %ld\n", 263 (long)(blk + cnt), 264 (long)cgsblock(&sblock, c)); 265 } 266 return (1); 267 } 268 } else { 269 if ((blk + cnt) > cgbase(&sblock, c+1)) { 270 if (debug) { 271 printf("blk %ld >= cgdmin %ld;", 272 (long)blk, (long)cgdmin(&sblock, c)); 273 printf(" blk + cnt %ld > sblock.fs_fpg %ld\n", 274 (long)(blk + cnt), (long)sblock.fs_fpg); 275 } 276 return (1); 277 } 278 } 279 return (0); 280 } 281 282 /* 283 * General purpose interface for reading inodes. 284 */ 285 union dinode * 286 ginode(ino_t inumber) 287 { 288 ufs2_daddr_t iblk; 289 union dinode *dp; 290 291 if (inumber < UFS_ROOTINO || inumber > maxino) 292 errx(EEXIT, "bad inode number %ju to ginode", 293 (uintmax_t)inumber); 294 if (startinum == 0 || 295 inumber < startinum || inumber >= startinum + INOPB(&sblock)) { 296 iblk = ino_to_fsba(&sblock, inumber); 297 if (pbp != NULL) 298 pbp->b_flags &= ~B_INUSE; 299 pbp = getdatablk(iblk, sblock.fs_bsize, BT_INODES); 300 startinum = rounddown(inumber, INOPB(&sblock)); 301 } 302 if (sblock.fs_magic == FS_UFS1_MAGIC) 303 return ((union dinode *) 304 &pbp->b_un.b_dinode1[inumber % INOPB(&sblock)]); 305 dp = (union dinode *)&pbp->b_un.b_dinode2[inumber % INOPB(&sblock)]; 306 if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp) != 0) { 307 pwarn("INODE CHECK-HASH FAILED"); 308 prtinode(inumber, dp); 309 if (preen || reply("FIX") != 0) { 310 if (preen) 311 printf(" (FIXED)\n"); 312 inodirty(dp); 313 } 314 } 315 return (dp); 316 } 317 318 /* 319 * Special purpose version of ginode used to optimize first pass 320 * over all the inodes in numerical order. 321 */ 322 static ino_t nextino, lastinum, lastvalidinum; 323 static long readcount, readpercg, fullcnt, inobufsize, partialcnt, partialsize; 324 static struct bufarea inobuf; 325 326 union dinode * 327 getnextinode(ino_t inumber, int rebuildcg) 328 { 329 int j; 330 long size; 331 mode_t mode; 332 ufs2_daddr_t ndb, blk; 333 union dinode *dp; 334 static caddr_t nextinop; 335 336 if (inumber != nextino++ || inumber > lastvalidinum) 337 errx(EEXIT, "bad inode number %ju to nextinode", 338 (uintmax_t)inumber); 339 if (inumber >= lastinum) { 340 readcount++; 341 blk = ino_to_fsba(&sblock, lastinum); 342 if (readcount % readpercg == 0) { 343 size = partialsize; 344 lastinum += partialcnt; 345 } else { 346 size = inobufsize; 347 lastinum += fullcnt; 348 } 349 /* 350 * If getblk encounters an error, it will already have zeroed 351 * out the buffer, so we do not need to do so here. 352 */ 353 getblk(&inobuf, blk, size); 354 nextinop = inobuf.b_un.b_buf; 355 } 356 dp = (union dinode *)nextinop; 357 if (sblock.fs_magic == FS_UFS1_MAGIC) 358 nextinop += sizeof(struct ufs1_dinode); 359 else 360 nextinop += sizeof(struct ufs2_dinode); 361 if ((ckhashadd & CK_INODE) != 0) { 362 ffs_update_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp); 363 dirty(&inobuf); 364 } 365 if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp) != 0) { 366 pwarn("INODE CHECK-HASH FAILED"); 367 prtinode(inumber, dp); 368 if (preen || reply("FIX") != 0) { 369 if (preen) 370 printf(" (FIXED)\n"); 371 ffs_update_dinode_ckhash(&sblock, 372 (struct ufs2_dinode *)dp); 373 dirty(&inobuf); 374 } 375 } 376 if (rebuildcg && (char *)dp == inobuf.b_un.b_buf) { 377 /* 378 * Try to determine if we have reached the end of the 379 * allocated inodes. 380 */ 381 mode = DIP(dp, di_mode) & IFMT; 382 if (mode == 0) { 383 if (memcmp(dp->dp2.di_db, ufs2_zino.di_db, 384 UFS_NDADDR * sizeof(ufs2_daddr_t)) || 385 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib, 386 UFS_NIADDR * sizeof(ufs2_daddr_t)) || 387 dp->dp2.di_mode || dp->dp2.di_size) 388 return (NULL); 389 return (dp); 390 } 391 if (!ftypeok(dp)) 392 return (NULL); 393 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize); 394 if (ndb < 0) 395 return (NULL); 396 if (mode == IFBLK || mode == IFCHR) 397 ndb++; 398 if (mode == IFLNK) { 399 /* 400 * Fake ndb value so direct/indirect block checks below 401 * will detect any garbage after symlink string. 402 */ 403 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) { 404 ndb = howmany(DIP(dp, di_size), 405 sizeof(ufs2_daddr_t)); 406 if (ndb > UFS_NDADDR) { 407 j = ndb - UFS_NDADDR; 408 for (ndb = 1; j > 1; j--) 409 ndb *= NINDIR(&sblock); 410 ndb += UFS_NDADDR; 411 } 412 } 413 } 414 for (j = ndb; ndb < UFS_NDADDR && j < UFS_NDADDR; j++) 415 if (DIP(dp, di_db[j]) != 0) 416 return (NULL); 417 for (j = 0, ndb -= UFS_NDADDR; ndb > 0; j++) 418 ndb /= NINDIR(&sblock); 419 for (; j < UFS_NIADDR; j++) 420 if (DIP(dp, di_ib[j]) != 0) 421 return (NULL); 422 } 423 return (dp); 424 } 425 426 void 427 setinodebuf(ino_t inum) 428 { 429 430 if (inum % sblock.fs_ipg != 0) 431 errx(EEXIT, "bad inode number %ju to setinodebuf", 432 (uintmax_t)inum); 433 lastvalidinum = inum + sblock.fs_ipg - 1; 434 startinum = 0; 435 nextino = inum; 436 lastinum = inum; 437 readcount = 0; 438 if (inobuf.b_un.b_buf != NULL) 439 return; 440 inobufsize = blkroundup(&sblock, INOBUFSIZE); 441 fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ? 442 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)); 443 readpercg = sblock.fs_ipg / fullcnt; 444 partialcnt = sblock.fs_ipg % fullcnt; 445 partialsize = partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ? 446 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)); 447 if (partialcnt != 0) { 448 readpercg++; 449 } else { 450 partialcnt = fullcnt; 451 partialsize = inobufsize; 452 } 453 initbarea(&inobuf, BT_INODES); 454 if ((inobuf.b_un.b_buf = Malloc((unsigned)inobufsize)) == NULL) 455 errx(EEXIT, "cannot allocate space for inode buffer"); 456 } 457 458 void 459 freeinodebuf(void) 460 { 461 462 if (inobuf.b_un.b_buf != NULL) 463 free((char *)inobuf.b_un.b_buf); 464 inobuf.b_un.b_buf = NULL; 465 } 466 467 /* 468 * Routines to maintain information about directory inodes. 469 * This is built during the first pass and used during the 470 * second and third passes. 471 * 472 * Enter inodes into the cache. 473 */ 474 void 475 cacheino(union dinode *dp, ino_t inumber) 476 { 477 struct inoinfo *inp, **inpp; 478 int i, blks; 479 480 if (howmany(DIP(dp, di_size), sblock.fs_bsize) > UFS_NDADDR) 481 blks = UFS_NDADDR + UFS_NIADDR; 482 else if (DIP(dp, di_size) > 0) 483 blks = howmany(DIP(dp, di_size), sblock.fs_bsize); 484 else 485 blks = 1; 486 inp = (struct inoinfo *) 487 Malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs2_daddr_t)); 488 if (inp == NULL) 489 errx(EEXIT, "cannot increase directory list"); 490 inpp = &inphead[inumber % dirhash]; 491 inp->i_nexthash = *inpp; 492 *inpp = inp; 493 inp->i_parent = inumber == UFS_ROOTINO ? UFS_ROOTINO : (ino_t)0; 494 inp->i_dotdot = (ino_t)0; 495 inp->i_number = inumber; 496 inp->i_isize = DIP(dp, di_size); 497 inp->i_numblks = blks; 498 for (i = 0; i < MIN(blks, UFS_NDADDR); i++) 499 inp->i_blks[i] = DIP(dp, di_db[i]); 500 if (blks > UFS_NDADDR) 501 for (i = 0; i < UFS_NIADDR; i++) 502 inp->i_blks[UFS_NDADDR + i] = DIP(dp, di_ib[i]); 503 if (inplast == listmax) { 504 listmax += 100; 505 inpsort = (struct inoinfo **)reallocarray((char *)inpsort, 506 listmax, sizeof(struct inoinfo *)); 507 if (inpsort == NULL) 508 errx(EEXIT, "cannot increase directory list"); 509 } 510 inpsort[inplast++] = inp; 511 } 512 513 /* 514 * Look up an inode cache structure. 515 */ 516 struct inoinfo * 517 getinoinfo(ino_t inumber) 518 { 519 struct inoinfo *inp; 520 521 for (inp = inphead[inumber % dirhash]; inp; inp = inp->i_nexthash) { 522 if (inp->i_number != inumber) 523 continue; 524 return (inp); 525 } 526 errx(EEXIT, "cannot find inode %ju", (uintmax_t)inumber); 527 return ((struct inoinfo *)0); 528 } 529 530 /* 531 * Clean up all the inode cache structure. 532 */ 533 void 534 inocleanup(void) 535 { 536 struct inoinfo **inpp; 537 538 if (inphead == NULL) 539 return; 540 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) 541 free((char *)(*inpp)); 542 free((char *)inphead); 543 free((char *)inpsort); 544 inphead = inpsort = NULL; 545 } 546 547 void 548 inodirty(union dinode *dp) 549 { 550 551 if (sblock.fs_magic == FS_UFS2_MAGIC) 552 ffs_update_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp); 553 dirty(pbp); 554 } 555 556 void 557 clri(struct inodesc *idesc, const char *type, int flag) 558 { 559 union dinode *dp; 560 561 dp = ginode(idesc->id_number); 562 if (flag == 1) { 563 pwarn("%s %s", type, 564 (DIP(dp, di_mode) & IFMT) == IFDIR ? "DIR" : "FILE"); 565 prtinode(idesc->id_number, dp); 566 printf("\n"); 567 } 568 if (preen || reply("CLEAR") == 1) { 569 if (preen) 570 printf(" (CLEARED)\n"); 571 n_files--; 572 if (bkgrdflag == 0) { 573 (void)ckinode(dp, idesc); 574 inoinfo(idesc->id_number)->ino_state = USTATE; 575 clearinode(dp); 576 inodirty(dp); 577 } else { 578 cmd.value = idesc->id_number; 579 cmd.size = -DIP(dp, di_nlink); 580 if (debug) 581 printf("adjrefcnt ino %ld amt %lld\n", 582 (long)cmd.value, (long long)cmd.size); 583 if (sysctl(adjrefcnt, MIBSIZE, 0, 0, 584 &cmd, sizeof cmd) == -1) 585 rwerror("ADJUST INODE", cmd.value); 586 } 587 } 588 } 589 590 int 591 findname(struct inodesc *idesc) 592 { 593 struct direct *dirp = idesc->id_dirp; 594 595 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) { 596 idesc->id_entryno++; 597 return (KEEPON); 598 } 599 memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1); 600 return (STOP|FOUND); 601 } 602 603 int 604 findino(struct inodesc *idesc) 605 { 606 struct direct *dirp = idesc->id_dirp; 607 608 if (dirp->d_ino == 0) 609 return (KEEPON); 610 if (strcmp(dirp->d_name, idesc->id_name) == 0 && 611 dirp->d_ino >= UFS_ROOTINO && dirp->d_ino <= maxino) { 612 idesc->id_parent = dirp->d_ino; 613 return (STOP|FOUND); 614 } 615 return (KEEPON); 616 } 617 618 int 619 clearentry(struct inodesc *idesc) 620 { 621 struct direct *dirp = idesc->id_dirp; 622 623 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) { 624 idesc->id_entryno++; 625 return (KEEPON); 626 } 627 dirp->d_ino = 0; 628 return (STOP|FOUND|ALTERED); 629 } 630 631 void 632 prtinode(ino_t ino, union dinode *dp) 633 { 634 char *p; 635 struct passwd *pw; 636 time_t t; 637 638 printf(" I=%lu ", (u_long)ino); 639 if (ino < UFS_ROOTINO || ino > maxino) 640 return; 641 printf(" OWNER="); 642 if ((pw = getpwuid((int)DIP(dp, di_uid))) != NULL) 643 printf("%s ", pw->pw_name); 644 else 645 printf("%u ", (unsigned)DIP(dp, di_uid)); 646 printf("MODE=%o\n", DIP(dp, di_mode)); 647 if (preen) 648 printf("%s: ", cdevname); 649 printf("SIZE=%ju ", (uintmax_t)DIP(dp, di_size)); 650 t = DIP(dp, di_mtime); 651 p = ctime(&t); 652 printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]); 653 } 654 655 void 656 blkerror(ino_t ino, const char *type, ufs2_daddr_t blk) 657 { 658 659 pfatal("%jd %s I=%ju", (intmax_t)blk, type, (uintmax_t)ino); 660 printf("\n"); 661 switch (inoinfo(ino)->ino_state) { 662 663 case FSTATE: 664 case FZLINK: 665 inoinfo(ino)->ino_state = FCLEAR; 666 return; 667 668 case DSTATE: 669 case DZLINK: 670 inoinfo(ino)->ino_state = DCLEAR; 671 return; 672 673 case FCLEAR: 674 case DCLEAR: 675 return; 676 677 default: 678 errx(EEXIT, "BAD STATE %d TO BLKERR", inoinfo(ino)->ino_state); 679 /* NOTREACHED */ 680 } 681 } 682 683 /* 684 * allocate an unused inode 685 */ 686 ino_t 687 allocino(ino_t request, int type) 688 { 689 ino_t ino; 690 union dinode *dp; 691 struct bufarea *cgbp; 692 struct cg *cgp; 693 int cg; 694 695 if (request == 0) 696 request = UFS_ROOTINO; 697 else if (inoinfo(request)->ino_state != USTATE) 698 return (0); 699 for (ino = request; ino < maxino; ino++) 700 if (inoinfo(ino)->ino_state == USTATE) 701 break; 702 if (ino == maxino) 703 return (0); 704 cg = ino_to_cg(&sblock, ino); 705 cgbp = cglookup(cg); 706 cgp = cgbp->b_un.b_cg; 707 if (!check_cgmagic(cg, cgbp)) 708 return (0); 709 setbit(cg_inosused(cgp), ino % sblock.fs_ipg); 710 cgp->cg_cs.cs_nifree--; 711 switch (type & IFMT) { 712 case IFDIR: 713 inoinfo(ino)->ino_state = DSTATE; 714 cgp->cg_cs.cs_ndir++; 715 break; 716 case IFREG: 717 case IFLNK: 718 inoinfo(ino)->ino_state = FSTATE; 719 break; 720 default: 721 return (0); 722 } 723 cgdirty(cgbp); 724 dp = ginode(ino); 725 DIP_SET(dp, di_db[0], allocblk((long)1)); 726 if (DIP(dp, di_db[0]) == 0) { 727 inoinfo(ino)->ino_state = USTATE; 728 return (0); 729 } 730 DIP_SET(dp, di_mode, type); 731 DIP_SET(dp, di_flags, 0); 732 DIP_SET(dp, di_atime, time(NULL)); 733 DIP_SET(dp, di_ctime, DIP(dp, di_atime)); 734 DIP_SET(dp, di_mtime, DIP(dp, di_ctime)); 735 DIP_SET(dp, di_mtimensec, 0); 736 DIP_SET(dp, di_ctimensec, 0); 737 DIP_SET(dp, di_atimensec, 0); 738 DIP_SET(dp, di_size, sblock.fs_fsize); 739 DIP_SET(dp, di_blocks, btodb(sblock.fs_fsize)); 740 n_files++; 741 inodirty(dp); 742 inoinfo(ino)->ino_type = IFTODT(type); 743 return (ino); 744 } 745 746 /* 747 * deallocate an inode 748 */ 749 void 750 freeino(ino_t ino) 751 { 752 struct inodesc idesc; 753 union dinode *dp; 754 755 memset(&idesc, 0, sizeof(struct inodesc)); 756 idesc.id_type = ADDR; 757 idesc.id_func = pass4check; 758 idesc.id_number = ino; 759 dp = ginode(ino); 760 (void)ckinode(dp, &idesc); 761 clearinode(dp); 762 inodirty(dp); 763 inoinfo(ino)->ino_state = USTATE; 764 n_files--; 765 } 766