Home | History | Annotate | Line # | Download | only in fsck_ext2fs
pass3.c revision 1.1
      1  1.1  bouyer /*	$NetBSD: pass3.c,v 1.1 1997/06/11 11:21:55 bouyer Exp $	*/
      2  1.1  bouyer 
      3  1.1  bouyer /*
      4  1.1  bouyer  * Copyright (c) 1997 Manuel Bouyer.
      5  1.1  bouyer  * Copyright (c) 1980, 1986, 1993
      6  1.1  bouyer  *	The Regents of the University of California.  All rights reserved.
      7  1.1  bouyer  *
      8  1.1  bouyer  * Redistribution and use in source and binary forms, with or without
      9  1.1  bouyer  * modification, are permitted provided that the following conditions
     10  1.1  bouyer  * are met:
     11  1.1  bouyer  * 1. Redistributions of source code must retain the above copyright
     12  1.1  bouyer  *    notice, this list of conditions and the following disclaimer.
     13  1.1  bouyer  * 2. Redistributions in binary form must reproduce the above copyright
     14  1.1  bouyer  *    notice, this list of conditions and the following disclaimer in the
     15  1.1  bouyer  *    documentation and/or other materials provided with the distribution.
     16  1.1  bouyer  * 3. All advertising materials mentioning features or use of this software
     17  1.1  bouyer  *    must display the following acknowledgement:
     18  1.1  bouyer  *	This product includes software developed by the University of
     19  1.1  bouyer  *	California, Berkeley and its contributors.
     20  1.1  bouyer  * 4. Neither the name of the University nor the names of its contributors
     21  1.1  bouyer  *    may be used to endorse or promote products derived from this software
     22  1.1  bouyer  *    without specific prior written permission.
     23  1.1  bouyer  *
     24  1.1  bouyer  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  1.1  bouyer  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  1.1  bouyer  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  1.1  bouyer  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  1.1  bouyer  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  1.1  bouyer  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  1.1  bouyer  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  1.1  bouyer  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  1.1  bouyer  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  1.1  bouyer  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  1.1  bouyer  * SUCH DAMAGE.
     35  1.1  bouyer  */
     36  1.1  bouyer 
     37  1.1  bouyer #ifndef lint
     38  1.1  bouyer #if 0
     39  1.1  bouyer static char sccsid[] = "@(#)pass3.c	8.1 (Berkeley) 6/5/93";
     40  1.1  bouyer #else
     41  1.1  bouyer static char rcsid[] = "$NetBSD: pass3.c,v 1.1 1997/06/11 11:21:55 bouyer Exp $";
     42  1.1  bouyer #endif
     43  1.1  bouyer #endif /* not lint */
     44  1.1  bouyer 
     45  1.1  bouyer #include <sys/param.h>
     46  1.1  bouyer #include <sys/time.h>
     47  1.1  bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
     48  1.1  bouyer #include <ufs/ext2fs/ext2fs.h>
     49  1.1  bouyer #include "fsck.h"
     50  1.1  bouyer #include "extern.h"
     51  1.1  bouyer 
     52  1.1  bouyer void
     53  1.1  bouyer pass3()
     54  1.1  bouyer {
     55  1.1  bouyer 	register struct inoinfo **inpp, *inp;
     56  1.1  bouyer 	ino_t orphan;
     57  1.1  bouyer 	int loopcnt;
     58  1.1  bouyer 
     59  1.1  bouyer 	for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) {
     60  1.1  bouyer 		inp = *inpp;
     61  1.1  bouyer 		if (inp->i_number == EXT2_ROOTINO ||
     62  1.1  bouyer 		    !(inp->i_parent == 0 || statemap[inp->i_number] == DSTATE))
     63  1.1  bouyer 			continue;
     64  1.1  bouyer 		if (statemap[inp->i_number] == DCLEAR)
     65  1.1  bouyer 			continue;
     66  1.1  bouyer 		for (loopcnt = 0; ; loopcnt++) {
     67  1.1  bouyer 			orphan = inp->i_number;
     68  1.1  bouyer 			if (inp->i_parent == 0 ||
     69  1.1  bouyer 			    statemap[inp->i_parent] != DSTATE ||
     70  1.1  bouyer 			    loopcnt > numdirs)
     71  1.1  bouyer 				break;
     72  1.1  bouyer 			inp = getinoinfo(inp->i_parent);
     73  1.1  bouyer 		}
     74  1.1  bouyer 		(void)linkup(orphan, inp->i_dotdot);
     75  1.1  bouyer 		inp->i_parent = inp->i_dotdot = lfdir;
     76  1.1  bouyer 		lncntp[lfdir]--;
     77  1.1  bouyer 		statemap[orphan] = DFOUND;
     78  1.1  bouyer 		propagate();
     79  1.1  bouyer 	}
     80  1.1  bouyer }
     81