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[] = "@(#)pass1b.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 <string.h> 45 46 #include "fsck.h" 47 48 static struct dups *duphead; 49 static int pass1bcheck __P((struct inodesc *)); 50 51 void 52 pass1b() 53 { 54 register int c, i; 55 register struct dinode *dp; 56 struct inodesc idesc; 57 ino_t inumber; 58 59 memset(&idesc, 0, sizeof(struct inodesc)); 60 idesc.id_type = ADDR; 61 idesc.id_func = pass1bcheck; 62 duphead = duplist; 63 inumber = 0; 64 for (c = 0; c < sblock.fs_ncg; c++) { 65 for (i = 0; i < sblock.fs_ipg; i++, inumber++) { 66 if (inumber < ROOTINO) 67 continue; 68 dp = ginode(inumber); 69 if (dp == NULL) 70 continue; 71 idesc.id_number = inumber; 72 if (statemap[inumber] != USTATE && 73 (ckinode(dp, &idesc) & STOP)) 74 return; 75 } 76 } 77 } 78 79 static int 80 pass1bcheck(idesc) 81 register struct inodesc *idesc; 82 { 83 register struct dups *dlp; 84 int nfrags, res = KEEPON; 85 ufs_daddr_t blkno = idesc->id_blkno; 86 87 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 88 if (chkrange(blkno, 1)) 89 res = SKIP; 90 for (dlp = duphead; dlp; dlp = dlp->next) { 91 if (dlp->dup == blkno) { 92 blkerror(idesc->id_number, "DUP", blkno); 93 dlp->dup = duphead->dup; 94 duphead->dup = blkno; 95 duphead = duphead->next; 96 } 97 if (dlp == muldup) 98 break; 99 } 100 if (muldup == 0 || duphead == muldup->next) 101 return (STOP); 102 } 103 return (res); 104 } 105