1 /* 2 * Copyright (c) 1980, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 #if 0 36 static const char sccsid[] = "@(#)pass3.c 8.2 (Berkeley) 4/27/95"; 37 #endif 38 static const char rcsid[] = 39 "$FreeBSD$"; 40 #endif /* not lint */ 41 42 #include <sys/param.h> 43 44 #include <ufs/ufs/dinode.h> 45 #include <ufs/ufs/dir.h> 46 #include <ufs/ffs/fs.h> 47 48 #include <string.h> 49 50 #include "fsck.h" 51 52 void 53 pass3(void) 54 { 55 struct inoinfo *inp; 56 int loopcnt, inpindex, state; 57 ino_t orphan; 58 struct inodesc idesc; 59 char namebuf[MAXNAMLEN+1]; 60 61 for (inpindex = inplast - 1; inpindex >= 0; inpindex--) { 62 if (got_siginfo) { 63 printf("%s: phase 3: dir %d of %d (%d%%)\n", cdevname, 64 (int)(inplast - inpindex - 1), (int)inplast, 65 (int)((inplast - inpindex - 1) * 100 / inplast)); 66 got_siginfo = 0; 67 } 68 inp = inpsort[inpindex]; 69 state = inoinfo(inp->i_number)->ino_state; 70 if (inp->i_number == ROOTINO || 71 (inp->i_parent != 0 && state != DSTATE)) 72 continue; 73 if (state == DCLEAR) 74 continue; 75 /* 76 * If we are running with soft updates and we come 77 * across unreferenced directories, we just leave 78 * them in DSTATE which will cause them to be pitched 79 * in pass 4. 80 */ 81 if ((preen || bkgrdflag) && 82 resolved && usedsoftdep && state == DSTATE) { 83 if (inp->i_dotdot >= ROOTINO) 84 inoinfo(inp->i_dotdot)->ino_linkcnt++; 85 continue; 86 } 87 for (loopcnt = 0; ; loopcnt++) { 88 orphan = inp->i_number; 89 if (inp->i_parent == 0 || 90 inoinfo(inp->i_parent)->ino_state != DSTATE || 91 loopcnt > countdirs) 92 break; 93 inp = getinoinfo(inp->i_parent); 94 } 95 if (loopcnt <= countdirs) { 96 if (linkup(orphan, inp->i_dotdot, NULL)) { 97 inp->i_parent = inp->i_dotdot = lfdir; 98 inoinfo(lfdir)->ino_linkcnt--; 99 } 100 inoinfo(orphan)->ino_state = DFOUND; 101 propagate(); 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 if ((ckinode(ginode(inp->i_parent), &idesc) & FOUND) == 0) 115 pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY"); 116 if (linkup(orphan, inp->i_parent, namebuf)) { 117 idesc.id_func = clearentry; 118 if (ckinode(ginode(inp->i_parent), &idesc) & FOUND) 119 inoinfo(orphan)->ino_linkcnt++; 120 inp->i_parent = inp->i_dotdot = lfdir; 121 inoinfo(lfdir)->ino_linkcnt--; 122 } 123 inoinfo(orphan)->ino_state = DFOUND; 124 propagate(); 125 } 126 } 127