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 * @(#)pass3.c 8.2 (Berkeley) 4/27/95 34 * $FreeBSD: src/sbin/fsck/pass3.c,v 1.7.2.1 2001/01/23 23:11:07 iedowse Exp $ 35 * $DragonFly: src/sbin/fsck/pass3.c,v 1.6 2006/10/12 04:04:03 dillon Exp $ 36 */ 37 38 #include <sys/param.h> 39 40 #include <vfs/ufs/dinode.h> 41 #include <vfs/ufs/dir.h> 42 #include <vfs/ufs/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 ufs1_ino_t orphan; 54 struct inodesc idesc; 55 char namebuf[MAXNAMLEN+1]; 56 57 for (inpindex = inplast - 1; inpindex >= 0; inpindex--) { 58 if (got_siginfo) { 59 printf("%s: phase 3: dir %ld of %ld (%d%%)\n", cdevname, 60 inplast - inpindex - 1, inplast, 61 (int)((inplast - inpindex - 1) * 100 / inplast)); 62 got_siginfo = 0; 63 } 64 inp = inpsort[inpindex]; 65 state = inoinfo(inp->i_number)->ino_state; 66 if (inp->i_number == ROOTINO || 67 (inp->i_parent != 0 && state != DSTATE)) 68 continue; 69 if (state == DCLEAR) 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 && resolved && usedsoftdep && state == DSTATE) { 78 if (inp->i_dotdot >= ROOTINO) 79 inoinfo(inp->i_dotdot)->ino_linkcnt++; 80 continue; 81 } 82 for (loopcnt = 0; ; loopcnt++) { 83 orphan = inp->i_number; 84 if (inp->i_parent == 0 || 85 inoinfo(inp->i_parent)->ino_state != DSTATE || 86 loopcnt > countdirs) 87 break; 88 inp = getinoinfo(inp->i_parent); 89 } 90 if (loopcnt <= countdirs) { 91 if (linkup(orphan, inp->i_dotdot, NULL)) { 92 inp->i_parent = inp->i_dotdot = lfdir; 93 inoinfo(lfdir)->ino_linkcnt--; 94 } 95 inoinfo(orphan)->ino_state = DFOUND; 96 propagate(); 97 continue; 98 } 99 pfatal("ORPHANED DIRECTORY LOOP DETECTED I=%lu", orphan); 100 if (reply("RECONNECT") == 0) 101 continue; 102 memset(&idesc, 0, sizeof(struct inodesc)); 103 idesc.id_type = DATA; 104 idesc.id_number = inp->i_parent; 105 idesc.id_parent = orphan; 106 idesc.id_func = findname; 107 idesc.id_name = namebuf; 108 if ((ckinode(ginode(inp->i_parent), &idesc) & FOUND) == 0) 109 pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY"); 110 if (linkup(orphan, inp->i_parent, namebuf)) { 111 idesc.id_func = clearentry; 112 if (ckinode(ginode(inp->i_parent), &idesc) & FOUND) 113 inoinfo(orphan)->ino_linkcnt++; 114 inp->i_parent = inp->i_dotdot = lfdir; 115 inoinfo(lfdir)->ino_linkcnt--; 116 } 117 inoinfo(orphan)->ino_state = DFOUND; 118 propagate(); 119 } 120 } 121