1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
|
/* Pass 5 of GNU fsck -- check allocation maps and summaries
Copyright (C) 1994 Free Software Foundation, Inc.
Written by Michael I. Bushnell.
This file is part of the GNU Hurd.
The GNU Hurd is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2, or (at
your option) any later version.
The GNU Hurd is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "fsck.h"
pass5 ()
{
char cgbuf[MAXBSIZE];
struct cg *newcg = cgbuf;
struct ocg *ocg = (struct ocg *)cgbuf;
int savednrpos;
struct csum cstotal;
int i, j;
int c;
struct cg *cg = alloca (sblock.fs_cgsize);
char csumbuf[fragroundup (sizeof (struct csum) * sblock.fs_ncg)];
struct csum *sbcsums = (struct csum *)csumbuf;
int basesize; /* size of cg not counting flexibly sized */
int sumsize; /* size of block totals and pos tbl */
int mapsize; /* size of inode map + block map */
int writesb;
int writecg;
int writecsum;
writesb = 0;
writecsum = 0;
readblock (fsbtodb (&sblock, sblock.fs_csaddr), csumbuf,
fragroundup (sizeof (struct csum) * sblock.fs_ncg));
/* Construct a CG structure; initialize everything that's the same
in each cylinder group. */
bzero (newcg, sblock.fs_cgsize);
newcg->cg_niblk = sblock.fs_ipg;
switch (sblock.fs_postblformat)
{
case FS_42POSTBLFMT:
/* Initialize size information */
basesize = (char *)(&ocg->cg_btot[0]) - (char *)(&ocg->cg_link);
sumsize = &ocg->cg_iused[0] - (char *)(&ocg->cg_btot[0]);
mapsize = (&ocg->cg_free[howmany(sblock.fs_fpg, NBBY)]
- (u_char *)&ocg->cg_iused[0]);
savednrpos = sblock.fs_nrpos;
sblock.fs_nrpos = 8;
break;
case FS_DYNAMICPOSTBLFMT;
/* Set fields unique to new cg structure */
newcg->cg_btotoff = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link);
newcg->cg_boff = newcg->cg_btotoff + sblock.fs_cpg * sizeof (long);
newcg->cg_iusedoff = newcg->cg_boff + (sblock.fs_cpg
* block.fs_nrpos
* sizeof (short));
newcg->cg_freeoff = newcg->cg_iusedoff + howmany (sblock.fs_ipg, NBBY);
/* Only support sblock.fs_contigsumsize == 0 here */
/* If we supported clustered filesystems, then we would set
clustersumoff and clusteroff and nextfree off would be past
them. */
newcg->cg_nextfreeoff =
(newcg->cg_freeoff
+ howmany (sblock.fs_cpg * sblock.fs_spc / NSPF (&sblock), NBBY));
newcg->cg_magic = CG_MAGIC;
/* Set map sizes */
basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link);
sumsize = newcg->cg_iusedoff - newcg->cg_btotoff;
mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
break;
}
bzero (&cstotal, sizeof (struct csum));
/* Mark fragments past the end of the filesystem as used. */
j = blknum (&sblock, sblock->fs_size + fs->fs_frag - 1);
for (i = sblock.fs_size; i < j; i++)
setbmap (i);
/* Now walk through the cylinder groups, checking each one. */
for (c = 0; c < sblock.fs_ncg; c++)
{
int dbase, dmax;
/* Read the cylinder group structure */
readblock (fsbtodb (cgtod (&sblock, c)), cg, sblock.fs_cgsize);
writecg = 0;
if (!cg_chkmagic (cg))
pfatal ("CG %d: BAD MAGIC NUMBER\n", c);
/* Compute first and last data block addresses in this group */
dbase = cgbase (&sblock, c);
dmax = dbase + sblock.fs_fpg;
if (dmax > sblock.fs_size)
dmax = sblock.fs_size;
/* Initialize newcg fully; values from cg for those
we can't check. */
newcg->cg_time = cg->cg_time;
newcg->cg_cgx = c;
if (c == sblock.fs_ncg - 1)
newcg->cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
else
newcg->cg_ncyl = sblock.fs_cpg;
newcg->cg_ndblk = dmax - dbase;
/* Don't set nclusterblks; we don't support that */
newcg->cg_cs.cs_ndir = 0;
newcg->cg_cs.cs_nffree = 0;
newcg->cg_cs.cs_nbfree = 0;
newcg->cg_cs.cs_nifree = sblock.fs_ipg;
/* Check these for basic viability; if they are wrong
then clear them. */
newcg->cg_rotor = cg->cg_rotor;
newcg->cg_frotor = cg->cg_frotor;
newcg->cg_irotor = cg->cg_irotor;
if (newcg->cg_rotor > newcg->cg_ndblk)
{
pwarn ("ILLEGAL ROTOR VALUE IN CG %d", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
newcg->cg_rotor = 0;
cg->cg_rotor = 0;
writecg = 1;
}
}
if (newcg->cg_frotor > newcg->cg_ndblk)
{
pwarn ("ILLEGAL FROTOR VALUE IN CG %d", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
newcg->cg_frotor = 0;
cg->cg_frotor = 0;
writecg = 1;
}
}
if (newcg->cg_irotor > newcg->cg_niblk)
{
pwarn ("ILLEGAL IROTOR VALUE IN CG %d", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
newcg->cg_irotor = 0;
cg->cg_irotor = 0;
writecg = 1;
}
}
/* Zero the block maps and summary areas */
bzero (&newcg->cg_frsum[0], sizeof newcg->cg_frsum);
bzero (&cg_blktot (newcg)[0], sumsize + mapsize);
if (sblock.fs_postblformat == FS_42POSTBLFMT)
ocg->cg_magic = CG_MAGIC;
/* Walk through each inode, accounting for it in
the inode map and in newcg->cg_cs. */
j = fs->fs_ipg * c;
for (i = 0; i < fs->fs_ipg; j++, i++)
switch (inodestate[i])
{
case DIR:
case DIR | DIR_REF:
newcg->cg_cs.cs_ndir++;
/* Fall through... */
case REG:
newcg->cg_cs.cs_nifree--;
setbit (cg_inosused (newcg), i);
}
/* Account for inodes 0 and 1 */
if (c == 0)
for (i = 0; i < ROOTINO; i++)
{
setbit (cg_inosused (newcg), i);
newcg->cg_cs.cs_nifree--;
}
/* Walk through each data block, accounting for it in
the block map and in newcg->cg_cs. */
for (i = 0, d = dbase;
d < dmax;
d += sblock.fs_frag, i += sblock.fs_frag)
{
int frags = 0;
/* Set each free frag of this block in the block map;
count how many frags were free. */
for (j = 0; j < fs->fs_frag; j++)
{
if (testbmap (d + j))
continue;
setbit (cg_blksfree (newcg), i + j);
frags++;
}
/* If all the frags were free, then count this as
a free block too. */
if (frags == fs->fs_frag)
{
newcg->cg_cs.cs_nbfree++;
j = cbtocylno (&sblock, i);
cg_blktot(newcg)[j]++;
cg_blks(&sblock, newcg, j)[cktorpos(&sblock, i)]++;
/* If we support clustering, then we'd account for this
in the cluster map too. */
}
else if (frags)
{
/* Partial; account for the frags. */
newcg->cg_cs.cs_nffree += frags;
blk = blkmap (&sblock, cg_blksfree (newcg), i);
ffs_fragacct (&sblock, blk, newcg->cg_frsum, 1);
}
}
/* Add this cylinder group's totals into the superblock's
totals. */
cstotal.cs.nffree += newcg->cg_cs.cs_nffree;
cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
/* Check counts in superblock */
if (bcmp (&newcg->cg_cs, cs, sizeof (struct csum)))
{
pwarn ("FREE BLK COUNTS FOR CG %d WRONG IN SUPERBLOCK", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
bcopy (newcg->cg_cs, cs, sizeof (struct csum));
writecsum = 1;
}
}
/* Check inode and block maps */
if (bcmp (cg_inosused (newcg), cg_inosused (cg), mapsize))
{
pwarn ("BLKS OR INOS MISSING IN CG %d BIT MAPS", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
bcopy (cg_inosused (newcg), cg_inosused (cg), mapsize);
writecg = 1;
}
}
if (bcmp (&cg_blktot(newcg)[0], &cg_blktot(cg)[0], sumsize))
{
pwarn ("SUMMARY INFORMATION FOR CG %d BAD", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
bcopy (cg_blktot(newcg)[0], &cg_blktot(cg)[0], sumsize);
writecg = 1;
}
}
if (bcmp (newcg, cg, basesize))
{
pwarn ("CYLINDER GROUP %d BAD", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
bcopy (newcg, cg, basesize);
writecg = 1;
}
}
if (writecg)
writeblock (fsbtodb (cgtod (&sblock, c)), cg, sblock.fs_cgsize);
}
/* Restore nrpos */
if (sblock.fs_postblformat == FS_42POSTBLFMT)
sblock.fs_nrpos = savednrpos;
if (bcmp (cstotal, sblock.fs_cstotal, sizeof (struct csum)))
{
pwarn ("TOTAL FREE BLK COUNTS WRONG IN SUPERBLOCK", c);
if (preen || reply ("FIX"))
{
if (preen)
printf (" (FIXED)");
bcopy (&cstotal, sblock.fs_cstotal, sizeof (struct csum));
sblock.fs_ronly = 0;
sblock.fs_fmod = 0;
writesb = 1;
}
}
if (writesb)
writeblock (SBLOCK, &sblock, SBSIZE);
if (writecsum)
writeblock (fsbtodb (&sblock, sblock.fs_csaddr), csumbuf,
fragroundup (sizeof (struct csum) * sblock.fs_ncg));
}
|
