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 290 if (inumber < UFS_ROOTINO || inumber > maxino) 291 errx(EEXIT, "bad inode number %ju to ginode", 292 (uintmax_t)inumber); 293 if (startinum == 0 || 294 inumber < startinum || inumber >= startinum + INOPB(&sblock)) { 295 iblk = ino_to_fsba(&sblock, inumber); 296 if (pbp != NULL) 297 pbp->b_flags &= ~B_INUSE; 298 pbp = getdatablk(iblk, sblock.fs_bsize, BT_INODES); 299 startinum = rounddown(inumber, INOPB(&sblock)); 300 } 301 if (sblock.fs_magic == FS_UFS1_MAGIC) 302 return ((union dinode *) 303 &pbp->b_un.b_dinode1[inumber % INOPB(&sblock)]); 304 return ((union dinode *)&pbp->b_un.b_dinode2[inumber % INOPB(&sblock)]); 305 } 306 307 /* 308 * Special purpose version of ginode used to optimize first pass 309 * over all the inodes in numerical order. 310 */ 311 static ino_t nextino, lastinum, lastvalidinum; 312 static long readcount, readpercg, fullcnt, inobufsize, partialcnt, partialsize; 313 static struct bufarea inobuf; 314 315 union dinode * 316 getnextinode(ino_t inumber, int rebuildcg) 317 { 318 int j; 319 long size; 320 mode_t mode; 321 ufs2_daddr_t ndb, blk; 322 union dinode *dp; 323 static caddr_t nextinop; 324 325 if (inumber != nextino++ || inumber > lastvalidinum) 326 errx(EEXIT, "bad inode number %ju to nextinode", 327 (uintmax_t)inumber); 328 if (inumber >= lastinum) { 329 readcount++; 330 blk = ino_to_fsba(&sblock, lastinum); 331 if (readcount % readpercg == 0) { 332 size = partialsize; 333 lastinum += partialcnt; 334 } else { 335 size = inobufsize; 336 lastinum += fullcnt; 337 } 338 /* 339 * If getblk encounters an error, it will already have zeroed 340 * out the buffer, so we do not need to do so here. 341 */ 342 getblk(&inobuf, blk, size); 343 nextinop = inobuf.b_un.b_buf; 344 } 345 dp = (union dinode *)nextinop; 346 if (sblock.fs_magic == FS_UFS1_MAGIC) 347 nextinop += sizeof(struct ufs1_dinode); 348 else 349 nextinop += sizeof(struct ufs2_dinode); 350 if (rebuildcg && (char *)dp == inobuf.b_un.b_buf) { 351 /* 352 * Try to determine if we have reached the end of the 353 * allocated inodes. 354 */ 355 mode = DIP(dp, di_mode) & IFMT; 356 if (mode == 0) { 357 if (memcmp(dp->dp2.di_db, ufs2_zino.di_db, 358 UFS_NDADDR * sizeof(ufs2_daddr_t)) || 359 memcmp(dp->dp2.di_ib, ufs2_zino.di_ib, 360 UFS_NIADDR * sizeof(ufs2_daddr_t)) || 361 dp->dp2.di_mode || dp->dp2.di_size) 362 return (NULL); 363 return (dp); 364 } 365 if (!ftypeok(dp)) 366 return (NULL); 367 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize); 368 if (ndb < 0) 369 return (NULL); 370 if (mode == IFBLK || mode == IFCHR) 371 ndb++; 372 if (mode == IFLNK) { 373 /* 374 * Fake ndb value so direct/indirect block checks below 375 * will detect any garbage after symlink string. 376 */ 377 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) { 378 ndb = howmany(DIP(dp, di_size), 379 sizeof(ufs2_daddr_t)); 380 if (ndb > UFS_NDADDR) { 381 j = ndb - UFS_NDADDR; 382 for (ndb = 1; j > 1; j--) 383 ndb *= NINDIR(&sblock); 384 ndb += UFS_NDADDR; 385 } 386 } 387 } 388 for (j = ndb; ndb < UFS_NDADDR && j < UFS_NDADDR; j++) 389 if (DIP(dp, di_db[j]) != 0) 390 return (NULL); 391 for (j = 0, ndb -= UFS_NDADDR; ndb > 0; j++) 392 ndb /= NINDIR(&sblock); 393 for (; j < UFS_NIADDR; j++) 394 if (DIP(dp, di_ib[j]) != 0) 395 return (NULL); 396 } 397 return (dp); 398 } 399 400 void 401 setinodebuf(ino_t inum) 402 { 403 404 if (inum % sblock.fs_ipg != 0) 405 errx(EEXIT, "bad inode number %ju to setinodebuf", 406 (uintmax_t)inum); 407 lastvalidinum = inum + sblock.fs_ipg - 1; 408 startinum = 0; 409 nextino = inum; 410 lastinum = inum; 411 readcount = 0; 412 if (inobuf.b_un.b_buf != NULL) 413 return; 414 inobufsize = blkroundup(&sblock, INOBUFSIZE); 415 fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ? 416 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)); 417 readpercg = sblock.fs_ipg / fullcnt; 418 partialcnt = sblock.fs_ipg % fullcnt; 419 partialsize = partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ? 420 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)); 421 if (partialcnt != 0) { 422 readpercg++; 423 } else { 424 partialcnt = fullcnt; 425 partialsize = inobufsize; 426 } 427 initbarea(&inobuf, BT_INODES); 428 if ((inobuf.b_un.b_buf = Malloc((unsigned)inobufsize)) == NULL) 429 errx(EEXIT, "cannot allocate space for inode buffer"); 430 } 431 432 void 433 freeinodebuf(void) 434 { 435 436 if (inobuf.b_un.b_buf != NULL) 437 free((char *)inobuf.b_un.b_buf); 438 inobuf.b_un.b_buf = NULL; 439 } 440 441 /* 442 * Routines to maintain information about directory inodes. 443 * This is built during the first pass and used during the 444 * second and third passes. 445 * 446 * Enter inodes into the cache. 447 */ 448 void 449 cacheino(union dinode *dp, ino_t inumber) 450 { 451 struct inoinfo *inp, **inpp; 452 int i, blks; 453 454 if (howmany(DIP(dp, di_size), sblock.fs_bsize) > UFS_NDADDR) 455 blks = UFS_NDADDR + UFS_NIADDR; 456 else if (DIP(dp, di_size) > 0) 457 blks = howmany(DIP(dp, di_size), sblock.fs_bsize); 458 else 459 blks = 1; 460 inp = (struct inoinfo *) 461 Malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs2_daddr_t)); 462 if (inp == NULL) 463 errx(EEXIT, "cannot increase directory list"); 464 inpp = &inphead[inumber % dirhash]; 465 inp->i_nexthash = *inpp; 466 *inpp = inp; 467 inp->i_parent = inumber == UFS_ROOTINO ? UFS_ROOTINO : (ino_t)0; 468 inp->i_dotdot = (ino_t)0; 469 inp->i_number = inumber; 470 inp->i_isize = DIP(dp, di_size); 471 inp->i_numblks = blks; 472 for (i = 0; i < MIN(blks, UFS_NDADDR); i++) 473 inp->i_blks[i] = DIP(dp, di_db[i]); 474 if (blks > UFS_NDADDR) 475 for (i = 0; i < UFS_NIADDR; i++) 476 inp->i_blks[UFS_NDADDR + i] = DIP(dp, di_ib[i]); 477 if (inplast == listmax) { 478 listmax += 100; 479 inpsort = (struct inoinfo **)reallocarray((char *)inpsort, 480 listmax, sizeof(struct inoinfo *)); 481 if (inpsort == NULL) 482 errx(EEXIT, "cannot increase directory list"); 483 } 484 inpsort[inplast++] = inp; 485 } 486 487 /* 488 * Look up an inode cache structure. 489 */ 490 struct inoinfo * 491 getinoinfo(ino_t inumber) 492 { 493 struct inoinfo *inp; 494 495 for (inp = inphead[inumber % dirhash]; inp; inp = inp->i_nexthash) { 496 if (inp->i_number != inumber) 497 continue; 498 return (inp); 499 } 500 errx(EEXIT, "cannot find inode %ju", (uintmax_t)inumber); 501 return ((struct inoinfo *)0); 502 } 503 504 /* 505 * Clean up all the inode cache structure. 506 */ 507 void 508 inocleanup(void) 509 { 510 struct inoinfo **inpp; 511 512 if (inphead == NULL) 513 return; 514 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) 515 free((char *)(*inpp)); 516 free((char *)inphead); 517 free((char *)inpsort); 518 inphead = inpsort = NULL; 519 } 520 521 void 522 inodirty(union dinode *dp) 523 { 524 525 dirty(pbp); 526 } 527 528 void 529 clri(struct inodesc *idesc, const char *type, int flag) 530 { 531 union dinode *dp; 532 533 dp = ginode(idesc->id_number); 534 if (flag == 1) { 535 pwarn("%s %s", type, 536 (DIP(dp, di_mode) & IFMT) == IFDIR ? "DIR" : "FILE"); 537 prtinode(idesc->id_number, dp); 538 printf("\n"); 539 } 540 if (preen || reply("CLEAR") == 1) { 541 if (preen) 542 printf(" (CLEARED)\n"); 543 n_files--; 544 if (bkgrdflag == 0) { 545 (void)ckinode(dp, idesc); 546 inoinfo(idesc->id_number)->ino_state = USTATE; 547 clearinode(dp); 548 inodirty(dp); 549 } else { 550 cmd.value = idesc->id_number; 551 cmd.size = -DIP(dp, di_nlink); 552 if (debug) 553 printf("adjrefcnt ino %ld amt %lld\n", 554 (long)cmd.value, (long long)cmd.size); 555 if (sysctl(adjrefcnt, MIBSIZE, 0, 0, 556 &cmd, sizeof cmd) == -1) 557 rwerror("ADJUST INODE", cmd.value); 558 } 559 } 560 } 561 562 int 563 findname(struct inodesc *idesc) 564 { 565 struct direct *dirp = idesc->id_dirp; 566 567 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) { 568 idesc->id_entryno++; 569 return (KEEPON); 570 } 571 memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1); 572 return (STOP|FOUND); 573 } 574 575 int 576 findino(struct inodesc *idesc) 577 { 578 struct direct *dirp = idesc->id_dirp; 579 580 if (dirp->d_ino == 0) 581 return (KEEPON); 582 if (strcmp(dirp->d_name, idesc->id_name) == 0 && 583 dirp->d_ino >= UFS_ROOTINO && dirp->d_ino <= maxino) { 584 idesc->id_parent = dirp->d_ino; 585 return (STOP|FOUND); 586 } 587 return (KEEPON); 588 } 589 590 int 591 clearentry(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 dirp->d_ino = 0; 600 return (STOP|FOUND|ALTERED); 601 } 602 603 void 604 prtinode(ino_t ino, union dinode *dp) 605 { 606 char *p; 607 struct passwd *pw; 608 time_t t; 609 610 printf(" I=%lu ", (u_long)ino); 611 if (ino < UFS_ROOTINO || ino > maxino) 612 return; 613 printf(" OWNER="); 614 if ((pw = getpwuid((int)DIP(dp, di_uid))) != NULL) 615 printf("%s ", pw->pw_name); 616 else 617 printf("%u ", (unsigned)DIP(dp, di_uid)); 618 printf("MODE=%o\n", DIP(dp, di_mode)); 619 if (preen) 620 printf("%s: ", cdevname); 621 printf("SIZE=%ju ", (uintmax_t)DIP(dp, di_size)); 622 t = DIP(dp, di_mtime); 623 p = ctime(&t); 624 printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]); 625 } 626 627 void 628 blkerror(ino_t ino, const char *type, ufs2_daddr_t blk) 629 { 630 631 pfatal("%jd %s I=%ju", (intmax_t)blk, type, (uintmax_t)ino); 632 printf("\n"); 633 switch (inoinfo(ino)->ino_state) { 634 635 case FSTATE: 636 case FZLINK: 637 inoinfo(ino)->ino_state = FCLEAR; 638 return; 639 640 case DSTATE: 641 case DZLINK: 642 inoinfo(ino)->ino_state = DCLEAR; 643 return; 644 645 case FCLEAR: 646 case DCLEAR: 647 return; 648 649 default: 650 errx(EEXIT, "BAD STATE %d TO BLKERR", inoinfo(ino)->ino_state); 651 /* NOTREACHED */ 652 } 653 } 654 655 /* 656 * allocate an unused inode 657 */ 658 ino_t 659 allocino(ino_t request, int type) 660 { 661 ino_t ino; 662 union dinode *dp; 663 struct bufarea *cgbp; 664 struct cg *cgp; 665 int cg; 666 667 if (request == 0) 668 request = UFS_ROOTINO; 669 else if (inoinfo(request)->ino_state != USTATE) 670 return (0); 671 for (ino = request; ino < maxino; ino++) 672 if (inoinfo(ino)->ino_state == USTATE) 673 break; 674 if (ino == maxino) 675 return (0); 676 cg = ino_to_cg(&sblock, ino); 677 cgbp = cglookup(cg); 678 cgp = cgbp->b_un.b_cg; 679 if (!check_cgmagic(cg, cgbp)) 680 return (0); 681 setbit(cg_inosused(cgp), ino % sblock.fs_ipg); 682 cgp->cg_cs.cs_nifree--; 683 switch (type & IFMT) { 684 case IFDIR: 685 inoinfo(ino)->ino_state = DSTATE; 686 cgp->cg_cs.cs_ndir++; 687 break; 688 case IFREG: 689 case IFLNK: 690 inoinfo(ino)->ino_state = FSTATE; 691 break; 692 default: 693 return (0); 694 } 695 dirty(cgbp); 696 dp = ginode(ino); 697 DIP_SET(dp, di_db[0], allocblk((long)1)); 698 if (DIP(dp, di_db[0]) == 0) { 699 inoinfo(ino)->ino_state = USTATE; 700 return (0); 701 } 702 DIP_SET(dp, di_mode, type); 703 DIP_SET(dp, di_flags, 0); 704 DIP_SET(dp, di_atime, time(NULL)); 705 DIP_SET(dp, di_ctime, DIP(dp, di_atime)); 706 DIP_SET(dp, di_mtime, DIP(dp, di_ctime)); 707 DIP_SET(dp, di_mtimensec, 0); 708 DIP_SET(dp, di_ctimensec, 0); 709 DIP_SET(dp, di_atimensec, 0); 710 DIP_SET(dp, di_size, sblock.fs_fsize); 711 DIP_SET(dp, di_blocks, btodb(sblock.fs_fsize)); 712 n_files++; 713 inodirty(dp); 714 inoinfo(ino)->ino_type = IFTODT(type); 715 return (ino); 716 } 717 718 /* 719 * deallocate an inode 720 */ 721 void 722 freeino(ino_t ino) 723 { 724 struct inodesc idesc; 725 union dinode *dp; 726 727 memset(&idesc, 0, sizeof(struct inodesc)); 728 idesc.id_type = ADDR; 729 idesc.id_func = pass4check; 730 idesc.id_number = ino; 731 dp = ginode(ino); 732 (void)ckinode(dp, &idesc); 733 clearinode(dp); 734 inodirty(dp); 735 inoinfo(ino)->ino_state = USTATE; 736 n_files--; 737 } 738