pass4.c revision 1.17 1 1.17 fvdl /* $NetBSD: pass4.c,v 1.17 2003/04/02 10:39:26 fvdl Exp $ */
2 1.9 cgd
3 1.1 cgd /*
4 1.6 mycroft * Copyright (c) 1980, 1986, 1993
5 1.6 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.12 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.9 cgd #if 0
39 1.13 lukem static char sccsid[] = "@(#)pass4.c 8.4 (Berkeley) 4/28/95";
40 1.9 cgd #else
41 1.17 fvdl __RCSID("$NetBSD: pass4.c,v 1.17 2003/04/02 10:39:26 fvdl Exp $");
42 1.9 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include <sys/param.h>
46 1.5 cgd #include <sys/time.h>
47 1.13 lukem
48 1.6 mycroft #include <ufs/ufs/dinode.h>
49 1.6 mycroft #include <ufs/ffs/fs.h>
50 1.13 lukem
51 1.13 lukem #include <err.h>
52 1.14 lukem #include <stdlib.h>
53 1.1 cgd #include <string.h>
54 1.10 christos
55 1.11 christos #include "fsutil.h"
56 1.1 cgd #include "fsck.h"
57 1.8 cgd #include "extern.h"
58 1.1 cgd
59 1.8 cgd void
60 1.1 cgd pass4()
61 1.1 cgd {
62 1.12 lukem ino_t inumber;
63 1.12 lukem struct zlncnt *zlnp;
64 1.17 fvdl union dinode *dp;
65 1.1 cgd struct inodesc idesc;
66 1.17 fvdl int n, i, cg;
67 1.17 fvdl struct inostat *info;
68 1.1 cgd
69 1.7 mycroft memset(&idesc, 0, sizeof(struct inodesc));
70 1.1 cgd idesc.id_type = ADDR;
71 1.1 cgd idesc.id_func = pass4check;
72 1.17 fvdl
73 1.17 fvdl for (cg = 0; cg < sblock->fs_ncg; cg++) {
74 1.15 lukem if (got_siginfo) {
75 1.15 lukem fprintf(stderr,
76 1.15 lukem "%s: phase 4: cyl group %d of %d (%d%%)\n",
77 1.17 fvdl cdevname(), cg, sblock->fs_ncg,
78 1.17 fvdl cg * 100 / sblock->fs_ncg);
79 1.15 lukem got_siginfo = 0;
80 1.15 lukem }
81 1.17 fvdl inumber = cg * sblock->fs_ipg;
82 1.17 fvdl for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
83 1.17 fvdl if (inumber < ROOTINO)
84 1.17 fvdl continue;
85 1.17 fvdl info = inoinfo(inumber);
86 1.17 fvdl idesc.id_number = inumber;
87 1.17 fvdl switch (info->ino_state) {
88 1.17 fvdl case FSTATE:
89 1.17 fvdl case DFOUND:
90 1.17 fvdl n = info->ino_linkcnt;
91 1.17 fvdl if (n) {
92 1.17 fvdl adjust(&idesc, (short)n);
93 1.17 fvdl break;
94 1.17 fvdl }
95 1.1 cgd for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
96 1.1 cgd if (zlnp->zlncnt == inumber) {
97 1.1 cgd zlnp->zlncnt = zlnhead->zlncnt;
98 1.1 cgd zlnp = zlnhead;
99 1.1 cgd zlnhead = zlnhead->next;
100 1.1 cgd free((char *)zlnp);
101 1.1 cgd clri(&idesc, "UNREF", 1);
102 1.1 cgd break;
103 1.1 cgd }
104 1.17 fvdl break;
105 1.17 fvdl
106 1.17 fvdl case DSTATE:
107 1.17 fvdl clri(&idesc, "UNREF", 1);
108 1.17 fvdl break;
109 1.17 fvdl
110 1.17 fvdl case DCLEAR:
111 1.17 fvdl dp = ginode(inumber);
112 1.17 fvdl if (DIP(dp, size) == 0) {
113 1.17 fvdl clri(&idesc, "ZERO LENGTH", 1);
114 1.17 fvdl break;
115 1.17 fvdl }
116 1.17 fvdl /* fall through */
117 1.17 fvdl case FCLEAR:
118 1.17 fvdl clri(&idesc, "BAD/DUP", 1);
119 1.17 fvdl break;
120 1.1 cgd
121 1.17 fvdl case USTATE:
122 1.1 cgd break;
123 1.17 fvdl
124 1.17 fvdl default:
125 1.17 fvdl errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
126 1.17 fvdl info->ino_state, inumber);
127 1.1 cgd }
128 1.1 cgd }
129 1.1 cgd }
130 1.1 cgd }
131 1.1 cgd
132 1.8 cgd int
133 1.1 cgd pass4check(idesc)
134 1.12 lukem struct inodesc *idesc;
135 1.1 cgd {
136 1.12 lukem struct dups *dlp;
137 1.1 cgd int nfrags, res = KEEPON;
138 1.16 fvdl daddr_t blkno = idesc->id_blkno;
139 1.1 cgd
140 1.1 cgd for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
141 1.1 cgd if (chkrange(blkno, 1)) {
142 1.1 cgd res = SKIP;
143 1.1 cgd } else if (testbmap(blkno)) {
144 1.1 cgd for (dlp = duplist; dlp; dlp = dlp->next) {
145 1.1 cgd if (dlp->dup != blkno)
146 1.1 cgd continue;
147 1.1 cgd dlp->dup = duplist->dup;
148 1.1 cgd dlp = duplist;
149 1.1 cgd duplist = duplist->next;
150 1.1 cgd free((char *)dlp);
151 1.1 cgd break;
152 1.1 cgd }
153 1.1 cgd if (dlp == 0) {
154 1.1 cgd clrbmap(blkno);
155 1.1 cgd n_blks--;
156 1.1 cgd }
157 1.1 cgd }
158 1.1 cgd }
159 1.1 cgd return (res);
160 1.1 cgd }
161