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