sbin/fsck/pass1.c

   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  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33
  34 #ifndef lint
  35 #if 0
  36 static const char sccsid[] = "@(#)pass1.c       8.6 (Berkeley) 4/28/95";
  37 #endif
  38 static const char rcsid[] =
  39   "$FreeBSD$";
  40 #endif /* not lint */
  41
  42 #include <sys/param.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 <string.h>
  50
  51 #include "fsck.h"
  52
  53 static ufs_daddr_t badblk;
  54 static ufs_daddr_t dupblk;
  55 static ino_t lastino;           /* last inode in use */
  56
  57 static void checkinode __P((ino_t inumber, struct inodesc *));
  58
  59 void
  60 pass1()
  61 {
  62         u_int8_t *cp;
  63         ino_t inumber;
  64         int c, i, cgd, inosused;
  65         struct inostat *info;
  66         struct inodesc idesc;
  67
  68         /*
  69          * Set file system reserved blocks in used block map.
  70          */
  71         for (c = 0; c < sblock.fs_ncg; c++) {
  72                 cgd = cgdmin(&sblock, c);
  73                 if (c == 0) {
  74                         i = cgbase(&sblock, c);
  75                         cgd += howmany(sblock.fs_cssize, sblock.fs_fsize);
  76                 } else
  77                         i = cgsblock(&sblock, c);
  78                 for (; i < cgd; i++)
  79                         setbmap(i);
  80         }
  81         /*
  82          * Find all allocated blocks.
  83          */
  84         memset(&idesc, 0, sizeof(struct inodesc));
  85         idesc.id_type = ADDR;
  86         idesc.id_func = pass1check;
  87         n_files = n_blks = 0;
  88         for (c = 0; c < sblock.fs_ncg; c++) {
  89                 inumber = c * sblock.fs_ipg;
  90                 setinodebuf(inumber);
  91                 inosused = sblock.fs_ipg;
  92                 /*
  93                  * If we are using soft updates, then we can trust the
  94                  * cylinder group inode allocation maps to tell us which
  95                  * inodes are allocated. We will scan the used inode map
  96                  * to find the inodes that are really in use, and then
  97                  * read only those inodes in from disk.
  98                  */
  99                 if (preen && usedsoftdep) {
 100                         getblk(&cgblk, cgtod(&sblock, c), sblock.fs_cgsize);
 101                         if (!cg_chkmagic(&cgrp))
 102                                 pfatal("CG %d: BAD MAGIC NUMBER\n", c);
 103                         cp = &cg_inosused(&cgrp)[(sblock.fs_ipg - 1) / NBBY];
 104                         for ( ; inosused > 0; inosused -= NBBY, cp--) {
 105                                 if (*cp == 0)
 106                                         continue;
 107                                 for (i = 1 << (NBBY - 1); i > 0; i >>= 1) {
 108                                         if (*cp & i)
 109                                                 break;
 110                                         inosused--;
 111                                 }
 112                                 break;
 113                         }
 114                         if (inosused < 0)
 115                                 inosused = 0;
 116                 }
 117                 /*
 118                  * Allocate inoinfo structures for the allocated inodes.
 119                  */
 120                 inostathead[c].il_numalloced = inosused;
 121                 if (inosused == 0) {
 122                         inostathead[c].il_stat = 0;
 123                         continue;
 124                 }
 125                 info = calloc((unsigned)inosused, sizeof(struct inostat));
 126                 if (info == NULL)
 127                         pfatal("cannot alloc %u bytes for inoinfo\n",
 128                             (unsigned)(sizeof(struct inostat) * inosused));
 129                 inostathead[c].il_stat = info;
 130                 /*
 131                  * Scan the allocated inodes.
 132                  */
 133                 for (i = 0; i < inosused; i++, inumber++) {
 134                         if (inumber < ROOTINO) {
 135                                 (void)getnextinode(inumber);
 136                                 continue;
 137                         }
 138                         checkinode(inumber, &idesc);
 139                 }
 140                 lastino += 1;
 141                 if (inosused < sblock.fs_ipg || inumber == lastino)
 142                         continue;
 143                 /*
 144                  * If we were not able to determine in advance which inodes
 145                  * were in use, then reduce the size of the inoinfo structure
 146                  * to the size necessary to describe the inodes that we
 147                  * really found.
 148                  */
 149                 inosused = lastino - (c * sblock.fs_ipg);
 150                 if (inosused < 0)
 151                         inosused = 0;
 152                 inostathead[c].il_numalloced = inosused;
 153                 if (inosused == 0) {
 154                         free(inostathead[c].il_stat);
 155                         inostathead[c].il_stat = 0;
 156                         continue;
 157                 }
 158                 info = calloc((unsigned)inosused, sizeof(struct inostat));
 159                 if (info == NULL)
 160                         pfatal("cannot alloc %u bytes for inoinfo\n",
 161                             (unsigned)(sizeof(struct inostat) * inosused));
 162                 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info));
 163                 free(inostathead[c].il_stat);
 164                 inostathead[c].il_stat = info;
 165         }
 166         freeinodebuf();
 167 }
 168
 169 static void
 170 checkinode(inumber, idesc)
 171         ino_t inumber;
 172         register struct inodesc *idesc;
 173 {
 174         register struct dinode *dp;
 175         struct zlncnt *zlnp;
 176         int ndb, j;
 177         mode_t mode;
 178         char *symbuf;
 179
 180         dp = getnextinode(inumber);
 181         mode = dp->di_mode & IFMT;
 182         if (mode == 0) {
 183                 if (memcmp(dp->di_db, zino.di_db,
 184                         NDADDR * sizeof(ufs_daddr_t)) ||
 185                     memcmp(dp->di_ib, zino.di_ib,
 186                         NIADDR * sizeof(ufs_daddr_t)) ||
 187                     dp->di_mode || dp->di_size) {
 188                         pfatal("PARTIALLY ALLOCATED INODE I=%lu", inumber);
 189                         if (reply("CLEAR") == 1) {
 190                                 dp = ginode(inumber);
 191                                 clearinode(dp);
 192                                 inodirty();
 193                         }
 194                 }
 195                 inoinfo(inumber)->ino_state = USTATE;
 196                 return;
 197         }
 198         lastino = inumber;
 199         if (/* dp->di_size < 0 || */
 200             dp->di_size + sblock.fs_bsize - 1 < dp->di_size ||
 201             (mode == IFDIR && dp->di_size > MAXDIRSIZE)) {
 202                 if (debug)
 203                         printf("bad size %qu:", dp->di_size);
 204                 goto unknown;
 205         }
 206         if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
 207                 dp = ginode(inumber);
 208                 dp->di_size = sblock.fs_fsize;
 209                 dp->di_mode = IFREG|0600;
 210                 inodirty();
 211         }
 212         ndb = howmany(dp->di_size, sblock.fs_bsize);
 213         if (ndb < 0) {
 214                 if (debug)
 215                         printf("bad size %qu ndb %d:",
 216                                 dp->di_size, ndb);
 217                 goto unknown;
 218         }
 219         if (mode == IFBLK || mode == IFCHR)
 220                 ndb++;
 221         if (mode == IFLNK) {
 222                 if (doinglevel2 &&
 223                     dp->di_size > 0 && dp->di_size < MAXSYMLINKLEN &&
 224                     dp->di_blocks != 0) {
 225                         symbuf = alloca(secsize);
 226                         if (bread(fsreadfd, symbuf,
 227                             fsbtodb(&sblock, dp->di_db[0]),
 228                             (long)secsize) != 0)
 229                                 errx(EEXIT, "cannot read symlink");
 230                         if (debug) {
 231                                 symbuf[dp->di_size] = 0;
 232                                 printf("convert symlink %lu(%s) of size %ld\n",
 233                                     (u_long)inumber, symbuf, (long)dp->di_size);
 234                         }
 235                         dp = ginode(inumber);
 236                         memmove(dp->di_shortlink, symbuf, (long)dp->di_size);
 237                         dp->di_blocks = 0;
 238                         inodirty();
 239                 }
 240                 /*
 241                  * Fake ndb value so direct/indirect block checks below
 242                  * will detect any garbage after symlink string.
 243                  */
 244                 if (dp->di_size < sblock.fs_maxsymlinklen) {
 245                         ndb = howmany(dp->di_size, sizeof(ufs_daddr_t));
 246                         if (ndb > NDADDR) {
 247                                 j = ndb - NDADDR;
 248                                 for (ndb = 1; j > 1; j--)
 249                                         ndb *= NINDIR(&sblock);
 250                                 ndb += NDADDR;
 251                         }
 252                 }
 253         }
 254         for (j = ndb; j < NDADDR; j++)
 255                 if (dp->di_db[j] != 0) {
 256                         if (debug)
 257                                 printf("bad direct addr: %ld\n",
 258                                     (long)dp->di_db[j]);
 259                         goto unknown;
 260                 }
 261         for (j = 0, ndb -= NDADDR; ndb > 0; j++)
 262                 ndb /= NINDIR(&sblock);
 263         for (; j < NIADDR; j++)
 264                 if (dp->di_ib[j] != 0) {
 265                         if (debug)
 266                                 printf("bad indirect addr: %ld\n",
 267                                     (long)dp->di_ib[j]);
 268                         goto unknown;
 269                 }
 270         if (ftypeok(dp) == 0)
 271                 goto unknown;
 272         n_files++;
 273         inoinfo(inumber)->ino_linkcnt = dp->di_nlink;
 274         if (dp->di_nlink <= 0) {
 275                 zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
 276                 if (zlnp == NULL) {
 277                         pfatal("LINK COUNT TABLE OVERFLOW");
 278                         if (reply("CONTINUE") == 0) {
 279                                 ckfini(0);
 280                                 exit(EEXIT);
 281                         }
 282                 } else {
 283                         zlnp->zlncnt = inumber;
 284                         zlnp->next = zlnhead;
 285                         zlnhead = zlnp;
 286                 }
 287         }
 288         if (mode == IFDIR) {
 289                 if (dp->di_size == 0)
 290                         inoinfo(inumber)->ino_state = DCLEAR;
 291                 else
 292                         inoinfo(inumber)->ino_state = DSTATE;
 293                 cacheino(dp, inumber);
 294                 countdirs++;
 295         } else
 296                 inoinfo(inumber)->ino_state = FSTATE;
 297         inoinfo(inumber)->ino_type = IFTODT(mode);
 298         if (doinglevel2 &&
 299             (dp->di_ouid != (u_short)-1 || dp->di_ogid != (u_short)-1)) {
 300                 dp = ginode(inumber);
 301                 dp->di_uid = dp->di_ouid;
 302                 dp->di_ouid = -1;
 303                 dp->di_gid = dp->di_ogid;
 304                 dp->di_ogid = -1;
 305                 inodirty();
 306         }
 307         badblk = dupblk = 0;
 308         idesc->id_number = inumber;
 309         (void)ckinode(dp, idesc);
 310         idesc->id_entryno *= btodb(sblock.fs_fsize);
 311         if (dp->di_blocks != idesc->id_entryno) {
 312                 pwarn("INCORRECT BLOCK COUNT I=%lu (%ld should be %ld)",
 313                     inumber, dp->di_blocks, idesc->id_entryno);
 314                 if (preen)
 315                         printf(" (CORRECTED)\n");
 316                 else if (reply("CORRECT") == 0)
 317                         return;
 318                 dp = ginode(inumber);
 319                 dp->di_blocks = idesc->id_entryno;
 320                 inodirty();
 321         }
 322         return;
 323 unknown:
 324         pfatal("UNKNOWN FILE TYPE I=%lu", inumber);
 325         inoinfo(inumber)->ino_state = FCLEAR;
 326         if (reply("CLEAR") == 1) {
 327                 inoinfo(inumber)->ino_state = USTATE;
 328                 dp = ginode(inumber);
 329                 clearinode(dp);
 330                 inodirty();
 331         }
 332 }
 333
 334 int
 335 pass1check(idesc)
 336         register struct inodesc *idesc;
 337 {
 338         int res = KEEPON;
 339         int anyout, nfrags;
 340         ufs_daddr_t blkno = idesc->id_blkno;
 341         register struct dups *dlp;
 342         struct dups *new;
 343
 344         if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
 345                 blkerror(idesc->id_number, "BAD", blkno);
 346                 if (badblk++ >= MAXBAD) {
 347                         pwarn("EXCESSIVE BAD BLKS I=%lu",
 348                                 idesc->id_number);
 349                         if (preen)
 350                                 printf(" (SKIPPING)\n");
 351                         else if (reply("CONTINUE") == 0) {
 352                                 ckfini(0);
 353                                 exit(EEXIT);
 354                         }
 355                         return (STOP);
 356                 }
 357         }
 358         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
 359                 if (anyout && chkrange(blkno, 1)) {
 360                         res = SKIP;
 361                 } else if (!testbmap(blkno)) {
 362                         n_blks++;
 363                         setbmap(blkno);
 364                 } else {
 365                         blkerror(idesc->id_number, "DUP", blkno);
 366                         if (dupblk++ >= MAXDUP) {
 367                                 pwarn("EXCESSIVE DUP BLKS I=%lu",
 368                                         idesc->id_number);
 369                                 if (preen)
 370                                         printf(" (SKIPPING)\n");
 371                                 else if (reply("CONTINUE") == 0) {
 372                                         ckfini(0);
 373                                         exit(EEXIT);
 374                                 }
 375                                 return (STOP);
 376                         }
 377                         new = (struct dups *)malloc(sizeof(struct dups));
 378                         if (new == NULL) {
 379                                 pfatal("DUP TABLE OVERFLOW.");
 380                                 if (reply("CONTINUE") == 0) {
 381                                         ckfini(0);
 382                                         exit(EEXIT);
 383                                 }
 384                                 return (STOP);
 385                         }
 386                         new->dup = blkno;
 387                         if (muldup == 0) {
 388                                 duplist = muldup = new;
 389                                 new->next = 0;
 390                         } else {
 391                                 new->next = muldup->next;
 392                                 muldup->next = new;
 393                         }
 394                         for (dlp = duplist; dlp != muldup; dlp = dlp->next)
 395                                 if (dlp->dup == blkno)
 396                                         break;
 397                         if (dlp == muldup && dlp->dup != blkno)
 398                                 muldup = new;
 399                 }
 400                 /*
 401                  * count the number of blocks found in id_entryno
 402                  */
 403                 idesc->id_entryno++;
 404         }
 405         return (res);
 406 }