1 /* $NetBSD: pass4.c,v 1.5 2004/03/22 19:46:53 bouyer 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 /* 33 * Copyright (c) 1997 Manuel Bouyer. 34 * 35 * Redistribution and use in source and binary forms, with or without 36 * modification, are permitted provided that the following conditions 37 * are met: 38 * 1. Redistributions of source code must retain the above copyright 39 * notice, this list of conditions and the following disclaimer. 40 * 2. Redistributions in binary form must reproduce the above copyright 41 * notice, this list of conditions and the following disclaimer in the 42 * documentation and/or other materials provided with the distribution. 43 * 3. All advertising materials mentioning features or use of this software 44 * must display the following acknowledgement: 45 * This product includes software developed by Manuel Bouyer. 46 * 4. The name of the author may not be used to endorse or promote products 47 * derived from this software without specific prior written permission. 48 * 49 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 50 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 51 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 52 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 53 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 54 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 55 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 56 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 57 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 58 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 59 */ 60 61 #include <sys/cdefs.h> 62 #ifndef lint 63 #if 0 64 static char sccsid[] = "@(#)pass4.c 8.1 (Berkeley) 6/5/93"; 65 #else 66 __RCSID("$NetBSD: pass4.c,v 1.5 2004/03/22 19:46:53 bouyer Exp $"); 67 #endif 68 #endif /* not lint */ 69 70 #include <sys/param.h> 71 #include <sys/time.h> 72 #include <ufs/ext2fs/ext2fs_dinode.h> 73 #include <ufs/ext2fs/ext2fs.h> 74 #include <stdlib.h> 75 #include <string.h> 76 77 #include "fsutil.h" 78 #include "fsck.h" 79 #include "extern.h" 80 81 void 82 pass4() 83 { 84 ino_t inumber; 85 struct zlncnt *zlnp; 86 struct ext2fs_dinode *dp; 87 struct inodesc idesc; 88 int n; 89 90 memset(&idesc, 0, sizeof(struct inodesc)); 91 idesc.id_type = ADDR; 92 idesc.id_func = pass4check; 93 for (inumber = EXT2_ROOTINO; inumber <= lastino; inumber++) { 94 if (inumber < EXT2_FIRSTINO && inumber > EXT2_ROOTINO) 95 continue; 96 idesc.id_number = inumber; 97 switch (statemap[inumber]) { 98 99 case FSTATE: 100 case DFOUND: 101 n = lncntp[inumber]; 102 if (n) 103 adjust(&idesc, (short)n); 104 else { 105 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) 106 if (zlnp->zlncnt == inumber) { 107 zlnp->zlncnt = zlnhead->zlncnt; 108 zlnp = zlnhead; 109 zlnhead = zlnhead->next; 110 free((char *)zlnp); 111 clri(&idesc, "UNREF", 1); 112 break; 113 } 114 } 115 break; 116 117 case DSTATE: 118 clri(&idesc, "UNREF", 1); 119 break; 120 121 case DCLEAR: 122 dp = ginode(inumber); 123 if (dp->e2di_size == 0) { 124 clri(&idesc, "ZERO LENGTH", 1); 125 break; 126 } 127 /* fall through */ 128 case FCLEAR: 129 clri(&idesc, "BAD/DUP", 1); 130 break; 131 132 case USTATE: 133 break; 134 135 default: 136 errexit("BAD STATE %d FOR INODE I=%d\n", 137 statemap[inumber], inumber); 138 } 139 } 140 } 141 142 int 143 pass4check(idesc) 144 struct inodesc *idesc; 145 { 146 struct dups *dlp; 147 int nfrags, res = KEEPON; 148 daddr_t blkno = idesc->id_blkno; 149 150 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 151 if (chkrange(blkno, 1)) { 152 res = SKIP; 153 } else if (testbmap(blkno)) { 154 for (dlp = duplist; dlp; dlp = dlp->next) { 155 if (dlp->dup != blkno) 156 continue; 157 dlp->dup = duplist->dup; 158 dlp = duplist; 159 duplist = duplist->next; 160 free((char *)dlp); 161 break; 162 } 163 if (dlp == 0) { 164 clrbmap(blkno); 165 n_blks--; 166 } 167 } 168 } 169 return (res); 170 } 171