sbin/fsck_ffs/pass3.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[] = "@(#)pass3.c       8.2 (Berkeley) 4/27/95";
  35 #endif /* not lint */
  36 #endif
  37 #include <sys/cdefs.h>
  38 __FBSDID("$FreeBSD$");
  39
  40 #include <sys/param.h>
  41
  42 #include <ufs/ufs/dinode.h>
  43 #include <ufs/ufs/dir.h>
  44 #include <ufs/ffs/fs.h>
  45
  46 #include <string.h>
  47
  48 #include "fsck.h"
  49
  50 void
  51 pass3(void)
  52 {
  53         struct inoinfo *inp;
  54         int loopcnt, inpindex, state;
  55         ino_t orphan;
  56         struct inodesc idesc;
  57         char namebuf[UFS_MAXNAMLEN+1];
  58
  59         for (inpindex = inplast - 1; inpindex >= 0; inpindex--) {
  60                 if (got_siginfo) {
  61                         printf("%s: phase 3: dir %d of %d (%d%%)\n", cdevname,
  62                             (int)(inplast - inpindex - 1), (int)inplast,
  63                             (int)((inplast - inpindex - 1) * 100 / inplast));
  64                         got_siginfo = 0;
  65                 }
  66                 if (got_sigalarm) {
  67                         setproctitle("%s p3 %d%%", cdevname,
  68                             (int)((inplast - inpindex - 1) * 100 / inplast));
  69                         got_sigalarm = 0;
  70                 }
  71                 inp = inpsort[inpindex];
  72                 state = inoinfo(inp->i_number)->ino_state;
  73                 if (inp->i_number == UFS_ROOTINO ||
  74                     (inp->i_parent != 0 && !S_IS_DUNFOUND(state)))
  75                         continue;
  76                 if (state == DCLEAR)
  77                         continue;
  78                 /*
  79                  * If we are running with soft updates and we come
  80                  * across unreferenced directories, we just leave
  81                  * them in DSTATE which will cause them to be pitched
  82                  * in pass 4.
  83                  */
  84                 if ((preen || bkgrdflag) &&
  85                     resolved && usedsoftdep && S_IS_DUNFOUND(state)) {
  86                         if (inp->i_dotdot >= UFS_ROOTINO)
  87                                 inoinfo(inp->i_dotdot)->ino_linkcnt++;
  88                         continue;
  89                 }
  90                 for (loopcnt = 0; ; loopcnt++) {
  91                         orphan = inp->i_number;
  92                         if (inp->i_parent == 0 ||
  93                             !INO_IS_DUNFOUND(inp->i_parent) ||
  94                             loopcnt > countdirs)
  95                                 break;
  96                         inp = getinoinfo(inp->i_parent);
  97                 }
  98                 if (loopcnt <= countdirs) {
  99                         if (linkup(orphan, inp->i_dotdot, NULL)) {
 100                                 inp->i_parent = inp->i_dotdot = lfdir;
 101                                 inoinfo(lfdir)->ino_linkcnt--;
 102                         }
 103                         inoinfo(orphan)->ino_state = DFOUND;
 104                         propagate();
 105                         continue;
 106                 }
 107                 pfatal("ORPHANED DIRECTORY LOOP DETECTED I=%lu",
 108                     (u_long)orphan);
 109                 if (reply("RECONNECT") == 0)
 110                         continue;
 111                 memset(&idesc, 0, sizeof(struct inodesc));
 112                 idesc.id_type = DATA;
 113                 idesc.id_number = inp->i_parent;
 114                 idesc.id_parent = orphan;
 115                 idesc.id_func = findname;
 116                 idesc.id_name = namebuf;
 117                 if ((ckinode(ginode(inp->i_parent), &idesc) & FOUND) == 0)
 118                         pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY");
 119                 if (linkup(orphan, inp->i_parent, namebuf)) {
 120                         idesc.id_func = clearentry;
 121                         if (ckinode(ginode(inp->i_parent), &idesc) & FOUND)
 122                                 inoinfo(orphan)->ino_linkcnt++;
 123                         inp->i_parent = inp->i_dotdot = lfdir;
 124                         inoinfo(lfdir)->ino_linkcnt--;
 125                 }
 126                 inoinfo(orphan)->ino_state = DFOUND;
 127                 propagate();
 128         }
 129 }