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 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30 #if 0 31 #ifndef lint 32 static const char sccsid[] = "@(#)pass4.c 8.4 (Berkeley) 4/28/95"; 33 #endif /* not lint */ 34 #endif 35 #include <sys/cdefs.h> 36 __FBSDID("$FreeBSD$"); 37 38 #include <sys/param.h> 39 40 #include <ufs/ufs/dinode.h> 41 #include <ufs/ffs/fs.h> 42 43 #include <err.h> 44 #include <string.h> 45 46 #include "fsck.h" 47 48 void 49 pass4(void) 50 { 51 ino_t inumber; 52 struct zlncnt *zlnp; 53 union dinode *dp; 54 struct inodesc idesc; 55 int i, n, cg; 56 57 memset(&idesc, 0, sizeof(struct inodesc)); 58 idesc.id_type = ADDR; 59 idesc.id_func = pass4check; 60 for (cg = 0; cg < sblock.fs_ncg; cg++) { 61 if (got_siginfo) { 62 printf("%s: phase 4: cyl group %d of %d (%d%%)\n", 63 cdevname, cg, sblock.fs_ncg, 64 cg * 100 / sblock.fs_ncg); 65 got_siginfo = 0; 66 } 67 if (got_sigalarm) { 68 setproctitle("%s p4 %d%%", cdevname, 69 cg * 100 / sblock.fs_ncg); 70 got_sigalarm = 0; 71 } 72 inumber = cg * sblock.fs_ipg; 73 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) { 74 if (inumber < ROOTINO) 75 continue; 76 idesc.id_number = inumber; 77 switch (inoinfo(inumber)->ino_state) { 78 79 case FSTATE: 80 case DFOUND: 81 n = inoinfo(inumber)->ino_linkcnt; 82 if (n) { 83 adjust(&idesc, (short)n); 84 break; 85 } 86 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) { 87 if (zlnp->zlncnt == inumber) { 88 zlnp->zlncnt = zlnhead->zlncnt; 89 zlnp = zlnhead; 90 zlnhead = zlnhead->next; 91 free((char *)zlnp); 92 clri(&idesc, "UNREF", 1); 93 break; 94 } 95 } 96 break; 97 98 case DSTATE: 99 clri(&idesc, "UNREF", 1); 100 break; 101 102 case DCLEAR: 103 dp = ginode(inumber); 104 if (DIP(dp, di_size) == 0) { 105 clri(&idesc, "ZERO LENGTH", 1); 106 break; 107 } 108 /* fall through */ 109 case FCLEAR: 110 clri(&idesc, "BAD/DUP", 1); 111 break; 112 113 case USTATE: 114 break; 115 116 default: 117 errx(EEXIT, "BAD STATE %d FOR INODE I=%d", 118 inoinfo(inumber)->ino_state, inumber); 119 } 120 } 121 } 122 } 123 124 int 125 pass4check(struct inodesc *idesc) 126 { 127 struct dups *dlp; 128 int nfrags, res = KEEPON; 129 ufs2_daddr_t blkno = idesc->id_blkno; 130 131 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 132 if (chkrange(blkno, 1)) { 133 res = SKIP; 134 } else if (testbmap(blkno)) { 135 for (dlp = duplist; dlp; dlp = dlp->next) { 136 if (dlp->dup != blkno) 137 continue; 138 dlp->dup = duplist->dup; 139 dlp = duplist; 140 duplist = duplist->next; 141 free((char *)dlp); 142 break; 143 } 144 if (dlp == 0) { 145 clrbmap(blkno); 146 n_blks--; 147 } 148 } 149 } 150 return (res); 151 } 152