Home | History | Annotate | Line # | Download | only in fsck_ffs
pass1b.c revision 1.6 
      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 char sccsid[] = "from: @(#)pass1b.c	8.1 (Berkeley) 6/5/93";*/
     36 static char *rcsid = "$Id: pass1b.c,v 1.6 1994/06/08 19:00:26 mycroft Exp $";
     37 #endif /* not lint */
     38 
     39 #include <sys/param.h>
     40 #include <sys/time.h>
     41 #include <ufs/ufs/dinode.h>
     42 #include <ufs/ffs/fs.h>
     43 #include <string.h>
     44 #include "fsck.h"
     45 
     46 int	pass1bcheck();
     47 static  struct dups *duphead;
     48 
     49 pass1b()
     50 {
     51 	register int c, i;
     52 	register struct dinode *dp;
     53 	struct inodesc idesc;
     54 	ino_t inumber;
     55 
     56 	bzero((char *)&idesc, sizeof(struct inodesc));
     57 	idesc.id_type = ADDR;
     58 	idesc.id_func = pass1bcheck;
     59 	duphead = duplist;
     60 	inumber = 0;
     61 	for (c = 0; c < sblock.fs_ncg; c++) {
     62 		for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
     63 			if (inumber < ROOTINO)
     64 				continue;
     65 			dp = ginode(inumber);
     66 			if (dp == NULL)
     67 				continue;
     68 			idesc.id_number = inumber;
     69 			if (statemap[inumber] != USTATE &&
     70 			    (ckinode(dp, &idesc) & STOP))
     71 				return;
     72 		}
     73 	}
     74 }
     75 
     76 pass1bcheck(idesc)
     77 	register struct inodesc *idesc;
     78 {
     79 	register struct dups *dlp;
     80 	int nfrags, res = KEEPON;
     81 	daddr_t blkno = idesc->id_blkno;
     82 
     83 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
     84 		if (chkrange(blkno, 1))
     85 			res = SKIP;
     86 		for (dlp = duphead; dlp; dlp = dlp->next) {
     87 			if (dlp->dup == blkno) {
     88 				blkerror(idesc->id_number, "DUP", blkno);
     89 				dlp->dup = duphead->dup;
     90 				duphead->dup = blkno;
     91 				duphead = duphead->next;
     92 			}
     93 			if (dlp == muldup)
     94 				break;
     95 		}
     96 		if (muldup == 0 || duphead == muldup->next)
     97 			return (STOP);
     98 	}
     99 	return (res);
    100 }
    101