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