sbin/fsck_ffs/pass2.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[] = "@(#)pass2.c       8.9 (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 #define MINDIRSIZE      (sizeof (struct dirtemplate))
  54
  55 static int blksort(const void *, const void *);
  56 static int pass2check(struct inodesc *);
  57
  58 void
  59 pass2(void)
  60 {
  61         struct dinode *dp;
  62         struct inoinfo **inpp, *inp;
  63         struct inoinfo **inpend;
  64         struct inodesc curino;
  65         struct dinode dino;
  66         char pathbuf[MAXPATHLEN + 1];
  67
  68         switch (inoinfo(ROOTINO)->ino_state) {
  69
  70         case USTATE:
  71                 pfatal("ROOT INODE UNALLOCATED");
  72                 if (reply("ALLOCATE") == 0) {
  73                         ckfini(0);
  74                         exit(EEXIT);
  75                 }
  76                 if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
  77                         errx(EEXIT, "CANNOT ALLOCATE ROOT INODE");
  78                 break;
  79
  80         case DCLEAR:
  81                 pfatal("DUPS/BAD IN ROOT INODE");
  82                 if (reply("REALLOCATE")) {
  83                         freeino(ROOTINO);
  84                         if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
  85                                 errx(EEXIT, "CANNOT ALLOCATE ROOT INODE");
  86                         break;
  87                 }
  88                 if (reply("CONTINUE") == 0) {
  89                         ckfini(0);
  90                         exit(EEXIT);
  91                 }
  92                 break;
  93
  94         case FSTATE:
  95         case FCLEAR:
  96                 pfatal("ROOT INODE NOT DIRECTORY");
  97                 if (reply("REALLOCATE")) {
  98                         freeino(ROOTINO);
  99                         if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
 100                                 errx(EEXIT, "CANNOT ALLOCATE ROOT INODE");
 101                         break;
 102                 }
 103                 if (reply("FIX") == 0) {
 104                         ckfini(0);
 105                         exit(EEXIT);
 106                 }
 107                 dp = ginode(ROOTINO);
 108                 dp->di_mode &= ~IFMT;
 109                 dp->di_mode |= IFDIR;
 110                 inodirty();
 111                 break;
 112
 113         case DSTATE:
 114                 break;
 115
 116         default:
 117                 errx(EEXIT, "BAD STATE %d FOR ROOT INODE",
 118                     inoinfo(ROOTINO)->ino_state);
 119         }
 120         inoinfo(ROOTINO)->ino_state = DFOUND;
 121         if (newinofmt) {
 122                 inoinfo(WINO)->ino_state = FSTATE;
 123                 inoinfo(WINO)->ino_type = DT_WHT;
 124         }
 125         /*
 126          * Sort the directory list into disk block order.
 127          */
 128         qsort((char *)inpsort, (size_t)inplast, sizeof *inpsort, blksort);
 129         /*
 130          * Check the integrity of each directory.
 131          */
 132         memset(&curino, 0, sizeof(struct inodesc));
 133         curino.id_type = DATA;
 134         curino.id_func = pass2check;
 135         dp = &dino;
 136         inpend = &inpsort[inplast];
 137         for (inpp = inpsort; inpp < inpend; inpp++) {
 138                 if (got_siginfo) {
 139                         printf("%s: phase 2: dir %d of %d (%d%%)\n", cdevname,
 140                             inpp - inpsort, (int)inplast,
 141                             (int)((inpp - inpsort) * 100 / inplast));
 142                         got_siginfo = 0;
 143                 }
 144                 inp = *inpp;
 145                 if (inp->i_isize == 0)
 146                         continue;
 147                 if (inp->i_isize < MINDIRSIZE) {
 148                         direrror(inp->i_number, "DIRECTORY TOO SHORT");
 149                         inp->i_isize = roundup(MINDIRSIZE, DIRBLKSIZ);
 150                         if (reply("FIX") == 1) {
 151                                 dp = ginode(inp->i_number);
 152                                 dp->di_size = inp->i_isize;
 153                                 inodirty();
 154                                 dp = &dino;
 155                         }
 156                 } else if ((inp->i_isize & (DIRBLKSIZ - 1)) != 0) {
 157                         getpathname(pathbuf, inp->i_number, inp->i_number);
 158                         if (usedsoftdep)
 159                                 pfatal("%s %s: LENGTH %d NOT MULTIPLE OF %d",
 160                                         "DIRECTORY", pathbuf, inp->i_isize,
 161                                         DIRBLKSIZ);
 162                         else
 163                                 pwarn("%s %s: LENGTH %d NOT MULTIPLE OF %d",
 164                                         "DIRECTORY", pathbuf, inp->i_isize,
 165                                         DIRBLKSIZ);
 166                         if (preen)
 167                                 printf(" (ADJUSTED)\n");
 168                         inp->i_isize = roundup(inp->i_isize, DIRBLKSIZ);
 169                         if (preen || reply("ADJUST") == 1) {
 170                                 dp = ginode(inp->i_number);
 171                                 dp->di_size = roundup(inp->i_isize, DIRBLKSIZ);
 172                                 inodirty();
 173                                 dp = &dino;
 174                         }
 175                 }
 176                 memset(&dino, 0, sizeof(struct dinode));
 177                 dino.di_mode = IFDIR;
 178                 dp->di_size = inp->i_isize;
 179                 memmove(&dp->di_db[0], &inp->i_blks[0], (size_t)inp->i_numblks);
 180                 curino.id_number = inp->i_number;
 181                 curino.id_parent = inp->i_parent;
 182                 (void)ckinode(dp, &curino);
 183         }
 184         /*
 185          * Now that the parents of all directories have been found,
 186          * make another pass to verify the value of `..'
 187          */
 188         for (inpp = inpsort; inpp < inpend; inpp++) {
 189                 inp = *inpp;
 190                 if (inp->i_parent == 0 || inp->i_isize == 0)
 191                         continue;
 192                 if (inoinfo(inp->i_parent)->ino_state == DFOUND &&
 193                     inoinfo(inp->i_number)->ino_state == DSTATE)
 194                         inoinfo(inp->i_number)->ino_state = DFOUND;
 195                 if (inp->i_dotdot == inp->i_parent ||
 196                     inp->i_dotdot == (ino_t)-1)
 197                         continue;
 198                 if (inp->i_dotdot == 0) {
 199                         inp->i_dotdot = inp->i_parent;
 200                         fileerror(inp->i_parent, inp->i_number, "MISSING '..'");
 201                         if (reply("FIX") == 0)
 202                                 continue;
 203                         (void)makeentry(inp->i_number, inp->i_parent, "..");
 204                         inoinfo(inp->i_parent)->ino_linkcnt--;
 205                         continue;
 206                 }
 207                 fileerror(inp->i_parent, inp->i_number,
 208                     "BAD INODE NUMBER FOR '..'");
 209                 if (reply("FIX") == 0)
 210                         continue;
 211                 inoinfo(inp->i_dotdot)->ino_linkcnt++;
 212                 inoinfo(inp->i_parent)->ino_linkcnt--;
 213                 inp->i_dotdot = inp->i_parent;
 214                 (void)changeino(inp->i_number, "..", inp->i_parent);
 215         }
 216         /*
 217          * Mark all the directories that can be found from the root.
 218          */
 219         propagate();
 220 }
 221
 222 static int
 223 pass2check(struct inodesc *idesc)
 224 {
 225         struct direct *dirp = idesc->id_dirp;
 226         struct inoinfo *inp;
 227         int n, entrysize, ret = 0;
 228         struct dinode *dp;
 229         char *errmsg;
 230         struct direct proto;
 231         char namebuf[MAXPATHLEN + 1];
 232         char pathbuf[MAXPATHLEN + 1];
 233
 234         /*
 235          * If converting, set directory entry type.
 236          */
 237         if (doinglevel2 && dirp->d_ino > 0 && dirp->d_ino < maxino) {
 238                 dirp->d_type = inoinfo(dirp->d_ino)->ino_type;
 239                 ret |= ALTERED;
 240         }
 241         /*
 242          * check for "."
 243          */
 244         if (idesc->id_entryno != 0)
 245                 goto chk1;
 246         if (dirp->d_ino != 0 && strcmp(dirp->d_name, ".") == 0) {
 247                 if (dirp->d_ino != idesc->id_number) {
 248                         direrror(idesc->id_number, "BAD INODE NUMBER FOR '.'");
 249                         dirp->d_ino = idesc->id_number;
 250                         if (reply("FIX") == 1)
 251                                 ret |= ALTERED;
 252                 }
 253                 if (newinofmt && dirp->d_type != DT_DIR) {
 254                         direrror(idesc->id_number, "BAD TYPE VALUE FOR '.'");
 255                         dirp->d_type = DT_DIR;
 256                         if (reply("FIX") == 1)
 257                                 ret |= ALTERED;
 258                 }
 259                 goto chk1;
 260         }
 261         direrror(idesc->id_number, "MISSING '.'");
 262         proto.d_ino = idesc->id_number;
 263         if (newinofmt)
 264                 proto.d_type = DT_DIR;
 265         else
 266                 proto.d_type = 0;
 267         proto.d_namlen = 1;
 268         (void)strcpy(proto.d_name, ".");
 269 #       if BYTE_ORDER == LITTLE_ENDIAN
 270                 if (!newinofmt) {
 271                         u_char tmp;
 272
 273                         tmp = proto.d_type;
 274                         proto.d_type = proto.d_namlen;
 275                         proto.d_namlen = tmp;
 276                 }
 277 #       endif
 278         entrysize = DIRSIZ(0, &proto);
 279         if (dirp->d_ino != 0 && strcmp(dirp->d_name, "..") != 0) {
 280                 pfatal("CANNOT FIX, FIRST ENTRY IN DIRECTORY CONTAINS %s\n",
 281                         dirp->d_name);
 282         } else if (dirp->d_reclen < entrysize) {
 283                 pfatal("CANNOT FIX, INSUFFICIENT SPACE TO ADD '.'\n");
 284         } else if (dirp->d_reclen < 2 * entrysize) {
 285                 proto.d_reclen = dirp->d_reclen;
 286                 memmove(dirp, &proto, (size_t)entrysize);
 287                 if (reply("FIX") == 1)
 288                         ret |= ALTERED;
 289         } else {
 290                 n = dirp->d_reclen - entrysize;
 291                 proto.d_reclen = entrysize;
 292                 memmove(dirp, &proto, (size_t)entrysize);
 293                 idesc->id_entryno++;
 294                 inoinfo(dirp->d_ino)->ino_linkcnt--;
 295                 dirp = (struct direct *)((char *)(dirp) + entrysize);
 296                 memset(dirp, 0, (size_t)n);
 297                 dirp->d_reclen = n;
 298                 if (reply("FIX") == 1)
 299                         ret |= ALTERED;
 300         }
 301 chk1:
 302         if (idesc->id_entryno > 1)
 303                 goto chk2;
 304         inp = getinoinfo(idesc->id_number);
 305         proto.d_ino = inp->i_parent;
 306         if (newinofmt)
 307                 proto.d_type = DT_DIR;
 308         else
 309                 proto.d_type = 0;
 310         proto.d_namlen = 2;
 311         (void)strcpy(proto.d_name, "..");
 312 #       if BYTE_ORDER == LITTLE_ENDIAN
 313                 if (!newinofmt) {
 314                         u_char tmp;
 315
 316                         tmp = proto.d_type;
 317                         proto.d_type = proto.d_namlen;
 318                         proto.d_namlen = tmp;
 319                 }
 320 #       endif
 321         entrysize = DIRSIZ(0, &proto);
 322         if (idesc->id_entryno == 0) {
 323                 n = DIRSIZ(0, dirp);
 324                 if (dirp->d_reclen < n + entrysize)
 325                         goto chk2;
 326                 proto.d_reclen = dirp->d_reclen - n;
 327                 dirp->d_reclen = n;
 328                 idesc->id_entryno++;
 329                 inoinfo(dirp->d_ino)->ino_linkcnt--;
 330                 dirp = (struct direct *)((char *)(dirp) + n);
 331                 memset(dirp, 0, (size_t)proto.d_reclen);
 332                 dirp->d_reclen = proto.d_reclen;
 333         }
 334         if (dirp->d_ino != 0 && strcmp(dirp->d_name, "..") == 0) {
 335                 inp->i_dotdot = dirp->d_ino;
 336                 if (newinofmt && dirp->d_type != DT_DIR) {
 337                         direrror(idesc->id_number, "BAD TYPE VALUE FOR '..'");
 338                         dirp->d_type = DT_DIR;
 339                         if (reply("FIX") == 1)
 340                                 ret |= ALTERED;
 341                 }
 342                 goto chk2;
 343         }
 344         if (dirp->d_ino != 0 && strcmp(dirp->d_name, ".") != 0) {
 345                 fileerror(inp->i_parent, idesc->id_number, "MISSING '..'");
 346                 pfatal("CANNOT FIX, SECOND ENTRY IN DIRECTORY CONTAINS %s\n",
 347                         dirp->d_name);
 348                 inp->i_dotdot = (ino_t)-1;
 349         } else if (dirp->d_reclen < entrysize) {
 350                 fileerror(inp->i_parent, idesc->id_number, "MISSING '..'");
 351                 pfatal("CANNOT FIX, INSUFFICIENT SPACE TO ADD '..'\n");
 352                 inp->i_dotdot = (ino_t)-1;
 353         } else if (inp->i_parent != 0) {
 354                 /*
 355                  * We know the parent, so fix now.
 356                  */
 357                 inp->i_dotdot = inp->i_parent;
 358                 fileerror(inp->i_parent, idesc->id_number, "MISSING '..'");
 359                 proto.d_reclen = dirp->d_reclen;
 360                 memmove(dirp, &proto, (size_t)entrysize);
 361                 if (reply("FIX") == 1)
 362                         ret |= ALTERED;
 363         }
 364         idesc->id_entryno++;
 365         if (dirp->d_ino != 0)
 366                 inoinfo(dirp->d_ino)->ino_linkcnt--;
 367         return (ret|KEEPON);
 368 chk2:
 369         if (dirp->d_ino == 0)
 370                 return (ret|KEEPON);
 371         if (dirp->d_namlen <= 2 &&
 372             dirp->d_name[0] == '.' &&
 373             idesc->id_entryno >= 2) {
 374                 if (dirp->d_namlen == 1) {
 375                         direrror(idesc->id_number, "EXTRA '.' ENTRY");
 376                         dirp->d_ino = 0;
 377                         if (reply("FIX") == 1)
 378                                 ret |= ALTERED;
 379                         return (KEEPON | ret);
 380                 }
 381                 if (dirp->d_name[1] == '.') {
 382                         direrror(idesc->id_number, "EXTRA '..' ENTRY");
 383                         dirp->d_ino = 0;
 384                         if (reply("FIX") == 1)
 385                                 ret |= ALTERED;
 386                         return (KEEPON | ret);
 387                 }
 388         }
 389         idesc->id_entryno++;
 390         n = 0;
 391         if (dirp->d_ino > maxino) {
 392                 fileerror(idesc->id_number, dirp->d_ino, "I OUT OF RANGE");
 393                 n = reply("REMOVE");
 394         } else if (newinofmt &&
 395                    ((dirp->d_ino == WINO && dirp->d_type != DT_WHT) ||
 396                     (dirp->d_ino != WINO && dirp->d_type == DT_WHT))) {
 397                 fileerror(idesc->id_number, dirp->d_ino, "BAD WHITEOUT ENTRY");
 398                 dirp->d_ino = WINO;
 399                 dirp->d_type = DT_WHT;
 400                 if (reply("FIX") == 1)
 401                         ret |= ALTERED;
 402         } else {
 403 again:
 404                 switch (inoinfo(dirp->d_ino)->ino_state) {
 405                 case USTATE:
 406                         if (idesc->id_entryno <= 2)
 407                                 break;
 408                         fileerror(idesc->id_number, dirp->d_ino, "UNALLOCATED");
 409                         n = reply("REMOVE");
 410                         break;
 411
 412                 case DCLEAR:
 413                 case FCLEAR:
 414                         if (idesc->id_entryno <= 2)
 415                                 break;
 416                         if (inoinfo(dirp->d_ino)->ino_state == FCLEAR)
 417                                 errmsg = "DUP/BAD";
 418                         else if (!preen && !usedsoftdep)
 419                                 errmsg = "ZERO LENGTH DIRECTORY";
 420                         else {
 421                                 n = 1;
 422                                 break;
 423                         }
 424                         fileerror(idesc->id_number, dirp->d_ino, errmsg);
 425                         if ((n = reply("REMOVE")) == 1)
 426                                 break;
 427                         dp = ginode(dirp->d_ino);
 428                         inoinfo(dirp->d_ino)->ino_state =
 429                             (dp->di_mode & IFMT) == IFDIR ? DSTATE : FSTATE;
 430                         inoinfo(dirp->d_ino)->ino_linkcnt = dp->di_nlink;
 431                         goto again;
 432
 433                 case DSTATE:
 434                         if (inoinfo(idesc->id_number)->ino_state == DFOUND)
 435                                 inoinfo(dirp->d_ino)->ino_state = DFOUND;
 436                         /* fall through */
 437
 438                 case DFOUND:
 439                         inp = getinoinfo(dirp->d_ino);
 440                         if (inp->i_parent != 0 && idesc->id_entryno > 2) {
 441                                 getpathname(pathbuf, idesc->id_number,
 442                                     idesc->id_number);
 443                                 getpathname(namebuf, dirp->d_ino, dirp->d_ino);
 444                                 pwarn("%s%s%s %s %s\n", pathbuf,
 445                                     (strcmp(pathbuf, "/") == 0 ? "" : "/"),
 446                                     dirp->d_name,
 447                                     "IS AN EXTRANEOUS HARD LINK TO DIRECTORY",
 448                                     namebuf);
 449                                 if (cursnapshot != 0)
 450                                         break;
 451                                 if (preen) {
 452                                         printf(" (REMOVED)\n");
 453                                         n = 1;
 454                                         break;
 455                                 }
 456                                 if ((n = reply("REMOVE")) == 1)
 457                                         break;
 458                         }
 459                         if (idesc->id_entryno > 2)
 460                                 inp->i_parent = idesc->id_number;
 461                         /* fall through */
 462
 463                 case FSTATE:
 464                         if (newinofmt &&
 465                             dirp->d_type != inoinfo(dirp->d_ino)->ino_type) {
 466                                 fileerror(idesc->id_number, dirp->d_ino,
 467                                     "BAD TYPE VALUE");
 468                                 dirp->d_type = inoinfo(dirp->d_ino)->ino_type;
 469                                 if (reply("FIX") == 1)
 470                                         ret |= ALTERED;
 471                         }
 472                         inoinfo(dirp->d_ino)->ino_linkcnt--;
 473                         break;
 474
 475                 default:
 476                         errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
 477                             inoinfo(dirp->d_ino)->ino_state, dirp->d_ino);
 478                 }
 479         }
 480         if (n == 0)
 481                 return (ret|KEEPON);
 482         dirp->d_ino = 0;
 483         return (ret|KEEPON|ALTERED);
 484 }
 485
 486 /*
 487  * Routine to sort disk blocks.
 488  */
 489 static int
 490 blksort(const void *arg1, const void *arg2)
 491 {
 492
 493         return ((*(struct inoinfo **)arg1)->i_blks[0] -
 494                 (*(struct inoinfo **)arg2)->i_blks[0]);
 495 }