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