sbin/fsck_ext2fs/pass1.c

   1 /*      $NetBSD: pass1.c,v 1.24 2013/06/19 17:51:25 dholland 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  *
  44  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  45  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  46  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  47  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  48  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  49  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  50  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  51  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  52  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  53  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  54  */
  55
  56 #include <sys/cdefs.h>
  57 #ifndef lint
  58 #if 0
  59 static char sccsid[] = "@(#)pass1.c     8.1 (Berkeley) 6/5/93";
  60 #else
  61 __RCSID("$NetBSD: pass1.c,v 1.24 2013/06/19 17:51:25 dholland Exp $");
  62 #endif
  63 #endif /* not lint */
  64
  65 #include <sys/param.h>
  66 #include <sys/time.h>
  67 #include <ufs/ext2fs/ext2fs_dinode.h>
  68 #include <ufs/ext2fs/ext2fs_dir.h>
  69 #include <ufs/ext2fs/ext2fs.h>
  70
  71 #include <ufs/ufs/dinode.h> /* for IFMT & friends */
  72
  73 #include <stdio.h>
  74 #include <stdlib.h>
  75 #include <string.h>
  76 #include <time.h>
  77
  78 #include "fsck.h"
  79 #include "extern.h"
  80 #include "fsutil.h"
  81 #include "exitvalues.h"
  82
  83 static daddr_t badblk;
  84 static daddr_t dupblk;
  85 static void checkinode(ino_t, struct inodesc *);
  86
  87 void
  88 pass1(void)
  89 {
  90         ino_t inumber;
  91         int c, i;
  92         size_t j;
  93         daddr_t dbase;
  94         struct inodesc idesc;
  95
  96         /*
  97          * Set file system reserved blocks in used block map.
  98          */
  99         for (c = 0; c < sblock.e2fs_ncg; c++) {
 100                 dbase = c * sblock.e2fs.e2fs_bpg +
 101                     sblock.e2fs.e2fs_first_dblock;
 102                 /* Mark the blocks used for the inode table */
 103                 if (fs2h32(sblock.e2fs_gd[c].ext2bgd_i_tables) >= dbase) {
 104                         for (i = 0; i < sblock.e2fs_itpg; i++)
 105                                 setbmap(
 106                                     fs2h32(sblock.e2fs_gd[c].ext2bgd_i_tables)
 107                                     + i);
 108                 }
 109                 /* Mark the blocks used for the block bitmap */
 110                 if (fs2h32(sblock.e2fs_gd[c].ext2bgd_b_bitmap) >= dbase)
 111                         setbmap(fs2h32(sblock.e2fs_gd[c].ext2bgd_b_bitmap));
 112                 /* Mark the blocks used for the inode bitmap */
 113                 if (fs2h32(sblock.e2fs_gd[c].ext2bgd_i_bitmap) >= dbase)
 114                         setbmap(fs2h32(sblock.e2fs_gd[c].ext2bgd_i_bitmap));
 115
 116                 if (sblock.e2fs.e2fs_rev == E2FS_REV0 ||
 117                     (sblock.e2fs.e2fs_features_rocompat &
 118                         EXT2F_ROCOMPAT_SPARSESUPER) == 0 ||
 119                     cg_has_sb(c)) {
 120                         /* Mark copuy of SB and descriptors */
 121                         setbmap(dbase);
 122                         for (i = 1; i <= sblock.e2fs_ngdb; i++)
 123                                 setbmap(dbase+i);
 124                 }
 125
 126
 127                 if (c == 0) {
 128                         for(i = 0; i < dbase; i++)
 129                                 setbmap(i);
 130                 }
 131         }
 132
 133         /*
 134          * Find all allocated blocks.
 135          */
 136         memset(&idesc, 0, sizeof(struct inodesc));
 137         idesc.id_type = ADDR;
 138         idesc.id_func = pass1check;
 139         inumber = 1;
 140         n_files = n_blks = 0;
 141         resetinodebuf();
 142         for (c = 0; c < sblock.e2fs_ncg; c++) {
 143                 for (j = 0;
 144                         j < sblock.e2fs.e2fs_ipg && inumber <= sblock.e2fs.e2fs_icount;
 145                         j++, inumber++) {
 146                         if (inumber < EXT2_ROOTINO) /* XXX */
 147                                 continue;
 148                         checkinode(inumber, &idesc);
 149                 }
 150         }
 151         freeinodebuf();
 152 }
 153
 154 static void
 155 checkinode(ino_t inumber, struct inodesc *idesc)
 156 {
 157         struct ext2fs_dinode *dp;
 158         struct zlncnt *zlnp;
 159         int ndb, j;
 160         mode_t mode;
 161
 162         dp = getnextinode(inumber);
 163         if (inumber < EXT2_FIRSTINO &&
 164             inumber != EXT2_ROOTINO &&
 165             !(inumber == EXT2_RESIZEINO &&
 166               (sblock.e2fs.e2fs_features_compat & EXT2F_COMPAT_RESIZE) != 0))
 167                 return;
 168
 169         mode = fs2h16(dp->e2di_mode) & IFMT;
 170         if (mode == 0 || (dp->e2di_dtime != 0 && dp->e2di_nlink == 0)) {
 171                 if (mode == 0 && (
 172                     memcmp(dp->e2di_blocks, zino.e2di_blocks,
 173                     (EXT2FS_NDADDR + EXT2FS_NIADDR) * sizeof(u_int32_t)) ||
 174                     dp->e2di_mode || inosize(dp))) {
 175                         pfatal("PARTIALLY ALLOCATED INODE I=%llu",
 176                             (unsigned long long)inumber);
 177                         if (reply("CLEAR") == 1) {
 178                                 dp = ginode(inumber);
 179                                 clearinode(dp);
 180                                 inodirty();
 181                         }
 182                 }
 183 #ifdef notyet /* it seems that dtime == 0 is valid for a unallocated inode */
 184                 if (dp->e2di_dtime == 0) {
 185                         pwarn("DELETED INODE I=%llu HAS A NULL DTIME",
 186                             (unsigned long long)inumber);
 187                         if (preen) {
 188                                 printf(" (CORRECTED)\n");
 189                         }
 190                         if (preen || reply("CORRECT")) {
 191                                 time_t t;
 192                                 time(&t);
 193                                 dp->e2di_dtime = h2fs32(t);
 194                                 dp = ginode(inumber);
 195                                 inodirty();
 196                         }
 197                 }
 198 #endif
 199                 statemap[inumber] = USTATE;
 200                 return;
 201         }
 202         lastino = inumber;
 203         if (dp->e2di_dtime != 0) {
 204                 pwarn("INODE I=%llu HAS DTIME=%s",
 205                     (unsigned long long)inumber,
 206                     print_mtime(fs2h32(dp->e2di_dtime)));
 207                 if (preen) {
 208                         printf(" (CORRECTED)\n");
 209                 }
 210                 if (preen || reply("CORRECT")) {
 211                         dp = ginode(inumber);
 212                         dp->e2di_dtime = 0;
 213                         inodirty();
 214                 }
 215         }
 216         if (inosize(dp) + sblock.e2fs_bsize - 1 < inosize(dp)) {
 217                 if (debug)
 218                         printf("bad size %llu:", (unsigned long long)inosize(dp));
 219                 goto unknown;
 220         }
 221         if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
 222                 dp = ginode(inumber);
 223                 dp->e2di_mode = h2fs16(IFREG|0600);
 224                 inossize(dp, sblock.e2fs_bsize);
 225                 inodirty();
 226         }
 227         ndb = howmany(inosize(dp), sblock.e2fs_bsize);
 228         if (ndb < 0) {
 229                 if (debug)
 230                         printf("bad size %llu ndb %d:",
 231                             (unsigned long long)inosize(dp), ndb);
 232                 goto unknown;
 233         }
 234         if (mode == IFBLK || mode == IFCHR)
 235                 ndb++;
 236         if (mode == IFLNK) {
 237                 /*
 238                  * Fake ndb value so direct/indirect block checks below
 239                  * will detect any garbage after symlink string.
 240                  */
 241                 if (inosize(dp) < EXT2_MAXSYMLINKLEN ||
 242                     (EXT2_MAXSYMLINKLEN == 0 && dp->e2di_blocks == 0)) {
 243                         ndb = howmany(inosize(dp), sizeof(u_int32_t));
 244                         if (ndb > EXT2FS_NDADDR) {
 245                                 j = ndb - EXT2FS_NDADDR;
 246                                 for (ndb = 1; j > 1; j--)
 247                                         ndb *= EXT2_NINDIR(&sblock);
 248                                 ndb += EXT2FS_NDADDR;
 249                         }
 250                 }
 251         }
 252         /* Linux puts things in blocks for FIFO, so skip this check */
 253         if (mode != IFIFO) {
 254                 for (j = ndb; j < EXT2FS_NDADDR; j++)
 255                         if (dp->e2di_blocks[j] != 0) {
 256                                 if (debug)
 257                                         printf("bad direct addr: %d\n",
 258                                             fs2h32(dp->e2di_blocks[j]));
 259                                 goto unknown;
 260                         }
 261                 for (j = 0, ndb -= EXT2FS_NDADDR; ndb > 0; j++)
 262                         ndb /= EXT2_NINDIR(&sblock);
 263                 for (; j < EXT2FS_NIADDR; j++) {
 264                         if (dp->e2di_blocks[j+EXT2FS_NDADDR] != 0) {
 265                                 if (debug)
 266                                         printf("bad indirect addr: %d\n",
 267                                             fs2h32(dp->e2di_blocks[j+EXT2FS_NDADDR]));
 268                                 goto unknown;
 269                         }
 270                 }
 271         }
 272         if (ftypeok(dp) == 0)
 273                 goto unknown;
 274         if (inumber >= EXT2_FIRSTINO || inumber == EXT2_ROOTINO) {
 275                 /* Don't count reserved inodes except root */
 276                 n_files++;
 277         }
 278         lncntp[inumber] = fs2h16(dp->e2di_nlink);
 279         if (dp->e2di_nlink == 0) {
 280                 zlnp = malloc(sizeof *zlnp);
 281                 if (zlnp == NULL) {
 282                         pfatal("LINK COUNT TABLE OVERFLOW");
 283                         if (reply("CONTINUE") == 0)
 284                                 exit(FSCK_EXIT_CHECK_FAILED);
 285                 } else {
 286                         zlnp->zlncnt = inumber;
 287                         zlnp->next = zlnhead;
 288                         zlnhead = zlnp;
 289                 }
 290         }
 291         if (mode == IFDIR) {
 292                 if (inosize(dp) == 0)
 293                         statemap[inumber] = DCLEAR;
 294                 else
 295                         statemap[inumber] = DSTATE;
 296                 cacheino(dp, inumber);
 297         } else {
 298                 statemap[inumber] = FSTATE;
 299         }
 300         typemap[inumber] = E2IFTODT(mode);
 301         badblk = dupblk = 0;
 302         idesc->id_number = inumber;
 303         (void)ckinode(dp, idesc);
 304         idesc->id_entryno *= btodb(sblock.e2fs_bsize);
 305         if (inonblock(dp) != (uint32_t)idesc->id_entryno) {
 306                 pwarn("INCORRECT BLOCK COUNT I=%llu (%llu should be %d)",
 307                     (unsigned long long)inumber,
 308                     (unsigned long long)inonblock(dp),
 309                     idesc->id_entryno);
 310                 if (preen)
 311                         printf(" (CORRECTED)\n");
 312                 else if (reply("CORRECT") == 0)
 313                         return;
 314                 dp = ginode(inumber);
 315                 inosnblock(dp, idesc->id_entryno);
 316                 inodirty();
 317         }
 318         return;
 319 unknown:
 320         pfatal("UNKNOWN FILE TYPE I=%llu", (unsigned long long)inumber);
 321         statemap[inumber] = FCLEAR;
 322         if (reply("CLEAR") == 1) {
 323                 statemap[inumber] = USTATE;
 324                 dp = ginode(inumber);
 325                 clearinode(dp);
 326                 inodirty();
 327         }
 328 }
 329
 330 int
 331 pass1check(struct inodesc *idesc)
 332 {
 333         int res = KEEPON;
 334         int anyout, nfrags;
 335         daddr_t blkno = idesc->id_blkno;
 336         struct dups *dlp;
 337         struct dups *new;
 338
 339         if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
 340                 blkerror(idesc->id_number, "BAD", blkno);
 341                 if (badblk++ >= MAXBAD) {
 342                         pwarn("EXCESSIVE BAD BLKS I=%llu",
 343                             (unsigned long long)idesc->id_number);
 344                         if (preen)
 345                                 printf(" (SKIPPING)\n");
 346                         else if (reply("CONTINUE") == 0)
 347                                 exit(FSCK_EXIT_CHECK_FAILED);
 348                         return (STOP);
 349                 }
 350         }
 351         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
 352                 if (anyout && chkrange(blkno, 1)) {
 353                         res = SKIP;
 354                 } else if (!testbmap(blkno)) {
 355                         n_blks++;
 356                         setbmap(blkno);
 357                 } else {
 358                         blkerror(idesc->id_number, "DUP", blkno);
 359                         if (dupblk++ >= MAXDUP) {
 360                                 pwarn("EXCESSIVE DUP BLKS I=%llu",
 361                                     (unsigned long long)idesc->id_number);
 362                                 if (preen)
 363                                         printf(" (SKIPPING)\n");
 364                                 else if (reply("CONTINUE") == 0)
 365                                         exit(FSCK_EXIT_CHECK_FAILED);
 366                                 return (STOP);
 367                         }
 368                         new = malloc(sizeof(struct dups));
 369                         if (new == NULL) {
 370                                 pfatal("DUP TABLE OVERFLOW.");
 371                                 if (reply("CONTINUE") == 0)
 372                                         exit(FSCK_EXIT_CHECK_FAILED);
 373                                 return (STOP);
 374                         }
 375                         new->dup = blkno;
 376                         if (muldup == 0) {
 377                                 duplist = muldup = new;
 378                                 new->next = 0;
 379                         } else {
 380                                 new->next = muldup->next;
 381                                 muldup->next = new;
 382                         }
 383                         for (dlp = duplist; dlp != muldup; dlp = dlp->next)
 384                                 if (dlp->dup == blkno)
 385                                         break;
 386                         if (dlp == muldup && dlp->dup != blkno)
 387                                 muldup = new;
 388                 }
 389                 /*
 390                  * count the number of blocks found in id_entryno
 391                  */
 392                 idesc->id_entryno++;
 393         }
 394         return (res);
 395 }