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