Home | History | Annotate | Line # | Download | only in fsck_ext2fs
pass1b.c revision 1.3 
      1 /*	$NetBSD: pass1b.c,v 1.3 2003/08/07 10:04:18 agc Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1980, 1986, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 /*
     33  * Copyright (c) 1997 Manuel Bouyer.
     34  *
     35  * Redistribution and use in source and binary forms, with or without
     36  * modification, are permitted provided that the following conditions
     37  * are met:
     38  * 1. Redistributions of source code must retain the above copyright
     39  *    notice, this list of conditions and the following disclaimer.
     40  * 2. Redistributions in binary form must reproduce the above copyright
     41  *    notice, this list of conditions and the following disclaimer in the
     42  *    documentation and/or other materials provided with the distribution.
     43  * 3. All advertising materials mentioning features or use of this software
     44  *    must display the following acknowledgement:
     45  *	This product includes software developed by the University of
     46  *	California, Berkeley and its contributors.
     47  * 4. Neither the name of the University nor the names of its contributors
     48  *    may be used to endorse or promote products derived from this software
     49  *    without specific prior written permission.
     50  *
     51  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     52  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     53  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     54  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     55  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     56  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     57  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     58  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     59  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     60  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     61  * SUCH DAMAGE.
     62  */
     63 
     64 #include <sys/cdefs.h>
     65 #ifndef lint
     66 #if 0
     67 static char sccsid[] = "@(#)pass1b.c	8.1 (Berkeley) 6/5/93";
     68 #else
     69 __RCSID("$NetBSD: pass1b.c,v 1.3 2003/08/07 10:04:18 agc Exp $");
     70 #endif
     71 #endif /* not lint */
     72 
     73 #include <sys/param.h>
     74 #include <sys/time.h>
     75 #include <ufs/ext2fs/ext2fs_dinode.h>
     76 #include <ufs/ext2fs/ext2fs.h>
     77 
     78 #include <string.h>
     79 #include "fsck.h"
     80 #include "extern.h"
     81 
     82 static int	pass1bcheck __P((struct inodesc *));
     83 static  struct dups *duphead;
     84 
     85 void
     86 pass1b()
     87 {
     88 	int c, i;
     89 	struct ext2fs_dinode *dp;
     90 	struct inodesc idesc;
     91 	ino_t inumber;
     92 
     93 	memset(&idesc, 0, sizeof(struct inodesc));
     94 	idesc.id_type = ADDR;
     95 	idesc.id_func = pass1bcheck;
     96 	duphead = duplist;
     97 	inumber = 0;
     98 	for (c = 0; c < sblock.e2fs_ncg; c++) {
     99 		for (i = 0; i < sblock.e2fs.e2fs_ipg; i++, inumber++) {
    100 			if ((inumber < EXT2_FIRSTINO) && (inumber != EXT2_ROOTINO))
    101 				continue;
    102 			dp = ginode(inumber);
    103 			if (dp == NULL)
    104 				continue;
    105 			idesc.id_number = inumber;
    106 			if (statemap[inumber] != USTATE &&
    107 			    (ckinode(dp, &idesc) & STOP))
    108 				return;
    109 		}
    110 	}
    111 }
    112 
    113 static int
    114 pass1bcheck(idesc)
    115 	struct inodesc *idesc;
    116 {
    117 	struct dups *dlp;
    118 	int nfrags, res = KEEPON;
    119 	daddr_t blkno = idesc->id_blkno;
    120 
    121 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
    122 		if (chkrange(blkno, 1))
    123 			res = SKIP;
    124 		for (dlp = duphead; dlp; dlp = dlp->next) {
    125 			if (dlp->dup == blkno) {
    126 				blkerror(idesc->id_number, "DUP", blkno);
    127 				dlp->dup = duphead->dup;
    128 				duphead->dup = blkno;
    129 				duphead = duphead->next;
    130 			}
    131 			if (dlp == muldup)
    132 				break;
    133 		}
    134 		if (muldup == 0 || duphead == muldup->next)
    135 			return (STOP);
    136 	}
    137 	return (res);
    138 }
    139