pass4.c revision 1.29 1 1.29 chs /* $NetBSD: pass4.c,v 1.29 2023/01/07 19:41:29 chs 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.18 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.12 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.9 cgd #if 0
35 1.13 lukem static char sccsid[] = "@(#)pass4.c 8.4 (Berkeley) 4/28/95";
36 1.9 cgd #else
37 1.29 chs __RCSID("$NetBSD: pass4.c,v 1.29 2023/01/07 19:41:29 chs Exp $");
38 1.9 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #include <sys/param.h>
42 1.5 cgd #include <sys/time.h>
43 1.26 bouyer #include <sys/stat.h>
44 1.13 lukem
45 1.26 bouyer #include <ufs/ufs/ufs_bswap.h>
46 1.6 mycroft #include <ufs/ufs/dinode.h>
47 1.6 mycroft #include <ufs/ffs/fs.h>
48 1.26 bouyer #include <ufs/ffs/ffs_extern.h>
49 1.13 lukem
50 1.13 lukem #include <err.h>
51 1.14 lukem #include <stdlib.h>
52 1.1 cgd #include <string.h>
53 1.10 christos
54 1.11 christos #include "fsutil.h"
55 1.1 cgd #include "fsck.h"
56 1.8 cgd #include "extern.h"
57 1.1 cgd
58 1.8 cgd void
59 1.21 xtraeme pass4(void)
60 1.1 cgd {
61 1.12 lukem ino_t inumber;
62 1.12 lukem struct zlncnt *zlnp;
63 1.17 fvdl union dinode *dp;
64 1.1 cgd struct inodesc idesc;
65 1.29 chs int n, i;
66 1.29 chs uint32_t 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_func = pass4check;
71 1.17 fvdl
72 1.17 fvdl for (cg = 0; cg < sblock->fs_ncg; cg++) {
73 1.15 lukem if (got_siginfo) {
74 1.15 lukem fprintf(stderr,
75 1.15 lukem "%s: phase 4: cyl group %d of %d (%d%%)\n",
76 1.17 fvdl cdevname(), cg, sblock->fs_ncg,
77 1.17 fvdl cg * 100 / sblock->fs_ncg);
78 1.15 lukem got_siginfo = 0;
79 1.15 lukem }
80 1.20 christos #ifdef PROGRESS
81 1.19 christos progress_bar(cdevname(), preen ? NULL : "phase 4",
82 1.19 christos cg, sblock->fs_ncg);
83 1.20 christos #endif /* PROGRESS */
84 1.17 fvdl inumber = cg * sblock->fs_ipg;
85 1.17 fvdl for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
86 1.27 dholland if (inumber < UFS_ROOTINO)
87 1.17 fvdl continue;
88 1.26 bouyer dp = ginode(inumber);
89 1.17 fvdl info = inoinfo(inumber);
90 1.17 fvdl idesc.id_number = inumber;
91 1.26 bouyer idesc.id_uid = iswap32(DIP(dp, uid));
92 1.26 bouyer idesc.id_gid = iswap32(DIP(dp, gid));
93 1.26 bouyer if (iswap32(DIP(dp, flags)) & SF_SNAPSHOT)
94 1.26 bouyer idesc.id_type = SNAP;
95 1.26 bouyer else
96 1.26 bouyer idesc.id_type = ADDR;
97 1.17 fvdl switch (info->ino_state) {
98 1.17 fvdl case FSTATE:
99 1.17 fvdl case DFOUND:
100 1.17 fvdl n = info->ino_linkcnt;
101 1.17 fvdl if (n) {
102 1.25 simonb if (is_journal_inode(inumber)) {
103 1.25 simonb if (debug)
104 1.25 simonb printf(
105 1.25 simonb "skipping unreferenced journal inode %" PRId64 "\n", inumber);
106 1.25 simonb break;
107 1.26 bouyer } else if (is_quota_inode(inumber)) {
108 1.26 bouyer if (debug)
109 1.26 bouyer printf(
110 1.26 bouyer "skipping unreferenced quota inode %" PRId64 "\n", inumber);
111 1.26 bouyer break;
112 1.25 simonb } else {
113 1.25 simonb adjust(&idesc, (short)n);
114 1.25 simonb }
115 1.17 fvdl break;
116 1.17 fvdl }
117 1.1 cgd for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
118 1.1 cgd if (zlnp->zlncnt == inumber) {
119 1.1 cgd zlnp->zlncnt = zlnhead->zlncnt;
120 1.1 cgd zlnp = zlnhead;
121 1.1 cgd zlnhead = zlnhead->next;
122 1.1 cgd free((char *)zlnp);
123 1.1 cgd clri(&idesc, "UNREF", 1);
124 1.1 cgd break;
125 1.1 cgd }
126 1.17 fvdl break;
127 1.17 fvdl
128 1.17 fvdl case DSTATE:
129 1.17 fvdl clri(&idesc, "UNREF", 1);
130 1.17 fvdl break;
131 1.17 fvdl
132 1.17 fvdl case DCLEAR:
133 1.17 fvdl if (DIP(dp, size) == 0) {
134 1.17 fvdl clri(&idesc, "ZERO LENGTH", 1);
135 1.17 fvdl break;
136 1.17 fvdl }
137 1.17 fvdl /* fall through */
138 1.17 fvdl case FCLEAR:
139 1.17 fvdl clri(&idesc, "BAD/DUP", 1);
140 1.17 fvdl break;
141 1.1 cgd
142 1.17 fvdl case USTATE:
143 1.1 cgd break;
144 1.17 fvdl
145 1.17 fvdl default:
146 1.24 christos errexit("BAD STATE %d FOR INODE I=%llu",
147 1.22 christos info->ino_state,
148 1.22 christos (unsigned long long)inumber);
149 1.1 cgd }
150 1.1 cgd }
151 1.1 cgd }
152 1.20 christos #ifdef PROGRESS
153 1.23 apb if (!preen)
154 1.19 christos progress_done();
155 1.20 christos #endif /* PROGRESS */
156 1.1 cgd }
157 1.1 cgd
158 1.8 cgd int
159 1.21 xtraeme pass4check(struct inodesc *idesc)
160 1.1 cgd {
161 1.12 lukem struct dups *dlp;
162 1.26 bouyer int cg, nfrags, res = KEEPON;
163 1.16 fvdl daddr_t blkno = idesc->id_blkno;
164 1.26 bouyer struct cg *cgp = cgrp;
165 1.26 bouyer
166 1.26 bouyer cg = dtog(sblock, blkno);
167 1.26 bouyer getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize);
168 1.26 bouyer memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize);
169 1.26 bouyer if ((doswap && !needswap) || (!doswap && needswap))
170 1.26 bouyer ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock);
171 1.26 bouyer if (!cg_chkmagic(cgp, 0)) {
172 1.26 bouyer pwarn("CG %d: ALLOCBLK: BAD MAGIC NUMBER\n", cg);
173 1.26 bouyer cgp = NULL;
174 1.26 bouyer }
175 1.1 cgd
176 1.1 cgd for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
177 1.1 cgd if (chkrange(blkno, 1)) {
178 1.1 cgd res = SKIP;
179 1.1 cgd } else if (testbmap(blkno)) {
180 1.1 cgd for (dlp = duplist; dlp; dlp = dlp->next) {
181 1.1 cgd if (dlp->dup != blkno)
182 1.1 cgd continue;
183 1.1 cgd dlp->dup = duplist->dup;
184 1.1 cgd dlp = duplist;
185 1.1 cgd duplist = duplist->next;
186 1.1 cgd free((char *)dlp);
187 1.1 cgd break;
188 1.1 cgd }
189 1.1 cgd if (dlp == 0) {
190 1.1 cgd clrbmap(blkno);
191 1.26 bouyer if (cgp)
192 1.26 bouyer setbit(cg_blksfree(cgp, 0),
193 1.26 bouyer dtogd(sblock, blkno));
194 1.26 bouyer
195 1.1 cgd n_blks--;
196 1.26 bouyer if (idesc->id_type != SNAP) {
197 1.26 bouyer update_uquot(idesc->id_number,
198 1.26 bouyer idesc->id_uid, idesc->id_gid,
199 1.26 bouyer -btodb(sblock->fs_fsize), 0);
200 1.26 bouyer }
201 1.26 bouyer if (idesc->id_numfrags != sblock->fs_frag &&
202 1.26 bouyer cgp) {
203 1.26 bouyer cgp->cg_cs.cs_nffree ++;
204 1.26 bouyer sblock->fs_cstotal.cs_nffree ++;
205 1.26 bouyer sblock->fs_cs(fs, cg).cs_nffree ++;
206 1.26 bouyer }
207 1.1 cgd }
208 1.1 cgd }
209 1.1 cgd }
210 1.26 bouyer if (cgp && res != SKIP && idesc->id_numfrags == sblock->fs_frag) {
211 1.26 bouyer cgp->cg_cs.cs_nbfree++;
212 1.26 bouyer sblock->fs_cstotal.cs_nbfree++;
213 1.26 bouyer sblock->fs_cs(fs, cg).cs_nbfree++;
214 1.26 bouyer ffs_clusteracct(sblock, cgp,
215 1.28 dholland ffs_fragstoblks(sblock, dtogd(sblock, idesc->id_blkno)), 1);
216 1.26 bouyer }
217 1.26 bouyer sbdirty();
218 1.26 bouyer cgdirty();
219 1.1 cgd return (res);
220 1.1 cgd }
221