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