1 /* $NetBSD: pass4.c,v 1.18 2003/08/07 10:04:21 agc Exp $ */ 2 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 #include <sys/cdefs.h> 33 #ifndef lint 34 #if 0 35 static char sccsid[] = "@(#)pass4.c 8.4 (Berkeley) 4/28/95"; 36 #else 37 __RCSID("$NetBSD: pass4.c,v 1.18 2003/08/07 10:04:21 agc Exp $"); 38 #endif 39 #endif /* not lint */ 40 41 #include <sys/param.h> 42 #include <sys/time.h> 43 44 #include <ufs/ufs/dinode.h> 45 #include <ufs/ffs/fs.h> 46 47 #include <err.h> 48 #include <stdlib.h> 49 #include <string.h> 50 51 #include "fsutil.h" 52 #include "fsck.h" 53 #include "extern.h" 54 55 void 56 pass4() 57 { 58 ino_t inumber; 59 struct zlncnt *zlnp; 60 union dinode *dp; 61 struct inodesc idesc; 62 int n, i, cg; 63 struct inostat *info; 64 65 memset(&idesc, 0, sizeof(struct inodesc)); 66 idesc.id_type = ADDR; 67 idesc.id_func = pass4check; 68 69 for (cg = 0; cg < sblock->fs_ncg; cg++) { 70 if (got_siginfo) { 71 fprintf(stderr, 72 "%s: phase 4: cyl group %d of %d (%d%%)\n", 73 cdevname(), cg, sblock->fs_ncg, 74 cg * 100 / sblock->fs_ncg); 75 got_siginfo = 0; 76 } 77 inumber = cg * sblock->fs_ipg; 78 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) { 79 if (inumber < ROOTINO) 80 continue; 81 info = inoinfo(inumber); 82 idesc.id_number = inumber; 83 switch (info->ino_state) { 84 case FSTATE: 85 case DFOUND: 86 n = info->ino_linkcnt; 87 if (n) { 88 adjust(&idesc, (short)n); 89 break; 90 } 91 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) 92 if (zlnp->zlncnt == inumber) { 93 zlnp->zlncnt = zlnhead->zlncnt; 94 zlnp = zlnhead; 95 zlnhead = zlnhead->next; 96 free((char *)zlnp); 97 clri(&idesc, "UNREF", 1); 98 break; 99 } 100 break; 101 102 case DSTATE: 103 clri(&idesc, "UNREF", 1); 104 break; 105 106 case DCLEAR: 107 dp = ginode(inumber); 108 if (DIP(dp, size) == 0) { 109 clri(&idesc, "ZERO LENGTH", 1); 110 break; 111 } 112 /* fall through */ 113 case FCLEAR: 114 clri(&idesc, "BAD/DUP", 1); 115 break; 116 117 case USTATE: 118 break; 119 120 default: 121 errx(EEXIT, "BAD STATE %d FOR INODE I=%d", 122 info->ino_state, inumber); 123 } 124 } 125 } 126 } 127 128 int 129 pass4check(idesc) 130 struct inodesc *idesc; 131 { 132 struct dups *dlp; 133 int nfrags, res = KEEPON; 134 daddr_t blkno = idesc->id_blkno; 135 136 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 137 if (chkrange(blkno, 1)) { 138 res = SKIP; 139 } else if (testbmap(blkno)) { 140 for (dlp = duplist; dlp; dlp = dlp->next) { 141 if (dlp->dup != blkno) 142 continue; 143 dlp->dup = duplist->dup; 144 dlp = duplist; 145 duplist = duplist->next; 146 free((char *)dlp); 147 break; 148 } 149 if (dlp == 0) { 150 clrbmap(blkno); 151 n_blks--; 152 } 153 } 154 } 155 return (res); 156 } 157