pass4.c revision 1.4
1 /* $NetBSD: pass4.c,v 1.4 2003/10/05 17:48:49 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 REGENTS AND CONTRIBUTORS ``AS IS'' AND 50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 59 * SUCH DAMAGE. 60 */ 61 62 #include <sys/cdefs.h> 63 #ifndef lint 64 #if 0 65 static char sccsid[] = "@(#)pass4.c 8.1 (Berkeley) 6/5/93"; 66 #else 67 __RCSID("$NetBSD: pass4.c,v 1.4 2003/10/05 17:48:49 bouyer Exp $"); 68 #endif 69 #endif /* not lint */ 70 71 #include <sys/param.h> 72 #include <sys/time.h> 73 #include <ufs/ext2fs/ext2fs_dinode.h> 74 #include <ufs/ext2fs/ext2fs.h> 75 #include <stdlib.h> 76 #include <string.h> 77 78 #include "fsutil.h" 79 #include "fsck.h" 80 #include "extern.h" 81 82 void 83 pass4() 84 { 85 ino_t inumber; 86 struct zlncnt *zlnp; 87 struct ext2fs_dinode *dp; 88 struct inodesc idesc; 89 int n; 90 91 memset(&idesc, 0, sizeof(struct inodesc)); 92 idesc.id_type = ADDR; 93 idesc.id_func = pass4check; 94 for (inumber = EXT2_ROOTINO; inumber <= lastino; inumber++) { 95 if (inumber < EXT2_FIRSTINO && inumber > EXT2_ROOTINO) 96 continue; 97 idesc.id_number = inumber; 98 switch (statemap[inumber]) { 99 100 case FSTATE: 101 case DFOUND: 102 n = lncntp[inumber]; 103 if (n) 104 adjust(&idesc, (short)n); 105 else { 106 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) 107 if (zlnp->zlncnt == inumber) { 108 zlnp->zlncnt = zlnhead->zlncnt; 109 zlnp = zlnhead; 110 zlnhead = zlnhead->next; 111 free((char *)zlnp); 112 clri(&idesc, "UNREF", 1); 113 break; 114 } 115 } 116 break; 117 118 case DSTATE: 119 clri(&idesc, "UNREF", 1); 120 break; 121 122 case DCLEAR: 123 dp = ginode(inumber); 124 if (dp->e2di_size == 0) { 125 clri(&idesc, "ZERO LENGTH", 1); 126 break; 127 } 128 /* fall through */ 129 case FCLEAR: 130 clri(&idesc, "BAD/DUP", 1); 131 break; 132 133 case USTATE: 134 break; 135 136 default: 137 errexit("BAD STATE %d FOR INODE I=%d\n", 138 statemap[inumber], inumber); 139 } 140 } 141 } 142 143 int 144 pass4check(idesc) 145 struct inodesc *idesc; 146 { 147 struct dups *dlp; 148 int nfrags, res = KEEPON; 149 daddr_t blkno = idesc->id_blkno; 150 151 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 152 if (chkrange(blkno, 1)) { 153 res = SKIP; 154 } else if (testbmap(blkno)) { 155 for (dlp = duplist; dlp; dlp = dlp->next) { 156 if (dlp->dup != blkno) 157 continue; 158 dlp->dup = duplist->dup; 159 dlp = duplist; 160 duplist = duplist->next; 161 free((char *)dlp); 162 break; 163 } 164 if (dlp == 0) { 165 clrbmap(blkno); 166 n_blks--; 167 } 168 } 169 } 170 return (res); 171 } 172
Indexes created Tue Sep 23 14:10:03 GMT 2025