Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /* |
2 | * Copyright (c) 1980, 1986 The Regents of the University of California. | |
3 | * 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 | |
35 | static char sccsid[] = "@(#)pass4.c 5.10 (Berkeley) 7/20/90"; | |
78ed81a3 | 36 | static char rcsid[] = "$Header: /b/source/CVS/src/sbin/fsck/pass4.c,v 1.3 1993/03/23 00:28:07 cgd Exp $"; |
15637ed4 RG |
37 | #endif /* not lint */ |
38 | ||
39 | #include <sys/param.h> | |
40 | #include <ufs/dinode.h> | |
41 | #include <ufs/fs.h> | |
42 | #include <stdlib.h> | |
43 | #include <string.h> | |
44 | #include "fsck.h" | |
45 | ||
46 | int pass4check(); | |
47 | ||
48 | pass4() | |
49 | { | |
50 | register ino_t inumber; | |
51 | register struct zlncnt *zlnp; | |
52 | struct dinode *dp; | |
53 | struct inodesc idesc; | |
54 | int n; | |
55 | ||
56 | bzero((char *)&idesc, sizeof(struct inodesc)); | |
57 | idesc.id_type = ADDR; | |
58 | idesc.id_func = pass4check; | |
59 | for (inumber = ROOTINO; inumber <= lastino; inumber++) { | |
60 | idesc.id_number = inumber; | |
61 | switch (statemap[inumber]) { | |
62 | ||
63 | case FSTATE: | |
64 | case DFOUND: | |
65 | n = lncntp[inumber]; | |
66 | if (n) | |
67 | adjust(&idesc, (short)n); | |
68 | else { | |
69 | for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) | |
70 | if (zlnp->zlncnt == inumber) { | |
71 | zlnp->zlncnt = zlnhead->zlncnt; | |
72 | zlnp = zlnhead; | |
73 | zlnhead = zlnhead->next; | |
74 | free((char *)zlnp); | |
75 | clri(&idesc, "UNREF", 1); | |
76 | break; | |
77 | } | |
78 | } | |
79 | break; | |
80 | ||
81 | case DSTATE: | |
82 | clri(&idesc, "UNREF", 1); | |
83 | break; | |
84 | ||
85 | case DCLEAR: | |
86 | dp = ginode(inumber); | |
87 | if (dp->di_size == 0) { | |
88 | clri(&idesc, "ZERO LENGTH", 1); | |
89 | break; | |
90 | } | |
91 | /* fall through */ | |
92 | case FCLEAR: | |
93 | clri(&idesc, "BAD/DUP", 1); | |
94 | break; | |
95 | ||
96 | case USTATE: | |
97 | break; | |
98 | ||
99 | default: | |
100 | errexit("BAD STATE %d FOR INODE I=%d", | |
101 | statemap[inumber], inumber); | |
102 | } | |
103 | } | |
104 | } | |
105 | ||
106 | pass4check(idesc) | |
107 | register struct inodesc *idesc; | |
108 | { | |
109 | register 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 | } else if (testbmap(blkno)) { | |
117 | for (dlp = duplist; dlp; dlp = dlp->next) { | |
118 | if (dlp->dup != blkno) | |
119 | continue; | |
120 | dlp->dup = duplist->dup; | |
121 | dlp = duplist; | |
122 | duplist = duplist->next; | |
123 | free((char *)dlp); | |
124 | break; | |
125 | } | |
126 | if (dlp == 0) { | |
127 | clrbmap(blkno); | |
128 | n_blks--; | |
129 | } | |
130 | } | |
131 | } | |
132 | return (res); | |
133 | } |