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