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