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>
51 static void check_maps(u_char *, u_char *, int, ufs2_daddr_t, const char *, int *, int, int);
53 static void clear_blocks(ufs2_daddr_t start, ufs2_daddr_t end);
58 int c, i, j, blk, frags, basesize, mapsize;
59 int inomapsize, blkmapsize;
60 struct fs *fs = &sblock;
61 struct cg *cg = &cgrp;
62 ufs2_daddr_t d, dbase, dmax, start;
63 int excessdirs, rewritecg = 0;
65 struct csum_total cstotal;
66 struct inodesc idesc[3];
68 struct cg *newcg = (struct cg *)buf;
70 inoinfo(WINO)->ino_state = USTATE;
71 memset(newcg, 0, (size_t)fs->fs_cgsize);
72 newcg->cg_niblk = fs->fs_ipg;
74 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
76 pwarn("DELETING CLUSTERING MAPS\n");
77 if (preen || reply("DELETE CLUSTERING MAPS")) {
78 fs->fs_contigsumsize = 0;
83 if (fs->fs_maxcontig > 1) {
86 if (fs->fs_contigsumsize < 1) {
88 } else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
89 fs->fs_contigsumsize < FS_MAXCONTIG) {
93 i = fs->fs_contigsumsize;
94 fs->fs_contigsumsize =
95 MIN(fs->fs_maxcontig, FS_MAXCONTIG);
96 if (CGSIZE(fs) > (u_int)fs->fs_bsize) {
97 pwarn("CANNOT %s CLUSTER MAPS\n", doit);
98 fs->fs_contigsumsize = i;
100 reply("CREATE CLUSTER MAPS")) {
102 pwarn("%sING CLUSTER MAPS\n",
105 fragroundup(fs, CGSIZE(fs));
112 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
113 if (sblock.fs_magic == FS_UFS2_MAGIC) {
114 newcg->cg_iusedoff = basesize;
117 * We reserve the space for the old rotation summary
118 * tables for the benefit of old kernels, but do not
119 * maintain them in modern kernels. In time, they can
122 newcg->cg_old_btotoff = basesize;
123 newcg->cg_old_boff = newcg->cg_old_btotoff +
124 fs->fs_old_cpg * sizeof(int32_t);
125 newcg->cg_iusedoff = newcg->cg_old_boff +
126 fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
127 memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
129 inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
130 newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
131 blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
132 newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
133 if (fs->fs_contigsumsize > 0) {
134 newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
136 newcg->cg_clustersumoff =
137 roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
138 newcg->cg_clusteroff = newcg->cg_clustersumoff +
139 (fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
140 newcg->cg_nextfreeoff = newcg->cg_clusteroff +
141 howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
143 newcg->cg_magic = CG_MAGIC;
144 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
145 memset(&idesc[0], 0, sizeof idesc);
146 for (i = 0; i < 3; i++)
147 idesc[i].id_type = ADDR;
148 memset(&cstotal, 0, sizeof(struct csum_total));
149 dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1);
150 for (d = fs->fs_size; d < dmax; d++)
152 for (c = 0; c < fs->fs_ncg; c++) {
154 printf("%s: phase 5: cyl group %d of %d (%d%%)\n",
155 cdevname, c, sblock.fs_ncg,
156 c * 100 / sblock.fs_ncg);
160 setproctitle("%s p5 %d%%", cdevname,
161 c * 100 / sblock.fs_ncg);
164 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
165 if (!cg_chkmagic(cg))
166 pfatal("CG %d: BAD MAGIC NUMBER\n", c);
167 newcg->cg_time = cg->cg_time;
168 newcg->cg_old_time = cg->cg_old_time;
169 newcg->cg_unrefs = cg->cg_unrefs;
171 dbase = cgbase(fs, c);
172 dmax = dbase + fs->fs_fpg;
173 if (dmax > fs->fs_size)
175 newcg->cg_ndblk = dmax - dbase;
176 if (fs->fs_magic == FS_UFS1_MAGIC) {
177 if (c == fs->fs_ncg - 1)
178 newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
179 fs->fs_fpg / fs->fs_old_cpg);
181 newcg->cg_old_ncyl = fs->fs_old_cpg;
182 newcg->cg_old_niblk = fs->fs_ipg;
185 if (fs->fs_contigsumsize > 0)
186 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
187 newcg->cg_cs.cs_ndir = 0;
188 newcg->cg_cs.cs_nffree = 0;
189 newcg->cg_cs.cs_nbfree = 0;
190 newcg->cg_cs.cs_nifree = fs->fs_ipg;
191 if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk)
192 newcg->cg_rotor = cg->cg_rotor;
195 if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk)
196 newcg->cg_frotor = cg->cg_frotor;
198 newcg->cg_frotor = 0;
199 if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg)
200 newcg->cg_irotor = cg->cg_irotor;
202 newcg->cg_irotor = 0;
203 if (fs->fs_magic == FS_UFS1_MAGIC) {
204 newcg->cg_initediblk = 0;
206 if ((unsigned)cg->cg_initediblk > fs->fs_ipg)
207 newcg->cg_initediblk = fs->fs_ipg;
209 newcg->cg_initediblk = cg->cg_initediblk;
211 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
212 memset(cg_inosused(newcg), 0, (size_t)(mapsize));
214 for (i = 0; i < inostathead[c].il_numalloced; j++, i++) {
215 switch (inoinfo(j)->ino_state) {
224 newcg->cg_cs.cs_ndir++;
230 newcg->cg_cs.cs_nifree--;
231 setbit(cg_inosused(newcg), i);
235 if (j < (int)ROOTINO)
237 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
238 inoinfo(j)->ino_state, j);
242 for (i = 0; i < (int)ROOTINO; i++) {
243 setbit(cg_inosused(newcg), i);
244 newcg->cg_cs.cs_nifree--;
247 for (i = 0, d = dbase;
249 d += fs->fs_frag, i += fs->fs_frag) {
251 for (j = 0; j < fs->fs_frag; j++) {
252 if (testbmap(d + j)) {
253 if (Eflag && start != -1) {
254 clear_blocks(start, d + j - 1);
261 setbit(cg_blksfree(newcg), i + j);
264 if (frags == fs->fs_frag) {
265 newcg->cg_cs.cs_nbfree++;
266 if (fs->fs_contigsumsize > 0)
267 setbit(cg_clustersfree(newcg),
269 } else if (frags > 0) {
270 newcg->cg_cs.cs_nffree += frags;
271 blk = blkmap(fs, cg_blksfree(newcg), i);
272 ffs_fragacct(fs, blk, newcg->cg_frsum, 1);
275 if (Eflag && start != -1)
276 clear_blocks(start, d - 1);
277 if (fs->fs_contigsumsize > 0) {
278 int32_t *sump = cg_clustersum(newcg);
279 u_char *mapp = cg_clustersfree(newcg);
284 for (i = 0; i < newcg->cg_nclusterblks; i++) {
285 if ((map & bit) != 0) {
287 } else if (run != 0) {
288 if (run > fs->fs_contigsumsize)
289 run = fs->fs_contigsumsize;
293 if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
301 if (run > fs->fs_contigsumsize)
302 run = fs->fs_contigsumsize;
306 if (bkgrdflag != 0) {
307 cstotal.cs_nffree += cg->cg_cs.cs_nffree;
308 cstotal.cs_nbfree += cg->cg_cs.cs_nbfree;
309 cstotal.cs_nifree += cg->cg_cs.cs_nifree;
310 cstotal.cs_ndir += cg->cg_cs.cs_ndir;
312 cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
313 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
314 cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
315 cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
317 cs = &fs->fs_cs(fs, c);
318 if (cursnapshot == 0 &&
319 memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 &&
320 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
321 memmove(cs, &newcg->cg_cs, sizeof *cs);
325 memmove(cg, newcg, (size_t)fs->fs_cgsize);
329 if (cursnapshot == 0 &&
330 memcmp(newcg, cg, basesize) != 0 &&
331 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
332 memmove(cg, newcg, (size_t)basesize);
335 if (bkgrdflag != 0 || usedsoftdep || debug) {
336 excessdirs = cg->cg_cs.cs_ndir - newcg->cg_cs.cs_ndir;
337 if (excessdirs < 0) {
338 pfatal("LOST %d DIRECTORIES\n", -excessdirs);
342 check_maps(cg_inosused(newcg), cg_inosused(cg),
344 cg->cg_cgx * (ufs2_daddr_t) fs->fs_ipg,
346 freedirs, 0, excessdirs);
347 check_maps(cg_inosused(newcg), cg_inosused(cg),
349 cg->cg_cgx * (ufs2_daddr_t) fs->fs_ipg, "FILE",
350 freefiles, excessdirs, fs->fs_ipg);
351 check_maps(cg_blksfree(cg), cg_blksfree(newcg),
353 cg->cg_cgx * (ufs2_daddr_t) fs->fs_fpg, "FRAG",
354 freeblks, 0, fs->fs_fpg);
356 if (cursnapshot == 0 &&
357 memcmp(cg_inosused(newcg), cg_inosused(cg), mapsize) != 0 &&
358 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
359 memmove(cg_inosused(cg), cg_inosused(newcg),
364 if (cursnapshot == 0 &&
365 memcmp(&cstotal, &fs->fs_cstotal, sizeof cstotal) != 0
366 && dofix(&idesc[0], "SUMMARY BLK COUNT(S) WRONG IN SUPERBLK")) {
367 memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
374 * When doing background fsck on a snapshot, figure out whether
375 * the superblock summary is inaccurate and correct it when
378 if (cursnapshot != 0) {
381 cmd.value = cstotal.cs_ndir - fs->fs_cstotal.cs_ndir;
382 if (cmd.value != 0) {
384 printf("adjndir by %+" PRIi64 "\n", cmd.value);
385 if (bkgrdsumadj == 0 || sysctl(adjndir, MIBSIZE, 0, 0,
386 &cmd, sizeof cmd) == -1)
387 rwerror("ADJUST NUMBER OF DIRECTORIES", cmd.value);
390 cmd.value = cstotal.cs_nbfree - fs->fs_cstotal.cs_nbfree;
391 if (cmd.value != 0) {
393 printf("adjnbfree by %+" PRIi64 "\n", cmd.value);
394 if (bkgrdsumadj == 0 || sysctl(adjnbfree, MIBSIZE, 0, 0,
395 &cmd, sizeof cmd) == -1)
396 rwerror("ADJUST NUMBER OF FREE BLOCKS", cmd.value);
399 cmd.value = cstotal.cs_nifree - fs->fs_cstotal.cs_nifree;
400 if (cmd.value != 0) {
402 printf("adjnifree by %+" PRIi64 "\n", cmd.value);
403 if (bkgrdsumadj == 0 || sysctl(adjnifree, MIBSIZE, 0, 0,
404 &cmd, sizeof cmd) == -1)
405 rwerror("ADJUST NUMBER OF FREE INODES", cmd.value);
408 cmd.value = cstotal.cs_nffree - fs->fs_cstotal.cs_nffree;
409 if (cmd.value != 0) {
411 printf("adjnffree by %+" PRIi64 "\n", cmd.value);
412 if (bkgrdsumadj == 0 || sysctl(adjnffree, MIBSIZE, 0, 0,
413 &cmd, sizeof cmd) == -1)
414 rwerror("ADJUST NUMBER OF FREE FRAGS", cmd.value);
417 cmd.value = cstotal.cs_numclusters - fs->fs_cstotal.cs_numclusters;
418 if (cmd.value != 0) {
420 printf("adjnumclusters by %+" PRIi64 "\n", cmd.value);
421 if (bkgrdsumadj == 0 || sysctl(adjnumclusters, MIBSIZE, 0, 0,
422 &cmd, sizeof cmd) == -1)
423 rwerror("ADJUST NUMBER OF FREE CLUSTERS", cmd.value);
430 u_char *map1, /* map of claimed allocations */
431 u_char *map2, /* map of determined allocations */
432 int mapsize, /* size of above two maps */
433 ufs2_daddr_t startvalue, /* resource value for first element in map */
434 const char *name, /* name of resource found in maps */
435 int *opcode, /* sysctl opcode to free resource */
436 int skip, /* number of entries to skip before starting to free */
437 int limit) /* limit on number of entries to free */
441 long i, j, k, l, m, size;
442 ufs2_daddr_t n, astart, aend, ustart, uend;
443 void (*msg)(const char *fmt, ...);
449 astart = ustart = aend = uend = -1;
450 for (i = 0; i < mapsize; i++) {
455 for (m = 0, l = 1; m < CHAR_BIT; m++, l <<= 1) {
456 if ((j & l) == (k & l))
458 n = startvalue + i * CHAR_BIT + m;
469 (*msg)("ALLOCATED %s %" PRId64
473 (*msg)("%s %sS %" PRId64 "-%" PRId64
475 "ALLOCATED", name, astart, aend);
486 size = uend - ustart + 1;
499 if (debug && size == 1)
500 pwarn("%s %s %" PRId64
502 "UNALLOCATED", name, ustart);
504 pwarn("%s %sS %" PRId64 "-%" PRId64
506 "UNALLOCATED", name, ustart,
508 if (bkgrdflag != 0) {
511 if (sysctl(opcode, MIBSIZE, 0, 0,
512 &cmd, sizeof cmd) == -1) {
513 snprintf(buf, BUFSIZE,
515 rwerror(buf, cmd.value);
527 (*msg)("ALLOCATED %s %" PRId64
528 " MARKED FREE\n", name, astart);
530 (*msg)("ALLOCATED %sS %" PRId64 "-%" PRId64
535 size = uend - ustart + 1;
546 pwarn("UNALLOCATED %s %" PRId64
550 pwarn("UNALLOCATED %sS %" PRId64 "-%" PRId64
552 name, ustart, ustart + size - 1);
554 if (bkgrdflag != 0) {
557 if (sysctl(opcode, MIBSIZE, 0, 0, &cmd,
559 snprintf(buf, BUFSIZE, "FREE %s", name);
560 rwerror(buf, cmd.value);
566 static void clear_blocks(ufs2_daddr_t start, ufs2_daddr_t end)
570 printf("Zero frags %jd to %jd\n", start, end);
571 blerase(fswritefd, fsbtodb(&sblock, start),
572 lfragtosize(&sblock, end - start + 1));