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