1 /*
2 * Copyright (c) 1980, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * %sccs.include.redist.c%
6 */
7
8 #ifndef lint
9 static char sccsid[] = "@(#)mkfs.c 8.11 (Berkeley) 05/03/95";
10 #endif /* not lint */
11
12 #include <unistd.h>
13 #include <sys/param.h>
14 #include <sys/time.h>
15 #include <sys/wait.h>
16 #include <sys/resource.h>
17 #include <ufs/ufs/dinode.h>
18 #include <ufs/ufs/dir.h>
19 #include <ufs/ffs/fs.h>
20 #include <sys/disklabel.h>
21
22 #ifndef STANDALONE
23 #include <a.out.h>
24 #include <stdio.h>
25 #endif
26
27 /*
28 * make file system for cylinder-group style file systems
29 */
30
31 /*
32 * We limit the size of the inode map to be no more than a
33 * third of the cylinder group space, since we must leave at
34 * least an equal amount of space for the block map.
35 *
36 * N.B.: MAXIPG must be a multiple of INOPB(fs).
37 */
38 #define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs))
39
40 #define UMASK 0755
41 #define MAXINOPB (MAXBSIZE / sizeof(struct dinode))
42 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
43
44 /*
45 * variables set up by front end.
46 */
47 extern int mfs; /* run as the memory based filesystem */
48 extern int Nflag; /* run mkfs without writing file system */
49 extern int Oflag; /* format as an 4.3BSD file system */
50 extern int fssize; /* file system size */
51 extern int ntracks; /* # tracks/cylinder */
52 extern int nsectors; /* # sectors/track */
53 extern int nphyssectors; /* # sectors/track including spares */
54 extern int secpercyl; /* sectors per cylinder */
55 extern int sectorsize; /* bytes/sector */
56 extern int rpm; /* revolutions/minute of drive */
57 extern int interleave; /* hardware sector interleave */
58 extern int trackskew; /* sector 0 skew, per track */
59 extern int headswitch; /* head switch time, usec */
60 extern int trackseek; /* track-to-track seek, usec */
61 extern int fsize; /* fragment size */
62 extern int bsize; /* block size */
63 extern int cpg; /* cylinders/cylinder group */
64 extern int cpgflg; /* cylinders/cylinder group flag was given */
65 extern int minfree; /* free space threshold */
66 extern int opt; /* optimization preference (space or time) */
67 extern int density; /* number of bytes per inode */
68 extern int maxcontig; /* max contiguous blocks to allocate */
69 extern int rotdelay; /* rotational delay between blocks */
70 extern int maxbpg; /* maximum blocks per file in a cyl group */
71 extern int nrpos; /* # of distinguished rotational positions */
72 extern int bbsize; /* boot block size */
73 extern int sbsize; /* superblock size */
74 extern u_long memleft; /* virtual memory available */
75 extern caddr_t membase; /* start address of memory based filesystem */
76 extern caddr_t malloc(), calloc();
77
78 union {
79 struct fs fs;
80 char pad[SBSIZE];
81 } fsun;
82 #define sblock fsun.fs
83 struct csum *fscs;
84
85 union {
86 struct cg cg;
87 char pad[MAXBSIZE];
88 } cgun;
89 #define acg cgun.cg
90
91 struct dinode zino[MAXBSIZE / sizeof(struct dinode)];
92
93 int fsi, fso;
94 daddr_t alloc();
95 long calcipg();
96
97 mkfs(pp, fsys, fi, fo)
98 struct partition *pp;
99 char *fsys;
100 int fi, fo;
101 {
102 register long i, mincpc, mincpg, inospercg;
103 long cylno, rpos, blk, j, warn = 0;
104 long used, mincpgcnt, bpcg;
105 off_t usedb;
106 long mapcramped, inodecramped;
107 long postblsize, rotblsize, totalsbsize;
108 int ppid, status;
109 time_t utime;
110 quad_t sizepb;
111 void started();
112
113 #ifndef STANDALONE
114 time(&utime);
115 #endif
116 if (mfs) {
117 ppid = getpid();
118 (void) signal(SIGUSR1, started);
119 if (i = fork()) {
120 if (i == -1) {
121 perror("mfs");
122 exit(10);
123 }
124 if (waitpid(i, &status, 0) != -1 && WIFEXITED(status))
125 exit(WEXITSTATUS(status));
126 exit(11);
127 /* NOTREACHED */
128 }
129 (void)malloc(0);
130 if (fssize * sectorsize > memleft)
131 fssize = (memleft - 16384) / sectorsize;
132 if ((membase = malloc(fssize * sectorsize)) == 0)
133 exit(12);
134 }
135 fsi = fi;
136 fso = fo;
137 if (Oflag) {
138 sblock.fs_inodefmt = FS_42INODEFMT;
139 sblock.fs_maxsymlinklen = 0;
140 } else {
141 sblock.fs_inodefmt = FS_44INODEFMT;
142 sblock.fs_maxsymlinklen = MAXSYMLINKLEN;
143 }
144 /*
145 * Validate the given file system size.
146 * Verify that its last block can actually be accessed.
147 */
148 if (fssize <= 0)
149 printf("preposterous size %d\n", fssize), exit(13);
150 wtfs(fssize - 1, sectorsize, (char *)&sblock);
151 /*
152 * collect and verify the sector and track info
153 */
154 sblock.fs_nsect = nsectors;
155 sblock.fs_ntrak = ntracks;
156 if (sblock.fs_ntrak <= 0)
157 printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14);
158 if (sblock.fs_nsect <= 0)
159 printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15);
160 /*
161 * collect and verify the block and fragment sizes
162 */
163 sblock.fs_bsize = bsize;
164 sblock.fs_fsize = fsize;
165 if (!POWEROF2(sblock.fs_bsize)) {
166 printf("block size must be a power of 2, not %d\n",
167 sblock.fs_bsize);
168 exit(16);
169 }
170 if (!POWEROF2(sblock.fs_fsize)) {
171 printf("fragment size must be a power of 2, not %d\n",
172 sblock.fs_fsize);
173 exit(17);
174 }
175 if (sblock.fs_fsize < sectorsize) {
176 printf("fragment size %d is too small, minimum is %d\n",
177 sblock.fs_fsize, sectorsize);
178 exit(18);
179 }
180 if (sblock.fs_bsize < MINBSIZE) {
181 printf("block size %d is too small, minimum is %d\n",
182 sblock.fs_bsize, MINBSIZE);
183 exit(19);
184 }
185 if (sblock.fs_bsize < sblock.fs_fsize) {
186 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
187 sblock.fs_bsize, sblock.fs_fsize);
188 exit(20);
189 }
190 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
191 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
192 sblock.fs_qbmask = ~sblock.fs_bmask;
193 sblock.fs_qfmask = ~sblock.fs_fmask;
194 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
195 sblock.fs_bshift++;
196 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
197 sblock.fs_fshift++;
198 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
199 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
200 sblock.fs_fragshift++;
201 if (sblock.fs_frag > MAXFRAG) {
202 printf("fragment size %d is too small, minimum with block size %d is %d\n",
203 sblock.fs_fsize, sblock.fs_bsize,
204 sblock.fs_bsize / MAXFRAG);
205 exit(21);
206 }
207 sblock.fs_nrpos = nrpos;
208 sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t);
209 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode);
210 sblock.fs_nspf = sblock.fs_fsize / sectorsize;
211 for (sblock.fs_fsbtodb = 0, i = NSPF(&sblock); i > 1; i >>= 1)
212 sblock.fs_fsbtodb++;
213 sblock.fs_sblkno =
214 roundup(howmany(bbsize + sbsize, sblock.fs_fsize), sblock.fs_frag);
215 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
216 roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag));
217 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
218 sblock.fs_cgoffset = roundup(
219 howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag);
220 for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1)
221 sblock.fs_cgmask <<= 1;
222 if (!POWEROF2(sblock.fs_ntrak))
223 sblock.fs_cgmask <<= 1;
224 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
225 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
226 sizepb *= NINDIR(&sblock);
227 sblock.fs_maxfilesize += sizepb;
228 }
229 /*
230 * Validate specified/determined secpercyl
231 * and calculate minimum cylinders per group.
232 */
233 sblock.fs_spc = secpercyl;
234 for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc;
235 sblock.fs_cpc > 1 && (i & 1) == 0;
236 sblock.fs_cpc >>= 1, i >>= 1)
237 /* void */;
238 mincpc = sblock.fs_cpc;
239 bpcg = sblock.fs_spc * sectorsize;
240 inospercg = roundup(bpcg / sizeof(struct dinode), INOPB(&sblock));
241 if (inospercg > MAXIPG(&sblock))
242 inospercg = MAXIPG(&sblock);
243 used = (sblock.fs_iblkno + inospercg / INOPF(&sblock)) * NSPF(&sblock);
244 mincpgcnt = howmany(sblock.fs_cgoffset * (~sblock.fs_cgmask) + used,
245 sblock.fs_spc);
246 mincpg = roundup(mincpgcnt, mincpc);
247 /*
248 * Ensure that cylinder group with mincpg has enough space
249 * for block maps.
250 */
251 sblock.fs_cpg = mincpg;
252 sblock.fs_ipg = inospercg;
253 if (maxcontig > 1)
254 sblock.fs_contigsumsize = MIN(maxcontig, FS_MAXCONTIG);
255 mapcramped = 0;
256 while (CGSIZE(&sblock) > sblock.fs_bsize) {
257 mapcramped = 1;
258 if (sblock.fs_bsize < MAXBSIZE) {
259 sblock.fs_bsize <<= 1;
260 if ((i & 1) == 0) {
261 i >>= 1;
262 } else {
263 sblock.fs_cpc <<= 1;
264 mincpc <<= 1;
265 mincpg = roundup(mincpgcnt, mincpc);
266 sblock.fs_cpg = mincpg;
267 }
268 sblock.fs_frag <<= 1;
269 sblock.fs_fragshift += 1;
270 if (sblock.fs_frag <= MAXFRAG)
271 continue;
272 }
273 if (sblock.fs_fsize == sblock.fs_bsize) {
274 printf("There is no block size that");
275 printf(" can support this disk\n");
276 exit(22);
277 }
278 sblock.fs_frag >>= 1;
279 sblock.fs_fragshift -= 1;
280 sblock.fs_fsize <<= 1;
281 sblock.fs_nspf <<= 1;
282 }
283 /*
284 * Ensure that cylinder group with mincpg has enough space for inodes.
285 */
286 inodecramped = 0;
287 inospercg = calcipg(mincpg, bpcg, &usedb);
288 sblock.fs_ipg = inospercg;
289 while (inospercg > MAXIPG(&sblock)) {
290 inodecramped = 1;
291 if (mincpc == 1 || sblock.fs_frag == 1 ||
292 sblock.fs_bsize == MINBSIZE)
293 break;
294 printf("With a block size of %d %s %d\n", sblock.fs_bsize,
295 "minimum bytes per inode is",
296 (int)((mincpg * (off_t)bpcg - usedb)
297 / MAXIPG(&sblock) + 1));
298 sblock.fs_bsize >>= 1;
299 sblock.fs_frag >>= 1;
300 sblock.fs_fragshift -= 1;
301 mincpc >>= 1;
302 sblock.fs_cpg = roundup(mincpgcnt, mincpc);
303 if (CGSIZE(&sblock) > sblock.fs_bsize) {
304 sblock.fs_bsize <<= 1;
305 break;
306 }
307 mincpg = sblock.fs_cpg;
308 inospercg = calcipg(mincpg, bpcg, &usedb);
309 sblock.fs_ipg = inospercg;
310 }
311 if (inodecramped) {
312 if (inospercg > MAXIPG(&sblock)) {
313 printf("Minimum bytes per inode is %d\n",
314 (int)((mincpg * (off_t)bpcg - usedb)
315 / MAXIPG(&sblock) + 1));
316 } else if (!mapcramped) {
317 printf("With %d bytes per inode, ", density);
318 printf("minimum cylinders per group is %d\n", mincpg);
319 }
320 }
321 if (mapcramped) {
322 printf("With %d sectors per cylinder, ", sblock.fs_spc);
323 printf("minimum cylinders per group is %d\n", mincpg);
324 }
325 if (inodecramped || mapcramped) {
326 if (sblock.fs_bsize != bsize)
327 printf("%s to be changed from %d to %d\n",
328 "This requires the block size",
329 bsize, sblock.fs_bsize);
330 if (sblock.fs_fsize != fsize)
331 printf("\t%s to be changed from %d to %d\n",
332 "and the fragment size",
333 fsize, sblock.fs_fsize);
334 exit(23);
335 }
336 /*
337 * Calculate the number of cylinders per group
338 */
339 sblock.fs_cpg = cpg;
340 if (sblock.fs_cpg % mincpc != 0) {
341 printf("%s groups must have a multiple of %d cylinders\n",
342 cpgflg ? "Cylinder" : "Warning: cylinder", mincpc);
343 sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc);
344 if (!cpgflg)
345 cpg = sblock.fs_cpg;
346 }
347 /*
348 * Must ensure there is enough space for inodes.
349 */
350 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
351 while (sblock.fs_ipg > MAXIPG(&sblock)) {
352 inodecramped = 1;
353 sblock.fs_cpg -= mincpc;
354 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
355 }
356 /*
357 * Must ensure there is enough space to hold block map.
358 */
359 while (CGSIZE(&sblock) > sblock.fs_bsize) {
360 mapcramped = 1;
361 sblock.fs_cpg -= mincpc;
362 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
363 }
364 sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
365 if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) {
366 printf("panic (fs_cpg * fs_spc) % NSPF != 0");
367 exit(24);
368 }
369 if (sblock.fs_cpg < mincpg) {
370 printf("cylinder groups must have at least %d cylinders\n",
371 mincpg);
372 exit(25);
373 } else if (sblock.fs_cpg != cpg) {
374 if (!cpgflg)
375 printf("Warning: ");
376 else if (!mapcramped && !inodecramped)
377 exit(26);
378 if (mapcramped && inodecramped)
379 printf("Block size and bytes per inode restrict");
380 else if (mapcramped)
381 printf("Block size restricts");
382 else
383 printf("Bytes per inode restrict");
384 printf(" cylinders per group to %d.\n", sblock.fs_cpg);
385 if (cpgflg)
386 exit(27);
387 }
388 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
389 /*
390 * Now have size for file system and nsect and ntrak.
391 * Determine number of cylinders and blocks in the file system.
392 */
393 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
394 sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc;
395 if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) {
396 sblock.fs_ncyl++;
397 warn = 1;
398 }
399 if (sblock.fs_ncyl < 1) {
400 printf("file systems must have at least one cylinder\n");
401 exit(28);
402 }
403 /*
404 * Determine feasability/values of rotational layout tables.
405 *
406 * The size of the rotational layout tables is limited by the
407 * size of the superblock, SBSIZE. The amount of space available
408 * for tables is calculated as (SBSIZE - sizeof (struct fs)).
409 * The size of these tables is inversely proportional to the block
410 * size of the file system. The size increases if sectors per track
411 * are not powers of two, because more cylinders must be described
412 * by the tables before the rotational pattern repeats (fs_cpc).
413 */
414 sblock.fs_interleave = interleave;
415 sblock.fs_trackskew = trackskew;
416 sblock.fs_npsect = nphyssectors;
417 sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
418 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
419 if (sblock.fs_ntrak == 1) {
420 sblock.fs_cpc = 0;
421 goto next;
422 }
423 postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(short);
424 rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock);
425 totalsbsize = sizeof(struct fs) + rotblsize;
426 if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) {
427 /* use old static table space */
428 sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) -
429 (char *)(&sblock.fs_firstfield);
430 sblock.fs_rotbloff = &sblock.fs_space[0] -
431 (u_char *)(&sblock.fs_firstfield);
432 } else {
433 /* use dynamic table space */
434 sblock.fs_postbloff = &sblock.fs_space[0] -
435 (u_char *)(&sblock.fs_firstfield);
436 sblock.fs_rotbloff = sblock.fs_postbloff + postblsize;
437 totalsbsize += postblsize;
438 }
439 if (totalsbsize > SBSIZE ||
440 sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) {
441 printf("%s %s %d %s %d.%s",
442 "Warning: insufficient space in super block for\n",
443 "rotational layout tables with nsect", sblock.fs_nsect,
444 "and ntrak", sblock.fs_ntrak,
445 "\nFile system performance may be impaired.\n");
446 sblock.fs_cpc = 0;
447 goto next;
448 }
449 sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
450 /*
451 * calculate the available blocks for each rotational position
452 */
453 for (cylno = 0; cylno < sblock.fs_cpc; cylno++)
454 for (rpos = 0; rpos < sblock.fs_nrpos; rpos++)
455 fs_postbl(&sblock, cylno)[rpos] = -1;
456 for (i = (rotblsize - 1) * sblock.fs_frag;
457 i >= 0; i -= sblock.fs_frag) {
458 cylno = cbtocylno(&sblock, i);
459 rpos = cbtorpos(&sblock, i);
460 blk = fragstoblks(&sblock, i);
461 if (fs_postbl(&sblock, cylno)[rpos] == -1)
462 fs_rotbl(&sblock)[blk] = 0;
463 else
464 fs_rotbl(&sblock)[blk] =
465 fs_postbl(&sblock, cylno)[rpos] - blk;
466 fs_postbl(&sblock, cylno)[rpos] = blk;
467 }
468 next:
469 /*
470 * Compute/validate number of cylinder groups.
471 */
472 sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg;
473 if (sblock.fs_ncyl % sblock.fs_cpg)
474 sblock.fs_ncg++;
475 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
476 i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1);
477 if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) {
478 printf("inode blocks/cyl group (%d) >= data blocks (%d)\n",
479 cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
480 sblock.fs_fpg / sblock.fs_frag);
481 printf("number of cylinders per cylinder group (%d) %s.\n",
482 sblock.fs_cpg, "must be increased");
483 exit(29);
484 }
485 j = sblock.fs_ncg - 1;
486 if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg &&
487 cgdmin(&sblock, j) - cgbase(&sblock, j) > i) {
488 if (j == 0) {
489 printf("Filesystem must have at least %d sectors\n",
490 NSPF(&sblock) *
491 (cgdmin(&sblock, 0) + 3 * sblock.fs_frag));
492 exit(30);
493 }
494 printf("Warning: inode blocks/cyl group (%d) >= data blocks (%d) in last\n",
495 (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
496 i / sblock.fs_frag);
497 printf(" cylinder group. This implies %d sector(s) cannot be allocated.\n",
498 i * NSPF(&sblock));
499 sblock.fs_ncg--;
500 sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg;
501 sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc /
502 NSPF(&sblock);
503 warn = 0;
504 }
505 if (warn && !mfs) {
506 printf("Warning: %d sector(s) in last cylinder unallocated\n",
507 sblock.fs_spc -
508 (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1)
509 * sblock.fs_spc));
510 }
511 /*
512 * fill in remaining fields of the super block
513 */
514 sblock.fs_csaddr = cgdmin(&sblock, 0);
515 sblock.fs_cssize =
516 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
517 i = sblock.fs_bsize / sizeof(struct csum);
518 sblock.fs_csmask = ~(i - 1);
519 for (sblock.fs_csshift = 0; i > 1; i >>= 1)
520 sblock.fs_csshift++;
521 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
522 sblock.fs_magic = FS_MAGIC;
523 sblock.fs_rotdelay = rotdelay;
524 sblock.fs_minfree = minfree;
525 sblock.fs_maxcontig = maxcontig;
526 sblock.fs_headswitch = headswitch;
527 sblock.fs_trkseek = trackseek;
528 sblock.fs_maxbpg = maxbpg;
529 sblock.fs_rps = rpm / 60;
530 sblock.fs_optim = opt;
531 sblock.fs_cgrotor = 0;
532 sblock.fs_cstotal.cs_ndir = 0;
533 sblock.fs_cstotal.cs_nbfree = 0;
534 sblock.fs_cstotal.cs_nifree = 0;
535 sblock.fs_cstotal.cs_nffree = 0;
536 sblock.fs_fmod = 0;
537 sblock.fs_ronly = 0;
538 sblock.fs_clean = 1;
539 /*
540 * Dump out summary information about file system.
541 */
542 if (!mfs) {
543 printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n",
544 fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
545 "cylinders", sblock.fs_ntrak, sblock.fs_nsect);
546 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
547 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)\n",
548 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
549 sblock.fs_ncg, sblock.fs_cpg,
550 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
551 sblock.fs_ipg);
552 #undef B2MBFACTOR
553 }
554 /*
555 * Now build the cylinders group blocks and
556 * then print out indices of cylinder groups.
557 */
558 if (!mfs)
559 printf("super-block backups (for fsck -b #) at:");
560 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
561 initcg(cylno, utime);
562 if (mfs)
563 continue;
564 if (cylno % 8 == 0)
565 printf("\n");
566 printf(" %d,", fsbtodb(&sblock, cgsblock(&sblock, cylno)));
567 }
568 if (!mfs)
569 printf("\n");
570 if (Nflag && !mfs)
571 exit(0);
572 /*
573 * Now construct the initial file system,
574 * then write out the super-block.
575 */
576 fsinit(utime);
577 sblock.fs_time = utime;
578 wtfs((int)SBOFF / sectorsize, sbsize, (char *)&sblock);
579 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
580 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
581 sblock.fs_cssize - i < sblock.fs_bsize ?
582 sblock.fs_cssize - i : sblock.fs_bsize,
583 ((char *)fscs) + i);
584 /*
585 * Write out the duplicate super blocks
586 */
587 for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
588 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
589 sbsize, (char *)&sblock);
590 /*
591 * Update information about this partion in pack
592 * label, to that it may be updated on disk.
593 */
594 pp->p_fstype = FS_BSDFFS;
595 pp->p_fsize = sblock.fs_fsize;
596 pp->p_frag = sblock.fs_frag;
597 pp->p_cpg = sblock.fs_cpg;
598 /*
599 * Notify parent process of success.
600 * Dissociate from session and tty.
601 */
602 if (mfs) {
603 kill(ppid, SIGUSR1);
604 (void) setsid();
605 (void) close(0);
606 (void) close(1);
607 (void) close(2);
608 (void) chdir("/");
609 }
610 }
611
612 /*
613 * Initialize a cylinder group.
614 */
initcg(cylno,utime)615 initcg(cylno, utime)
616 int cylno;
617 time_t utime;
618 {
619 daddr_t cbase, d, dlower, dupper, dmax, blkno;
620 long i, j, s;
621 register struct csum *cs;
622
623 /*
624 * Determine block bounds for cylinder group.
625 * Allow space for super block summary information in first
626 * cylinder group.
627 */
628 cbase = cgbase(&sblock, cylno);
629 dmax = cbase + sblock.fs_fpg;
630 if (dmax > sblock.fs_size)
631 dmax = sblock.fs_size;
632 dlower = cgsblock(&sblock, cylno) - cbase;
633 dupper = cgdmin(&sblock, cylno) - cbase;
634 if (cylno == 0)
635 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
636 cs = fscs + cylno;
637 memset(&acg, 0, sblock.fs_cgsize);
638 acg.cg_time = utime;
639 acg.cg_magic = CG_MAGIC;
640 acg.cg_cgx = cylno;
641 if (cylno == sblock.fs_ncg - 1)
642 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
643 else
644 acg.cg_ncyl = sblock.fs_cpg;
645 acg.cg_niblk = sblock.fs_ipg;
646 acg.cg_ndblk = dmax - cbase;
647 if (sblock.fs_contigsumsize > 0)
648 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
649 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
650 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(long);
651 acg.cg_iusedoff = acg.cg_boff +
652 sblock.fs_cpg * sblock.fs_nrpos * sizeof(short);
653 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
654 if (sblock.fs_contigsumsize <= 0) {
655 acg.cg_nextfreeoff = acg.cg_freeoff +
656 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY);
657 } else {
658 acg.cg_clustersumoff = acg.cg_freeoff + howmany
659 (sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) -
660 sizeof(long);
661 acg.cg_clustersumoff =
662 roundup(acg.cg_clustersumoff, sizeof(long));
663 acg.cg_clusteroff = acg.cg_clustersumoff +
664 (sblock.fs_contigsumsize + 1) * sizeof(long);
665 acg.cg_nextfreeoff = acg.cg_clusteroff + howmany
666 (sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY);
667 }
668 if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) > sblock.fs_cgsize) {
669 printf("Panic: cylinder group too big\n");
670 exit(37);
671 }
672 acg.cg_cs.cs_nifree += sblock.fs_ipg;
673 if (cylno == 0)
674 for (i = 0; i < ROOTINO; i++) {
675 setbit(cg_inosused(&acg), i);
676 acg.cg_cs.cs_nifree--;
677 }
678 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag)
679 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
680 sblock.fs_bsize, (char *)zino);
681 if (cylno > 0) {
682 /*
683 * In cylno 0, beginning space is reserved
684 * for boot and super blocks.
685 */
686 for (d = 0; d < dlower; d += sblock.fs_frag) {
687 blkno = d / sblock.fs_frag;
688 setblock(&sblock, cg_blksfree(&acg), blkno);
689 if (sblock.fs_contigsumsize > 0)
690 setbit(cg_clustersfree(&acg), blkno);
691 acg.cg_cs.cs_nbfree++;
692 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
693 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
694 [cbtorpos(&sblock, d)]++;
695 }
696 sblock.fs_dsize += dlower;
697 }
698 sblock.fs_dsize += acg.cg_ndblk - dupper;
699 if (i = dupper % sblock.fs_frag) {
700 acg.cg_frsum[sblock.fs_frag - i]++;
701 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
702 setbit(cg_blksfree(&acg), dupper);
703 acg.cg_cs.cs_nffree++;
704 }
705 }
706 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) {
707 blkno = d / sblock.fs_frag;
708 setblock(&sblock, cg_blksfree(&acg), blkno);
709 if (sblock.fs_contigsumsize > 0)
710 setbit(cg_clustersfree(&acg), blkno);
711 acg.cg_cs.cs_nbfree++;
712 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
713 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
714 [cbtorpos(&sblock, d)]++;
715 d += sblock.fs_frag;
716 }
717 if (d < dmax - cbase) {
718 acg.cg_frsum[dmax - cbase - d]++;
719 for (; d < dmax - cbase; d++) {
720 setbit(cg_blksfree(&acg), d);
721 acg.cg_cs.cs_nffree++;
722 }
723 }
724 if (sblock.fs_contigsumsize > 0) {
725 int32_t *sump = cg_clustersum(&acg);
726 u_char *mapp = cg_clustersfree(&acg);
727 int map = *mapp++;
728 int bit = 1;
729 int run = 0;
730
731 for (i = 0; i < acg.cg_nclusterblks; i++) {
732 if ((map & bit) != 0) {
733 run++;
734 } else if (run != 0) {
735 if (run > sblock.fs_contigsumsize)
736 run = sblock.fs_contigsumsize;
737 sump[run]++;
738 run = 0;
739 }
740 if ((i & (NBBY - 1)) != (NBBY - 1)) {
741 bit <<= 1;
742 } else {
743 map = *mapp++;
744 bit = 1;
745 }
746 }
747 if (run != 0) {
748 if (run > sblock.fs_contigsumsize)
749 run = sblock.fs_contigsumsize;
750 sump[run]++;
751 }
752 }
753 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
754 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
755 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
756 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
757 *cs = acg.cg_cs;
758 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
759 sblock.fs_bsize, (char *)&acg);
760 }
761
762 /*
763 * initialize the file system
764 */
765 struct dinode node;
766
767 #ifdef LOSTDIR
768 #define PREDEFDIR 3
769 #else
770 #define PREDEFDIR 2
771 #endif
772
773 struct direct root_dir[] = {
774 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
775 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
776 #ifdef LOSTDIR
777 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" },
778 #endif
779 };
780 struct odirect {
781 u_long d_ino;
782 u_short d_reclen;
783 u_short d_namlen;
784 u_char d_name[MAXNAMLEN + 1];
785 } oroot_dir[] = {
786 { ROOTINO, sizeof(struct direct), 1, "." },
787 { ROOTINO, sizeof(struct direct), 2, ".." },
788 #ifdef LOSTDIR
789 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" },
790 #endif
791 };
792 #ifdef LOSTDIR
793 struct direct lost_found_dir[] = {
794 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." },
795 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
796 { 0, DIRBLKSIZ, 0, 0, 0 },
797 };
798 struct odirect olost_found_dir[] = {
799 { LOSTFOUNDINO, sizeof(struct direct), 1, "." },
800 { ROOTINO, sizeof(struct direct), 2, ".." },
801 { 0, DIRBLKSIZ, 0, 0 },
802 };
803 #endif
804 char buf[MAXBSIZE];
805
fsinit(utime)806 fsinit(utime)
807 time_t utime;
808 {
809 int i;
810
811 /*
812 * initialize the node
813 */
814 node.di_atime = utime;
815 node.di_mtime = utime;
816 node.di_ctime = utime;
817 #ifdef LOSTDIR
818 /*
819 * create the lost+found directory
820 */
821 if (Oflag) {
822 (void)makedir((struct direct *)olost_found_dir, 2);
823 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
824 memmove(&buf[i], &olost_found_dir[2],
825 DIRSIZ(0, &olost_found_dir[2]));
826 } else {
827 (void)makedir(lost_found_dir, 2);
828 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
829 memmove(&buf[i], &lost_found_dir[2],
830 DIRSIZ(0, &lost_found_dir[2]));
831 }
832 node.di_mode = IFDIR | UMASK;
833 node.di_nlink = 2;
834 node.di_size = sblock.fs_bsize;
835 node.di_db[0] = alloc(node.di_size, node.di_mode);
836 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
837 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf);
838 iput(&node, LOSTFOUNDINO);
839 #endif
840 /*
841 * create the root directory
842 */
843 if (mfs)
844 node.di_mode = IFDIR | 01777;
845 else
846 node.di_mode = IFDIR | UMASK;
847 node.di_nlink = PREDEFDIR;
848 if (Oflag)
849 node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR);
850 else
851 node.di_size = makedir(root_dir, PREDEFDIR);
852 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode);
853 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
854 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf);
855 iput(&node, ROOTINO);
856 }
857
858 /*
859 * construct a set of directory entries in "buf".
860 * return size of directory.
861 */
makedir(protodir,entries)862 makedir(protodir, entries)
863 register struct direct *protodir;
864 int entries;
865 {
866 char *cp;
867 int i, spcleft;
868
869 spcleft = DIRBLKSIZ;
870 for (cp = buf, i = 0; i < entries - 1; i++) {
871 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
872 memmove(cp, &protodir[i], protodir[i].d_reclen);
873 cp += protodir[i].d_reclen;
874 spcleft -= protodir[i].d_reclen;
875 }
876 protodir[i].d_reclen = spcleft;
877 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
878 return (DIRBLKSIZ);
879 }
880
881 /*
882 * allocate a block or frag
883 */
884 daddr_t
alloc(size,mode)885 alloc(size, mode)
886 int size;
887 int mode;
888 {
889 int i, frag;
890 daddr_t d, blkno;
891
892 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
893 (char *)&acg);
894 if (acg.cg_magic != CG_MAGIC) {
895 printf("cg 0: bad magic number\n");
896 return (0);
897 }
898 if (acg.cg_cs.cs_nbfree == 0) {
899 printf("first cylinder group ran out of space\n");
900 return (0);
901 }
902 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
903 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
904 goto goth;
905 printf("internal error: can't find block in cyl 0\n");
906 return (0);
907 goth:
908 blkno = fragstoblks(&sblock, d);
909 clrblock(&sblock, cg_blksfree(&acg), blkno);
910 if (sblock.fs_contigsumsize > 0)
911 clrbit(cg_clustersfree(&acg), blkno);
912 acg.cg_cs.cs_nbfree--;
913 sblock.fs_cstotal.cs_nbfree--;
914 fscs[0].cs_nbfree--;
915 if (mode & IFDIR) {
916 acg.cg_cs.cs_ndir++;
917 sblock.fs_cstotal.cs_ndir++;
918 fscs[0].cs_ndir++;
919 }
920 cg_blktot(&acg)[cbtocylno(&sblock, d)]--;
921 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--;
922 if (size != sblock.fs_bsize) {
923 frag = howmany(size, sblock.fs_fsize);
924 fscs[0].cs_nffree += sblock.fs_frag - frag;
925 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
926 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
927 acg.cg_frsum[sblock.fs_frag - frag]++;
928 for (i = frag; i < sblock.fs_frag; i++)
929 setbit(cg_blksfree(&acg), d + i);
930 }
931 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
932 (char *)&acg);
933 return (d);
934 }
935
936 /*
937 * Calculate number of inodes per group.
938 */
939 long
calcipg(cpg,bpcg,usedbp)940 calcipg(cpg, bpcg, usedbp)
941 long cpg;
942 long bpcg;
943 off_t *usedbp;
944 {
945 int i;
946 long ipg, new_ipg, ncg, ncyl;
947 off_t usedb;
948
949 /*
950 * Prepare to scale by fssize / (number of sectors in cylinder groups).
951 * Note that fssize is still in sectors, not filesystem blocks.
952 */
953 ncyl = howmany(fssize, secpercyl);
954 ncg = howmany(ncyl, cpg);
955 /*
956 * Iterate a few times to allow for ipg depending on itself.
957 */
958 ipg = 0;
959 for (i = 0; i < 10; i++) {
960 usedb = (sblock.fs_iblkno + ipg / INOPF(&sblock))
961 * NSPF(&sblock) * (off_t)sectorsize;
962 new_ipg = (cpg * (quad_t)bpcg - usedb) / density * fssize
963 / ncg / secpercyl / cpg;
964 new_ipg = roundup(new_ipg, INOPB(&sblock));
965 if (new_ipg == ipg)
966 break;
967 ipg = new_ipg;
968 }
969 *usedbp = usedb;
970 return (ipg);
971 }
972
973 /*
974 * Allocate an inode on the disk
975 */
iput(ip,ino)976 iput(ip, ino)
977 register struct dinode *ip;
978 register ino_t ino;
979 {
980 struct dinode buf[MAXINOPB];
981 daddr_t d;
982 int c;
983
984 c = ino_to_cg(&sblock, ino);
985 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
986 (char *)&acg);
987 if (acg.cg_magic != CG_MAGIC) {
988 printf("cg 0: bad magic number\n");
989 exit(31);
990 }
991 acg.cg_cs.cs_nifree--;
992 setbit(cg_inosused(&acg), ino);
993 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
994 (char *)&acg);
995 sblock.fs_cstotal.cs_nifree--;
996 fscs[0].cs_nifree--;
997 if (ino >= sblock.fs_ipg * sblock.fs_ncg) {
998 printf("fsinit: inode value out of range (%d).\n", ino);
999 exit(32);
1000 }
1001 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
1002 rdfs(d, sblock.fs_bsize, buf);
1003 buf[ino_to_fsbo(&sblock, ino)] = *ip;
1004 wtfs(d, sblock.fs_bsize, buf);
1005 }
1006
1007 /*
1008 * Notify parent process that the filesystem has created itself successfully.
1009 */
1010 void
started()1011 started()
1012 {
1013
1014 exit(0);
1015 }
1016
1017 /*
1018 * Replace libc function with one suited to our needs.
1019 */
1020 caddr_t
malloc(size)1021 malloc(size)
1022 register u_long size;
1023 {
1024 char *base, *i;
1025 static u_long pgsz;
1026 struct rlimit rlp;
1027
1028 if (pgsz == 0) {
1029 base = sbrk(0);
1030 pgsz = getpagesize() - 1;
1031 i = (char *)((u_long)(base + pgsz) &~ pgsz);
1032 base = sbrk(i - base);
1033 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1034 perror("getrlimit");
1035 rlp.rlim_cur = rlp.rlim_max;
1036 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1037 perror("setrlimit");
1038 memleft = rlp.rlim_max - (u_long)base;
1039 }
1040 size = (size + pgsz) &~ pgsz;
1041 if (size > memleft)
1042 size = memleft;
1043 memleft -= size;
1044 if (size == 0)
1045 return (0);
1046 return ((caddr_t)sbrk(size));
1047 }
1048
1049 /*
1050 * Replace libc function with one suited to our needs.
1051 */
1052 caddr_t
realloc(ptr,size)1053 realloc(ptr, size)
1054 char *ptr;
1055 u_long size;
1056 {
1057 void *p;
1058
1059 if ((p = malloc(size)) == NULL)
1060 return (NULL);
1061 memmove(p, ptr, size);
1062 free(ptr);
1063 return (p);
1064 }
1065
1066 /*
1067 * Replace libc function with one suited to our needs.
1068 */
1069 char *
calloc(size,numelm)1070 calloc(size, numelm)
1071 u_long size, numelm;
1072 {
1073 caddr_t base;
1074
1075 size *= numelm;
1076 base = malloc(size);
1077 memset(base, 0, size);
1078 return (base);
1079 }
1080
1081 /*
1082 * Replace libc function with one suited to our needs.
1083 */
free(ptr)1084 free(ptr)
1085 char *ptr;
1086 {
1087
1088 /* do not worry about it for now */
1089 }
1090
1091 /*
1092 * read a block from the file system
1093 */
rdfs(bno,size,bf)1094 rdfs(bno, size, bf)
1095 daddr_t bno;
1096 int size;
1097 char *bf;
1098 {
1099 int n;
1100
1101 if (mfs) {
1102 memmove(bf, membase + bno * sectorsize, size);
1103 return;
1104 }
1105 if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) {
1106 printf("seek error: %ld\n", bno);
1107 perror("rdfs");
1108 exit(33);
1109 }
1110 n = read(fsi, bf, size);
1111 if (n != size) {
1112 printf("read error: %ld\n", bno);
1113 perror("rdfs");
1114 exit(34);
1115 }
1116 }
1117
1118 /*
1119 * write a block to the file system
1120 */
wtfs(bno,size,bf)1121 wtfs(bno, size, bf)
1122 daddr_t bno;
1123 int size;
1124 char *bf;
1125 {
1126 int n;
1127
1128 if (mfs) {
1129 memmove(membase + bno * sectorsize, bf, size);
1130 return;
1131 }
1132 if (Nflag)
1133 return;
1134 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) {
1135 printf("seek error: %ld\n", bno);
1136 perror("wtfs");
1137 exit(35);
1138 }
1139 n = write(fso, bf, size);
1140 if (n != size) {
1141 printf("write error: %ld\n", bno);
1142 perror("wtfs");
1143 exit(36);
1144 }
1145 }
1146
1147 /*
1148 * check if a block is available
1149 */
1150 isblock(fs, cp, h)
1151 struct fs *fs;
1152 unsigned char *cp;
1153 int h;
1154 {
1155 unsigned char mask;
1156
1157 switch (fs->fs_frag) {
1158 case 8:
1159 return (cp[h] == 0xff);
1160 case 4:
1161 mask = 0x0f << ((h & 0x1) << 2);
1162 return ((cp[h >> 1] & mask) == mask);
1163 case 2:
1164 mask = 0x03 << ((h & 0x3) << 1);
1165 return ((cp[h >> 2] & mask) == mask);
1166 case 1:
1167 mask = 0x01 << (h & 0x7);
1168 return ((cp[h >> 3] & mask) == mask);
1169 default:
1170 #ifdef STANDALONE
1171 printf("isblock bad fs_frag %d\n", fs->fs_frag);
1172 #else
1173 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1174 #endif
1175 return (0);
1176 }
1177 }
1178
1179 /*
1180 * take a block out of the map
1181 */
1182 clrblock(fs, cp, h)
1183 struct fs *fs;
1184 unsigned char *cp;
1185 int h;
1186 {
1187 switch ((fs)->fs_frag) {
1188 case 8:
1189 cp[h] = 0;
1190 return;
1191 case 4:
1192 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1193 return;
1194 case 2:
1195 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1196 return;
1197 case 1:
1198 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1199 return;
1200 default:
1201 #ifdef STANDALONE
1202 printf("clrblock bad fs_frag %d\n", fs->fs_frag);
1203 #else
1204 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1205 #endif
1206 return;
1207 }
1208 }
1209
1210 /*
1211 * put a block into the map
1212 */
1213 setblock(fs, cp, h)
1214 struct fs *fs;
1215 unsigned char *cp;
1216 int h;
1217 {
1218 switch (fs->fs_frag) {
1219 case 8:
1220 cp[h] = 0xff;
1221 return;
1222 case 4:
1223 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1224 return;
1225 case 2:
1226 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1227 return;
1228 case 1:
1229 cp[h >> 3] |= (0x01 << (h & 0x7));
1230 return;
1231 default:
1232 #ifdef STANDALONE
1233 printf("setblock bad fs_frag %d\n", fs->fs_frag);
1234 #else
1235 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1236 #endif
1237 return;
1238 }
1239 }
1240