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