Home | History | Annotate | Line # | Download | only in fsck_ext2fs
pass1b.c revision 1.1 
      1 /*	$NetBSD: pass1b.c,v 1.1 1997/06/11 11:21:53 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[] = "@(#)pass1b.c	8.1 (Berkeley) 6/5/93";
     40 #else
     41 static char rcsid[] = "$NetBSD: pass1b.c,v 1.1 1997/06/11 11:21:53 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 
     50 #include <string.h>
     51 #include "fsck.h"
     52 #include "extern.h"
     53 
     54 static int	pass1bcheck __P((struct inodesc *));
     55 static  struct dups *duphead;
     56 
     57 void
     58 pass1b()
     59 {
     60 	register int c, i;
     61 	register struct ext2fs_dinode *dp;
     62 	struct inodesc idesc;
     63 	ino_t inumber;
     64 
     65 	memset(&idesc, 0, sizeof(struct inodesc));
     66 	idesc.id_type = ADDR;
     67 	idesc.id_func = pass1bcheck;
     68 	duphead = duplist;
     69 	inumber = 0;
     70 	for (c = 0; c < sblock.e2fs_ncg; c++) {
     71 		for (i = 0; i < sblock.e2fs.e2fs_ipg; i++, inumber++) {
     72 			if ((inumber < EXT2_FIRSTINO) && (inumber != EXT2_ROOTINO))
     73 				continue;
     74 			dp = ginode(inumber);
     75 			if (dp == NULL)
     76 				continue;
     77 			idesc.id_number = inumber;
     78 			if (statemap[inumber] != USTATE &&
     79 			    (ckinode(dp, &idesc) & STOP))
     80 				return;
     81 		}
     82 	}
     83 }
     84 
     85 static int
     86 pass1bcheck(idesc)
     87 	register struct inodesc *idesc;
     88 {
     89 	register struct dups *dlp;
     90 	int nfrags, res = KEEPON;
     91 	daddr_t blkno = idesc->id_blkno;
     92 
     93 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
     94 		if (chkrange(blkno, 1))
     95 			res = SKIP;
     96 		for (dlp = duphead; dlp; dlp = dlp->next) {
     97 			if (dlp->dup == blkno) {
     98 				blkerror(idesc->id_number, "DUP", blkno);
     99 				dlp->dup = duphead->dup;
    100 				duphead->dup = blkno;
    101 				duphead = duphead->next;
    102 			}
    103 			if (dlp == muldup)
    104 				break;
    105 		}
    106 		if (muldup == 0 || duphead == muldup->next)
    107 			return (STOP);
    108 	}
    109 	return (res);
    110 }
    111