Home | History | Annotate | Line # | Download | only in fsck_ffs
pass3.c revision 1.20 
      1 /*	$NetBSD: pass3.c,v 1.20 2011/03/06 17:08:16 bouyer 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 #include <sys/cdefs.h>
     33 #ifndef lint
     34 #if 0
     35 static char sccsid[] = "@(#)pass3.c	8.2 (Berkeley) 4/27/95";
     36 #else
     37 __RCSID("$NetBSD: pass3.c,v 1.20 2011/03/06 17:08:16 bouyer Exp $");
     38 #endif
     39 #endif /* not lint */
     40 
     41 #include <sys/param.h>
     42 #include <sys/time.h>
     43 #include <string.h>
     44 
     45 #include <ufs/ufs/dinode.h>
     46 #include <ufs/ffs/fs.h>
     47 
     48 #include <dirent.h>
     49 
     50 #include "fsck.h"
     51 #include "extern.h"
     52 #include "fsutil.h"
     53 
     54 void
     55 pass3(void)
     56 {
     57 	struct inoinfo *inp, **inpp;
     58 	int loopcnt, state;
     59 	ino_t orphan;
     60 	struct inodesc idesc;
     61 	char namebuf[MAXNAMLEN+1];
     62 	union dinode *dp;
     63 
     64 	for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) {
     65 		int inpindex = inpp - inpsort;
     66 		if (got_siginfo) {
     67 			fprintf(stderr,
     68 			    "%s: phase 3: dir %d of %d (%d%%)\n", cdevname(),
     69 			    (int)(inplast - inpindex - 1), (int)inplast,
     70 			    (int)((inplast - inpindex - 1) * 100 / inplast));
     71 			got_siginfo = 0;
     72 		}
     73 #ifdef PROGRESS
     74 		progress_bar(cdevname(), preen ? NULL : "phase 3",
     75 			    inplast - inpindex - 1, inplast);
     76 #endif /* PROGRESS */
     77 		inp = *inpp;
     78 		state = inoinfo(inp->i_number)->ino_state;
     79 		if (inp->i_number == ROOTINO ||
     80 		    (inp->i_parent != 0 && state != DSTATE))
     81 			continue;
     82 		if (state == DCLEAR)
     83 			continue;
     84 		/*
     85 		 * If we are running with soft updates and we come
     86 		 * across unreferenced directories, we just leave
     87 		 * them in DSTATE which will cause them to be pitched
     88 		 * in pass 4.
     89 		 */
     90 		if (preen &&
     91 		    resolved && usedsoftdep && state == DSTATE) {
     92 			if (inp->i_dotdot >= ROOTINO)
     93 				inoinfo(inp->i_dotdot)->ino_linkcnt++;
     94 			continue;
     95 		}
     96 		for (loopcnt = 0; ; loopcnt++) {
     97 			orphan = inp->i_number;
     98 			if (inp->i_parent == 0 ||
     99 			    inoinfo(inp->i_parent)->ino_state != DSTATE ||
    100 			    loopcnt > countdirs)
    101 				break;
    102 			inp = getinoinfo(inp->i_parent);
    103 		}
    104 		if (loopcnt <= countdirs) {
    105 			if (linkup(orphan, inp->i_dotdot, NULL))
    106 				inoinfo(lfdir)->ino_linkcnt--;
    107 			continue;
    108 		}
    109 		pfatal("ORPHANED DIRECTORY LOOP DETECTED I=%lu",
    110 		    (u_long)orphan);
    111 		if (reply("RECONNECT") == 0)
    112 			continue;
    113 		dp = ginode(inp->i_parent);
    114 		memset(&idesc, 0, sizeof(struct inodesc));
    115 		idesc.id_type = DATA;
    116 		idesc.id_number = inp->i_parent;
    117 		idesc.id_parent = orphan;
    118 		idesc.id_func = findname;
    119 		idesc.id_name = namebuf;
    120 		idesc.id_uid = iswap32(DIP(dp, uid));
    121 		idesc.id_gid = iswap32(DIP(dp, gid));
    122 		if ((ckinode(dp, &idesc) & FOUND) == 0)
    123 			pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY");
    124 		if (linkup(orphan, inp->i_parent, namebuf)) {
    125 			idesc.id_func = clearentry;
    126 			if (ckinode(ginode(inp->i_parent), &idesc) & FOUND)
    127 				inoinfo(orphan)->ino_linkcnt++;
    128 			inoinfo(lfdir)->ino_linkcnt--;
    129 		}
    130 	}
    131 #ifdef PROGRESS
    132 	if (!preen)
    133 		progress_done();
    134 #endif /* PROGRESS */
    135 }
    136