inode.c revision 1.17
1 /* $NetBSD: inode.c,v 1.17 2005/02/09 22:55:45 ws 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 /* 33 * Copyright (c) 1997 Manuel Bouyer. 34 * 35 * Redistribution and use in source and binary forms, with or without 36 * modification, are permitted provided that the following conditions 37 * are met: 38 * 1. Redistributions of source code must retain the above copyright 39 * notice, this list of conditions and the following disclaimer. 40 * 2. Redistributions in binary form must reproduce the above copyright 41 * notice, this list of conditions and the following disclaimer in the 42 * documentation and/or other materials provided with the distribution. 43 * 3. All advertising materials mentioning features or use of this software 44 * must display the following acknowledgement: 45 * This product includes software developed by Manuel Bouyer. 46 * 4. The name of the author may not be used to endorse or promote products 47 * derived from this software without specific prior written permission. 48 * 49 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 50 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 51 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 52 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 53 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 54 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 55 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 56 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 57 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 58 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 59 */ 60 61 #include <sys/cdefs.h> 62 #ifndef lint 63 #if 0 64 static char sccsid[] = "@(#)inode.c 8.5 (Berkeley) 2/8/95"; 65 #else 66 __RCSID("$NetBSD: inode.c,v 1.17 2005/02/09 22:55:45 ws Exp $"); 67 #endif 68 #endif /* not lint */ 69 70 #include <sys/param.h> 71 #include <sys/time.h> 72 #include <ufs/ext2fs/ext2fs_dinode.h> 73 #include <ufs/ext2fs/ext2fs_dir.h> 74 #include <ufs/ext2fs/ext2fs.h> 75 76 #include <ufs/ufs/dinode.h> /* for IFMT & friends */ 77 #ifndef SMALL 78 #include <pwd.h> 79 #endif 80 #include <stdio.h> 81 #include <stdlib.h> 82 #include <string.h> 83 #include <time.h> 84 85 #include "fsck.h" 86 #include "fsutil.h" 87 #include "extern.h" 88 89 /* 90 * CG is stored in fs byte order in memory, so we can't use ino_to_fsba 91 * here. 92 */ 93 94 #define fsck_ino_to_fsba(fs, x) \ 95 (fs2h32((fs)->e2fs_gd[ino_to_cg(fs, x)].ext2bgd_i_tables) + \ 96 (((x)-1) % (fs)->e2fs.e2fs_ipg)/(fs)->e2fs_ipb) 97 98 99 static ino_t startinum; 100 101 static int iblock(struct inodesc *, long, u_int64_t); 102 103 static int setlarge(void); 104 105 static int 106 setlarge(void) 107 { 108 if (sblock.e2fs.e2fs_rev < E2FS_REV1) { 109 pfatal("LARGE FILES UNSUPPORTED ON REVISION 0 FILESYSTEMS"); 110 return 0; 111 } 112 if (!(sblock.e2fs.e2fs_features_rocompat & EXT2F_ROCOMPAT_LARGEFILE)) { 113 if (preen) 114 pwarn("SETTING LARGE FILE INDICATOR\n"); 115 else if (!reply("SET LARGE FILE INDICATOR")) 116 return 0; 117 sblock.e2fs.e2fs_features_rocompat |= EXT2F_ROCOMPAT_LARGEFILE; 118 sbdirty(); 119 } 120 return 1; 121 } 122 123 u_int64_t 124 inosize(struct ext2fs_dinode *dp) 125 { 126 u_int64_t size = fs2h32(dp->e2di_size); 127 128 if ((fs2h16(dp->e2di_mode) & IFMT) == IFREG) 129 size |= (u_int64_t)fs2h32(dp->e2di_dacl) << 32; 130 if (size >= 0x80000000U) 131 (void)setlarge(); 132 return size; 133 } 134 135 void 136 inossize(struct ext2fs_dinode *dp, u_int64_t size) 137 { 138 if ((fs2h16(dp->e2di_mode) & IFMT) == IFREG) { 139 dp->e2di_dacl = h2fs32(size >> 32); 140 if (size >= 0x80000000U) 141 if (!setlarge()) 142 return; 143 } else if (size >= 0x80000000U) { 144 pfatal("TRYING TO SET FILESIZE TO %llu ON MODE %x FILE\n", 145 (unsigned long long)size, fs2h16(dp->e2di_mode) & IFMT); 146 return; 147 } 148 dp->e2di_size = h2fs32(size); 149 } 150 151 int 152 ckinode(struct ext2fs_dinode *dp, struct inodesc *idesc) 153 { 154 u_int32_t *ap; 155 long ret, n, ndb; 156 struct ext2fs_dinode dino; 157 u_int64_t remsize, sizepb; 158 mode_t mode; 159 char pathbuf[MAXPATHLEN + 1]; 160 161 if (idesc->id_fix != IGNORE) 162 idesc->id_fix = DONTKNOW; 163 idesc->id_entryno = 0; 164 idesc->id_filesize = inosize(dp); 165 mode = fs2h16(dp->e2di_mode) & IFMT; 166 if (mode == IFBLK || mode == IFCHR || mode == IFIFO || 167 (mode == IFLNK && (inosize(dp) < EXT2_MAXSYMLINKLEN))) 168 return (KEEPON); 169 dino = *dp; 170 ndb = howmany(inosize(&dino), sblock.e2fs_bsize); 171 for (ap = &dino.e2di_blocks[0]; ap < &dino.e2di_blocks[NDADDR]; 172 ap++,ndb--) { 173 idesc->id_numfrags = 1; 174 if (*ap == 0) { 175 if (idesc->id_type == DATA && ndb > 0) { 176 /* An empty block in a directory XXX */ 177 getpathname(pathbuf, sizeof(pathbuf), 178 idesc->id_number, idesc->id_number); 179 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS", 180 pathbuf); 181 if (reply("ADJUST LENGTH") == 1) { 182 dp = ginode(idesc->id_number); 183 inossize(dp, 184 (ap - &dino.e2di_blocks[0]) * 185 sblock.e2fs_bsize); 186 printf( 187 "YOU MUST RERUN FSCK AFTERWARDS\n"); 188 rerun = 1; 189 inodirty(); 190 } 191 } 192 continue; 193 } 194 idesc->id_blkno = fs2h32(*ap); 195 if (idesc->id_type == ADDR) 196 ret = (*idesc->id_func)(idesc); 197 else 198 ret = dirscan(idesc); 199 if (ret & STOP) 200 return (ret); 201 } 202 idesc->id_numfrags = 1; 203 remsize = inosize(&dino) - sblock.e2fs_bsize * NDADDR; 204 sizepb = sblock.e2fs_bsize; 205 for (ap = &dino.e2di_blocks[NDADDR], n = 1; n <= NIADDR; ap++, n++) { 206 if (*ap) { 207 idesc->id_blkno = fs2h32(*ap); 208 ret = iblock(idesc, n, remsize); 209 if (ret & STOP) 210 return (ret); 211 } else { 212 if (idesc->id_type == DATA && remsize > 0) { 213 /* An empty block in a directory XXX */ 214 getpathname(pathbuf, sizeof(pathbuf), 215 idesc->id_number, idesc->id_number); 216 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS", 217 pathbuf); 218 if (reply("ADJUST LENGTH") == 1) { 219 dp = ginode(idesc->id_number); 220 inossize(dp, inosize(dp) - remsize); 221 remsize = 0; 222 printf( 223 "YOU MUST RERUN FSCK AFTERWARDS\n"); 224 rerun = 1; 225 inodirty(); 226 break; 227 } 228 } 229 } 230 sizepb *= NINDIR(&sblock); 231 remsize -= sizepb; 232 } 233 return (KEEPON); 234 } 235 236 static int 237 iblock(struct inodesc *idesc, long ilevel, u_int64_t isize) 238 { 239 /* XXX ondisk32 */ 240 int32_t *ap; 241 int32_t *aplim; 242 struct bufarea *bp; 243 int i, n, (*func)(struct inodesc *), nif; 244 u_int64_t sizepb; 245 char buf[BUFSIZ]; 246 char pathbuf[MAXPATHLEN + 1]; 247 struct ext2fs_dinode *dp; 248 249 if (idesc->id_type == ADDR) { 250 func = idesc->id_func; 251 if (((n = (*func)(idesc)) & KEEPON) == 0) 252 return (n); 253 } else 254 func = dirscan; 255 if (chkrange(idesc->id_blkno, idesc->id_numfrags)) 256 return (SKIP); 257 bp = getdatablk(idesc->id_blkno, sblock.e2fs_bsize); 258 ilevel--; 259 for (sizepb = sblock.e2fs_bsize, i = 0; i < ilevel; i++) 260 sizepb *= NINDIR(&sblock); 261 if (isize > sizepb * NINDIR(&sblock)) 262 nif = NINDIR(&sblock); 263 else 264 nif = howmany(isize, sizepb); 265 if (idesc->id_func == pass1check && 266 nif < NINDIR(&sblock)) { 267 aplim = &bp->b_un.b_indir[NINDIR(&sblock)]; 268 for (ap = &bp->b_un.b_indir[nif]; ap < aplim; ap++) { 269 if (*ap == 0) 270 continue; 271 (void)snprintf(buf, sizeof(buf), 272 "PARTIALLY TRUNCATED INODE I=%u", idesc->id_number); 273 if (dofix(idesc, buf)) { 274 *ap = 0; 275 dirty(bp); 276 } 277 } 278 flush(fswritefd, bp); 279 } 280 aplim = &bp->b_un.b_indir[nif]; 281 for (ap = bp->b_un.b_indir; ap < aplim; ap++) { 282 if (*ap) { 283 idesc->id_blkno = fs2h32(*ap); 284 if (ilevel == 0) 285 n = (*func)(idesc); 286 else 287 n = iblock(idesc, ilevel, isize); 288 if (n & STOP) { 289 bp->b_flags &= ~B_INUSE; 290 return (n); 291 } 292 } else { 293 if (idesc->id_type == DATA && isize > 0) { 294 /* An empty block in a directory XXX */ 295 getpathname(pathbuf, sizeof(pathbuf), 296 idesc->id_number, idesc->id_number); 297 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS", 298 pathbuf); 299 if (reply("ADJUST LENGTH") == 1) { 300 dp = ginode(idesc->id_number); 301 inossize(dp, inosize(dp) - isize); 302 isize = 0; 303 printf( 304 "YOU MUST RERUN FSCK AFTERWARDS\n"); 305 rerun = 1; 306 inodirty(); 307 bp->b_flags &= ~B_INUSE; 308 return(STOP); 309 } 310 } 311 } 312 isize -= sizepb; 313 } 314 bp->b_flags &= ~B_INUSE; 315 return (KEEPON); 316 } 317 318 /* 319 * Check that a block in a legal block number. 320 * Return 0 if in range, 1 if out of range. 321 */ 322 int 323 chkrange(daddr_t blk, int cnt) 324 { 325 int c, overh; 326 327 if ((unsigned)(blk + cnt) > maxfsblock) 328 return (1); 329 c = dtog(&sblock, blk); 330 overh = cgoverhead(c); 331 if (blk < sblock.e2fs.e2fs_bpg * c + overh + 332 sblock.e2fs.e2fs_first_dblock) { 333 if ((blk + cnt) > sblock.e2fs.e2fs_bpg * c + overh + 334 sblock.e2fs.e2fs_first_dblock) { 335 if (debug) { 336 printf("blk %lld < cgdmin %d;", 337 (long long)blk, 338 sblock.e2fs.e2fs_bpg * c + overh + 339 sblock.e2fs.e2fs_first_dblock); 340 printf(" blk + cnt %lld > cgsbase %d\n", 341 (long long)(blk + cnt), 342 sblock.e2fs.e2fs_bpg * c + 343 overh + sblock.e2fs.e2fs_first_dblock); 344 } 345 return (1); 346 } 347 } else { 348 if ((blk + cnt) > sblock.e2fs.e2fs_bpg * (c + 1) + overh + 349 sblock.e2fs.e2fs_first_dblock) { 350 if (debug) { 351 printf("blk %lld >= cgdmin %d;", 352 (long long)blk, 353 sblock.e2fs.e2fs_bpg * c + overh + 354 sblock.e2fs.e2fs_first_dblock); 355 printf(" blk + cnt %lld > cgdmax %d\n", 356 (long long)(blk+cnt), 357 sblock.e2fs.e2fs_bpg * (c + 1) + 358 overh + sblock.e2fs.e2fs_first_dblock); 359 } 360 return (1); 361 } 362 } 363 return (0); 364 } 365 366 /* 367 * General purpose interface for reading inodes. 368 */ 369 struct ext2fs_dinode * 370 ginode(ino_t inumber) 371 { 372 daddr_t iblk; 373 374 if ((inumber < EXT2_FIRSTINO && inumber != EXT2_ROOTINO) 375 || inumber > maxino) 376 errexit("bad inode number %d to ginode\n", inumber); 377 if (startinum == 0 || 378 inumber < startinum || inumber >= startinum + sblock.e2fs_ipb) { 379 iblk = fsck_ino_to_fsba(&sblock, inumber); 380 if (pbp != 0) 381 pbp->b_flags &= ~B_INUSE; 382 pbp = getdatablk(iblk, sblock.e2fs_bsize); 383 startinum = ((inumber -1) / sblock.e2fs_ipb) * sblock.e2fs_ipb + 1; 384 } 385 return (&pbp->b_un.b_dinode[(inumber-1) % sblock.e2fs_ipb]); 386 } 387 388 /* 389 * Special purpose version of ginode used to optimize first pass 390 * over all the inodes in numerical order. 391 */ 392 ino_t nextino, lastinum; 393 long readcnt, readpercg, fullcnt, inobufsize, partialcnt, partialsize; 394 struct ext2fs_dinode *inodebuf; 395 396 struct ext2fs_dinode * 397 getnextinode(ino_t inumber) 398 { 399 long size; 400 daddr_t dblk; 401 static struct ext2fs_dinode *dp; 402 403 if (inumber != nextino++ || inumber > maxino) 404 errexit("bad inode number %d to nextinode\n", inumber); 405 if (inumber >= lastinum) { 406 readcnt++; 407 dblk = fsbtodb(&sblock, fsck_ino_to_fsba(&sblock, lastinum)); 408 if (readcnt % readpercg == 0) { 409 size = partialsize; 410 lastinum += partialcnt; 411 } else { 412 size = inobufsize; 413 lastinum += fullcnt; 414 } 415 (void)bread(fsreadfd, (char *)inodebuf, dblk, size); 416 dp = inodebuf; 417 } 418 return (dp++); 419 } 420 421 void 422 resetinodebuf(void) 423 { 424 425 startinum = 0; 426 nextino = 1; 427 lastinum = 1; 428 readcnt = 0; 429 inobufsize = blkroundup(&sblock, INOBUFSIZE); 430 fullcnt = inobufsize / sizeof(struct ext2fs_dinode); 431 readpercg = sblock.e2fs.e2fs_ipg / fullcnt; 432 partialcnt = sblock.e2fs.e2fs_ipg % fullcnt; 433 partialsize = partialcnt * sizeof(struct ext2fs_dinode); 434 if (partialcnt != 0) { 435 readpercg++; 436 } else { 437 partialcnt = fullcnt; 438 partialsize = inobufsize; 439 } 440 if (inodebuf == NULL && 441 (inodebuf = (struct ext2fs_dinode *)malloc((unsigned)inobufsize)) == 442 NULL) 443 errexit("Cannot allocate space for inode buffer\n"); 444 while (nextino < EXT2_ROOTINO) 445 (void)getnextinode(nextino); 446 } 447 448 void 449 freeinodebuf(void) 450 { 451 452 if (inodebuf != NULL) 453 free((char *)inodebuf); 454 inodebuf = NULL; 455 } 456 457 /* 458 * Routines to maintain information about directory inodes. 459 * This is built during the first pass and used during the 460 * second and third passes. 461 * 462 * Enter inodes into the cache. 463 */ 464 void 465 cacheino(struct ext2fs_dinode *dp, ino_t inumber) 466 { 467 struct inoinfo *inp; 468 struct inoinfo **inpp; 469 unsigned int blks; 470 471 blks = howmany(inosize(dp), sblock.e2fs_bsize); 472 if (blks > NDADDR) 473 blks = NDADDR + NIADDR; 474 /* XXX ondisk32 */ 475 inp = (struct inoinfo *) 476 malloc(sizeof(*inp) + (blks - 1) * sizeof(int32_t)); 477 if (inp == NULL) 478 return; 479 inpp = &inphead[inumber % numdirs]; 480 inp->i_nexthash = *inpp; 481 *inpp = inp; 482 inp->i_child = inp->i_sibling = inp->i_parentp = 0; 483 if (inumber == EXT2_ROOTINO) 484 inp->i_parent = EXT2_ROOTINO; 485 else 486 inp->i_parent = (ino_t)0; 487 inp->i_dotdot = (ino_t)0; 488 inp->i_number = inumber; 489 inp->i_isize = inosize(dp); 490 /* XXX ondisk32 */ 491 inp->i_numblks = blks * sizeof(int32_t); 492 memcpy(&inp->i_blks[0], &dp->e2di_blocks[0], (size_t)inp->i_numblks); 493 if (inplast == listmax) { 494 listmax += 100; 495 inpsort = (struct inoinfo **)realloc((char *)inpsort, 496 (unsigned)listmax * sizeof(struct inoinfo *)); 497 if (inpsort == NULL) 498 errexit("cannot increase directory list\n"); 499 } 500 inpsort[inplast++] = inp; 501 } 502 503 /* 504 * Look up an inode cache structure. 505 */ 506 struct inoinfo * 507 getinoinfo(ino_t inumber) 508 { 509 struct inoinfo *inp; 510 511 for (inp = inphead[inumber % numdirs]; inp; inp = inp->i_nexthash) { 512 if (inp->i_number != inumber) 513 continue; 514 return (inp); 515 } 516 errexit("cannot find inode %d\n", inumber); 517 return ((struct inoinfo *)0); 518 } 519 520 /* 521 * Clean up all the inode cache structure. 522 */ 523 void 524 inocleanup(void) 525 { 526 struct inoinfo **inpp; 527 528 if (inphead == NULL) 529 return; 530 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) 531 free((char *)(*inpp)); 532 free((char *)inphead); 533 free((char *)inpsort); 534 inphead = inpsort = NULL; 535 } 536 537 void 538 inodirty(void) 539 { 540 541 dirty(pbp); 542 } 543 544 void 545 clri(struct inodesc *idesc, char *type, int flag) 546 { 547 struct ext2fs_dinode *dp; 548 549 dp = ginode(idesc->id_number); 550 if (flag == 1) { 551 pwarn("%s %s", type, 552 (dp->e2di_mode & IFMT) == IFDIR ? "DIR" : "FILE"); 553 pinode(idesc->id_number); 554 } 555 if (preen || reply("CLEAR") == 1) { 556 if (preen) 557 printf(" (CLEARED)\n"); 558 n_files--; 559 (void)ckinode(dp, idesc); 560 clearinode(dp); 561 statemap[idesc->id_number] = USTATE; 562 inodirty(); 563 } 564 } 565 566 int 567 findname(struct inodesc *idesc) 568 { 569 struct ext2fs_direct *dirp = idesc->id_dirp; 570 u_int16_t namlen = dirp->e2d_namlen; 571 572 if (fs2h32(dirp->e2d_ino) != idesc->id_parent) 573 return (KEEPON); 574 memcpy(idesc->id_name, dirp->e2d_name, (size_t)namlen); 575 idesc->id_name[namlen] = '\0'; 576 return (STOP|FOUND); 577 } 578 579 int 580 findino(struct inodesc *idesc) 581 { 582 struct ext2fs_direct *dirp = idesc->id_dirp; 583 u_int32_t ino = fs2h32(dirp->e2d_ino); 584 585 if (ino == 0) 586 return (KEEPON); 587 if (strcmp(dirp->e2d_name, idesc->id_name) == 0 && 588 (ino == EXT2_ROOTINO || ino >= EXT2_FIRSTINO) 589 && ino <= maxino) { 590 idesc->id_parent = ino; 591 return (STOP|FOUND); 592 } 593 return (KEEPON); 594 } 595 596 void 597 pinode(ino_t ino) 598 { 599 struct ext2fs_dinode *dp; 600 char *p; 601 struct passwd *pw; 602 time_t t; 603 604 printf(" I=%u ", ino); 605 if ((ino < EXT2_FIRSTINO && ino != EXT2_ROOTINO) || ino > maxino) 606 return; 607 dp = ginode(ino); 608 printf(" OWNER="); 609 #ifndef SMALL 610 if ((pw = getpwuid((int)dp->e2di_uid)) != 0) 611 printf("%s ", pw->pw_name); 612 else 613 #endif 614 printf("%u ", (unsigned)fs2h16(dp->e2di_uid)); 615 printf("MODE=%o\n", fs2h16(dp->e2di_mode)); 616 if (preen) 617 printf("%s: ", cdevname()); 618 printf("SIZE=%llu ", (long long)inosize(dp)); 619 t = fs2h32(dp->e2di_mtime); 620 p = ctime(&t); 621 printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]); 622 } 623 624 void 625 blkerror(ino_t ino, char *type, daddr_t blk) 626 { 627 628 pfatal("%lld %s I=%u", (long long)blk, type, ino); 629 printf("\n"); 630 switch (statemap[ino]) { 631 632 case FSTATE: 633 statemap[ino] = FCLEAR; 634 return; 635 636 case DSTATE: 637 statemap[ino] = DCLEAR; 638 return; 639 640 case FCLEAR: 641 case DCLEAR: 642 return; 643 644 default: 645 errexit("BAD STATE %d TO BLKERR\n", statemap[ino]); 646 /* NOTREACHED */ 647 } 648 } 649 650 /* 651 * allocate an unused inode 652 */ 653 ino_t 654 allocino(ino_t request, int type) 655 { 656 ino_t ino; 657 struct ext2fs_dinode *dp; 658 time_t t; 659 660 if (request == 0) 661 request = EXT2_ROOTINO; 662 else if (statemap[request] != USTATE) 663 return (0); 664 for (ino = request; ino < maxino; ino++) { 665 if ((ino > EXT2_ROOTINO) && (ino < EXT2_FIRSTINO)) 666 continue; 667 if (statemap[ino] == USTATE) 668 break; 669 } 670 if (ino == maxino) 671 return (0); 672 switch (type & IFMT) { 673 case IFDIR: 674 statemap[ino] = DSTATE; 675 break; 676 case IFREG: 677 case IFLNK: 678 statemap[ino] = FSTATE; 679 break; 680 default: 681 return (0); 682 } 683 dp = ginode(ino); 684 dp->e2di_blocks[0] = h2fs32(allocblk()); 685 if (dp->e2di_blocks[0] == 0) { 686 statemap[ino] = USTATE; 687 return (0); 688 } 689 dp->e2di_mode = h2fs16(type); 690 (void)time(&t); 691 dp->e2di_atime = h2fs32(t); 692 dp->e2di_mtime = dp->e2di_ctime = dp->e2di_atime; 693 dp->e2di_dtime = 0; 694 inossize(dp, sblock.e2fs_bsize); 695 dp->e2di_nblock = h2fs32(btodb(sblock.e2fs_bsize)); 696 n_files++; 697 inodirty(); 698 typemap[ino] = E2IFTODT(type); 699 return (ino); 700 } 701 702 /* 703 * deallocate an inode 704 */ 705 void 706 freeino(ino_t ino) 707 { 708 struct inodesc idesc; 709 struct ext2fs_dinode *dp; 710 711 memset(&idesc, 0, sizeof(struct inodesc)); 712 idesc.id_type = ADDR; 713 idesc.id_func = pass4check; 714 idesc.id_number = ino; 715 dp = ginode(ino); 716 (void)ckinode(dp, &idesc); 717 clearinode(dp); 718 inodirty(); 719 statemap[ino] = USTATE; 720 n_files--; 721 } 722
Indexes created Sun Sep 21 14:09:52 GMT 2025