sbin/fsck_ffs/inode.c

   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 struct bufarea *icachebp;       /* inode cache buffer */
  57
  58 static int iblock(struct inodesc *, off_t isize, int type);
  59 static ufs2_daddr_t indir_blkatoff(ufs2_daddr_t, ino_t, ufs_lbn_t, ufs_lbn_t,
  60     struct bufarea **);
  61
  62 int
  63 ckinode(union dinode *dp, struct inodesc *idesc)
  64 {
  65         off_t remsize, sizepb;
  66         int i, offset, ret;
  67         struct inode ip;
  68         union dinode dino;
  69         ufs2_daddr_t ndb;
  70         mode_t mode;
  71         char pathbuf[MAXPATHLEN + 1];
  72
  73         if (idesc->id_fix != IGNORE)
  74                 idesc->id_fix = DONTKNOW;
  75         idesc->id_dp = dp;
  76         idesc->id_lbn = -1;
  77         idesc->id_lballoc = -1;
  78         idesc->id_level = 0;
  79         idesc->id_entryno = 0;
  80         idesc->id_filesize = DIP(dp, di_size);
  81         mode = DIP(dp, di_mode) & IFMT;
  82         if (mode == IFBLK || mode == IFCHR || (mode == IFLNK &&
  83             DIP(dp, di_size) < (unsigned)sblock.fs_maxsymlinklen))
  84                 return (KEEPON);
  85         if (sblock.fs_magic == FS_UFS1_MAGIC)
  86                 dino.dp1 = dp->dp1;
  87         else
  88                 dino.dp2 = dp->dp2;
  89         ndb = howmany(DIP(&dino, di_size), sblock.fs_bsize);
  90         for (i = 0; i < UFS_NDADDR; i++) {
  91                 idesc->id_lbn++;
  92                 if (--ndb == 0 &&
  93                     (offset = blkoff(&sblock, DIP(&dino, di_size))) != 0)
  94                         idesc->id_numfrags =
  95                                 numfrags(&sblock, fragroundup(&sblock, offset));
  96                 else
  97                         idesc->id_numfrags = sblock.fs_frag;
  98                 if (DIP(&dino, di_db[i]) == 0) {
  99                         if (idesc->id_type == DATA && ndb >= 0) {
 100                                 /* An empty block in a directory XXX */
 101                                 getpathname(pathbuf, idesc->id_number,
 102                                                 idesc->id_number);
 103                                 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
 104                                         pathbuf);
 105                                 if (reply("ADJUST LENGTH") == 1) {
 106                                         ginode(idesc->id_number, &ip);
 107                                         DIP_SET(ip.i_dp, di_size,
 108                                             i * sblock.fs_bsize);
 109                                         printf(
 110                                             "YOU MUST RERUN FSCK AFTERWARDS\n");
 111                                         rerun = 1;
 112                                         inodirty(&ip);
 113                                         irelse(&ip);
 114                                 }
 115                         }
 116                         continue;
 117                 }
 118                 idesc->id_blkno = DIP(&dino, di_db[i]);
 119                 if (idesc->id_type != DATA)
 120                         ret = (*idesc->id_func)(idesc);
 121                 else
 122                         ret = dirscan(idesc);
 123                 if (ret & STOP)
 124                         return (ret);
 125         }
 126         idesc->id_numfrags = sblock.fs_frag;
 127         remsize = DIP(&dino, di_size) - sblock.fs_bsize * UFS_NDADDR;
 128         sizepb = sblock.fs_bsize;
 129         for (i = 0; i < UFS_NIADDR; i++) {
 130                 sizepb *= NINDIR(&sblock);
 131                 idesc->id_level = i + 1;
 132                 if (DIP(&dino, di_ib[i])) {
 133                         idesc->id_blkno = DIP(&dino, di_ib[i]);
 134                         ret = iblock(idesc, remsize, BT_LEVEL1 + i);
 135                         if (ret & STOP)
 136                                 return (ret);
 137                 } else if (remsize > 0) {
 138                         idesc->id_lbn += sizepb / sblock.fs_bsize;
 139                         if (idesc->id_type == DATA) {
 140                                 /* An empty block in a directory XXX */
 141                                 getpathname(pathbuf, idesc->id_number,
 142                                                 idesc->id_number);
 143                                 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
 144                                         pathbuf);
 145                                 if (reply("ADJUST LENGTH") == 1) {
 146                                         ginode(idesc->id_number, &ip);
 147                                         DIP_SET(ip.i_dp, di_size,
 148                                             DIP(ip.i_dp, di_size) - remsize);
 149                                         remsize = 0;
 150                                         printf(
 151                                             "YOU MUST RERUN FSCK AFTERWARDS\n");
 152                                         rerun = 1;
 153                                         inodirty(&ip);
 154                                         irelse(&ip);
 155                                         break;
 156                                 }
 157                         }
 158                 }
 159                 remsize -= sizepb;
 160         }
 161         return (KEEPON);
 162 }
 163
 164 static int
 165 iblock(struct inodesc *idesc, off_t isize, int type)
 166 {
 167         struct inode ip;
 168         struct bufarea *bp;
 169         int i, n, (*func)(struct inodesc *), nif;
 170         off_t sizepb;
 171         char buf[BUFSIZ];
 172         char pathbuf[MAXPATHLEN + 1];
 173
 174         if (idesc->id_type != DATA) {
 175                 func = idesc->id_func;
 176                 if (((n = (*func)(idesc)) & KEEPON) == 0)
 177                         return (n);
 178         } else
 179                 func = dirscan;
 180         bp = getdatablk(idesc->id_blkno, sblock.fs_bsize, type);
 181         if (bp->b_errs != 0) {
 182                 brelse(bp);
 183                 return (SKIP);
 184         }
 185         idesc->id_bp = bp;
 186         idesc->id_level--;
 187         for (sizepb = sblock.fs_bsize, i = 0; i < idesc->id_level; i++)
 188                 sizepb *= NINDIR(&sblock);
 189         if (howmany(isize, sizepb) > NINDIR(&sblock))
 190                 nif = NINDIR(&sblock);
 191         else
 192                 nif = howmany(isize, sizepb);
 193         if (idesc->id_func == pass1check && nif < NINDIR(&sblock)) {
 194                 for (i = nif; i < NINDIR(&sblock); i++) {
 195                         if (IBLK(bp, i) == 0)
 196                                 continue;
 197                         (void)sprintf(buf, "PARTIALLY TRUNCATED INODE I=%lu",
 198                             (u_long)idesc->id_number);
 199                         if (preen) {
 200                                 pfatal("%s", buf);
 201                         } else if (dofix(idesc, buf)) {
 202                                 IBLK_SET(bp, i, 0);
 203                                 dirty(bp);
 204                         }
 205                 }
 206                 flush(fswritefd, bp);
 207         }
 208         for (i = 0; i < nif; i++) {
 209                 if (IBLK(bp, i)) {
 210                         idesc->id_blkno = IBLK(bp, i);
 211                         bp->b_index = i;
 212                         if (idesc->id_level == 0) {
 213                                 idesc->id_lbn++;
 214                                 n = (*func)(idesc);
 215                         } else {
 216                                 n = iblock(idesc, isize, type - 1);
 217                                 idesc->id_level++;
 218                         }
 219                         if (n & STOP) {
 220                                 brelse(bp);
 221                                 return (n);
 222                         }
 223                 } else {
 224                         idesc->id_lbn += sizepb / sblock.fs_bsize;
 225                         if (idesc->id_type == DATA && isize > 0) {
 226                                 /* An empty block in a directory XXX */
 227                                 getpathname(pathbuf, idesc->id_number,
 228                                                 idesc->id_number);
 229                                 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
 230                                         pathbuf);
 231                                 if (reply("ADJUST LENGTH") == 1) {
 232                                         ginode(idesc->id_number, &ip);
 233                                         DIP_SET(ip.i_dp, di_size,
 234                                             DIP(ip.i_dp, di_size) - isize);
 235                                         isize = 0;
 236                                         printf(
 237                                             "YOU MUST RERUN FSCK AFTERWARDS\n");
 238                                         rerun = 1;
 239                                         inodirty(&ip);
 240                                         brelse(bp);
 241                                         return(STOP);
 242                                 }
 243                         }
 244                 }
 245                 isize -= sizepb;
 246         }
 247         brelse(bp);
 248         return (KEEPON);
 249 }
 250
 251 /*
 252  * Finds the disk block address at the specified lbn within the inode
 253  * specified by dp.  This follows the whole tree and honors di_size and
 254  * di_extsize so it is a true test of reachability.  The lbn may be
 255  * negative if an extattr or indirect block is requested.
 256  */
 257 ufs2_daddr_t
 258 ino_blkatoff(union dinode *dp, ino_t ino, ufs_lbn_t lbn, int *frags,
 259     struct bufarea **bpp)
 260 {
 261         ufs_lbn_t tmpval;
 262         ufs_lbn_t cur;
 263         ufs_lbn_t next;
 264         int i;
 265
 266         *frags = 0;
 267         if (bpp != NULL)
 268                 *bpp = NULL;
 269         /*
 270          * Handle extattr blocks first.
 271          */
 272         if (lbn < 0 && lbn >= -UFS_NXADDR) {
 273                 lbn = -1 - lbn;
 274                 if (lbn > lblkno(&sblock, dp->dp2.di_extsize - 1))
 275                         return (0);
 276                 *frags = numfrags(&sblock,
 277                     sblksize(&sblock, dp->dp2.di_extsize, lbn));
 278                 return (dp->dp2.di_extb[lbn]);
 279         }
 280         /*
 281          * Now direct and indirect.
 282          */
 283         if (DIP(dp, di_mode) == IFLNK &&
 284             DIP(dp, di_size) < sblock.fs_maxsymlinklen)
 285                 return (0);
 286         if (lbn >= 0 && lbn < UFS_NDADDR) {
 287                 *frags = numfrags(&sblock,
 288                     sblksize(&sblock, DIP(dp, di_size), lbn));
 289                 return (DIP(dp, di_db[lbn]));
 290         }
 291         *frags = sblock.fs_frag;
 292
 293         for (i = 0, tmpval = NINDIR(&sblock), cur = UFS_NDADDR; i < UFS_NIADDR;
 294             i++, tmpval *= NINDIR(&sblock), cur = next) {
 295                 next = cur + tmpval;
 296                 if (lbn == -cur - i)
 297                         return (DIP(dp, di_ib[i]));
 298                 /*
 299                  * Determine whether the lbn in question is within this tree.
 300                  */
 301                 if (lbn < 0 && -lbn >= next)
 302                         continue;
 303                 if (lbn > 0 && lbn >= next)
 304                         continue;
 305                 if (DIP(dp, di_ib[i]) == 0)
 306                         return (0);
 307                 return (indir_blkatoff(DIP(dp, di_ib[i]), ino, -cur - i, lbn,
 308                     bpp));
 309         }
 310         pfatal("lbn %jd not in ino %ju\n", lbn, (uintmax_t)ino);
 311         return (0);
 312 }
 313
 314 /*
 315  * Fetch an indirect block to find the block at a given lbn.  The lbn
 316  * may be negative to fetch a specific indirect block pointer or positive
 317  * to fetch a specific block.
 318  */
 319 static ufs2_daddr_t
 320 indir_blkatoff(ufs2_daddr_t blk, ino_t ino, ufs_lbn_t cur, ufs_lbn_t lbn,
 321     struct bufarea **bpp)
 322 {
 323         struct bufarea *bp;
 324         ufs_lbn_t lbnadd;
 325         ufs_lbn_t base;
 326         int i, level;
 327
 328         level = lbn_level(cur);
 329         if (level == -1)
 330                 pfatal("Invalid indir lbn %jd in ino %ju\n",
 331                     lbn, (uintmax_t)ino);
 332         if (level == 0 && lbn < 0)
 333                 pfatal("Invalid lbn %jd in ino %ju\n",
 334                     lbn, (uintmax_t)ino);
 335         lbnadd = 1;
 336         base = -(cur + level);
 337         for (i = level; i > 0; i--)
 338                 lbnadd *= NINDIR(&sblock);
 339         if (lbn > 0)
 340                 i = (lbn - base) / lbnadd;
 341         else
 342                 i = (-lbn - base) / lbnadd;
 343         if (i < 0 || i >= NINDIR(&sblock)) {
 344                 pfatal("Invalid indirect index %d produced by lbn %jd "
 345                     "in ino %ju\n", i, lbn, (uintmax_t)ino);
 346                 return (0);
 347         }
 348         if (level == 0)
 349                 cur = base + (i * lbnadd);
 350         else
 351                 cur = -(base + (i * lbnadd)) - (level - 1);
 352         bp = getdatablk(blk, sblock.fs_bsize, BT_LEVEL1 + level);
 353         if (bp->b_errs != 0)
 354                 return (0);
 355         blk = IBLK(bp, i);
 356         bp->b_index = i;
 357         if (cur == lbn || blk == 0) {
 358                 if (bpp != NULL)
 359                         *bpp = bp;
 360                 else
 361                         brelse(bp);
 362                 return (blk);
 363         }
 364         brelse(bp);
 365         if (level == 0)
 366                 pfatal("Invalid lbn %jd at level 0 for ino %ju\n", lbn,
 367                     (uintmax_t)ino);
 368         return (indir_blkatoff(blk, ino, cur, lbn, bpp));
 369 }
 370
 371 /*
 372  * Check that a block in a legal block number.
 373  * Return 0 if in range, 1 if out of range.
 374  */
 375 int
 376 chkrange(ufs2_daddr_t blk, int cnt)
 377 {
 378         int c;
 379
 380         if (cnt <= 0 || blk <= 0 || blk > maxfsblock ||
 381             cnt - 1 > maxfsblock - blk)
 382                 return (1);
 383         if (cnt > sblock.fs_frag ||
 384             fragnum(&sblock, blk) + cnt > sblock.fs_frag) {
 385                 if (debug)
 386                         printf("bad size: blk %ld, offset %i, size %d\n",
 387                             (long)blk, (int)fragnum(&sblock, blk), cnt);
 388                 return (1);
 389         }
 390         c = dtog(&sblock, blk);
 391         if (blk < cgdmin(&sblock, c)) {
 392                 if ((blk + cnt) > cgsblock(&sblock, c)) {
 393                         if (debug) {
 394                                 printf("blk %ld < cgdmin %ld;",
 395                                     (long)blk, (long)cgdmin(&sblock, c));
 396                                 printf(" blk + cnt %ld > cgsbase %ld\n",
 397                                     (long)(blk + cnt),
 398                                     (long)cgsblock(&sblock, c));
 399                         }
 400                         return (1);
 401                 }
 402         } else {
 403                 if ((blk + cnt) > cgbase(&sblock, c+1)) {
 404                         if (debug)  {
 405                                 printf("blk %ld >= cgdmin %ld;",
 406                                     (long)blk, (long)cgdmin(&sblock, c));
 407                                 printf(" blk + cnt %ld > sblock.fs_fpg %ld\n",
 408                                     (long)(blk + cnt), (long)sblock.fs_fpg);
 409                         }
 410                         return (1);
 411                 }
 412         }
 413         return (0);
 414 }
 415
 416 /*
 417  * General purpose interface for reading inodes.
 418  *
 419  * firstinum and lastinum track contents of getnextino() cache (below).
 420  */
 421 static ino_t firstinum, lastinum;
 422 static struct bufarea inobuf;
 423
 424 void
 425 ginode(ino_t inumber, struct inode *ip)
 426 {
 427         ufs2_daddr_t iblk;
 428
 429         if (inumber < UFS_ROOTINO || inumber > maxino)
 430                 errx(EEXIT, "bad inode number %ju to ginode",
 431                     (uintmax_t)inumber);
 432         ip->i_number = inumber;
 433         if (inumber >= firstinum && inumber < lastinum) {
 434                 /* contents in getnextino() cache */
 435                 ip->i_bp = &inobuf;
 436                 inobuf.b_refcnt++;
 437                 inobuf.b_index = firstinum;
 438         } else if (icachebp != NULL &&
 439             inumber >= icachebp->b_index &&
 440             inumber < icachebp->b_index + INOPB(&sblock)) {
 441                 /* take an additional reference for the returned inode */
 442                 icachebp->b_refcnt++;
 443                 ip->i_bp = icachebp;
 444         } else {
 445                 iblk = ino_to_fsba(&sblock, inumber);
 446                 /* release our cache-hold reference on old icachebp */
 447                 if (icachebp != NULL)
 448                         brelse(icachebp);
 449                 icachebp = getdatablk(iblk, sblock.fs_bsize, BT_INODES);
 450                 if (icachebp->b_errs != 0) {
 451                         icachebp = NULL;
 452                         ip->i_bp = NULL;
 453                         ip->i_dp = &zino;
 454                         return;
 455                 }
 456                 /* take a cache-hold reference on new icachebp */
 457                 icachebp->b_refcnt++;
 458                 icachebp->b_index = rounddown(inumber, INOPB(&sblock));
 459                 ip->i_bp = icachebp;
 460         }
 461         if (sblock.fs_magic == FS_UFS1_MAGIC) {
 462                 ip->i_dp = (union dinode *)
 463                     &ip->i_bp->b_un.b_dinode1[inumber - ip->i_bp->b_index];
 464                 return;
 465         }
 466         ip->i_dp = (union dinode *)
 467             &ip->i_bp->b_un.b_dinode2[inumber - ip->i_bp->b_index];
 468         if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)ip->i_dp)) {
 469                 pwarn("INODE CHECK-HASH FAILED");
 470                 prtinode(ip);
 471                 if (preen || reply("FIX") != 0) {
 472                         if (preen)
 473                                 printf(" (FIXED)\n");
 474                         ffs_update_dinode_ckhash(&sblock,
 475                             (struct ufs2_dinode *)ip->i_dp);
 476                         inodirty(ip);
 477                 }
 478         }
 479 }
 480
 481 /*
 482  * Release a held inode.
 483  */
 484 void
 485 irelse(struct inode *ip)
 486 {
 487
 488         /* Check for failed inode read */
 489         if (ip->i_bp == NULL)
 490                 return;
 491         if (ip->i_bp->b_refcnt <= 0)
 492                 pfatal("irelse: releasing unreferenced ino %ju\n",
 493                     (uintmax_t) ip->i_number);
 494         brelse(ip->i_bp);
 495 }
 496
 497 /*
 498  * Special purpose version of ginode used to optimize first pass
 499  * over all the inodes in numerical order.
 500  */
 501 static ino_t nextinum, lastvalidinum;
 502 static long readcount, readpercg, fullcnt, inobufsize, partialcnt, partialsize;
 503
 504 union dinode *
 505 getnextinode(ino_t inumber, int rebuildcg)
 506 {
 507         int j;
 508         long size;
 509         mode_t mode;
 510         ufs2_daddr_t ndb, blk;
 511         union dinode *dp;
 512         struct inode ip;
 513         static caddr_t nextinop;
 514
 515         if (inumber != nextinum++ || inumber > lastvalidinum)
 516                 errx(EEXIT, "bad inode number %ju to nextinode",
 517                     (uintmax_t)inumber);
 518         if (inumber >= lastinum) {
 519                 readcount++;
 520                 firstinum = lastinum;
 521                 blk = ino_to_fsba(&sblock, lastinum);
 522                 if (readcount % readpercg == 0) {
 523                         size = partialsize;
 524                         lastinum += partialcnt;
 525                 } else {
 526                         size = inobufsize;
 527                         lastinum += fullcnt;
 528                 }
 529                 /*
 530                  * Flush old contents in case they have been updated.
 531                  * If getblk encounters an error, it will already have zeroed
 532                  * out the buffer, so we do not need to do so here.
 533                  */
 534                 if (inobuf.b_refcnt != 0)
 535                         pfatal("Non-zero getnextinode() ref count %d\n",
 536                             inobuf.b_refcnt);
 537                 flush(fswritefd, &inobuf);
 538                 getblk(&inobuf, blk, size);
 539                 nextinop = inobuf.b_un.b_buf;
 540         }
 541         dp = (union dinode *)nextinop;
 542         if (sblock.fs_magic == FS_UFS1_MAGIC)
 543                 nextinop += sizeof(struct ufs1_dinode);
 544         else
 545                 nextinop += sizeof(struct ufs2_dinode);
 546         if ((ckhashadd & CK_INODE) != 0) {
 547                 ffs_update_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp);
 548                 dirty(&inobuf);
 549         }
 550         if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp) != 0) {
 551                 pwarn("INODE CHECK-HASH FAILED");
 552                 ip.i_bp = NULL;
 553                 ip.i_dp = dp;
 554                 ip.i_number = inumber;
 555                 prtinode(&ip);
 556                 if (preen || reply("FIX") != 0) {
 557                         if (preen)
 558                                 printf(" (FIXED)\n");
 559                         ffs_update_dinode_ckhash(&sblock,
 560                             (struct ufs2_dinode *)dp);
 561                         dirty(&inobuf);
 562                 }
 563         }
 564         if (rebuildcg && (char *)dp == inobuf.b_un.b_buf) {
 565                 /*
 566                  * Try to determine if we have reached the end of the
 567                  * allocated inodes.
 568                  */
 569                 mode = DIP(dp, di_mode) & IFMT;
 570                 if (mode == 0) {
 571                         if (memcmp(dp->dp2.di_db, zino.dp2.di_db,
 572                                 UFS_NDADDR * sizeof(ufs2_daddr_t)) ||
 573                               memcmp(dp->dp2.di_ib, zino.dp2.di_ib,
 574                                 UFS_NIADDR * sizeof(ufs2_daddr_t)) ||
 575                               dp->dp2.di_mode || dp->dp2.di_size)
 576                                 return (NULL);
 577                         return (dp);
 578                 }
 579                 if (!ftypeok(dp))
 580                         return (NULL);
 581                 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize);
 582                 if (ndb < 0)
 583                         return (NULL);
 584                 if (mode == IFBLK || mode == IFCHR)
 585                         ndb++;
 586                 if (mode == IFLNK) {
 587                         /*
 588                          * Fake ndb value so direct/indirect block checks below
 589                          * will detect any garbage after symlink string.
 590                          */
 591                         if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) {
 592                                 ndb = howmany(DIP(dp, di_size),
 593                                     sizeof(ufs2_daddr_t));
 594                                 if (ndb > UFS_NDADDR) {
 595                                         j = ndb - UFS_NDADDR;
 596                                         for (ndb = 1; j > 1; j--)
 597                                                 ndb *= NINDIR(&sblock);
 598                                         ndb += UFS_NDADDR;
 599                                 }
 600                         }
 601                 }
 602                 for (j = ndb; ndb < UFS_NDADDR && j < UFS_NDADDR; j++)
 603                         if (DIP(dp, di_db[j]) != 0)
 604                                 return (NULL);
 605                 for (j = 0, ndb -= UFS_NDADDR; ndb > 0; j++)
 606                         ndb /= NINDIR(&sblock);
 607                 for (; j < UFS_NIADDR; j++)
 608                         if (DIP(dp, di_ib[j]) != 0)
 609                                 return (NULL);
 610         }
 611         return (dp);
 612 }
 613
 614 void
 615 setinodebuf(int cg, ino_t inosused)
 616 {
 617         ino_t inum;
 618
 619         inum = cg * sblock.fs_ipg;
 620         lastvalidinum = inum + inosused - 1;
 621         nextinum = inum;
 622         lastinum = inum;
 623         readcount = 0;
 624         /* Flush old contents in case they have been updated */
 625         flush(fswritefd, &inobuf);
 626         inobuf.b_bno = 0;
 627         if (inobuf.b_un.b_buf == NULL) {
 628                 inobufsize = blkroundup(&sblock,
 629                     MAX(INOBUFSIZE, sblock.fs_bsize));
 630                 initbarea(&inobuf, BT_INODES);
 631                 if ((inobuf.b_un.b_buf = Malloc((unsigned)inobufsize)) == NULL)
 632                         errx(EEXIT, "cannot allocate space for inode buffer");
 633         }
 634         fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ?
 635             sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode));
 636         readpercg = inosused / fullcnt;
 637         partialcnt = inosused % fullcnt;
 638         partialsize = fragroundup(&sblock,
 639             partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ?
 640             sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)));
 641         if (partialcnt != 0) {
 642                 readpercg++;
 643         } else {
 644                 partialcnt = fullcnt;
 645                 partialsize = inobufsize;
 646         }
 647 }
 648
 649 int
 650 freeblock(struct inodesc *idesc)
 651 {
 652         struct dups *dlp;
 653         ufs2_daddr_t blkno;
 654         long nfrags, res;
 655
 656         res = KEEPON;
 657         blkno = idesc->id_blkno;
 658         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
 659                 if (chkrange(blkno, 1)) {
 660                         res = SKIP;
 661                 } else if (testbmap(blkno)) {
 662                         for (dlp = duplist; dlp; dlp = dlp->next) {
 663                                 if (dlp->dup != blkno)
 664                                         continue;
 665                                 dlp->dup = duplist->dup;
 666                                 dlp = duplist;
 667                                 duplist = duplist->next;
 668                                 free((char *)dlp);
 669                                 break;
 670                         }
 671                         if (dlp == NULL) {
 672                                 clrbmap(blkno);
 673                                 n_blks--;
 674                         }
 675                 }
 676         }
 677         return (res);
 678 }
 679
 680 void
 681 freeinodebuf(void)
 682 {
 683
 684         /*
 685          * Flush old contents in case they have been updated.
 686          */
 687         flush(fswritefd, &inobuf);
 688         if (inobuf.b_un.b_buf != NULL)
 689                 free((char *)inobuf.b_un.b_buf);
 690         inobuf.b_un.b_buf = NULL;
 691         firstinum = lastinum = 0;
 692 }
 693
 694 /*
 695  * Routines to maintain information about directory inodes.
 696  * This is built during the first pass and used during the
 697  * second and third passes.
 698  *
 699  * Enter inodes into the cache.
 700  */
 701 struct inoinfo *
 702 cacheino(union dinode *dp, ino_t inumber)
 703 {
 704         struct inoinfo *inp, **inpp;
 705         int i, blks;
 706
 707         if (getinoinfo(inumber) != NULL)
 708                 pfatal("cacheino: duplicate entry for ino %jd\n",
 709                     (intmax_t)inumber);
 710         if (howmany(DIP(dp, di_size), sblock.fs_bsize) > UFS_NDADDR)
 711                 blks = UFS_NDADDR + UFS_NIADDR;
 712         else if (DIP(dp, di_size) > 0)
 713                 blks = howmany(DIP(dp, di_size), sblock.fs_bsize);
 714         else
 715                 blks = 1;
 716         inp = (struct inoinfo *)
 717                 Malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs2_daddr_t));
 718         if (inp == NULL)
 719                 errx(EEXIT, "cannot increase directory list");
 720         inpp = &inphead[inumber % dirhash];
 721         inp->i_nexthash = *inpp;
 722         *inpp = inp;
 723         inp->i_parent = inumber == UFS_ROOTINO ? UFS_ROOTINO : (ino_t)0;
 724         inp->i_dotdot = (ino_t)0;
 725         inp->i_number = inumber;
 726         inp->i_isize = DIP(dp, di_size);
 727         inp->i_numblks = blks;
 728         for (i = 0; i < MIN(blks, UFS_NDADDR); i++)
 729                 inp->i_blks[i] = DIP(dp, di_db[i]);
 730         if (blks > UFS_NDADDR)
 731                 for (i = 0; i < UFS_NIADDR; i++)
 732                         inp->i_blks[UFS_NDADDR + i] = DIP(dp, di_ib[i]);
 733         if (inplast == listmax) {
 734                 listmax += 100;
 735                 inpsort = (struct inoinfo **)reallocarray((char *)inpsort,
 736                     listmax, sizeof(struct inoinfo *));
 737                 if (inpsort == NULL)
 738                         errx(EEXIT, "cannot increase directory list");
 739         }
 740         inpsort[inplast++] = inp;
 741         return (inp);
 742 }
 743
 744 /*
 745  * Look up an inode cache structure.
 746  */
 747 struct inoinfo *
 748 getinoinfo(ino_t inumber)
 749 {
 750         struct inoinfo *inp;
 751
 752         for (inp = inphead[inumber % dirhash]; inp; inp = inp->i_nexthash) {
 753                 if (inp->i_number != inumber)
 754                         continue;
 755                 return (inp);
 756         }
 757         return ((struct inoinfo *)0);
 758 }
 759
 760 /*
 761  * Clean up all the inode cache structure.
 762  */
 763 void
 764 inocleanup(void)
 765 {
 766         struct inoinfo **inpp;
 767
 768         if (inphead == NULL)
 769                 return;
 770         for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--)
 771                 free((char *)(*inpp));
 772         free((char *)inphead);
 773         free((char *)inpsort);
 774         inphead = inpsort = NULL;
 775 }
 776
 777 void
 778 inodirty(struct inode *ip)
 779 {
 780
 781         if (sblock.fs_magic == FS_UFS2_MAGIC)
 782                 ffs_update_dinode_ckhash(&sblock,
 783                     (struct ufs2_dinode *)ip->i_dp);
 784         dirty(ip->i_bp);
 785 }
 786
 787 void
 788 clri(struct inodesc *idesc, const char *type, int flag)
 789 {
 790         union dinode *dp;
 791         struct inode ip;
 792
 793         ginode(idesc->id_number, &ip);
 794         dp = ip.i_dp;
 795         if (flag == 1) {
 796                 pwarn("%s %s", type,
 797                     (DIP(dp, di_mode) & IFMT) == IFDIR ? "DIR" : "FILE");
 798                 prtinode(&ip);
 799                 printf("\n");
 800         }
 801         if (preen || reply("CLEAR") == 1) {
 802                 if (preen)
 803                         printf(" (CLEARED)\n");
 804                 n_files--;
 805                 if (bkgrdflag == 0) {
 806                         (void)ckinode(dp, idesc);
 807                         inoinfo(idesc->id_number)->ino_state = USTATE;
 808                         clearinode(dp);
 809                         inodirty(&ip);
 810                 } else {
 811                         cmd.value = idesc->id_number;
 812                         cmd.size = -DIP(dp, di_nlink);
 813                         if (debug)
 814                                 printf("adjrefcnt ino %ld amt %lld\n",
 815                                     (long)cmd.value, (long long)cmd.size);
 816                         if (sysctl(adjrefcnt, MIBSIZE, 0, 0,
 817                             &cmd, sizeof cmd) == -1)
 818                                 rwerror("ADJUST INODE", cmd.value);
 819                 }
 820         }
 821         irelse(&ip);
 822 }
 823
 824 int
 825 findname(struct inodesc *idesc)
 826 {
 827         struct direct *dirp = idesc->id_dirp;
 828
 829         if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
 830                 idesc->id_entryno++;
 831                 return (KEEPON);
 832         }
 833         memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1);
 834         return (STOP|FOUND);
 835 }
 836
 837 int
 838 findino(struct inodesc *idesc)
 839 {
 840         struct direct *dirp = idesc->id_dirp;
 841
 842         if (dirp->d_ino == 0)
 843                 return (KEEPON);
 844         if (strcmp(dirp->d_name, idesc->id_name) == 0 &&
 845             dirp->d_ino >= UFS_ROOTINO && dirp->d_ino <= maxino) {
 846                 idesc->id_parent = dirp->d_ino;
 847                 return (STOP|FOUND);
 848         }
 849         return (KEEPON);
 850 }
 851
 852 int
 853 clearentry(struct inodesc *idesc)
 854 {
 855         struct direct *dirp = idesc->id_dirp;
 856
 857         if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
 858                 idesc->id_entryno++;
 859                 return (KEEPON);
 860         }
 861         dirp->d_ino = 0;
 862         return (STOP|FOUND|ALTERED);
 863 }
 864
 865 void
 866 prtinode(struct inode *ip)
 867 {
 868         char *p;
 869         union dinode *dp;
 870         struct passwd *pw;
 871         time_t t;
 872
 873         dp = ip->i_dp;
 874         printf(" I=%lu ", (u_long)ip->i_number);
 875         if (ip->i_number < UFS_ROOTINO || ip->i_number > maxino)
 876                 return;
 877         printf(" OWNER=");
 878         if ((pw = getpwuid((int)DIP(dp, di_uid))) != NULL)
 879                 printf("%s ", pw->pw_name);
 880         else
 881                 printf("%u ", (unsigned)DIP(dp, di_uid));
 882         printf("MODE=%o\n", DIP(dp, di_mode));
 883         if (preen)
 884                 printf("%s: ", cdevname);
 885         printf("SIZE=%ju ", (uintmax_t)DIP(dp, di_size));
 886         t = DIP(dp, di_mtime);
 887         p = ctime(&t);
 888         printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]);
 889 }
 890
 891 void
 892 blkerror(ino_t ino, const char *type, ufs2_daddr_t blk)
 893 {
 894
 895         pfatal("%jd %s I=%ju", (intmax_t)blk, type, (uintmax_t)ino);
 896         printf("\n");
 897         switch (inoinfo(ino)->ino_state) {
 898
 899         case FSTATE:
 900         case FZLINK:
 901                 inoinfo(ino)->ino_state = FCLEAR;
 902                 return;
 903
 904         case DSTATE:
 905         case DZLINK:
 906                 inoinfo(ino)->ino_state = DCLEAR;
 907                 return;
 908
 909         case FCLEAR:
 910         case DCLEAR:
 911                 return;
 912
 913         default:
 914                 errx(EEXIT, "BAD STATE %d TO BLKERR", inoinfo(ino)->ino_state);
 915                 /* NOTREACHED */
 916         }
 917 }
 918
 919 /*
 920  * allocate an unused inode
 921  */
 922 ino_t
 923 allocino(ino_t request, int type)
 924 {
 925         ino_t ino;
 926         struct inode ip;
 927         union dinode *dp;
 928         struct bufarea *cgbp;
 929         struct cg *cgp;
 930         int cg, anyino;
 931
 932         anyino = 0;
 933         if (request == 0) {
 934                 request = UFS_ROOTINO;
 935                 anyino = 1;
 936         } else if (inoinfo(request)->ino_state != USTATE)
 937                 return (0);
 938 retry:
 939         for (ino = request; ino < maxino; ino++)
 940                 if (inoinfo(ino)->ino_state == USTATE)
 941                         break;
 942         if (ino >= maxino)
 943                 return (0);
 944         cg = ino_to_cg(&sblock, ino);
 945         cgbp = cglookup(cg);
 946         cgp = cgbp->b_un.b_cg;
 947         if (!check_cgmagic(cg, cgbp, 0)) {
 948                 if (anyino == 0)
 949                         return (0);
 950                 request = (cg + 1) * sblock.fs_ipg;
 951                 goto retry;
 952         }
 953         setbit(cg_inosused(cgp), ino % sblock.fs_ipg);
 954         cgp->cg_cs.cs_nifree--;
 955         switch (type & IFMT) {
 956         case IFDIR:
 957                 inoinfo(ino)->ino_state = DSTATE;
 958                 cgp->cg_cs.cs_ndir++;
 959                 break;
 960         case IFREG:
 961         case IFLNK:
 962                 inoinfo(ino)->ino_state = FSTATE;
 963                 break;
 964         default:
 965                 return (0);
 966         }
 967         cgdirty(cgbp);
 968         ginode(ino, &ip);
 969         dp = ip.i_dp;
 970         DIP_SET(dp, di_db[0], allocblk((long)1));
 971         if (DIP(dp, di_db[0]) == 0) {
 972                 inoinfo(ino)->ino_state = USTATE;
 973                 irelse(&ip);
 974                 return (0);
 975         }
 976         DIP_SET(dp, di_mode, type);
 977         DIP_SET(dp, di_flags, 0);
 978         DIP_SET(dp, di_atime, time(NULL));
 979         DIP_SET(dp, di_ctime, DIP(dp, di_atime));
 980         DIP_SET(dp, di_mtime, DIP(dp, di_ctime));
 981         DIP_SET(dp, di_mtimensec, 0);
 982         DIP_SET(dp, di_ctimensec, 0);
 983         DIP_SET(dp, di_atimensec, 0);
 984         DIP_SET(dp, di_size, sblock.fs_fsize);
 985         DIP_SET(dp, di_blocks, btodb(sblock.fs_fsize));
 986         n_files++;
 987         inodirty(&ip);
 988         irelse(&ip);
 989         inoinfo(ino)->ino_type = IFTODT(type);
 990         return (ino);
 991 }
 992
 993 /*
 994  * deallocate an inode
 995  */
 996 void
 997 freeino(ino_t ino)
 998 {
 999         struct inodesc idesc;
1000         union dinode *dp;
1001         struct inode ip;
1002
1003         memset(&idesc, 0, sizeof(struct inodesc));
1004         idesc.id_type = inoinfo(ino)->ino_idtype;
1005         idesc.id_func = freeblock;
1006         idesc.id_number = ino;
1007         ginode(ino, &ip);
1008         dp = ip.i_dp;
1009         (void)ckinode(dp, &idesc);
1010         clearinode(dp);
1011         inodirty(&ip);
1012         irelse(&ip);
1013         inoinfo(ino)->ino_state = USTATE;
1014         n_files--;
1015 }