pass5.c revision 1.55 1 1.55 chs /* $NetBSD: pass5.c,v 1.55 2022/11/17 06:40:38 chs Exp $ */
2 1.13 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.37 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.17 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.13 cgd #if 0
35 1.18 lukem static char sccsid[] = "@(#)pass5.c 8.9 (Berkeley) 4/28/95";
36 1.13 cgd #else
37 1.55 chs __RCSID("$NetBSD: pass5.c,v 1.55 2022/11/17 06:40:38 chs Exp $");
38 1.13 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.18 lukem
44 1.6 mycroft #include <ufs/ufs/dinode.h>
45 1.6 mycroft #include <ufs/ffs/fs.h>
46 1.19 bouyer #include <ufs/ffs/ffs_extern.h>
47 1.19 bouyer #include <ufs/ufs/ufs_bswap.h>
48 1.18 lukem
49 1.18 lukem #include <err.h>
50 1.1 cgd #include <string.h>
51 1.50 dholland #include <stdlib.h>
52 1.15 christos
53 1.16 christos #include "fsutil.h"
54 1.1 cgd #include "fsck.h"
55 1.10 cgd #include "extern.h"
56 1.1 cgd
57 1.45 xtraeme void print_bmap(u_char *,u_int32_t);
58 1.19 bouyer
59 1.10 cgd void
60 1.34 fvdl pass5(void)
61 1.1 cgd {
62 1.39 dbj int c, blk, frags, basesize, sumsize, mapsize, cssize;
63 1.21 fvdl int inomapsize, blkmapsize;
64 1.19 bouyer struct fs *fs = sblock;
65 1.32 fvdl daddr_t dbase, dmax;
66 1.32 fvdl daddr_t d;
67 1.21 fvdl long i, j, k;
68 1.1 cgd struct csum *cs;
69 1.34 fvdl struct csum_total cstotal;
70 1.26 thorpej struct inodesc idesc[4];
71 1.1 cgd char buf[MAXBSIZE];
72 1.17 lukem struct cg *newcg = (struct cg *)buf;
73 1.39 dbj struct ocg *ocg = (struct ocg *)buf;
74 1.38 itojun struct cg *cg = cgrp, *ncg;
75 1.34 fvdl struct inostat *info;
76 1.38 itojun u_int32_t ncgsize;
77 1.1 cgd
78 1.51 dholland inoinfo(UFS_WINO)->ino_state = USTATE;
79 1.7 mycroft memset(newcg, 0, (size_t)fs->fs_cgsize);
80 1.1 cgd newcg->cg_niblk = fs->fs_ipg;
81 1.12 mycroft if (cvtlevel >= 3) {
82 1.6 mycroft if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
83 1.6 mycroft if (preen)
84 1.6 mycroft pwarn("DELETING CLUSTERING MAPS\n");
85 1.6 mycroft if (preen || reply("DELETE CLUSTERING MAPS")) {
86 1.6 mycroft fs->fs_contigsumsize = 0;
87 1.6 mycroft doinglevel1 = 1;
88 1.6 mycroft sbdirty();
89 1.6 mycroft }
90 1.6 mycroft }
91 1.6 mycroft if (fs->fs_maxcontig > 1) {
92 1.46 christos const char *doit = NULL;
93 1.6 mycroft
94 1.6 mycroft if (fs->fs_contigsumsize < 1) {
95 1.6 mycroft doit = "CREAT";
96 1.6 mycroft } else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
97 1.6 mycroft fs->fs_contigsumsize < FS_MAXCONTIG) {
98 1.6 mycroft doit = "EXPAND";
99 1.6 mycroft }
100 1.6 mycroft if (doit) {
101 1.6 mycroft i = fs->fs_contigsumsize;
102 1.6 mycroft fs->fs_contigsumsize =
103 1.6 mycroft MIN(fs->fs_maxcontig, FS_MAXCONTIG);
104 1.49 christos if (CGSIZE(fs) > (uint32_t)fs->fs_bsize) {
105 1.6 mycroft pwarn("CANNOT %s CLUSTER MAPS\n", doit);
106 1.6 mycroft fs->fs_contigsumsize = i;
107 1.6 mycroft } else if (preen ||
108 1.6 mycroft reply("CREATE CLUSTER MAPS")) {
109 1.6 mycroft if (preen)
110 1.6 mycroft pwarn("%sING CLUSTER MAPS\n",
111 1.6 mycroft doit);
112 1.53 dholland ncgsize = ffs_fragroundup(fs, CGSIZE(fs));
113 1.38 itojun ncg = realloc(cgrp, ncgsize);
114 1.38 itojun if (ncg == NULL)
115 1.48 christos errexit(
116 1.21 fvdl "cannot reallocate cg space");
117 1.38 itojun cg = cgrp = ncg;
118 1.38 itojun fs->fs_cgsize = ncgsize;
119 1.6 mycroft doinglevel1 = 1;
120 1.6 mycroft sbdirty();
121 1.6 mycroft }
122 1.6 mycroft }
123 1.6 mycroft }
124 1.6 mycroft }
125 1.34 fvdl basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
126 1.36 fvdl cssize = (u_char *)&cstotal.cs_spare[0] - (u_char *)&cstotal.cs_ndir;
127 1.39 dbj sumsize = 0;
128 1.34 fvdl if (is_ufs2) {
129 1.34 fvdl newcg->cg_iusedoff = basesize;
130 1.34 fvdl } else {
131 1.34 fvdl /*
132 1.34 fvdl * We reserve the space for the old rotation summary
133 1.34 fvdl * tables for the benefit of old kernels, but do not
134 1.34 fvdl * maintain them in modern kernels. In time, they can
135 1.34 fvdl * go away.
136 1.34 fvdl */
137 1.34 fvdl newcg->cg_old_btotoff = basesize;
138 1.34 fvdl newcg->cg_old_boff = newcg->cg_old_btotoff +
139 1.34 fvdl fs->fs_old_cpg * sizeof(int32_t);
140 1.34 fvdl newcg->cg_iusedoff = newcg->cg_old_boff +
141 1.34 fvdl fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
142 1.34 fvdl memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
143 1.34 fvdl }
144 1.34 fvdl inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
145 1.34 fvdl newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
146 1.34 fvdl blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
147 1.34 fvdl newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
148 1.34 fvdl if (fs->fs_contigsumsize > 0) {
149 1.34 fvdl newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
150 1.34 fvdl sizeof(u_int32_t);
151 1.39 dbj if (isappleufs) {
152 1.39 dbj /* Apple PR2216969 gives rationale for this change.
153 1.39 dbj * I believe they were mistaken, but we need to
154 1.39 dbj * duplicate it for compatibility. -- dbj (at) NetBSD.org
155 1.39 dbj */
156 1.39 dbj newcg->cg_clustersumoff += sizeof(u_int32_t);
157 1.39 dbj }
158 1.34 fvdl newcg->cg_clustersumoff =
159 1.34 fvdl roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
160 1.34 fvdl newcg->cg_clusteroff = newcg->cg_clustersumoff +
161 1.34 fvdl (fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
162 1.34 fvdl newcg->cg_nextfreeoff = newcg->cg_clusteroff +
163 1.54 dholland howmany(ffs_fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
164 1.1 cgd }
165 1.34 fvdl newcg->cg_magic = CG_MAGIC;
166 1.34 fvdl mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
167 1.39 dbj if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)) {
168 1.39 dbj switch ((int)fs->fs_old_postblformat) {
169 1.39 dbj
170 1.39 dbj case FS_42POSTBLFMT:
171 1.39 dbj basesize = (char *)(&ocg->cg_btot[0]) -
172 1.39 dbj (char *)(&ocg->cg_firstfield);
173 1.39 dbj sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]);
174 1.39 dbj mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] -
175 1.39 dbj (u_char *)&ocg->cg_iused[0];
176 1.39 dbj blkmapsize = howmany(fs->fs_fpg, NBBY);
177 1.39 dbj inomapsize = &ocg->cg_free[0] - (u_char *)&ocg->cg_iused[0];
178 1.39 dbj ocg->cg_magic = CG_MAGIC;
179 1.39 dbj newcg->cg_magic = 0;
180 1.39 dbj break;
181 1.39 dbj
182 1.39 dbj case FS_DYNAMICPOSTBLFMT:
183 1.39 dbj sumsize = newcg->cg_iusedoff - newcg->cg_old_btotoff;
184 1.39 dbj break;
185 1.39 dbj
186 1.39 dbj default:
187 1.48 christos errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d",
188 1.39 dbj fs->fs_old_postblformat);
189 1.39 dbj }
190 1.39 dbj }
191 1.7 mycroft memset(&idesc[0], 0, sizeof idesc);
192 1.26 thorpej for (i = 0; i < 4; i++) {
193 1.1 cgd idesc[i].id_type = ADDR;
194 1.34 fvdl if (!is_ufs2 && doinglevel2)
195 1.6 mycroft idesc[i].id_fix = FIX;
196 1.6 mycroft }
197 1.34 fvdl memset(&cstotal, 0, sizeof(struct csum_total));
198 1.54 dholland dmax = ffs_blknum(fs, fs->fs_size + fs->fs_frag - 1);
199 1.34 fvdl for (d = fs->fs_size; d < dmax; d++)
200 1.34 fvdl setbmap(d);
201 1.1 cgd for (c = 0; c < fs->fs_ncg; c++) {
202 1.29 lukem if (got_siginfo) {
203 1.29 lukem fprintf(stderr,
204 1.29 lukem "%s: phase 5: cyl group %d of %d (%d%%)\n",
205 1.29 lukem cdevname(), c, fs->fs_ncg,
206 1.29 lukem c * 100 / fs->fs_ncg);
207 1.29 lukem got_siginfo = 0;
208 1.29 lukem }
209 1.43 christos #ifdef PROGRESS
210 1.42 christos progress_bar(cdevname(), preen ? NULL : "phase 5",
211 1.42 christos c, fs->fs_ncg);
212 1.43 christos #endif /* PROGRESS */
213 1.1 cgd getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
214 1.19 bouyer memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize);
215 1.19 bouyer if((doswap && !needswap) || (!doswap && needswap))
216 1.34 fvdl ffs_cg_swap(cgblk.b_un.b_cg, cg, sblock);
217 1.39 dbj if (!doinglevel1 && !cg_chkmagic(cg, 0))
218 1.21 fvdl pfatal("CG %d: PASS5: BAD MAGIC NUMBER\n", c);
219 1.19 bouyer if(doswap)
220 1.19 bouyer cgdirty();
221 1.26 thorpej /*
222 1.26 thorpej * While we have the disk head where we want it,
223 1.26 thorpej * write back the superblock to the spare at this
224 1.26 thorpej * cylinder group.
225 1.26 thorpej */
226 1.55 chs if ((cvtlevel && sblk.b_dirty) || doswap || doing2ea || doing2noea) {
227 1.26 thorpej bwrite(fswritefd, sblk.b_un.b_buf,
228 1.52 dholland FFS_FSBTODB(sblock, cgsblock(sblock, c)),
229 1.26 thorpej sblock->fs_sbsize);
230 1.26 thorpej } else {
231 1.55 chs int alt_ufs2ea = 0;
232 1.55 chs
233 1.26 thorpej /*
234 1.26 thorpej * Read in the current alternate superblock,
235 1.26 thorpej * and compare it to the master. If it's
236 1.26 thorpej * wrong, fix it up.
237 1.26 thorpej */
238 1.26 thorpej getblk(&asblk, cgsblock(sblock, c), sblock->fs_sbsize);
239 1.26 thorpej if (asblk.b_errs)
240 1.26 thorpej pfatal("CG %d: UNABLE TO READ ALTERNATE "
241 1.26 thorpej "SUPERBLK\n", c);
242 1.26 thorpej else {
243 1.26 thorpej memmove(altsblock, asblk.b_un.b_fs,
244 1.26 thorpej sblock->fs_sbsize);
245 1.26 thorpej if (needswap)
246 1.27 lukem ffs_sb_swap(asblk.b_un.b_fs, altsblock);
247 1.55 chs if (altsblock->fs_magic == FS_UFS2EA_MAGIC) {
248 1.55 chs altsblock->fs_magic = FS_UFS2_MAGIC;
249 1.55 chs alt_ufs2ea = 1;
250 1.55 chs }
251 1.26 thorpej }
252 1.39 dbj sb_oldfscompat_write(sblock, sblocksave);
253 1.55 chs if ((asblk.b_errs || cmpsblks(sblock, altsblock) ||
254 1.55 chs is_ufs2ea != alt_ufs2ea) &&
255 1.55 chs dofix(&idesc[3],
256 1.26 thorpej "ALTERNATE SUPERBLK(S) ARE INCORRECT")) {
257 1.26 thorpej bwrite(fswritefd, sblk.b_un.b_buf,
258 1.52 dholland FFS_FSBTODB(sblock, cgsblock(sblock, c)),
259 1.26 thorpej sblock->fs_sbsize);
260 1.26 thorpej }
261 1.39 dbj sb_oldfscompat_read(sblock, 0);
262 1.26 thorpej }
263 1.1 cgd dbase = cgbase(fs, c);
264 1.1 cgd dmax = dbase + fs->fs_fpg;
265 1.1 cgd if (dmax > fs->fs_size)
266 1.1 cgd dmax = fs->fs_size;
267 1.39 dbj if (is_ufs2 || (fs->fs_old_flags & FS_FLAGS_UPDATED))
268 1.39 dbj newcg->cg_time = cg->cg_time;
269 1.34 fvdl newcg->cg_old_time = cg->cg_old_time;
270 1.1 cgd newcg->cg_cgx = c;
271 1.1 cgd newcg->cg_ndblk = dmax - dbase;
272 1.34 fvdl if (!is_ufs2) {
273 1.39 dbj if (c == fs->fs_ncg - 1) {
274 1.39 dbj /* Avoid fighting old fsck for this value. Its never used
275 1.39 dbj * outside of this check anyway.
276 1.39 dbj */
277 1.39 dbj if ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)
278 1.39 dbj newcg->cg_old_ncyl = fs->fs_old_ncyl % fs->fs_old_cpg;
279 1.39 dbj else
280 1.39 dbj newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
281 1.39 dbj fs->fs_fpg / fs->fs_old_cpg);
282 1.39 dbj } else
283 1.34 fvdl newcg->cg_old_ncyl = fs->fs_old_cpg;
284 1.34 fvdl newcg->cg_old_niblk = fs->fs_ipg;
285 1.34 fvdl newcg->cg_niblk = 0;
286 1.34 fvdl }
287 1.6 mycroft if (fs->fs_contigsumsize > 0)
288 1.6 mycroft newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
289 1.1 cgd newcg->cg_cs.cs_ndir = 0;
290 1.1 cgd newcg->cg_cs.cs_nffree = 0;
291 1.1 cgd newcg->cg_cs.cs_nbfree = 0;
292 1.1 cgd newcg->cg_cs.cs_nifree = fs->fs_ipg;
293 1.25 mycroft if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk)
294 1.1 cgd newcg->cg_rotor = cg->cg_rotor;
295 1.1 cgd else
296 1.1 cgd newcg->cg_rotor = 0;
297 1.25 mycroft if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk)
298 1.1 cgd newcg->cg_frotor = cg->cg_frotor;
299 1.1 cgd else
300 1.1 cgd newcg->cg_frotor = 0;
301 1.35 fvdl if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg)
302 1.1 cgd newcg->cg_irotor = cg->cg_irotor;
303 1.1 cgd else
304 1.1 cgd newcg->cg_irotor = 0;
305 1.34 fvdl if (!is_ufs2) {
306 1.34 fvdl newcg->cg_initediblk = 0;
307 1.34 fvdl } else {
308 1.49 christos if ((unsigned)cg->cg_initediblk > (unsigned)fs->fs_ipg)
309 1.34 fvdl newcg->cg_initediblk = fs->fs_ipg;
310 1.34 fvdl else
311 1.34 fvdl newcg->cg_initediblk = cg->cg_initediblk;
312 1.34 fvdl }
313 1.7 mycroft memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
314 1.39 dbj memset(&old_cg_blktot(newcg, 0)[0], 0, (size_t)(sumsize));
315 1.34 fvdl memset(cg_inosused(newcg, 0), 0, (size_t)(mapsize));
316 1.39 dbj if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0) &&
317 1.39 dbj fs->fs_old_postblformat == FS_42POSTBLFMT)
318 1.39 dbj ocg->cg_magic = CG_MAGIC;
319 1.1 cgd j = fs->fs_ipg * c;
320 1.1 cgd for (i = 0; i < fs->fs_ipg; j++, i++) {
321 1.34 fvdl info = inoinfo(j);
322 1.34 fvdl switch (info->ino_state) {
323 1.1 cgd
324 1.1 cgd case USTATE:
325 1.1 cgd break;
326 1.1 cgd
327 1.1 cgd case DSTATE:
328 1.1 cgd case DCLEAR:
329 1.1 cgd case DFOUND:
330 1.1 cgd newcg->cg_cs.cs_ndir++;
331 1.1 cgd /* fall through */
332 1.1 cgd
333 1.1 cgd case FSTATE:
334 1.1 cgd case FCLEAR:
335 1.1 cgd newcg->cg_cs.cs_nifree--;
336 1.19 bouyer setbit(cg_inosused(newcg, 0), i);
337 1.1 cgd break;
338 1.1 cgd
339 1.1 cgd default:
340 1.51 dholland if ((ino_t)j < UFS_ROOTINO)
341 1.1 cgd break;
342 1.48 christos errexit("BAD STATE %d FOR INODE I=%ld",
343 1.34 fvdl info->ino_state, (long)j);
344 1.1 cgd }
345 1.1 cgd }
346 1.1 cgd if (c == 0)
347 1.51 dholland for (i = 0; i < (long)UFS_ROOTINO; i++) {
348 1.19 bouyer setbit(cg_inosused(newcg, 0), i);
349 1.1 cgd newcg->cg_cs.cs_nifree--;
350 1.1 cgd }
351 1.1 cgd for (i = 0, d = dbase;
352 1.1 cgd d < dmax;
353 1.1 cgd d += fs->fs_frag, i += fs->fs_frag) {
354 1.1 cgd frags = 0;
355 1.1 cgd for (j = 0; j < fs->fs_frag; j++) {
356 1.1 cgd if (testbmap(d + j))
357 1.1 cgd continue;
358 1.19 bouyer setbit(cg_blksfree(newcg, 0), i + j);
359 1.1 cgd frags++;
360 1.1 cgd }
361 1.1 cgd if (frags == fs->fs_frag) {
362 1.1 cgd newcg->cg_cs.cs_nbfree++;
363 1.39 dbj if (sumsize) {
364 1.39 dbj j = old_cbtocylno(fs, i);
365 1.39 dbj old_cg_blktot(newcg, 0)[j]++;
366 1.39 dbj old_cg_blks(fs, newcg, j, 0)[old_cbtorpos(fs, i)]++;
367 1.39 dbj }
368 1.6 mycroft if (fs->fs_contigsumsize > 0)
369 1.19 bouyer setbit(cg_clustersfree(newcg, 0),
370 1.54 dholland ffs_fragstoblks(fs, i));
371 1.1 cgd } else if (frags > 0) {
372 1.1 cgd newcg->cg_cs.cs_nffree += frags;
373 1.19 bouyer blk = blkmap(fs, cg_blksfree(newcg, 0), i);
374 1.19 bouyer ffs_fragacct(fs, blk, newcg->cg_frsum, 1, 0);
375 1.6 mycroft }
376 1.6 mycroft }
377 1.6 mycroft if (fs->fs_contigsumsize > 0) {
378 1.19 bouyer int32_t *sump = cg_clustersum(newcg, 0);
379 1.19 bouyer u_char *mapp = cg_clustersfree(newcg, 0);
380 1.6 mycroft int map = *mapp++;
381 1.6 mycroft int bit = 1;
382 1.6 mycroft int run = 0;
383 1.6 mycroft
384 1.6 mycroft for (i = 0; i < newcg->cg_nclusterblks; i++) {
385 1.6 mycroft if ((map & bit) != 0) {
386 1.6 mycroft run++;
387 1.6 mycroft } else if (run != 0) {
388 1.6 mycroft if (run > fs->fs_contigsumsize)
389 1.6 mycroft run = fs->fs_contigsumsize;
390 1.6 mycroft sump[run]++;
391 1.6 mycroft run = 0;
392 1.6 mycroft }
393 1.6 mycroft if ((i & (NBBY - 1)) != (NBBY - 1)) {
394 1.6 mycroft bit <<= 1;
395 1.6 mycroft } else {
396 1.6 mycroft map = *mapp++;
397 1.6 mycroft bit = 1;
398 1.6 mycroft }
399 1.6 mycroft }
400 1.6 mycroft if (run != 0) {
401 1.6 mycroft if (run > fs->fs_contigsumsize)
402 1.6 mycroft run = fs->fs_contigsumsize;
403 1.6 mycroft sump[run]++;
404 1.1 cgd }
405 1.1 cgd }
406 1.1 cgd cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
407 1.1 cgd cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
408 1.1 cgd cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
409 1.1 cgd cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
410 1.1 cgd cs = &fs->fs_cs(fs, c);
411 1.20 ross if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0) {
412 1.40 dbj if (debug) {
413 1.40 dbj printf("cg %d: nffree: %d/%d nbfree %d/%d"
414 1.40 dbj " nifree %d/%d ndir %d/%d\n",
415 1.40 dbj c, cs->cs_nffree,newcg->cg_cs.cs_nffree,
416 1.40 dbj cs->cs_nbfree,newcg->cg_cs.cs_nbfree,
417 1.40 dbj cs->cs_nifree,newcg->cg_cs.cs_nifree,
418 1.40 dbj cs->cs_ndir,newcg->cg_cs.cs_ndir);
419 1.40 dbj }
420 1.19 bouyer if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
421 1.34 fvdl memmove(cs, &newcg->cg_cs, sizeof *cs);
422 1.34 fvdl sbdirty();
423 1.19 bouyer } else
424 1.19 bouyer markclean = 0;
425 1.20 ross }
426 1.6 mycroft if (doinglevel1) {
427 1.18 lukem memmove(cg, newcg, (size_t)fs->fs_cgsize);
428 1.1 cgd cgdirty();
429 1.1 cgd continue;
430 1.1 cgd }
431 1.39 dbj if ((memcmp(newcg, cg, basesize) != 0) ||
432 1.39 dbj (memcmp(&old_cg_blktot(newcg, 0)[0],
433 1.39 dbj &old_cg_blktot(cg, 0)[0], sumsize) != 0)) {
434 1.34 fvdl if (dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
435 1.34 fvdl memmove(cg, newcg, (size_t)basesize);
436 1.39 dbj memmove(&old_cg_blktot(cg, 0)[0],
437 1.39 dbj &old_cg_blktot(newcg, 0)[0], (size_t)sumsize);
438 1.34 fvdl cgdirty();
439 1.21 fvdl } else
440 1.21 fvdl markclean = 0;
441 1.20 ross }
442 1.21 fvdl if (usedsoftdep) {
443 1.21 fvdl for (i = 0; i < inomapsize; i++) {
444 1.21 fvdl j = cg_inosused(newcg, 0)[i];
445 1.21 fvdl if ((cg_inosused(cg, 0)[i] & j) == j)
446 1.21 fvdl continue;
447 1.21 fvdl for (k = 0; k < NBBY; k++) {
448 1.21 fvdl if ((j & (1 << k)) == 0)
449 1.21 fvdl continue;
450 1.21 fvdl if (cg_inosused(cg, 0)[i] & (1 << k))
451 1.21 fvdl continue;
452 1.23 bouyer pwarn("ALLOCATED INODE %ld "
453 1.23 bouyer "MARKED FREE\n",
454 1.21 fvdl c * fs->fs_ipg + i * 8 + k);
455 1.21 fvdl }
456 1.21 fvdl }
457 1.21 fvdl for (i = 0; i < blkmapsize; i++) {
458 1.21 fvdl j = cg_blksfree(cg, 0)[i];
459 1.21 fvdl if ((cg_blksfree(newcg, 0)[i] & j) == j)
460 1.21 fvdl continue;
461 1.21 fvdl for (k = 0; k < NBBY; k++) {
462 1.21 fvdl if ((j & (1 << k)) == 0)
463 1.21 fvdl continue;
464 1.21 fvdl if (cg_inosused(cg, 0)[i] & (1 << k))
465 1.21 fvdl continue;
466 1.24 mycroft pwarn("ALLOCATED FRAG %ld "
467 1.24 mycroft "MARKED FREE\n",
468 1.21 fvdl c * fs->fs_fpg + i * 8 + k);
469 1.21 fvdl }
470 1.21 fvdl }
471 1.21 fvdl }
472 1.21 fvdl if (memcmp(cg_inosused(newcg, 0), cg_inosused(cg, 0), mapsize)
473 1.21 fvdl != 0 && dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
474 1.21 fvdl memmove(cg_inosused(cg, 0), cg_inosused(newcg, 0),
475 1.21 fvdl (size_t)mapsize);
476 1.21 fvdl cgdirty();
477 1.21 fvdl }
478 1.1 cgd }
479 1.36 fvdl if (memcmp(&cstotal, &fs->fs_cstotal, cssize) != 0) {
480 1.40 dbj if (debug) {
481 1.40 dbj printf("total: nffree: %lld/%lld nbfree %lld/%lld"
482 1.40 dbj " nifree %lld/%lld ndir %lld/%lld\n",
483 1.41 ragge (long long int)fs->fs_cstotal.cs_nffree,
484 1.41 ragge (long long int)cstotal.cs_nffree,
485 1.41 ragge (long long int)fs->fs_cstotal.cs_nbfree,
486 1.41 ragge (long long int)cstotal.cs_nbfree,
487 1.41 ragge (long long int)fs->fs_cstotal.cs_nifree,
488 1.41 ragge (long long int)cstotal.cs_nifree,
489 1.41 ragge (long long int)fs->fs_cstotal.cs_ndir,
490 1.41 ragge (long long int)cstotal.cs_ndir);
491 1.40 dbj }
492 1.26 thorpej if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
493 1.36 fvdl memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
494 1.26 thorpej fs->fs_ronly = 0;
495 1.26 thorpej fs->fs_fmod = 0;
496 1.26 thorpej sbdirty();
497 1.19 bouyer } else
498 1.19 bouyer markclean = 0;
499 1.20 ross }
500 1.43 christos #ifdef PROGRESS
501 1.47 apb if (!preen)
502 1.42 christos progress_done();
503 1.43 christos #endif /* PROGRESS */
504 1.19 bouyer }
505 1.19 bouyer
506 1.19 bouyer void
507 1.49 christos print_bmap(u_char *map, uint32_t size)
508 1.19 bouyer {
509 1.49 christos uint32_t i, j;
510 1.19 bouyer
511 1.19 bouyer i = 0;
512 1.19 bouyer while (i < size) {
513 1.19 bouyer printf("%u: ",i);
514 1.19 bouyer for (j = 0; j < 16; j++, i++)
515 1.19 bouyer printf("%2x ", (u_int)map[i] & 0xff);
516 1.19 bouyer printf("\n");
517 1.1 cgd }
518 1.1 cgd }
519