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 * 4. 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(WINO)->ino_state = USTATE;
72 memset(newcg, 0, (size_t)fs->fs_cgsize);
73 newcg->cg_niblk = fs->fs_ipg;
75 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
77 pwarn("DELETING CLUSTERING MAPS\n");
78 if (preen || reply("DELETE CLUSTERING MAPS")) {
79 fs->fs_contigsumsize = 0;
84 if (fs->fs_maxcontig > 1) {
87 if (fs->fs_contigsumsize < 1) {
89 } else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
90 fs->fs_contigsumsize < FS_MAXCONTIG) {
94 i = fs->fs_contigsumsize;
95 fs->fs_contigsumsize =
96 MIN(fs->fs_maxcontig, FS_MAXCONTIG);
97 if (CGSIZE(fs) > (u_int)fs->fs_bsize) {
98 pwarn("CANNOT %s CLUSTER MAPS\n", doit);
99 fs->fs_contigsumsize = i;
101 reply("CREATE CLUSTER MAPS")) {
103 pwarn("%sING CLUSTER MAPS\n",
106 fragroundup(fs, CGSIZE(fs));
113 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
114 if (sblock.fs_magic == FS_UFS2_MAGIC) {
115 newcg->cg_iusedoff = basesize;
118 * We reserve the space for the old rotation summary
119 * tables for the benefit of old kernels, but do not
120 * maintain them in modern kernels. In time, they can
123 newcg->cg_old_btotoff = basesize;
124 newcg->cg_old_boff = newcg->cg_old_btotoff +
125 fs->fs_old_cpg * sizeof(int32_t);
126 newcg->cg_iusedoff = newcg->cg_old_boff +
127 fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
128 memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
130 inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
131 newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
132 blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
133 newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
134 if (fs->fs_contigsumsize > 0) {
135 newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
137 newcg->cg_clustersumoff =
138 roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
139 newcg->cg_clusteroff = newcg->cg_clustersumoff +
140 (fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
141 newcg->cg_nextfreeoff = newcg->cg_clusteroff +
142 howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
144 newcg->cg_magic = CG_MAGIC;
145 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
146 memset(&idesc[0], 0, sizeof idesc);
147 for (i = 0; i < 3; i++)
148 idesc[i].id_type = ADDR;
149 memset(&cstotal, 0, sizeof(struct csum_total));
150 dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1);
151 for (d = fs->fs_size; d < dmax; d++)
153 for (c = 0; c < fs->fs_ncg; c++) {
155 printf("%s: phase 5: cyl group %d of %d (%d%%)\n",
156 cdevname, c, sblock.fs_ncg,
157 c * 100 / sblock.fs_ncg);
161 setproctitle("%s p5 %d%%", cdevname,
162 c * 100 / sblock.fs_ncg);
166 cg = cgbp->b_un.b_cg;
167 if (!cg_chkmagic(cg))
168 pfatal("CG %d: BAD MAGIC NUMBER\n", c);
169 newcg->cg_time = cg->cg_time;
170 newcg->cg_old_time = cg->cg_old_time;
171 newcg->cg_unrefs = cg->cg_unrefs;
173 dbase = cgbase(fs, c);
174 dmax = dbase + fs->fs_fpg;
175 if (dmax > fs->fs_size)
177 newcg->cg_ndblk = dmax - dbase;
178 if (fs->fs_magic == FS_UFS1_MAGIC) {
179 if (c == fs->fs_ncg - 1)
180 newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
181 fs->fs_fpg / fs->fs_old_cpg);
183 newcg->cg_old_ncyl = fs->fs_old_cpg;
184 newcg->cg_old_niblk = fs->fs_ipg;
187 if (fs->fs_contigsumsize > 0)
188 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
189 newcg->cg_cs.cs_ndir = 0;
190 newcg->cg_cs.cs_nffree = 0;
191 newcg->cg_cs.cs_nbfree = 0;
192 newcg->cg_cs.cs_nifree = fs->fs_ipg;
193 if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk)
194 newcg->cg_rotor = cg->cg_rotor;
197 if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk)
198 newcg->cg_frotor = cg->cg_frotor;
200 newcg->cg_frotor = 0;
201 if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg)
202 newcg->cg_irotor = cg->cg_irotor;
204 newcg->cg_irotor = 0;
205 if (fs->fs_magic == FS_UFS1_MAGIC) {
206 newcg->cg_initediblk = 0;
208 if ((unsigned)cg->cg_initediblk > fs->fs_ipg)
209 newcg->cg_initediblk = fs->fs_ipg;
211 newcg->cg_initediblk = cg->cg_initediblk;
213 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
214 memset(cg_inosused(newcg), 0, (size_t)(mapsize));
216 for (i = 0; i < inostathead[c].il_numalloced; j++, i++) {
217 switch (inoinfo(j)->ino_state) {
226 newcg->cg_cs.cs_ndir++;
232 newcg->cg_cs.cs_nifree--;
233 setbit(cg_inosused(newcg), i);
237 if (j < (int)ROOTINO)
239 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
240 inoinfo(j)->ino_state, j);
244 for (i = 0; i < (int)ROOTINO; i++) {
245 setbit(cg_inosused(newcg), i);
246 newcg->cg_cs.cs_nifree--;
249 for (i = 0, d = dbase;
251 d += fs->fs_frag, i += fs->fs_frag) {
253 for (j = 0; j < fs->fs_frag; j++) {
254 if (testbmap(d + j)) {
255 if ((Eflag || Zflag) && start != -1) {
256 clear_blocks(start, d + j - 1);
263 setbit(cg_blksfree(newcg), i + j);
266 if (frags == fs->fs_frag) {
267 newcg->cg_cs.cs_nbfree++;
268 if (fs->fs_contigsumsize > 0)
269 setbit(cg_clustersfree(newcg),
271 } else if (frags > 0) {
272 newcg->cg_cs.cs_nffree += frags;
273 blk = blkmap(fs, cg_blksfree(newcg), i);
274 ffs_fragacct(fs, blk, newcg->cg_frsum, 1);
277 if ((Eflag || Zflag) && start != -1)
278 clear_blocks(start, d - 1);
279 if (fs->fs_contigsumsize > 0) {
280 int32_t *sump = cg_clustersum(newcg);
281 u_char *mapp = cg_clustersfree(newcg);
286 for (i = 0; i < newcg->cg_nclusterblks; i++) {
287 if ((map & bit) != 0) {
289 } else if (run != 0) {
290 if (run > fs->fs_contigsumsize)
291 run = fs->fs_contigsumsize;
295 if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
303 if (run > fs->fs_contigsumsize)
304 run = fs->fs_contigsumsize;
308 if (bkgrdflag != 0) {
309 cstotal.cs_nffree += cg->cg_cs.cs_nffree;
310 cstotal.cs_nbfree += cg->cg_cs.cs_nbfree;
311 cstotal.cs_nifree += cg->cg_cs.cs_nifree;
312 cstotal.cs_ndir += cg->cg_cs.cs_ndir;
314 cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
315 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
316 cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
317 cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
319 cs = &fs->fs_cs(fs, c);
320 if (cursnapshot == 0 &&
321 memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 &&
322 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
323 memmove(cs, &newcg->cg_cs, sizeof *cs);
327 memmove(cg, newcg, (size_t)fs->fs_cgsize);
331 if (cursnapshot == 0 &&
332 memcmp(newcg, cg, basesize) != 0 &&
333 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
334 memmove(cg, newcg, (size_t)basesize);
337 if (bkgrdflag != 0 || usedsoftdep || debug)
338 update_maps(cg, newcg, bkgrdflag);
339 if (cursnapshot == 0 &&
340 memcmp(cg_inosused(newcg), cg_inosused(cg), mapsize) != 0 &&
341 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
342 memmove(cg_inosused(cg), cg_inosused(newcg),
347 if (cursnapshot == 0 &&
348 memcmp(&cstotal, &fs->fs_cstotal, sizeof cstotal) != 0
349 && dofix(&idesc[0], "SUMMARY BLK COUNT(S) WRONG IN SUPERBLK")) {
350 memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
357 * When doing background fsck on a snapshot, figure out whether
358 * the superblock summary is inaccurate and correct it when
361 if (cursnapshot != 0) {
364 cmd.value = cstotal.cs_ndir - fs->fs_cstotal.cs_ndir;
365 if (cmd.value != 0) {
367 printf("adjndir by %+" PRIi64 "\n", cmd.value);
368 if (bkgrdsumadj == 0 || sysctl(adjndir, MIBSIZE, 0, 0,
369 &cmd, sizeof cmd) == -1)
370 rwerror("ADJUST NUMBER OF DIRECTORIES", cmd.value);
373 cmd.value = cstotal.cs_nbfree - fs->fs_cstotal.cs_nbfree;
374 if (cmd.value != 0) {
376 printf("adjnbfree by %+" PRIi64 "\n", cmd.value);
377 if (bkgrdsumadj == 0 || sysctl(adjnbfree, MIBSIZE, 0, 0,
378 &cmd, sizeof cmd) == -1)
379 rwerror("ADJUST NUMBER OF FREE BLOCKS", cmd.value);
382 cmd.value = cstotal.cs_nifree - fs->fs_cstotal.cs_nifree;
383 if (cmd.value != 0) {
385 printf("adjnifree by %+" PRIi64 "\n", cmd.value);
386 if (bkgrdsumadj == 0 || sysctl(adjnifree, MIBSIZE, 0, 0,
387 &cmd, sizeof cmd) == -1)
388 rwerror("ADJUST NUMBER OF FREE INODES", cmd.value);
391 cmd.value = cstotal.cs_nffree - fs->fs_cstotal.cs_nffree;
392 if (cmd.value != 0) {
394 printf("adjnffree by %+" PRIi64 "\n", cmd.value);
395 if (bkgrdsumadj == 0 || sysctl(adjnffree, MIBSIZE, 0, 0,
396 &cmd, sizeof cmd) == -1)
397 rwerror("ADJUST NUMBER OF FREE FRAGS", cmd.value);
400 cmd.value = cstotal.cs_numclusters - fs->fs_cstotal.cs_numclusters;
401 if (cmd.value != 0) {
403 printf("adjnumclusters by %+" PRIi64 "\n", cmd.value);
404 if (bkgrdsumadj == 0 || sysctl(adjnumclusters, MIBSIZE, 0, 0,
405 &cmd, sizeof cmd) == -1)
406 rwerror("ADJUST NUMBER OF FREE CLUSTERS", cmd.value);
412 * Compare the original cylinder group inode and block bitmaps with the
413 * updated cylinder group inode and block bitmaps. Free inodes and blocks
414 * that have been added. Complain if any previously freed inodes blocks
419 struct cg *oldcg, /* cylinder group of claimed allocations */
420 struct cg *newcg, /* cylinder group of determined allocations */
421 int usesysctl) /* 1 => use sysctl interface to update maps */
423 int inomapsize, excessdirs;
424 struct fs *fs = &sblock;
426 inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
427 excessdirs = oldcg->cg_cs.cs_ndir - newcg->cg_cs.cs_ndir;
428 if (excessdirs < 0) {
429 pfatal("LOST %d DIRECTORIES\n", -excessdirs);
433 check_maps(cg_inosused(newcg), cg_inosused(oldcg), inomapsize,
434 oldcg->cg_cgx * (ufs2_daddr_t)fs->fs_ipg, "DIR", freedirs,
435 0, excessdirs, usesysctl);
436 check_maps(cg_inosused(newcg), cg_inosused(oldcg), inomapsize,
437 oldcg->cg_cgx * (ufs2_daddr_t)fs->fs_ipg, "FILE", freefiles,
438 excessdirs, fs->fs_ipg, usesysctl);
439 check_maps(cg_blksfree(oldcg), cg_blksfree(newcg),
440 howmany(fs->fs_fpg, CHAR_BIT),
441 oldcg->cg_cgx * (ufs2_daddr_t)fs->fs_fpg, "FRAG",
442 freeblks, 0, fs->fs_fpg, usesysctl);
447 u_char *map1, /* map of claimed allocations */
448 u_char *map2, /* map of determined allocations */
449 int mapsize, /* size of above two maps */
450 ufs2_daddr_t startvalue, /* resource value for first element in map */
451 const char *name, /* name of resource found in maps */
452 int *opcode, /* sysctl opcode to free resource */
453 int skip, /* number of entries to skip before starting to free */
454 int limit, /* limit on number of entries to free */
455 int usesysctl) /* 1 => use sysctl interface to update maps */
459 long i, j, k, l, m, size;
460 ufs2_daddr_t n, astart, aend, ustart, uend;
461 void (*msg)(const char *fmt, ...);
467 astart = ustart = aend = uend = -1;
468 for (i = 0; i < mapsize; i++) {
473 for (m = 0, l = 1; m < CHAR_BIT; m++, l <<= 1) {
474 if ((j & l) == (k & l))
476 n = startvalue + i * CHAR_BIT + m;
487 (*msg)("ALLOCATED %s %" PRId64
491 (*msg)("%s %sS %" PRId64 "-%" PRId64
493 "ALLOCATED", name, astart, aend);
504 size = uend - ustart + 1;
517 if (debug && size == 1)
518 pwarn("%s %s %" PRId64
520 "UNALLOCATED", name, ustart);
522 pwarn("%s %sS %" PRId64 "-%" PRId64
524 "UNALLOCATED", name, ustart,
526 if (usesysctl != 0) {
529 if (sysctl(opcode, MIBSIZE, 0, 0,
530 &cmd, sizeof cmd) == -1) {
531 snprintf(buf, BUFSIZE,
533 rwerror(buf, cmd.value);
545 (*msg)("ALLOCATED %s %" PRId64
546 " MARKED FREE\n", name, astart);
548 (*msg)("ALLOCATED %sS %" PRId64 "-%" PRId64
553 size = uend - ustart + 1;
564 pwarn("UNALLOCATED %s %" PRId64
568 pwarn("UNALLOCATED %sS %" PRId64 "-%" PRId64
570 name, ustart, ustart + size - 1);
572 if (usesysctl != 0) {
575 if (sysctl(opcode, MIBSIZE, 0, 0, &cmd,
577 snprintf(buf, BUFSIZE, "FREE %s", name);
578 rwerror(buf, cmd.value);
585 clear_blocks(ufs2_daddr_t start, ufs2_daddr_t end)
589 printf("Zero frags %jd to %jd\n", start, end);
591 blzero(fswritefd, fsbtodb(&sblock, start),
592 lfragtosize(&sblock, end - start + 1));
594 blerase(fswritefd, fsbtodb(&sblock, start),
595 lfragtosize(&sblock, end - start + 1));