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