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