2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 static const char sccsid[] = "@(#)pass5.c 8.9 (Berkeley) 4/28/95";
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
38 #include <sys/param.h>
39 #include <sys/sysctl.h>
41 #include <ufs/ufs/dinode.h>
42 #include <ufs/ffs/fs.h>
52 static void check_maps(u_char *, u_char *, int, ufs2_daddr_t, const char *,
53 int *, int, int, int);
54 static void clear_blocks(ufs2_daddr_t start, ufs2_daddr_t end);
59 int c, i, j, blk, frags, basesize, mapsize;
60 int inomapsize, blkmapsize;
61 struct fs *fs = &sblock;
62 ufs2_daddr_t d, dbase, dmax, start;
65 struct csum_total cstotal;
66 struct inodesc idesc[3];
68 struct cg *cg, *newcg = (struct cg *)buf;
71 inoinfo(UFS_WINO)->ino_state = USTATE;
72 memset(newcg, 0, (size_t)fs->fs_cgsize);
73 newcg->cg_niblk = fs->fs_ipg;
74 if (preen == 0 && yflag == 0 && fs->fs_magic == FS_UFS2_MAGIC &&
75 fswritefd != -1 && (fs->fs_metackhash & CK_CYLGRP) == 0 &&
76 reply("ADD CYLINDER GROUP CHECKSUM PROTECTION") != 0) {
77 fs->fs_metackhash |= CK_CYLGRP;
82 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
84 pwarn("DELETING CLUSTERING MAPS\n");
85 if (preen || reply("DELETE CLUSTERING MAPS")) {
86 fs->fs_contigsumsize = 0;
91 if (fs->fs_maxcontig > 1) {
92 const char *doit = NULL;
94 if (fs->fs_contigsumsize < 1) {
96 } else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
97 fs->fs_contigsumsize < FS_MAXCONTIG) {
101 i = fs->fs_contigsumsize;
102 fs->fs_contigsumsize =
103 MIN(fs->fs_maxcontig, FS_MAXCONTIG);
104 if (CGSIZE(fs) > (u_int)fs->fs_bsize) {
105 pwarn("CANNOT %s CLUSTER MAPS\n", doit);
106 fs->fs_contigsumsize = i;
108 reply("CREATE CLUSTER MAPS")) {
110 pwarn("%sING CLUSTER MAPS\n",
113 fragroundup(fs, CGSIZE(fs));
120 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
121 if (sblock.fs_magic == FS_UFS2_MAGIC) {
122 newcg->cg_iusedoff = basesize;
125 * We reserve the space for the old rotation summary
126 * tables for the benefit of old kernels, but do not
127 * maintain them in modern kernels. In time, they can
130 newcg->cg_old_btotoff = basesize;
131 newcg->cg_old_boff = newcg->cg_old_btotoff +
132 fs->fs_old_cpg * sizeof(int32_t);
133 newcg->cg_iusedoff = newcg->cg_old_boff +
134 fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
135 memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
137 inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
138 newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
139 blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
140 newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
141 if (fs->fs_contigsumsize > 0) {
142 newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
144 newcg->cg_clustersumoff =
145 roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
146 newcg->cg_clusteroff = newcg->cg_clustersumoff +
147 (fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
148 newcg->cg_nextfreeoff = newcg->cg_clusteroff +
149 howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
151 newcg->cg_magic = CG_MAGIC;
152 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
153 memset(&idesc[0], 0, sizeof idesc);
154 for (i = 0; i < 3; i++)
155 idesc[i].id_type = ADDR;
156 memset(&cstotal, 0, sizeof(struct csum_total));
157 dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1);
158 for (d = fs->fs_size; d < dmax; d++)
160 for (c = 0; c < fs->fs_ncg; c++) {
162 printf("%s: phase 5: cyl group %d of %d (%d%%)\n",
163 cdevname, c, sblock.fs_ncg,
164 c * 100 / sblock.fs_ncg);
168 setproctitle("%s p5 %d%%", cdevname,
169 c * 100 / sblock.fs_ncg);
173 cg = cgbp->b_un.b_cg;
174 if (!cg_chkmagic(cg))
175 pfatal("CG %d: BAD MAGIC NUMBER\n", c);
176 newcg->cg_time = cg->cg_time;
177 newcg->cg_old_time = cg->cg_old_time;
178 newcg->cg_unrefs = cg->cg_unrefs;
180 dbase = cgbase(fs, c);
181 dmax = dbase + fs->fs_fpg;
182 if (dmax > fs->fs_size)
184 newcg->cg_ndblk = dmax - dbase;
185 if (fs->fs_magic == FS_UFS1_MAGIC) {
186 if (c == fs->fs_ncg - 1)
187 newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
188 fs->fs_fpg / fs->fs_old_cpg);
190 newcg->cg_old_ncyl = fs->fs_old_cpg;
191 newcg->cg_old_niblk = fs->fs_ipg;
194 if (fs->fs_contigsumsize > 0)
195 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
196 newcg->cg_cs.cs_ndir = 0;
197 newcg->cg_cs.cs_nffree = 0;
198 newcg->cg_cs.cs_nbfree = 0;
199 newcg->cg_cs.cs_nifree = fs->fs_ipg;
200 if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk)
201 newcg->cg_rotor = cg->cg_rotor;
204 if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk)
205 newcg->cg_frotor = cg->cg_frotor;
207 newcg->cg_frotor = 0;
208 if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg)
209 newcg->cg_irotor = cg->cg_irotor;
211 newcg->cg_irotor = 0;
212 if (fs->fs_magic == FS_UFS1_MAGIC) {
213 newcg->cg_initediblk = 0;
215 if ((unsigned)cg->cg_initediblk > fs->fs_ipg)
216 newcg->cg_initediblk = fs->fs_ipg;
218 newcg->cg_initediblk = cg->cg_initediblk;
220 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
221 memset(cg_inosused(newcg), 0, (size_t)(mapsize));
223 for (i = 0; i < inostathead[c].il_numalloced; j++, i++) {
224 switch (inoinfo(j)->ino_state) {
233 newcg->cg_cs.cs_ndir++;
239 newcg->cg_cs.cs_nifree--;
240 setbit(cg_inosused(newcg), i);
244 if (j < (int)UFS_ROOTINO)
246 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
247 inoinfo(j)->ino_state, j);
251 for (i = 0; i < (int)UFS_ROOTINO; i++) {
252 setbit(cg_inosused(newcg), i);
253 newcg->cg_cs.cs_nifree--;
256 for (i = 0, d = dbase;
258 d += fs->fs_frag, i += fs->fs_frag) {
260 for (j = 0; j < fs->fs_frag; j++) {
261 if (testbmap(d + j)) {
262 if ((Eflag || Zflag) && start != -1) {
263 clear_blocks(start, d + j - 1);
270 setbit(cg_blksfree(newcg), i + j);
273 if (frags == fs->fs_frag) {
274 newcg->cg_cs.cs_nbfree++;
275 if (fs->fs_contigsumsize > 0)
276 setbit(cg_clustersfree(newcg),
278 } else if (frags > 0) {
279 newcg->cg_cs.cs_nffree += frags;
280 blk = blkmap(fs, cg_blksfree(newcg), i);
281 ffs_fragacct(fs, blk, newcg->cg_frsum, 1);
284 if ((Eflag || Zflag) && start != -1)
285 clear_blocks(start, d - 1);
286 if (fs->fs_contigsumsize > 0) {
287 int32_t *sump = cg_clustersum(newcg);
288 u_char *mapp = cg_clustersfree(newcg);
293 for (i = 0; i < newcg->cg_nclusterblks; i++) {
294 if ((map & bit) != 0) {
296 } else if (run != 0) {
297 if (run > fs->fs_contigsumsize)
298 run = fs->fs_contigsumsize;
302 if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
310 if (run > fs->fs_contigsumsize)
311 run = fs->fs_contigsumsize;
315 if ((fs->fs_metackhash & CK_CYLGRP) != 0) {
316 newcg->cg_ckhash = 0;
318 calculate_crc32c(~0L, (void *)newcg, fs->fs_cgsize);
321 if (bkgrdflag != 0) {
322 cstotal.cs_nffree += cg->cg_cs.cs_nffree;
323 cstotal.cs_nbfree += cg->cg_cs.cs_nbfree;
324 cstotal.cs_nifree += cg->cg_cs.cs_nifree;
325 cstotal.cs_ndir += cg->cg_cs.cs_ndir;
327 cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
328 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
329 cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
330 cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
332 cs = &fs->fs_cs(fs, c);
333 if (cursnapshot == 0 &&
334 memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 &&
335 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
336 memmove(cs, &newcg->cg_cs, sizeof *cs);
340 memmove(cg, newcg, (size_t)fs->fs_cgsize);
344 if (cursnapshot == 0 &&
345 memcmp(newcg, cg, basesize) != 0 &&
346 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
347 memmove(cg, newcg, (size_t)basesize);
350 if (bkgrdflag != 0 || usedsoftdep || debug)
351 update_maps(cg, newcg, bkgrdflag);
352 if (cursnapshot == 0 &&
353 memcmp(cg_inosused(newcg), cg_inosused(cg), mapsize) != 0 &&
354 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
355 memmove(cg_inosused(cg), cg_inosused(newcg),
360 if (cursnapshot == 0 &&
361 memcmp(&cstotal, &fs->fs_cstotal, sizeof cstotal) != 0
362 && dofix(&idesc[0], "SUMMARY BLK COUNT(S) WRONG IN SUPERBLK")) {
363 memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
370 * When doing background fsck on a snapshot, figure out whether
371 * the superblock summary is inaccurate and correct it when
374 if (cursnapshot != 0) {
377 cmd.value = cstotal.cs_ndir - fs->fs_cstotal.cs_ndir;
378 if (cmd.value != 0) {
380 printf("adjndir by %+" PRIi64 "\n", cmd.value);
381 if (bkgrdsumadj == 0 || sysctl(adjndir, MIBSIZE, 0, 0,
382 &cmd, sizeof cmd) == -1)
383 rwerror("ADJUST NUMBER OF DIRECTORIES", cmd.value);
386 cmd.value = cstotal.cs_nbfree - fs->fs_cstotal.cs_nbfree;
387 if (cmd.value != 0) {
389 printf("adjnbfree by %+" PRIi64 "\n", cmd.value);
390 if (bkgrdsumadj == 0 || sysctl(adjnbfree, MIBSIZE, 0, 0,
391 &cmd, sizeof cmd) == -1)
392 rwerror("ADJUST NUMBER OF FREE BLOCKS", cmd.value);
395 cmd.value = cstotal.cs_nifree - fs->fs_cstotal.cs_nifree;
396 if (cmd.value != 0) {
398 printf("adjnifree by %+" PRIi64 "\n", cmd.value);
399 if (bkgrdsumadj == 0 || sysctl(adjnifree, MIBSIZE, 0, 0,
400 &cmd, sizeof cmd) == -1)
401 rwerror("ADJUST NUMBER OF FREE INODES", cmd.value);
404 cmd.value = cstotal.cs_nffree - fs->fs_cstotal.cs_nffree;
405 if (cmd.value != 0) {
407 printf("adjnffree by %+" PRIi64 "\n", cmd.value);
408 if (bkgrdsumadj == 0 || sysctl(adjnffree, MIBSIZE, 0, 0,
409 &cmd, sizeof cmd) == -1)
410 rwerror("ADJUST NUMBER OF FREE FRAGS", cmd.value);
413 cmd.value = cstotal.cs_numclusters - fs->fs_cstotal.cs_numclusters;
414 if (cmd.value != 0) {
416 printf("adjnumclusters by %+" PRIi64 "\n", cmd.value);
417 if (bkgrdsumadj == 0 || sysctl(adjnumclusters, MIBSIZE, 0, 0,
418 &cmd, sizeof cmd) == -1)
419 rwerror("ADJUST NUMBER OF FREE CLUSTERS", cmd.value);
425 * Compare the original cylinder group inode and block bitmaps with the
426 * updated cylinder group inode and block bitmaps. Free inodes and blocks
427 * that have been added. Complain if any previously freed inodes blocks
432 struct cg *oldcg, /* cylinder group of claimed allocations */
433 struct cg *newcg, /* cylinder group of determined allocations */
434 int usesysctl) /* 1 => use sysctl interface to update maps */
436 int inomapsize, excessdirs;
437 struct fs *fs = &sblock;
439 inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
440 excessdirs = oldcg->cg_cs.cs_ndir - newcg->cg_cs.cs_ndir;
441 if (excessdirs < 0) {
442 pfatal("LOST %d DIRECTORIES\n", -excessdirs);
446 check_maps(cg_inosused(newcg), cg_inosused(oldcg), inomapsize,
447 oldcg->cg_cgx * (ufs2_daddr_t)fs->fs_ipg, "DIR", freedirs,
448 0, excessdirs, usesysctl);
449 check_maps(cg_inosused(newcg), cg_inosused(oldcg), inomapsize,
450 oldcg->cg_cgx * (ufs2_daddr_t)fs->fs_ipg, "FILE", freefiles,
451 excessdirs, fs->fs_ipg, usesysctl);
452 check_maps(cg_blksfree(oldcg), cg_blksfree(newcg),
453 howmany(fs->fs_fpg, CHAR_BIT),
454 oldcg->cg_cgx * (ufs2_daddr_t)fs->fs_fpg, "FRAG",
455 freeblks, 0, fs->fs_fpg, usesysctl);
460 u_char *map1, /* map of claimed allocations */
461 u_char *map2, /* map of determined allocations */
462 int mapsize, /* size of above two maps */
463 ufs2_daddr_t startvalue, /* resource value for first element in map */
464 const char *name, /* name of resource found in maps */
465 int *opcode, /* sysctl opcode to free resource */
466 int skip, /* number of entries to skip before starting to free */
467 int limit, /* limit on number of entries to free */
468 int usesysctl) /* 1 => use sysctl interface to update maps */
472 long i, j, k, l, m, size;
473 ufs2_daddr_t n, astart, aend, ustart, uend;
474 void (*msg)(const char *fmt, ...);
480 astart = ustart = aend = uend = -1;
481 for (i = 0; i < mapsize; i++) {
486 for (m = 0, l = 1; m < CHAR_BIT; m++, l <<= 1) {
487 if ((j & l) == (k & l))
489 n = startvalue + i * CHAR_BIT + m;
500 (*msg)("ALLOCATED %s %" PRId64
504 (*msg)("%s %sS %" PRId64 "-%" PRId64
506 "ALLOCATED", name, astart, aend);
517 size = uend - ustart + 1;
530 if (debug && size == 1)
531 pwarn("%s %s %" PRId64
533 "UNALLOCATED", name, ustart);
535 pwarn("%s %sS %" PRId64 "-%" PRId64
537 "UNALLOCATED", name, ustart,
539 if (usesysctl != 0) {
542 if (sysctl(opcode, MIBSIZE, 0, 0,
543 &cmd, sizeof cmd) == -1) {
544 snprintf(buf, BUFSIZE,
546 rwerror(buf, cmd.value);
558 (*msg)("ALLOCATED %s %" PRId64
559 " MARKED FREE\n", name, astart);
561 (*msg)("ALLOCATED %sS %" PRId64 "-%" PRId64
566 size = uend - ustart + 1;
577 pwarn("UNALLOCATED %s %" PRId64
581 pwarn("UNALLOCATED %sS %" PRId64 "-%" PRId64
583 name, ustart, ustart + size - 1);
585 if (usesysctl != 0) {
588 if (sysctl(opcode, MIBSIZE, 0, 0, &cmd,
590 snprintf(buf, BUFSIZE, "FREE %s", name);
591 rwerror(buf, cmd.value);
598 clear_blocks(ufs2_daddr_t start, ufs2_daddr_t end)
602 printf("Zero frags %jd to %jd\n", start, end);
604 blzero(fswritefd, fsbtodb(&sblock, start),
605 lfragtosize(&sblock, end - start + 1));
607 blerase(fswritefd, fsbtodb(&sblock, start),
608 lfragtosize(&sblock, end - start + 1));