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