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: src/sbin/fsck_ffs/pass5.c,v 1.43.2.2.6.1 2010/02/10 00:26:20 kensmith Exp $");
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);
56
int c, i, j, blk, frags, basesize, mapsize;
57
int inomapsize, blkmapsize;
58
struct fs *fs = &sblock;
59
struct cg *cg = &cgrp;
60
ufs2_daddr_t d, dbase, dmax;
61
int excessdirs, rewritecg = 0;
63
struct csum_total cstotal;
64
struct inodesc idesc[3];
66
struct cg *newcg = (struct cg *)buf;
68
inoinfo(WINO)->ino_state = USTATE;
69
memset(newcg, 0, (size_t)fs->fs_cgsize);
70
newcg->cg_niblk = fs->fs_ipg;
72
if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
74
pwarn("DELETING CLUSTERING MAPS\n");
75
if (preen || reply("DELETE CLUSTERING MAPS")) {
76
fs->fs_contigsumsize = 0;
81
if (fs->fs_maxcontig > 1) {
84
if (fs->fs_contigsumsize < 1) {
86
} else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
87
fs->fs_contigsumsize < FS_MAXCONTIG) {
91
i = fs->fs_contigsumsize;
92
fs->fs_contigsumsize =
93
MIN(fs->fs_maxcontig, FS_MAXCONTIG);
94
if (CGSIZE(fs) > (u_int)fs->fs_bsize) {
95
pwarn("CANNOT %s CLUSTER MAPS\n", doit);
96
fs->fs_contigsumsize = i;
98
reply("CREATE CLUSTER MAPS")) {
100
pwarn("%sING CLUSTER MAPS\n",
103
fragroundup(fs, CGSIZE(fs));
110
basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
111
if (sblock.fs_magic == FS_UFS2_MAGIC) {
112
newcg->cg_iusedoff = basesize;
115
* We reserve the space for the old rotation summary
116
* tables for the benefit of old kernels, but do not
117
* maintain them in modern kernels. In time, they can
120
newcg->cg_old_btotoff = basesize;
121
newcg->cg_old_boff = newcg->cg_old_btotoff +
122
fs->fs_old_cpg * sizeof(int32_t);
123
newcg->cg_iusedoff = newcg->cg_old_boff +
124
fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
125
memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
127
inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
128
newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
129
blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
130
newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
131
if (fs->fs_contigsumsize > 0) {
132
newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
134
newcg->cg_clustersumoff =
135
roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
136
newcg->cg_clusteroff = newcg->cg_clustersumoff +
137
(fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
138
newcg->cg_nextfreeoff = newcg->cg_clusteroff +
139
howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
141
newcg->cg_magic = CG_MAGIC;
142
mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
143
memset(&idesc[0], 0, sizeof idesc);
144
for (i = 0; i < 3; i++)
145
idesc[i].id_type = ADDR;
146
memset(&cstotal, 0, sizeof(struct csum_total));
147
dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1);
148
for (d = fs->fs_size; d < dmax; d++)
150
for (c = 0; c < fs->fs_ncg; c++) {
152
printf("%s: phase 5: cyl group %d of %d (%d%%)\n",
153
cdevname, c, sblock.fs_ncg,
154
c * 100 / sblock.fs_ncg);
158
setproctitle("%s p5 %d%%", cdevname,
159
c * 100 / sblock.fs_ncg);
162
getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
163
if (!cg_chkmagic(cg))
164
pfatal("CG %d: BAD MAGIC NUMBER\n", c);
165
newcg->cg_time = cg->cg_time;
166
newcg->cg_old_time = cg->cg_old_time;
167
newcg->cg_unrefs = cg->cg_unrefs;
169
dbase = cgbase(fs, c);
170
dmax = dbase + fs->fs_fpg;
171
if (dmax > fs->fs_size)
173
newcg->cg_ndblk = dmax - dbase;
174
if (fs->fs_magic == FS_UFS1_MAGIC) {
175
if (c == fs->fs_ncg - 1)
176
newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
177
fs->fs_fpg / fs->fs_old_cpg);
179
newcg->cg_old_ncyl = fs->fs_old_cpg;
180
newcg->cg_old_niblk = fs->fs_ipg;
183
if (fs->fs_contigsumsize > 0)
184
newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
185
newcg->cg_cs.cs_ndir = 0;
186
newcg->cg_cs.cs_nffree = 0;
187
newcg->cg_cs.cs_nbfree = 0;
188
newcg->cg_cs.cs_nifree = fs->fs_ipg;
189
if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk)
190
newcg->cg_rotor = cg->cg_rotor;
193
if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk)
194
newcg->cg_frotor = cg->cg_frotor;
196
newcg->cg_frotor = 0;
197
if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg)
198
newcg->cg_irotor = cg->cg_irotor;
200
newcg->cg_irotor = 0;
201
if (fs->fs_magic == FS_UFS1_MAGIC) {
202
newcg->cg_initediblk = 0;
204
if ((unsigned)cg->cg_initediblk > fs->fs_ipg)
205
newcg->cg_initediblk = fs->fs_ipg;
207
newcg->cg_initediblk = cg->cg_initediblk;
209
memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
210
memset(cg_inosused(newcg), 0, (size_t)(mapsize));
212
for (i = 0; i < inostathead[c].il_numalloced; j++, i++) {
213
switch (inoinfo(j)->ino_state) {
222
newcg->cg_cs.cs_ndir++;
228
newcg->cg_cs.cs_nifree--;
229
setbit(cg_inosused(newcg), i);
233
if (j < (int)ROOTINO)
235
errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
236
inoinfo(j)->ino_state, j);
240
for (i = 0; i < (int)ROOTINO; i++) {
241
setbit(cg_inosused(newcg), i);
242
newcg->cg_cs.cs_nifree--;
244
for (i = 0, d = dbase;
246
d += fs->fs_frag, i += fs->fs_frag) {
248
for (j = 0; j < fs->fs_frag; j++) {
251
setbit(cg_blksfree(newcg), i + j);
254
if (frags == fs->fs_frag) {
255
newcg->cg_cs.cs_nbfree++;
256
if (fs->fs_contigsumsize > 0)
257
setbit(cg_clustersfree(newcg),
259
} else if (frags > 0) {
260
newcg->cg_cs.cs_nffree += frags;
261
blk = blkmap(fs, cg_blksfree(newcg), i);
262
ffs_fragacct(fs, blk, newcg->cg_frsum, 1);
265
if (fs->fs_contigsumsize > 0) {
266
int32_t *sump = cg_clustersum(newcg);
267
u_char *mapp = cg_clustersfree(newcg);
272
for (i = 0; i < newcg->cg_nclusterblks; i++) {
273
if ((map & bit) != 0) {
275
} else if (run != 0) {
276
if (run > fs->fs_contigsumsize)
277
run = fs->fs_contigsumsize;
281
if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
289
if (run > fs->fs_contigsumsize)
290
run = fs->fs_contigsumsize;
294
if (bkgrdflag != 0) {
295
cstotal.cs_nffree += cg->cg_cs.cs_nffree;
296
cstotal.cs_nbfree += cg->cg_cs.cs_nbfree;
297
cstotal.cs_nifree += cg->cg_cs.cs_nifree;
298
cstotal.cs_ndir += cg->cg_cs.cs_ndir;
300
cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
301
cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
302
cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
303
cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
305
cs = &fs->fs_cs(fs, c);
306
if (cursnapshot == 0 &&
307
memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 &&
308
dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
309
memmove(cs, &newcg->cg_cs, sizeof *cs);
313
memmove(cg, newcg, (size_t)fs->fs_cgsize);
317
if (cursnapshot == 0 &&
318
memcmp(newcg, cg, basesize) != 0 &&
319
dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
320
memmove(cg, newcg, (size_t)basesize);
323
if (bkgrdflag != 0 || usedsoftdep || debug) {
324
excessdirs = cg->cg_cs.cs_ndir - newcg->cg_cs.cs_ndir;
325
if (excessdirs < 0) {
326
pfatal("LOST %d DIRECTORIES\n", -excessdirs);
330
check_maps(cg_inosused(newcg), cg_inosused(cg),
332
cg->cg_cgx * (ufs2_daddr_t) fs->fs_ipg,
334
freedirs, 0, excessdirs);
335
check_maps(cg_inosused(newcg), cg_inosused(cg),
337
cg->cg_cgx * (ufs2_daddr_t) fs->fs_ipg, "FILE",
338
freefiles, excessdirs, fs->fs_ipg);
339
check_maps(cg_blksfree(cg), cg_blksfree(newcg),
341
cg->cg_cgx * (ufs2_daddr_t) fs->fs_fpg, "FRAG",
342
freeblks, 0, fs->fs_fpg);
344
if (cursnapshot == 0 &&
345
memcmp(cg_inosused(newcg), cg_inosused(cg), mapsize) != 0 &&
346
dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
347
memmove(cg_inosused(cg), cg_inosused(newcg),
352
if (cursnapshot == 0 &&
353
memcmp(&cstotal, &fs->fs_cstotal, sizeof cstotal) != 0
354
&& dofix(&idesc[0], "SUMMARY BLK COUNT(S) WRONG IN SUPERBLK")) {
355
memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
362
* When doing background fsck on a snapshot, figure out whether
363
* the superblock summary is inaccurate and correct it when
366
if (cursnapshot != 0) {
369
cmd.value = cstotal.cs_ndir - fs->fs_cstotal.cs_ndir;
370
if (cmd.value != 0) {
372
printf("adjndir by %+" PRIi64 "\n", cmd.value);
373
if (bkgrdsumadj == 0 || sysctl(adjndir, MIBSIZE, 0, 0,
374
&cmd, sizeof cmd) == -1)
375
rwerror("ADJUST NUMBER OF DIRECTORIES", cmd.value);
378
cmd.value = cstotal.cs_nbfree - fs->fs_cstotal.cs_nbfree;
379
if (cmd.value != 0) {
381
printf("adjnbfree by %+" PRIi64 "\n", cmd.value);
382
if (bkgrdsumadj == 0 || sysctl(adjnbfree, MIBSIZE, 0, 0,
383
&cmd, sizeof cmd) == -1)
384
rwerror("ADJUST NUMBER OF FREE BLOCKS", cmd.value);
387
cmd.value = cstotal.cs_nifree - fs->fs_cstotal.cs_nifree;
388
if (cmd.value != 0) {
390
printf("adjnifree by %+" PRIi64 "\n", cmd.value);
391
if (bkgrdsumadj == 0 || sysctl(adjnifree, MIBSIZE, 0, 0,
392
&cmd, sizeof cmd) == -1)
393
rwerror("ADJUST NUMBER OF FREE INODES", cmd.value);
396
cmd.value = cstotal.cs_nffree - fs->fs_cstotal.cs_nffree;
397
if (cmd.value != 0) {
399
printf("adjnffree by %+" PRIi64 "\n", cmd.value);
400
if (bkgrdsumadj == 0 || sysctl(adjnffree, MIBSIZE, 0, 0,
401
&cmd, sizeof cmd) == -1)
402
rwerror("ADJUST NUMBER OF FREE FRAGS", cmd.value);
405
cmd.value = cstotal.cs_numclusters - fs->fs_cstotal.cs_numclusters;
406
if (cmd.value != 0) {
408
printf("adjnumclusters by %+" PRIi64 "\n", cmd.value);
409
if (bkgrdsumadj == 0 || sysctl(adjnumclusters, MIBSIZE, 0, 0,
410
&cmd, sizeof cmd) == -1)
411
rwerror("ADJUST NUMBER OF FREE CLUSTERS", cmd.value);
418
u_char *map1, /* map of claimed allocations */
419
u_char *map2, /* map of determined allocations */
420
int mapsize, /* size of above two maps */
421
ufs2_daddr_t startvalue, /* resource value for first element in map */
422
const char *name, /* name of resource found in maps */
423
int *opcode, /* sysctl opcode to free resource */
424
int skip, /* number of entries to skip before starting to free */
425
int limit) /* limit on number of entries to free */
429
long i, j, k, l, m, size;
430
ufs2_daddr_t n, astart, aend, ustart, uend;
431
void (*msg)(const char *fmt, ...);
437
astart = ustart = aend = uend = -1;
438
for (i = 0; i < mapsize; i++) {
443
for (m = 0, l = 1; m < CHAR_BIT; m++, l <<= 1) {
444
if ((j & l) == (k & l))
446
n = startvalue + i * CHAR_BIT + m;
457
(*msg)("ALLOCATED %s %" PRId64
461
(*msg)("%s %sS %" PRId64 "-%" PRId64
463
"ALLOCATED", name, astart, aend);
474
size = uend - ustart + 1;
487
if (debug && size == 1)
488
pwarn("%s %s %" PRId64
490
"UNALLOCATED", name, ustart);
492
pwarn("%s %sS %" PRId64 "-%" PRId64
494
"UNALLOCATED", name, ustart,
496
if (bkgrdflag != 0) {
499
if (sysctl(opcode, MIBSIZE, 0, 0,
500
&cmd, sizeof cmd) == -1) {
501
snprintf(buf, BUFSIZE,
503
rwerror(buf, cmd.value);
515
(*msg)("ALLOCATED %s %" PRId64
516
" MARKED FREE\n", name, astart);
518
(*msg)("ALLOCATED %sS %" PRId64 "-%" PRId64
523
size = uend - ustart + 1;
534
pwarn("UNALLOCATED %s %" PRId64
538
pwarn("UNALLOCATED %sS %" PRId64 "-%" PRId64
540
name, ustart, ustart + size - 1);
542
if (bkgrdflag != 0) {
545
if (sysctl(opcode, MIBSIZE, 0, 0, &cmd,
547
snprintf(buf, BUFSIZE, "FREE %s", name);
548
rwerror(buf, cmd.value);