xref: /freebsd/sbin/fsck_ffs/pass3.c (revision 3c4ba5f55438f7afd4f4b0b56f88f2bb505fd6a6)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
3  *
4  * Copyright (c) 1980, 1986, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
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.
18  *
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.
30  */
31 
32 #if 0
33 #ifndef lint
34 static const char sccsid[] = "@(#)pass3.c	8.2 (Berkeley) 4/27/95";
35 #endif /* not lint */
36 #endif
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
39 
40 #include <sys/param.h>
41 
42 #include <ufs/ufs/dinode.h>
43 #include <ufs/ufs/dir.h>
44 #include <ufs/ffs/fs.h>
45 
46 #include <string.h>
47 
48 #include "fsck.h"
49 
50 void
51 pass3(void)
52 {
53 	struct inoinfo *inp;
54 	int loopcnt, inpindex, state;
55 	ino_t orphan;
56 	struct inode ip;
57 	struct inodesc idesc;
58 	char namebuf[UFS_MAXNAMLEN+1];
59 
60 	for (inpindex = inplast - 1; inpindex >= 0; inpindex--) {
61 		if (got_siginfo) {
62 			printf("%s: phase 3: dir %d of %d (%d%%)\n", cdevname,
63 			    (int)(inplast - inpindex - 1), (int)inplast,
64 			    (int)((inplast - inpindex - 1) * 100 / inplast));
65 			got_siginfo = 0;
66 		}
67 		if (got_sigalarm) {
68 			setproctitle("%s p3 %d%%", cdevname,
69 			    (int)((inplast - inpindex - 1) * 100 / inplast));
70 			got_sigalarm = 0;
71 		}
72 		inp = inpsort[inpindex];
73 		state = inoinfo(inp->i_number)->ino_state;
74 		if (inp->i_number == UFS_ROOTINO ||
75 		    (inp->i_parent != 0 && !S_IS_DUNFOUND(state)))
76 			continue;
77 		if (state == DCLEAR || state == DZLINK)
78 			continue;
79 		/*
80 		 * If we are running with soft updates and we come
81 		 * across unreferenced directories, we just leave
82 		 * them in DSTATE which will cause them to be pitched
83 		 * in pass 4.
84 		 */
85 		if ((preen || bkgrdflag) &&
86 		    resolved && usedsoftdep && S_IS_DUNFOUND(state)) {
87 			if (inp->i_dotdot >= UFS_ROOTINO)
88 				inoinfo(inp->i_dotdot)->ino_linkcnt++;
89 			continue;
90 		}
91 		for (loopcnt = 0; ; loopcnt++) {
92 			orphan = inp->i_number;
93 			if (inp->i_parent == 0 ||
94 			    !INO_IS_DUNFOUND(inp->i_parent) ||
95 			    loopcnt > countdirs)
96 				break;
97 			inp = getinoinfo(inp->i_parent);
98 		}
99 		if (loopcnt <= countdirs) {
100 			if (linkup(orphan, inp->i_dotdot, NULL)) {
101 				inp->i_parent = inp->i_dotdot = lfdir;
102 				inoinfo(lfdir)->ino_linkcnt--;
103 			}
104 			inoinfo(orphan)->ino_state = DFOUND;
105 			check_dirdepth(inp);
106 			propagate();
107 			continue;
108 		}
109 		pfatal("ORPHANED DIRECTORY LOOP DETECTED I=%lu",
110 		    (u_long)orphan);
111 		if (reply("RECONNECT") == 0)
112 			continue;
113 		memset(&idesc, 0, sizeof(struct inodesc));
114 		idesc.id_type = DATA;
115 		idesc.id_number = inp->i_parent;
116 		idesc.id_parent = orphan;
117 		idesc.id_func = findname;
118 		idesc.id_name = namebuf;
119 		ginode(inp->i_parent, &ip);
120 		if ((ckinode(ip.i_dp, &idesc) & FOUND) == 0)
121 			pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY");
122 		if (linkup(orphan, inp->i_parent, namebuf)) {
123 			idesc.id_func = clearentry;
124 			if (ckinode(ip.i_dp, &idesc) & FOUND)
125 				inoinfo(orphan)->ino_linkcnt++;
126 			inp->i_parent = inp->i_dotdot = lfdir;
127 			inoinfo(lfdir)->ino_linkcnt--;
128 		}
129 		irelse(&ip);
130 		inoinfo(orphan)->ino_state = DFOUND;
131 		check_dirdepth(inp);
132 		propagate();
133 	}
134 }
135