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 static const char sccsid[] = "@(#)pass3.c 8.2 (Berkeley) 4/27/95"; 36 #endif /* not lint */ 37 38 #include <sys/param.h> 39 #include <sys/time.h> 40 41 #include <ufs/ufs/dinode.h> 42 #include <ufs/ufs/dir.h> 43 #include <ufs/ffs/fs.h> 44 45 #include <string.h> 46 47 #include "fsck.h" 48 49 void 50 pass3() 51 { 52 struct inoinfo *inp; 53 int loopcnt, inpindex, state; 54 ino_t orphan; 55 struct inodesc idesc; 56 char namebuf[MAXNAMLEN+1]; 57 58 for (inpindex = inplast - 1; inpindex >= 0; inpindex--) { 59 inp = inpsort[inpindex]; 60 state = inoinfo(inp->i_number)->ino_state; 61 if (inp->i_number == ROOTINO || 62 (inp->i_parent != 0 && state != DSTATE)) 63 continue; 64 if (state == DCLEAR) 65 continue; 66 /* 67 * If we are running with soft updates and we come 68 * across unreferenced directories, we just leave 69 * them in DSTATE which will cause them to be pitched 70 * in pass 4. 71 */ 72 if (preen && resolved && usedsoftdep && state == DSTATE) { 73 if (inp->i_dotdot >= ROOTINO) 74 inoinfo(inp->i_dotdot)->ino_linkcnt++; 75 continue; 76 } 77 for (loopcnt = 0; ; loopcnt++) { 78 orphan = inp->i_number; 79 if (inp->i_parent == 0 || 80 inoinfo(inp->i_parent)->ino_state != DSTATE || 81 loopcnt > countdirs) 82 break; 83 inp = getinoinfo(inp->i_parent); 84 } 85 if (loopcnt <= countdirs) { 86 if (linkup(orphan, inp->i_dotdot, NULL)) { 87 inp->i_parent = inp->i_dotdot = lfdir; 88 inoinfo(lfdir)->ino_linkcnt--; 89 } 90 inoinfo(orphan)->ino_state = DFOUND; 91 propagate(); 92 continue; 93 } 94 pfatal("ORPHANED DIRECTORY LOOP DETECTED I=%lu", orphan); 95 if (reply("RECONNECT") == 0) 96 continue; 97 memset(&idesc, 0, sizeof(struct inodesc)); 98 idesc.id_type = DATA; 99 idesc.id_number = inp->i_parent; 100 idesc.id_parent = orphan; 101 idesc.id_func = findname; 102 idesc.id_name = namebuf; 103 if ((ckinode(ginode(inp->i_parent), &idesc) & FOUND) == 0) 104 pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY"); 105 if (linkup(orphan, inp->i_parent, namebuf)) { 106 idesc.id_func = clearentry; 107 if (ckinode(ginode(inp->i_parent), &idesc) & FOUND) 108 inoinfo(orphan)->ino_linkcnt++; 109 inp->i_parent = inp->i_dotdot = lfdir; 110 inoinfo(lfdir)->ino_linkcnt--; 111 } 112 inoinfo(orphan)->ino_state = DFOUND; 113 propagate(); 114 } 115 } 116