Commit | Line | Data |
---|---|---|
14b4eb74 | 1 | #ifndef lint |
cdbcf1b5 | 2 | static char *sccsid = "@(#)mkfs.c 2.15 (Berkeley) %G%"; |
14b4eb74 | 3 | #endif |
d746d022 KM |
4 | |
5 | /* | |
6 | * make file system for cylinder-group style file systems | |
7 | * | |
b8daa521 | 8 | * usage: mkfs special size [ nsect ntrak bsize fsize cpg minfree rps nbpi ] |
d746d022 KM |
9 | */ |
10 | ||
c6ff3ebb KM |
11 | /* |
12 | * The following constants set the defaults used for the number | |
13 | * of sectors (fs_nsect), and number of tracks (fs_ntrak). | |
14 | */ | |
15 | #define DFLNSECT 32 | |
16 | #define DFLNTRAK 16 | |
17 | ||
18 | /* | |
19 | * The following two constants set the default block and fragment sizes. | |
20 | * Both constants must be a power of 2 and meet the following constraints: | |
21 | * MINBSIZE <= DESBLKSIZE <= MAXBSIZE | |
22 | * DEV_BSIZE <= DESFRAGSIZE <= DESBLKSIZE | |
23 | * DESBLKSIZE / DESFRAGSIZE <= 8 | |
24 | */ | |
25 | #define DESBLKSIZE 8192 | |
26 | #define DESFRAGSIZE 1024 | |
27 | ||
28 | /* | |
29 | * Cylinder groups may have up to MAXCPG cylinders. The actual | |
30 | * number used depends upon how much information can be stored | |
31 | * on a single cylinder. The default is to used 16 cylinders | |
32 | * per group. | |
33 | */ | |
34 | #define DESCPG 16 /* desired fs_cpg */ | |
35 | ||
36 | /* | |
37 | * MINFREE gives the minimum acceptable percentage of file system | |
38 | * blocks which may be free. If the freelist drops below this level | |
39 | * only the superuser may continue to allocate blocks. This may | |
40 | * be set to 0 if no reserve of free blocks is deemed necessary, | |
41 | * however throughput drops by fifty percent if the file system | |
42 | * is run at between 90% and 100% full; thus the default value of | |
43 | * fs_minfree is 10%. | |
44 | */ | |
45 | #define MINFREE 10 | |
46 | ||
47 | /* | |
48 | * ROTDELAY gives the minimum number of milliseconds to initiate | |
49 | * another disk transfer on the same cylinder. It is used in | |
50 | * determining the rotationally optimal layout for disk blocks | |
66dd907b | 51 | * within a file; the default of fs_rotdelay is 4ms. |
c6ff3ebb | 52 | */ |
66dd907b | 53 | #define ROTDELAY 4 |
c6ff3ebb KM |
54 | |
55 | /* | |
56 | * MAXCONTIG sets the default for the maximum number of blocks | |
57 | * that may be allocated sequentially. Since UNIX drivers are | |
58 | * not capable of scheduling multi-block transfers, this defaults | |
59 | * to 1 (ie no contiguous blocks are allocated). | |
60 | */ | |
61 | #define MAXCONTIG 1 | |
62 | ||
63 | /* | |
64 | * MAXBLKPG determines the maximum number of data blocks which are | |
65 | * placed in a single cylinder group. This is currently a function | |
66 | * of the block and fragment size of the file system. | |
67 | */ | |
68 | #define MAXBLKPG(fs) ((fs)->fs_fsize / sizeof(daddr_t)) | |
69 | ||
70 | /* | |
71 | * Each file system has a number of inodes statically allocated. | |
72 | * We allocate one inode slot per NBPI bytes, expecting this | |
73 | * to be far more than we will ever need. | |
74 | */ | |
75 | #define NBPI 2048 | |
76 | ||
a4222b50 SL |
77 | /* |
78 | * Disks are assumed to rotate at 60HZ, unless otherwise specified. | |
79 | */ | |
80 | #define DEFHZ 60 | |
81 | ||
d746d022 KM |
82 | #ifndef STANDALONE |
83 | #include <stdio.h> | |
84 | #include <a.out.h> | |
85 | #endif | |
86 | ||
45eb394d KM |
87 | #include <sys/param.h> |
88 | #include <sys/inode.h> | |
89 | #include <sys/fs.h> | |
14b4eb74 | 90 | #include <sys/dir.h> |
d746d022 | 91 | |
2fd3d252 | 92 | #define UMASK 0755 |
c312eebd | 93 | #define MAXINOPB (MAXBSIZE / sizeof(struct dinode)) |
2fd3d252 | 94 | #define POWEROF2(num) (((num) & ((num) - 1)) == 0) |
d746d022 KM |
95 | |
96 | union { | |
97 | struct fs fs; | |
b6407c9d | 98 | char pad[MAXBSIZE]; |
d746d022 KM |
99 | } fsun; |
100 | #define sblock fsun.fs | |
101 | struct csum *fscs; | |
102 | ||
103 | union { | |
104 | struct cg cg; | |
b6407c9d | 105 | char pad[MAXBSIZE]; |
d746d022 KM |
106 | } cgun; |
107 | #define acg cgun.cg | |
108 | ||
2fd3d252 KM |
109 | struct dinode zino[MAXIPG]; |
110 | ||
d746d022 | 111 | char *fsys; |
2fd3d252 KM |
112 | time_t utime; |
113 | int fsi; | |
114 | int fso; | |
d746d022 KM |
115 | daddr_t alloc(); |
116 | ||
d746d022 | 117 | main(argc, argv) |
b6407c9d KM |
118 | int argc; |
119 | char *argv[]; | |
d746d022 | 120 | { |
bf541624 | 121 | long cylno, rpos, blk, i, j, inos, fssize, warn = 0; |
d746d022 | 122 | |
d746d022 | 123 | #ifndef STANDALONE |
2fd3d252 | 124 | argc--, argv++; |
d746d022 | 125 | time(&utime); |
2fd3d252 | 126 | if (argc < 2) { |
b8daa521 | 127 | printf("usage: mkfs special size [ nsect ntrak bsize fsize cpg minfree rps nbpi ]\n"); |
d746d022 KM |
128 | exit(1); |
129 | } | |
130 | fsys = argv[0]; | |
2fd3d252 KM |
131 | fssize = atoi(argv[1]); |
132 | fso = creat(fsys, 0666); | |
133 | if(fso < 0) { | |
134 | printf("%s: cannot create\n", fsys); | |
135 | exit(1); | |
136 | } | |
137 | fsi = open(fsys, 0); | |
138 | if(fsi < 0) { | |
139 | printf("%s: cannot open\n", fsys); | |
140 | exit(1); | |
141 | } | |
d746d022 KM |
142 | #else |
143 | { | |
144 | static char protos[60]; | |
2fd3d252 | 145 | char fsbuf[100]; |
d746d022 KM |
146 | |
147 | printf("file sys size: "); | |
148 | gets(protos); | |
2fd3d252 | 149 | fssize = atoi(protos); |
d746d022 KM |
150 | do { |
151 | printf("file system: "); | |
152 | gets(fsbuf); | |
153 | fso = open(fsbuf, 1); | |
154 | fsi = open(fsbuf, 0); | |
155 | } while (fso < 0 || fsi < 0); | |
156 | } | |
d746d022 | 157 | argc = 0; |
2fd3d252 | 158 | #endif |
51fe1c64 KM |
159 | /* |
160 | * Validate the given file system size. | |
161 | * Verify that its last block can actually be accessed. | |
162 | */ | |
2fd3d252 KM |
163 | if (fssize <= 0) |
164 | printf("preposterous size %d\n", fssize), exit(1); | |
51fe1c64 | 165 | wtfs(fssize - 1, DEV_BSIZE, (char *)&sblock); |
2fd3d252 KM |
166 | /* |
167 | * collect and verify the sector and track info | |
168 | */ | |
169 | if (argc > 2) | |
170 | sblock.fs_nsect = atoi(argv[2]); | |
171 | else | |
172 | sblock.fs_nsect = DFLNSECT; | |
173 | if (argc > 3) | |
174 | sblock.fs_ntrak = atoi(argv[3]); | |
175 | else | |
176 | sblock.fs_ntrak = DFLNTRAK; | |
177 | if (sblock.fs_ntrak <= 0) | |
178 | printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(1); | |
179 | if (sblock.fs_nsect <= 0) | |
180 | printf("preposterous nsect %d\n", sblock.fs_nsect), exit(1); | |
181 | sblock.fs_spc = sblock.fs_ntrak * sblock.fs_nsect; | |
182 | /* | |
183 | * collect and verify the block and fragment sizes | |
184 | */ | |
185 | if (argc > 4) | |
186 | sblock.fs_bsize = atoi(argv[4]); | |
187 | else | |
c6ff3ebb | 188 | sblock.fs_bsize = DESBLKSIZE; |
2fd3d252 KM |
189 | if (argc > 5) |
190 | sblock.fs_fsize = atoi(argv[5]); | |
191 | else | |
c6ff3ebb | 192 | sblock.fs_fsize = DESFRAGSIZE; |
2fd3d252 KM |
193 | if (!POWEROF2(sblock.fs_bsize)) { |
194 | printf("block size must be a power of 2, not %d\n", | |
195 | sblock.fs_bsize); | |
d746d022 KM |
196 | exit(1); |
197 | } | |
2fd3d252 KM |
198 | if (!POWEROF2(sblock.fs_fsize)) { |
199 | printf("fragment size must be a power of 2, not %d\n", | |
200 | sblock.fs_fsize); | |
d746d022 KM |
201 | exit(1); |
202 | } | |
b6407c9d KM |
203 | if (sblock.fs_fsize < DEV_BSIZE) { |
204 | printf("fragment size %d is too small, minimum is %d\n", | |
205 | sblock.fs_fsize, DEV_BSIZE); | |
206 | exit(1); | |
207 | } | |
208 | if (sblock.fs_bsize < MINBSIZE) { | |
209 | printf("block size %d is too small, minimum is %d\n", | |
210 | sblock.fs_bsize, MINBSIZE); | |
211 | exit(1); | |
212 | } | |
2fd3d252 KM |
213 | if (sblock.fs_bsize < sblock.fs_fsize) { |
214 | printf("block size (%d) cannot be smaller than fragment size (%d)\n", | |
215 | sblock.fs_bsize, sblock.fs_fsize); | |
d746d022 KM |
216 | exit(1); |
217 | } | |
3352e84a KM |
218 | sblock.fs_bmask = ~(sblock.fs_bsize - 1); |
219 | sblock.fs_fmask = ~(sblock.fs_fsize - 1); | |
220 | for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1) | |
221 | sblock.fs_bshift++; | |
222 | for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1) | |
223 | sblock.fs_fshift++; | |
224 | sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize); | |
19782540 KM |
225 | for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1) |
226 | sblock.fs_fragshift++; | |
2fd3d252 KM |
227 | if (sblock.fs_frag > MAXFRAG) { |
228 | printf("fragment size %d is too small, minimum with block size %d is %d\n", | |
229 | sblock.fs_fsize, sblock.fs_bsize, | |
230 | sblock.fs_bsize / MAXFRAG); | |
231 | exit(1); | |
d746d022 | 232 | } |
19782540 KM |
233 | sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t); |
234 | sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode); | |
235 | sblock.fs_nspf = sblock.fs_fsize / DEV_BSIZE; | |
236 | for (sblock.fs_fsbtodb = 0, i = sblock.fs_nspf; i > 1; i >>= 1) | |
237 | sblock.fs_fsbtodb++; | |
bf541624 | 238 | sblock.fs_sblkno = |
aca50d72 | 239 | roundup(howmany(BBSIZE + SBSIZE, sblock.fs_fsize), sblock.fs_frag); |
bf541624 KM |
240 | sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno + |
241 | roundup(howmany(SBSIZE, sblock.fs_fsize), sblock.fs_frag)); | |
aca50d72 | 242 | sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag; |
bf541624 KM |
243 | sblock.fs_cgoffset = roundup( |
244 | howmany(sblock.fs_nsect, sblock.fs_fsize / DEV_BSIZE), | |
245 | sblock.fs_frag); | |
246 | for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1) | |
247 | sblock.fs_cgmask <<= 1; | |
248 | if (!POWEROF2(sblock.fs_ntrak)) | |
249 | sblock.fs_cgmask <<= 1; | |
3aaf0f69 KM |
250 | for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc; |
251 | sblock.fs_cpc > 1 && (i & 1) == 0; | |
252 | sblock.fs_cpc >>= 1, i >>= 1) | |
253 | /* void */; | |
173a62ff KM |
254 | if (sblock.fs_cpc > MAXCPG) { |
255 | printf("maximum block size with nsect %d and ntrak %d is %d\n", | |
256 | sblock.fs_nsect, sblock.fs_ntrak, | |
257 | sblock.fs_bsize / (sblock.fs_cpc / MAXCPG)); | |
258 | exit(1); | |
259 | } | |
2fd3d252 KM |
260 | /* |
261 | * collect and verify the number of cylinders per group | |
d746d022 | 262 | */ |
2fd3d252 KM |
263 | if (argc > 6) { |
264 | sblock.fs_cpg = atoi(argv[6]); | |
265 | sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock); | |
d746d022 | 266 | } else { |
3aaf0f69 | 267 | sblock.fs_cpg = MAX(sblock.fs_cpc, DESCPG); |
2fd3d252 | 268 | sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock); |
173a62ff KM |
269 | while (sblock.fs_fpg / sblock.fs_frag > MAXBPG(&sblock) && |
270 | sblock.fs_cpg > sblock.fs_cpc) { | |
271 | sblock.fs_cpg -= sblock.fs_cpc; | |
2fd3d252 KM |
272 | sblock.fs_fpg = |
273 | (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock); | |
274 | } | |
275 | } | |
276 | if (sblock.fs_cpg < 1) { | |
277 | printf("cylinder groups must have at least 1 cylinder\n"); | |
278 | exit(1); | |
279 | } | |
280 | if (sblock.fs_cpg > MAXCPG) { | |
281 | printf("cylinder groups are limited to %d cylinders\n", MAXCPG); | |
282 | exit(1); | |
d746d022 | 283 | } |
3aaf0f69 KM |
284 | if (sblock.fs_cpg % sblock.fs_cpc != 0) { |
285 | printf("cylinder groups must have a multiple of %d cylinders\n", | |
286 | sblock.fs_cpc); | |
287 | exit(1); | |
288 | } | |
2fd3d252 KM |
289 | /* |
290 | * Now have size for file system and nsect and ntrak. | |
291 | * Determine number of cylinders and blocks in the file system. | |
292 | */ | |
293 | sblock.fs_size = fssize = dbtofsb(&sblock, fssize); | |
294 | sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc; | |
aca50d72 | 295 | if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) { |
aca50d72 | 296 | sblock.fs_ncyl++; |
bf541624 | 297 | warn = 1; |
aca50d72 KM |
298 | } |
299 | if (sblock.fs_ncyl < 1) { | |
300 | printf("file systems must have at least one cylinder\n"); | |
2fd3d252 KM |
301 | exit(1); |
302 | } | |
aca50d72 KM |
303 | /* |
304 | * determine feasability/values of rotational layout tables | |
305 | */ | |
306 | if (sblock.fs_ntrak == 1) { | |
307 | sblock.fs_cpc = 0; | |
308 | goto next; | |
309 | } | |
aca50d72 KM |
310 | if (sblock.fs_spc * sblock.fs_cpc > MAXBPC * NSPB(&sblock) || |
311 | sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) { | |
312 | printf("%s %s %d %s %d.%s", | |
313 | "Warning: insufficient space in super block for\n", | |
314 | "rotational layout tables with nsect", sblock.fs_nsect, | |
315 | "and ntrak", sblock.fs_ntrak, | |
316 | "\nFile system performance may be impared.\n"); | |
317 | sblock.fs_cpc = 0; | |
318 | goto next; | |
319 | } | |
320 | /* | |
321 | * calculate the available blocks for each rotational position | |
322 | */ | |
323 | for (cylno = 0; cylno < MAXCPG; cylno++) | |
324 | for (rpos = 0; rpos < NRPOS; rpos++) | |
325 | sblock.fs_postbl[cylno][rpos] = -1; | |
326 | blk = sblock.fs_spc * sblock.fs_cpc / NSPF(&sblock); | |
327 | for (i = 0; i < blk; i += sblock.fs_frag) | |
328 | /* void */; | |
329 | for (i -= sblock.fs_frag; i >= 0; i -= sblock.fs_frag) { | |
330 | cylno = cbtocylno(&sblock, i); | |
331 | rpos = cbtorpos(&sblock, i); | |
332 | blk = i / sblock.fs_frag; | |
333 | if (sblock.fs_postbl[cylno][rpos] == -1) | |
334 | sblock.fs_rotbl[blk] = 0; | |
335 | else | |
336 | sblock.fs_rotbl[blk] = | |
337 | sblock.fs_postbl[cylno][rpos] - blk; | |
338 | sblock.fs_postbl[cylno][rpos] = blk; | |
339 | } | |
340 | next: | |
2fd3d252 KM |
341 | /* |
342 | * Validate specified/determined cpg. | |
343 | */ | |
344 | if (sblock.fs_spc > MAXBPG(&sblock) * NSPB(&sblock)) { | |
345 | printf("too many sectors per cylinder (%d sectors)\n", | |
346 | sblock.fs_spc); | |
347 | while(sblock.fs_spc > MAXBPG(&sblock) * NSPB(&sblock)) { | |
348 | sblock.fs_bsize <<= 1; | |
349 | if (sblock.fs_frag < MAXFRAG) | |
350 | sblock.fs_frag <<= 1; | |
351 | else | |
352 | sblock.fs_fsize <<= 1; | |
353 | } | |
354 | printf("nsect %d, and ntrak %d, requires block size of %d,\n", | |
355 | sblock.fs_nsect, sblock.fs_ntrak, sblock.fs_bsize); | |
356 | printf("\tand fragment size of %d\n", sblock.fs_fsize); | |
357 | exit(1); | |
358 | } | |
359 | if (sblock.fs_fpg > MAXBPG(&sblock) * sblock.fs_frag) { | |
360 | printf("cylinder group too large (%d cylinders); ", | |
361 | sblock.fs_cpg); | |
aca50d72 | 362 | printf("max: %d cylinders per group\n", |
2fd3d252 KM |
363 | MAXBPG(&sblock) * sblock.fs_frag / |
364 | (sblock.fs_fpg / sblock.fs_cpg)); | |
365 | exit(1); | |
366 | } | |
3352e84a KM |
367 | sblock.fs_cgsize = fragroundup(&sblock, |
368 | sizeof(struct cg) + howmany(sblock.fs_fpg, NBBY)); | |
d746d022 KM |
369 | /* |
370 | * Compute/validate number of cylinder groups. | |
371 | */ | |
372 | sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg; | |
373 | if (sblock.fs_ncyl % sblock.fs_cpg) | |
374 | sblock.fs_ncg++; | |
2fd3d252 | 375 | if ((sblock.fs_spc * sblock.fs_cpg) % NSPF(&sblock)) { |
d746d022 KM |
376 | printf("mkfs: nsect %d, ntrak %d, cpg %d is not tolerable\n", |
377 | sblock.fs_nsect, sblock.fs_ntrak, sblock.fs_cpg); | |
378 | printf("as this would would have cyl groups whose size\n"); | |
b6407c9d | 379 | printf("is not a multiple of %d; choke!\n", sblock.fs_fsize); |
d746d022 KM |
380 | exit(1); |
381 | } | |
d746d022 KM |
382 | /* |
383 | * Compute number of inode blocks per cylinder group. | |
384 | * Start with one inode per NBPI bytes; adjust as necessary. | |
385 | */ | |
b8daa521 KM |
386 | inos = MAX(NBPI, sblock.fs_fsize); |
387 | if (argc > 9) { | |
388 | i = atoi(argv[9]); | |
389 | if (i <= 0) | |
390 | printf("%s: bogus nbpi reset to %d\n", argv[9], inos); | |
391 | else | |
392 | inos = i; | |
393 | } | |
aca50d72 | 394 | i = sblock.fs_iblkno + MAXIPG / INOPF(&sblock); |
b8daa521 KM |
395 | inos = (fssize - sblock.fs_ncg * i) * sblock.fs_fsize / inos / |
396 | INOPB(&sblock); | |
2fd3d252 KM |
397 | if (inos <= 0) |
398 | inos = 1; | |
399 | sblock.fs_ipg = ((inos / sblock.fs_ncg) + 1) * INOPB(&sblock); | |
d746d022 KM |
400 | if (sblock.fs_ipg > MAXIPG) |
401 | sblock.fs_ipg = MAXIPG; | |
aca50d72 | 402 | sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock); |
bf541624 KM |
403 | i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1); |
404 | if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) { | |
d746d022 | 405 | printf("inode blocks/cyl group (%d) >= data blocks (%d)\n", |
bf541624 | 406 | cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag, |
b6407c9d | 407 | sblock.fs_fpg / sblock.fs_frag); |
bf541624 | 408 | printf("number of cylinders per cylinder group must be increased\n"); |
b6407c9d KM |
409 | exit(1); |
410 | } | |
bf541624 KM |
411 | j = sblock.fs_ncg - 1; |
412 | if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg && | |
413 | cgdmin(&sblock, j) - cgbase(&sblock, j) > i) { | |
414 | printf("Warning: inode blocks/cyl group (%d) >= data blocks (%d) in last\n", | |
415 | (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag, | |
416 | i / sblock.fs_frag); | |
417 | printf(" cylinder group. This implies %d sector(s) cannot be allocated.\n", | |
418 | i * NSPF(&sblock)); | |
419 | sblock.fs_ncg--; | |
420 | sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg; | |
421 | sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc / | |
422 | NSPF(&sblock); | |
423 | warn = 0; | |
424 | } | |
425 | if (warn) { | |
426 | printf("Warning: %d sector(s) in last cylinder unallocated\n", | |
427 | sblock.fs_spc - | |
428 | (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1) | |
429 | * sblock.fs_spc)); | |
430 | } | |
2fd3d252 KM |
431 | /* |
432 | * fill in remaining fields of the super block | |
433 | */ | |
6994bf5d | 434 | sblock.fs_csaddr = cgdmin(&sblock, 0); |
bf541624 KM |
435 | sblock.fs_cssize = |
436 | fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum)); | |
19782540 KM |
437 | i = sblock.fs_bsize / sizeof(struct csum); |
438 | sblock.fs_csmask = ~(i - 1); | |
439 | for (sblock.fs_csshift = 0; i > 1; i >>= 1) | |
440 | sblock.fs_csshift++; | |
441 | i = sizeof(struct fs) + | |
442 | howmany(sblock.fs_spc * sblock.fs_cpc, NSPB(&sblock)); | |
443 | sblock.fs_sbsize = fragroundup(&sblock, i); | |
bf541624 | 444 | fscs = (struct csum *)calloc(1, sblock.fs_cssize); |
aca50d72 | 445 | sblock.fs_magic = FS_MAGIC; |
2fd3d252 | 446 | sblock.fs_rotdelay = ROTDELAY; |
a4222b50 SL |
447 | if (argc > 7) { |
448 | sblock.fs_minfree = atoi(argv[7]); | |
449 | if (sblock.fs_minfree < 0 || sblock.fs_minfree > 99) { | |
450 | printf("%s: bogus minfree reset to %d%%\n", argv[7], | |
451 | MINFREE); | |
452 | sblock.fs_minfree = MINFREE; | |
453 | } | |
454 | } else | |
455 | sblock.fs_minfree = MINFREE; | |
c6ff3ebb KM |
456 | sblock.fs_maxcontig = MAXCONTIG; |
457 | sblock.fs_maxbpg = MAXBLKPG(&sblock); | |
a4222b50 SL |
458 | if (argc > 8) |
459 | sblock.fs_rps = atoi(argv[8]); | |
460 | else | |
461 | sblock.fs_rps = DEFHZ; | |
2fd3d252 KM |
462 | sblock.fs_cgrotor = 0; |
463 | sblock.fs_cstotal.cs_ndir = 0; | |
464 | sblock.fs_cstotal.cs_nbfree = 0; | |
465 | sblock.fs_cstotal.cs_nifree = 0; | |
466 | sblock.fs_cstotal.cs_nffree = 0; | |
d746d022 KM |
467 | sblock.fs_fmod = 0; |
468 | sblock.fs_ronly = 0; | |
d746d022 | 469 | /* |
2fd3d252 | 470 | * Dump out summary information about file system. |
d746d022 KM |
471 | */ |
472 | printf("%s:\t%d sectors in %d cylinders of %d tracks, %d sectors\n", | |
2fd3d252 | 473 | fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl, |
b6407c9d | 474 | sblock.fs_ntrak, sblock.fs_nsect); |
d746d022 | 475 | printf("\t%.1fMb in %d cyl groups (%d c/g, %.2fMb/g, %d i/g)\n", |
b6407c9d KM |
476 | (float)sblock.fs_size * sblock.fs_fsize * 1e-6, sblock.fs_ncg, |
477 | sblock.fs_cpg, (float)sblock.fs_fpg * sblock.fs_fsize * 1e-6, | |
478 | sblock.fs_ipg); | |
d746d022 KM |
479 | /* |
480 | * Now build the cylinders group blocks and | |
2fd3d252 | 481 | * then print out indices of cylinder groups. |
d746d022 | 482 | */ |
bf541624 KM |
483 | printf("super-block backups (for fsck -b#) at:"); |
484 | for (cylno = 0; cylno < sblock.fs_ncg; cylno++) { | |
aca50d72 | 485 | initcg(cylno); |
bf541624 KM |
486 | if (cylno % 10 == 0) |
487 | printf("\n"); | |
488 | printf(" %d,", fsbtodb(&sblock, cgsblock(&sblock, cylno))); | |
489 | } | |
4f38a6d0 | 490 | printf("\n"); |
d746d022 | 491 | /* |
2fd3d252 | 492 | * Now construct the initial file system, |
d746d022 KM |
493 | * then write out the super-block. |
494 | */ | |
2fd3d252 | 495 | fsinit(); |
d746d022 | 496 | sblock.fs_time = utime; |
2fd3d252 | 497 | wtfs(SBLOCK, SBSIZE, (char *)&sblock); |
b6407c9d | 498 | for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) |
3352e84a | 499 | wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)), |
bf541624 KM |
500 | sblock.fs_cssize - i < sblock.fs_bsize ? |
501 | sblock.fs_cssize - i : sblock.fs_bsize, | |
502 | ((char *)fscs) + i); | |
2fd3d252 KM |
503 | /* |
504 | * Write out the duplicate super blocks | |
505 | */ | |
c2b9e883 | 506 | for (cylno = 0; cylno < sblock.fs_ncg; cylno++) |
bf541624 KM |
507 | wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), |
508 | SBSIZE, (char *)&sblock); | |
d746d022 | 509 | #ifndef STANDALONE |
2fd3d252 | 510 | exit(0); |
d746d022 KM |
511 | #endif |
512 | } | |
513 | ||
514 | /* | |
515 | * Initialize a cylinder group. | |
516 | */ | |
aca50d72 KM |
517 | initcg(cylno) |
518 | int cylno; | |
d746d022 | 519 | { |
bf541624 | 520 | daddr_t cbase, d, dlower, dupper, dmax; |
d746d022 KM |
521 | long i, j, s; |
522 | register struct csum *cs; | |
523 | ||
524 | /* | |
525 | * Determine block bounds for cylinder group. | |
526 | * Allow space for super block summary information in first | |
527 | * cylinder group. | |
528 | */ | |
6994bf5d | 529 | cbase = cgbase(&sblock, cylno); |
d746d022 KM |
530 | dmax = cbase + sblock.fs_fpg; |
531 | if (dmax > sblock.fs_size) | |
532 | dmax = sblock.fs_size; | |
bf541624 KM |
533 | dlower = cgsblock(&sblock, cylno) - cbase; |
534 | dupper = cgdmin(&sblock, cylno) - cbase; | |
aca50d72 | 535 | cs = fscs + cylno; |
d746d022 KM |
536 | acg.cg_time = utime; |
537 | acg.cg_magic = CG_MAGIC; | |
aca50d72 | 538 | acg.cg_cgx = cylno; |
bb40745e KM |
539 | if (cylno == sblock.fs_ncg - 1) |
540 | acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg; | |
541 | else | |
542 | acg.cg_ncyl = sblock.fs_cpg; | |
d746d022 KM |
543 | acg.cg_niblk = sblock.fs_ipg; |
544 | acg.cg_ndblk = dmax - cbase; | |
0947395d KM |
545 | acg.cg_cs.cs_ndir = 0; |
546 | acg.cg_cs.cs_nffree = 0; | |
547 | acg.cg_cs.cs_nbfree = 0; | |
548 | acg.cg_cs.cs_nifree = 0; | |
bf541624 KM |
549 | acg.cg_rotor = 0; |
550 | acg.cg_frotor = 0; | |
92ea6158 | 551 | acg.cg_irotor = 0; |
b6407c9d | 552 | for (i = 0; i < sblock.fs_frag; i++) { |
f3c028b7 KM |
553 | acg.cg_frsum[i] = 0; |
554 | } | |
555 | for (i = 0; i < sblock.fs_ipg; ) { | |
b6407c9d | 556 | for (j = INOPB(&sblock); j > 0; j--) { |
d746d022 KM |
557 | clrbit(acg.cg_iused, i); |
558 | i++; | |
559 | } | |
b6407c9d | 560 | acg.cg_cs.cs_nifree += INOPB(&sblock); |
d746d022 | 561 | } |
aca50d72 | 562 | if (cylno == 0) |
2fd3d252 KM |
563 | for (i = 0; i < ROOTINO; i++) { |
564 | setbit(acg.cg_iused, i); | |
565 | acg.cg_cs.cs_nifree--; | |
566 | } | |
d746d022 KM |
567 | while (i < MAXIPG) { |
568 | clrbit(acg.cg_iused, i); | |
569 | i++; | |
570 | } | |
6994bf5d | 571 | lseek(fso, fsbtodb(&sblock, cgimin(&sblock, cylno)) * DEV_BSIZE, 0); |
d746d022 KM |
572 | if (write(fso, (char *)zino, sblock.fs_ipg * sizeof (struct dinode)) != |
573 | sblock.fs_ipg * sizeof (struct dinode)) | |
3352e84a | 574 | printf("write error %D\n", numfrags(&sblock, tell(fso))); |
43f6367c KM |
575 | for (i = 0; i < MAXCPG; i++) { |
576 | acg.cg_btot[i] = 0; | |
d746d022 KM |
577 | for (j = 0; j < NRPOS; j++) |
578 | acg.cg_b[i][j] = 0; | |
43f6367c | 579 | } |
aca50d72 | 580 | if (cylno == 0) { |
bf541624 KM |
581 | /* |
582 | * reserve space for summary info and Boot block | |
583 | */ | |
584 | dupper += howmany(sblock.fs_cssize, sblock.fs_fsize); | |
585 | for (d = 0; d < dlower; d += sblock.fs_frag) | |
586 | clrblock(&sblock, acg.cg_free, d/sblock.fs_frag); | |
587 | } else { | |
588 | for (d = 0; d < dlower; d += sblock.fs_frag) { | |
589 | setblock(&sblock, acg.cg_free, d/sblock.fs_frag); | |
590 | acg.cg_cs.cs_nbfree++; | |
591 | acg.cg_btot[cbtocylno(&sblock, d)]++; | |
592 | acg.cg_b[cbtocylno(&sblock, d)][cbtorpos(&sblock, d)]++; | |
593 | } | |
594 | sblock.fs_dsize += dlower; | |
d746d022 | 595 | } |
bf541624 KM |
596 | sblock.fs_dsize += acg.cg_ndblk - dupper; |
597 | for (; d < dupper; d += sblock.fs_frag) | |
b6407c9d | 598 | clrblock(&sblock, acg.cg_free, d/sblock.fs_frag); |
bf541624 KM |
599 | if (d > dupper) { |
600 | acg.cg_frsum[d - dupper]++; | |
601 | for (i = d - 1; i >= dupper; i--) { | |
602 | setbit(acg.cg_free, i); | |
603 | acg.cg_cs.cs_nffree++; | |
604 | } | |
605 | } | |
606 | while ((d + sblock.fs_frag) <= dmax - cbase) { | |
b6407c9d | 607 | setblock(&sblock, acg.cg_free, d/sblock.fs_frag); |
0947395d | 608 | acg.cg_cs.cs_nbfree++; |
43f6367c | 609 | acg.cg_btot[cbtocylno(&sblock, d)]++; |
aca50d72 | 610 | acg.cg_b[cbtocylno(&sblock, d)][cbtorpos(&sblock, d)]++; |
b6407c9d | 611 | d += sblock.fs_frag; |
d746d022 | 612 | } |
bf541624 | 613 | if (d < dmax - cbase) { |
aca50d72 | 614 | acg.cg_frsum[dmax - cbase - d]++; |
56d45dcd KM |
615 | for (; d < dmax - cbase; d++) { |
616 | setbit(acg.cg_free, d); | |
0947395d | 617 | acg.cg_cs.cs_nffree++; |
56d45dcd | 618 | } |
bb40745e KM |
619 | for (; d % sblock.fs_frag != 0; d++) |
620 | clrbit(acg.cg_free, d); | |
bf541624 | 621 | } |
bb40745e KM |
622 | for (d /= sblock.fs_frag; d < MAXBPG(&sblock); d ++) |
623 | clrblock(&sblock, acg.cg_free, d); | |
0947395d KM |
624 | sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir; |
625 | sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree; | |
626 | sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree; | |
627 | sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree; | |
628 | *cs = acg.cg_cs; | |
6994bf5d | 629 | wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)), |
b6407c9d | 630 | sblock.fs_bsize, (char *)&acg); |
d746d022 KM |
631 | } |
632 | ||
2fd3d252 KM |
633 | /* |
634 | * initialize the file system | |
635 | */ | |
636 | struct inode node; | |
637 | #define PREDEFDIR 3 | |
052efd62 KM |
638 | struct direct root_dir[] = { |
639 | { ROOTINO, sizeof(struct direct), 1, "." }, | |
640 | { ROOTINO, sizeof(struct direct), 2, ".." }, | |
641 | { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" }, | |
2fd3d252 | 642 | }; |
052efd62 KM |
643 | struct direct lost_found_dir[] = { |
644 | { LOSTFOUNDINO, sizeof(struct direct), 1, "." }, | |
645 | { ROOTINO, sizeof(struct direct), 2, ".." }, | |
646 | { 0, DIRBLKSIZ, 0, 0 }, | |
2fd3d252 | 647 | }; |
052efd62 | 648 | char buf[MAXBSIZE]; |
2fd3d252 KM |
649 | |
650 | fsinit() | |
d746d022 | 651 | { |
052efd62 KM |
652 | int i; |
653 | ||
d746d022 | 654 | /* |
2fd3d252 | 655 | * initialize the node |
d746d022 | 656 | */ |
2fd3d252 KM |
657 | node.i_atime = utime; |
658 | node.i_mtime = utime; | |
659 | node.i_ctime = utime; | |
d746d022 | 660 | /* |
2fd3d252 | 661 | * create the lost+found directory |
d746d022 | 662 | */ |
052efd62 KM |
663 | (void)makedir(lost_found_dir, 2); |
664 | for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ) | |
665 | bcopy(&lost_found_dir[2], &buf[i], DIRSIZ(&lost_found_dir[2])); | |
2fd3d252 KM |
666 | node.i_number = LOSTFOUNDINO; |
667 | node.i_mode = IFDIR | UMASK; | |
668 | node.i_nlink = 2; | |
669 | node.i_size = sblock.fs_bsize; | |
670 | node.i_db[0] = alloc(node.i_size, node.i_mode); | |
cdbcf1b5 | 671 | node.i_blocks = btodb(fragroundup(&sblock, node.i_size)); |
052efd62 | 672 | wtfs(fsbtodb(&sblock, node.i_db[0]), node.i_size, buf); |
2fd3d252 KM |
673 | iput(&node); |
674 | /* | |
675 | * create the root directory | |
676 | */ | |
677 | node.i_number = ROOTINO; | |
678 | node.i_mode = IFDIR | UMASK; | |
679 | node.i_nlink = PREDEFDIR; | |
052efd62 | 680 | node.i_size = makedir(root_dir, PREDEFDIR); |
2fd3d252 | 681 | node.i_db[0] = alloc(sblock.fs_fsize, node.i_mode); |
cdbcf1b5 | 682 | node.i_blocks = btodb(fragroundup(&sblock, node.i_size)); |
052efd62 | 683 | wtfs(fsbtodb(&sblock, node.i_db[0]), sblock.fs_fsize, buf); |
2fd3d252 | 684 | iput(&node); |
d746d022 KM |
685 | } |
686 | ||
052efd62 KM |
687 | /* |
688 | * construct a set of directory entries in "buf". | |
689 | * return size of directory. | |
690 | */ | |
691 | makedir(protodir, entries) | |
692 | register struct direct *protodir; | |
693 | int entries; | |
694 | { | |
695 | char *cp; | |
696 | int i, spcleft; | |
697 | ||
698 | spcleft = DIRBLKSIZ; | |
699 | for (cp = buf, i = 0; i < entries - 1; i++) { | |
700 | protodir[i].d_reclen = DIRSIZ(&protodir[i]); | |
701 | bcopy(&protodir[i], cp, protodir[i].d_reclen); | |
702 | cp += protodir[i].d_reclen; | |
703 | spcleft -= protodir[i].d_reclen; | |
704 | } | |
705 | protodir[i].d_reclen = spcleft; | |
706 | bcopy(&protodir[i], cp, DIRSIZ(&protodir[i])); | |
707 | cp += DIRSIZ(&protodir[i]); | |
708 | return (cp - buf); | |
709 | } | |
710 | ||
2fd3d252 KM |
711 | /* |
712 | * allocate a block or frag | |
713 | */ | |
d746d022 | 714 | daddr_t |
07670f7d KM |
715 | alloc(size, mode) |
716 | int size; | |
717 | int mode; | |
d746d022 | 718 | { |
aca50d72 | 719 | int i, frag; |
d746d022 KM |
720 | daddr_t d; |
721 | ||
3352e84a KM |
722 | rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, |
723 | (char *)&acg); | |
bf541624 KM |
724 | if (acg.cg_magic != CG_MAGIC) { |
725 | printf("cg 0: bad magic number\n"); | |
726 | return (0); | |
727 | } | |
0947395d | 728 | if (acg.cg_cs.cs_nbfree == 0) { |
d746d022 KM |
729 | printf("first cylinder group ran out of space\n"); |
730 | return (0); | |
731 | } | |
b6407c9d KM |
732 | for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag) |
733 | if (isblock(&sblock, acg.cg_free, d / sblock.fs_frag)) | |
d746d022 KM |
734 | goto goth; |
735 | printf("internal error: can't find block in cyl 0\n"); | |
736 | return (0); | |
737 | goth: | |
b6407c9d | 738 | clrblock(&sblock, acg.cg_free, d / sblock.fs_frag); |
0947395d KM |
739 | acg.cg_cs.cs_nbfree--; |
740 | sblock.fs_cstotal.cs_nbfree--; | |
d746d022 | 741 | fscs[0].cs_nbfree--; |
07670f7d | 742 | if (mode & IFDIR) { |
0947395d KM |
743 | acg.cg_cs.cs_ndir++; |
744 | sblock.fs_cstotal.cs_ndir++; | |
07670f7d KM |
745 | fscs[0].cs_ndir++; |
746 | } | |
43f6367c | 747 | acg.cg_btot[cbtocylno(&sblock, d)]--; |
aca50d72 | 748 | acg.cg_b[cbtocylno(&sblock, d)][cbtorpos(&sblock, d)]--; |
b6407c9d KM |
749 | if (size != sblock.fs_bsize) { |
750 | frag = howmany(size, sblock.fs_fsize); | |
751 | fscs[0].cs_nffree += sblock.fs_frag - frag; | |
752 | sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag; | |
753 | acg.cg_cs.cs_nffree += sblock.fs_frag - frag; | |
754 | acg.cg_frsum[sblock.fs_frag - frag]++; | |
755 | for (i = frag; i < sblock.fs_frag; i++) | |
bf541624 | 756 | setbit(acg.cg_free, d + i); |
d746d022 | 757 | } |
3352e84a KM |
758 | wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, |
759 | (char *)&acg); | |
d746d022 KM |
760 | return (d); |
761 | } | |
762 | ||
2fd3d252 KM |
763 | /* |
764 | * Allocate an inode on the disk | |
765 | */ | |
766 | iput(ip) | |
767 | register struct inode *ip; | |
d746d022 | 768 | { |
2fd3d252 | 769 | struct dinode buf[MAXINOPB]; |
d746d022 | 770 | daddr_t d; |
2fd3d252 | 771 | int c; |
d746d022 | 772 | |
6994bf5d | 773 | c = itog(&sblock, ip->i_number); |
3352e84a KM |
774 | rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, |
775 | (char *)&acg); | |
bf541624 KM |
776 | if (acg.cg_magic != CG_MAGIC) { |
777 | printf("cg 0: bad magic number\n"); | |
778 | exit(1); | |
779 | } | |
0947395d | 780 | acg.cg_cs.cs_nifree--; |
d746d022 | 781 | setbit(acg.cg_iused, ip->i_number); |
3352e84a KM |
782 | wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, |
783 | (char *)&acg); | |
0947395d | 784 | sblock.fs_cstotal.cs_nifree--; |
d746d022 | 785 | fscs[0].cs_nifree--; |
d746d022 | 786 | if(ip->i_number >= sblock.fs_ipg * sblock.fs_ncg) { |
2fd3d252 KM |
787 | printf("fsinit: inode value out of range (%d).\n", |
788 | ip->i_number); | |
789 | exit(1); | |
d746d022 | 790 | } |
6994bf5d | 791 | d = fsbtodb(&sblock, itod(&sblock, ip->i_number)); |
2fd3d252 | 792 | rdfs(d, sblock.fs_bsize, buf); |
6994bf5d | 793 | buf[itoo(&sblock, ip->i_number)].di_ic = ip->i_ic; |
2fd3d252 KM |
794 | wtfs(d, sblock.fs_bsize, buf); |
795 | } | |
796 | ||
797 | /* | |
798 | * read a block from the file system | |
799 | */ | |
800 | rdfs(bno, size, bf) | |
801 | daddr_t bno; | |
802 | int size; | |
803 | char *bf; | |
804 | { | |
805 | int n; | |
806 | ||
c312eebd KM |
807 | if (lseek(fsi, bno * DEV_BSIZE, 0) < 0) { |
808 | printf("seek error: %ld\n", bno); | |
809 | perror("rdfs"); | |
810 | exit(1); | |
811 | } | |
2fd3d252 KM |
812 | n = read(fsi, bf, size); |
813 | if(n != size) { | |
814 | printf("read error: %ld\n", bno); | |
c312eebd | 815 | perror("rdfs"); |
2fd3d252 | 816 | exit(1); |
b6407c9d | 817 | } |
b6407c9d KM |
818 | } |
819 | ||
820 | /* | |
2fd3d252 | 821 | * write a block to the file system |
b6407c9d | 822 | */ |
2fd3d252 KM |
823 | wtfs(bno, size, bf) |
824 | daddr_t bno; | |
825 | int size; | |
826 | char *bf; | |
827 | { | |
828 | int n; | |
829 | ||
c312eebd KM |
830 | if (lseek(fso, bno * DEV_BSIZE, 0) < 0) { |
831 | printf("seek error: %ld\n", bno); | |
832 | perror("wtfs"); | |
833 | exit(1); | |
834 | } | |
2fd3d252 KM |
835 | n = write(fso, bf, size); |
836 | if(n != size) { | |
837 | printf("write error: %D\n", bno); | |
c312eebd | 838 | perror("wtfs"); |
2fd3d252 KM |
839 | exit(1); |
840 | } | |
841 | } | |
b6407c9d | 842 | |
2fd3d252 KM |
843 | /* |
844 | * check if a block is available | |
845 | */ | |
b6407c9d KM |
846 | isblock(fs, cp, h) |
847 | struct fs *fs; | |
848 | unsigned char *cp; | |
849 | int h; | |
850 | { | |
851 | unsigned char mask; | |
852 | ||
853 | switch (fs->fs_frag) { | |
854 | case 8: | |
855 | return (cp[h] == 0xff); | |
856 | case 4: | |
857 | mask = 0x0f << ((h & 0x1) << 2); | |
858 | return ((cp[h >> 1] & mask) == mask); | |
859 | case 2: | |
860 | mask = 0x03 << ((h & 0x3) << 1); | |
861 | return ((cp[h >> 2] & mask) == mask); | |
862 | case 1: | |
863 | mask = 0x01 << (h & 0x7); | |
864 | return ((cp[h >> 3] & mask) == mask); | |
865 | default: | |
4384e5a5 KM |
866 | #ifdef STANDALONE |
867 | printf("isblock bad fs_frag %d\n", fs->fs_frag); | |
868 | #else | |
b6407c9d | 869 | fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag); |
4384e5a5 | 870 | #endif |
b6407c9d KM |
871 | return; |
872 | } | |
873 | } | |
874 | ||
2fd3d252 KM |
875 | /* |
876 | * take a block out of the map | |
877 | */ | |
b6407c9d KM |
878 | clrblock(fs, cp, h) |
879 | struct fs *fs; | |
880 | unsigned char *cp; | |
881 | int h; | |
882 | { | |
883 | switch ((fs)->fs_frag) { | |
884 | case 8: | |
885 | cp[h] = 0; | |
886 | return; | |
887 | case 4: | |
888 | cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); | |
889 | return; | |
890 | case 2: | |
891 | cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); | |
892 | return; | |
893 | case 1: | |
894 | cp[h >> 3] &= ~(0x01 << (h & 0x7)); | |
895 | return; | |
896 | default: | |
4384e5a5 KM |
897 | #ifdef STANDALONE |
898 | printf("clrblock bad fs_frag %d\n", fs->fs_frag); | |
899 | #else | |
b6407c9d | 900 | fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag); |
4384e5a5 | 901 | #endif |
b6407c9d KM |
902 | return; |
903 | } | |
904 | } | |
905 | ||
2fd3d252 KM |
906 | /* |
907 | * put a block into the map | |
908 | */ | |
b6407c9d KM |
909 | setblock(fs, cp, h) |
910 | struct fs *fs; | |
911 | unsigned char *cp; | |
912 | int h; | |
913 | { | |
914 | switch (fs->fs_frag) { | |
915 | case 8: | |
916 | cp[h] = 0xff; | |
917 | return; | |
918 | case 4: | |
919 | cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); | |
920 | return; | |
921 | case 2: | |
922 | cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); | |
923 | return; | |
924 | case 1: | |
925 | cp[h >> 3] |= (0x01 << (h & 0x7)); | |
926 | return; | |
927 | default: | |
4384e5a5 KM |
928 | #ifdef STANDALONE |
929 | printf("setblock bad fs_frag %d\n", fs->fs_frag); | |
930 | #else | |
b6407c9d | 931 | fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag); |
4384e5a5 | 932 | #endif |
b6407c9d | 933 | return; |
d746d022 | 934 | } |
d746d022 | 935 | } |