1 /*        $NetBSD: pass1b.c,v 1.8 2009/10/19 18:41:08 bouyer 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  *
44  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
45  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
46  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
47  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
48  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
49  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
50  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
51  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
52  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
53  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
54  */
55 
56 #include <sys/cdefs.h>
57 #ifndef lint
58 #if 0
59 static char sccsid[] = "@(#)pass1b.c    8.1 (Berkeley) 6/5/93";
60 #else
61 __RCSID("$NetBSD: pass1b.c,v 1.8 2009/10/19 18:41:08 bouyer Exp $");
62 #endif
63 #endif /* not lint */
64 
65 #include <sys/param.h>
66 #include <sys/time.h>
67 #include <ufs/ext2fs/ext2fs_dinode.h>
68 #include <ufs/ext2fs/ext2fs.h>
69 
70 #include <string.h>
71 #include "fsck.h"
72 #include "extern.h"
73 
74 static int          pass1bcheck(struct inodesc *);
75 static struct       dups *duphead;
76 
77 void
pass1b(void)78 pass1b(void)
79 {
80           int c;
81           uint32_t i;
82           struct ext2fs_dinode *dp;
83           struct inodesc idesc;
84           ino_t inumber;
85 
86           memset(&idesc, 0, sizeof(struct inodesc));
87           idesc.id_type = ADDR;
88           idesc.id_func = pass1bcheck;
89           duphead = duplist;
90           inumber = 0;
91           for (c = 0; c < sblock.e2fs_ncg; c++) {
92                     for (i = 0; i < sblock.e2fs.e2fs_ipg; i++, inumber++) {
93                               if ((inumber < EXT2_FIRSTINO) && (inumber != EXT2_ROOTINO))
94                                         continue;
95                               dp = ginode(inumber);
96                               if (dp == NULL)
97                                         continue;
98                               idesc.id_number = inumber;
99                               if (statemap[inumber] != USTATE &&
100                                   (ckinode(dp, &idesc) & STOP))
101                                         return;
102                     }
103           }
104 }
105 
106 static int
pass1bcheck(struct inodesc * idesc)107 pass1bcheck(struct inodesc *idesc)
108 {
109           struct dups *dlp;
110           int nfrags, res = KEEPON;
111           daddr_t blkno = idesc->id_blkno;
112 
113           for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
114                     if (chkrange(blkno, 1))
115                               res = SKIP;
116                     for (dlp = duphead; dlp; dlp = dlp->next) {
117                               if (dlp->dup == blkno) {
118                                         blkerror(idesc->id_number, "DUP", blkno);
119                                         dlp->dup = duphead->dup;
120                                         duphead->dup = blkno;
121                                         duphead = duphead->next;
122                               }
123                               if (dlp == muldup)
124                                         break;
125                     }
126                     if (muldup == 0 || duphead == muldup->next)
127                               return (STOP);
128           }
129           return (res);
130 }
131