Home | History | Annotate | Line # | Download | only in fsck_ext2fs
pass3.c revision 1.3
      1  1.3     agc /*	$NetBSD: pass3.c,v 1.3 2003/08/07 10:04:18 agc 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.1  bouyer  *	This product includes software developed by the University of
     46  1.1  bouyer  *	California, Berkeley and its contributors.
     47  1.1  bouyer  * 4. Neither the name of the University nor the names of its contributors
     48  1.1  bouyer  *    may be used to endorse or promote products derived from this software
     49  1.1  bouyer  *    without specific prior written permission.
     50  1.1  bouyer  *
     51  1.1  bouyer  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     52  1.1  bouyer  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     53  1.1  bouyer  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     54  1.1  bouyer  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     55  1.1  bouyer  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     56  1.1  bouyer  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     57  1.1  bouyer  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     58  1.1  bouyer  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     59  1.1  bouyer  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     60  1.1  bouyer  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     61  1.1  bouyer  * SUCH DAMAGE.
     62  1.1  bouyer  */
     63  1.1  bouyer 
     64  1.2   lukem #include <sys/cdefs.h>
     65  1.1  bouyer #ifndef lint
     66  1.1  bouyer #if 0
     67  1.1  bouyer static char sccsid[] = "@(#)pass3.c	8.1 (Berkeley) 6/5/93";
     68  1.1  bouyer #else
     69  1.3     agc __RCSID("$NetBSD: pass3.c,v 1.3 2003/08/07 10:04:18 agc Exp $");
     70  1.1  bouyer #endif
     71  1.1  bouyer #endif /* not lint */
     72  1.1  bouyer 
     73  1.1  bouyer #include <sys/param.h>
     74  1.1  bouyer #include <sys/time.h>
     75  1.1  bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
     76  1.1  bouyer #include <ufs/ext2fs/ext2fs.h>
     77  1.1  bouyer #include "fsck.h"
     78  1.1  bouyer #include "extern.h"
     79  1.1  bouyer 
     80  1.1  bouyer void
     81  1.1  bouyer pass3()
     82  1.1  bouyer {
     83  1.2   lukem 	struct inoinfo **inpp, *inp;
     84  1.1  bouyer 	ino_t orphan;
     85  1.1  bouyer 	int loopcnt;
     86  1.1  bouyer 
     87  1.1  bouyer 	for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) {
     88  1.1  bouyer 		inp = *inpp;
     89  1.1  bouyer 		if (inp->i_number == EXT2_ROOTINO ||
     90  1.1  bouyer 		    !(inp->i_parent == 0 || statemap[inp->i_number] == DSTATE))
     91  1.1  bouyer 			continue;
     92  1.1  bouyer 		if (statemap[inp->i_number] == DCLEAR)
     93  1.1  bouyer 			continue;
     94  1.1  bouyer 		for (loopcnt = 0; ; loopcnt++) {
     95  1.1  bouyer 			orphan = inp->i_number;
     96  1.1  bouyer 			if (inp->i_parent == 0 ||
     97  1.1  bouyer 			    statemap[inp->i_parent] != DSTATE ||
     98  1.1  bouyer 			    loopcnt > numdirs)
     99  1.1  bouyer 				break;
    100  1.1  bouyer 			inp = getinoinfo(inp->i_parent);
    101  1.1  bouyer 		}
    102  1.1  bouyer 		(void)linkup(orphan, inp->i_dotdot);
    103  1.1  bouyer 		inp->i_parent = inp->i_dotdot = lfdir;
    104  1.1  bouyer 		lncntp[lfdir]--;
    105  1.1  bouyer 		statemap[orphan] = DFOUND;
    106  1.1  bouyer 		propagate();
    107  1.1  bouyer 	}
    108  1.1  bouyer }
    109