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