Home | History | Annotate | Line # | Download | only in fsck_ffs
pass3.c revision 1.14 
      1 /*	$NetBSD: pass3.c,v 1.14 2003/04/02 10:39:26 fvdl 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. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  */
     35 
     36 #include <sys/cdefs.h>
     37 #ifndef lint
     38 #if 0
     39 static char sccsid[] = "@(#)pass3.c	8.2 (Berkeley) 4/27/95";
     40 #else
     41 __RCSID("$NetBSD: pass3.c,v 1.14 2003/04/02 10:39:26 fvdl Exp $");
     42 #endif
     43 #endif /* not lint */
     44 
     45 #include <sys/param.h>
     46 #include <sys/time.h>
     47 
     48 #include <ufs/ufs/dinode.h>
     49 #include <ufs/ffs/fs.h>
     50 
     51 #include <dirent.h>
     52 
     53 #include "fsck.h"
     54 #include "extern.h"
     55 #include "fsutil.h"
     56 
     57 void
     58 pass3(void)
     59 {
     60 	struct inoinfo *inp, **inpp;
     61 	int loopcnt, state;
     62 	ino_t orphan;
     63 	struct inodesc idesc;
     64 	char namebuf[MAXNAMLEN+1];
     65 
     66 	for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) {
     67 		if (got_siginfo) {
     68 			int inpindex = inpp - inpsort;
     69 			fprintf(stderr,
     70 			    "%s: phase 3: dir %d of %d (%d%%)\n", cdevname(),
     71 			    (int)(inplast - inpindex - 1), (int)inplast,
     72 			    (int)((inplast - inpindex - 1) * 100 / inplast));
     73 			got_siginfo = 0;
     74 		}
     75 		inp = *inpp;
     76 		state = inoinfo(inp->i_number)->ino_state;
     77 		if (inp->i_number == ROOTINO ||
     78 		    (inp->i_parent != 0 && state != DSTATE))
     79 			continue;
     80 		if (state == DCLEAR)
     81 			continue;
     82 		/*
     83 		 * If we are running with soft updates and we come
     84 		 * across unreferenced directories, we just leave
     85 		 * them in DSTATE which will cause them to be pitched
     86 		 * in pass 4.
     87 		 */
     88 		if (preen &&
     89 		    resolved && usedsoftdep && state == DSTATE) {
     90 			if (inp->i_dotdot >= ROOTINO)
     91 				inoinfo(inp->i_dotdot)->ino_linkcnt++;
     92 			continue;
     93 		}
     94 		for (loopcnt = 0; ; loopcnt++) {
     95 			orphan = inp->i_number;
     96 			if (inp->i_parent == 0 ||
     97 			    inoinfo(inp->i_parent)->ino_state != DSTATE ||
     98 			    loopcnt > countdirs)
     99 				break;
    100 			inp = getinoinfo(inp->i_parent);
    101 		}
    102 		if (loopcnt <= countdirs) {
    103 			if (linkup(orphan, inp->i_dotdot, NULL))
    104 				inoinfo(lfdir)->ino_linkcnt--;
    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 			inoinfo(lfdir)->ino_linkcnt--;
    124 		}
    125 	}
    126 }
    127