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