1 /* $NetBSD: mkfs.c,v 1.20 2004/06/24 22:30:13 lukem Exp $ */
4 * Copyright (c) 2002 Networks Associates Technology, Inc.
7 * This software was developed for the FreeBSD Project by Marshall
8 * Kirk McKusick and Network Associates Laboratories, the Security
9 * Research Division of Network Associates, Inc. under DARPA/SPAWAR
10 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
13 * Copyright (c) 1980, 1989, 1993
14 * The Regents of the University of California. All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
24 * 3. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
44 #include <sys/param.h>
46 #include <sys/resource.h>
57 #include <ufs/ufs/dinode.h>
58 #include <ufs/ffs/fs.h>
60 #include "ffs/ufs_bswap.h"
61 #include "ffs/ufs_inode.h"
62 #include "ffs/ffs_extern.h"
63 #include "ffs/newfs_extern.h"
66 #define BBSIZE 8192 /* size of boot area, with label */
69 static void initcg(int, time_t, const fsinfo_t *);
70 static int ilog2(int);
72 static int count_digits(int);
75 * make file system for cylinder-group style file systems
78 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
84 #define sblock fsun.fs
89 char pad[FFS_MAXBSIZE];
96 char writebuf[FFS_MAXBSIZE];
98 static int Oflag; /* format as an 4.3BSD file system */
99 static int64_t fssize; /* file system size */
100 static int sectorsize; /* bytes/sector */
101 static int fsize; /* fragment size */
102 static int bsize; /* block size */
103 static int maxbsize; /* maximum clustering */
104 static int maxblkspercg;
105 static int minfree; /* free space threshold */
106 static int opt; /* optimization preference (space or time) */
107 static int density; /* number of bytes per inode */
108 static int maxcontig; /* max contiguous blocks to allocate */
109 static int maxbpg; /* maximum blocks per file in a cyl group */
110 static int bbsize; /* boot block size */
111 static int sbsize; /* superblock size */
112 static int avgfilesize; /* expected average file size */
113 static int avgfpdir; /* expected number of files per directory */
116 ffs_mkfs(const char *fsys, const fsinfo_t *fsopts)
118 int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg;
119 int32_t cylno, i, csfrags;
123 int nprintcols, printcolwidth;
124 ffs_opt_t *ffs_opts = fsopts->fs_specific;
126 Oflag = ffs_opts->version;
127 fssize = fsopts->size / fsopts->sectorsize;
128 sectorsize = fsopts->sectorsize;
129 fsize = ffs_opts->fsize;
130 bsize = ffs_opts->bsize;
131 maxbsize = ffs_opts->maxbsize;
132 maxblkspercg = ffs_opts->maxblkspercg;
133 minfree = ffs_opts->minfree;
134 opt = ffs_opts->optimization;
135 density = ffs_opts->density;
136 maxcontig = ffs_opts->maxcontig;
137 maxbpg = ffs_opts->maxbpg;
138 avgfilesize = ffs_opts->avgfilesize;
139 avgfpdir = ffs_opts->avgfpdir;
143 strlcpy(sblock.fs_volname, ffs_opts->label, sizeof(sblock.fs_volname));
146 sblock.fs_old_inodefmt = FS_42INODEFMT;
147 sblock.fs_maxsymlinklen = 0;
148 sblock.fs_old_flags = 0;
150 sblock.fs_old_inodefmt = FS_44INODEFMT;
151 sblock.fs_maxsymlinklen = (Oflag == 1 ? MAXSYMLINKLEN_UFS1 :
153 sblock.fs_old_flags = FS_FLAGS_UPDATED;
157 * Validate the given file system size.
158 * Verify that its last block can actually be accessed.
159 * Convert to file system fragment sized units.
162 printf("preposterous size %lld\n", (long long)fssize);
165 ffs_wtfs(fssize - 1, sectorsize, (char *)&sblock, fsopts);
168 * collect and verify the filesystem density info
170 sblock.fs_avgfilesize = avgfilesize;
171 sblock.fs_avgfpdir = avgfpdir;
172 if (sblock.fs_avgfilesize <= 0)
173 printf("illegal expected average file size %d\n",
174 sblock.fs_avgfilesize), exit(14);
175 if (sblock.fs_avgfpdir <= 0)
176 printf("illegal expected number of files per directory %d\n",
177 sblock.fs_avgfpdir), exit(15);
179 * collect and verify the block and fragment sizes
181 sblock.fs_bsize = bsize;
182 sblock.fs_fsize = fsize;
183 if (!POWEROF2(sblock.fs_bsize)) {
184 printf("block size must be a power of 2, not %d\n",
188 if (!POWEROF2(sblock.fs_fsize)) {
189 printf("fragment size must be a power of 2, not %d\n",
193 if (sblock.fs_fsize < sectorsize) {
194 printf("fragment size %d is too small, minimum is %d\n",
195 sblock.fs_fsize, sectorsize);
198 if (sblock.fs_bsize < MINBSIZE) {
199 printf("block size %d is too small, minimum is %d\n",
200 sblock.fs_bsize, MINBSIZE);
203 if (sblock.fs_bsize > FFS_MAXBSIZE) {
204 printf("block size %d is too large, maximum is %d\n",
205 sblock.fs_bsize, FFS_MAXBSIZE);
208 if (sblock.fs_bsize < sblock.fs_fsize) {
209 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
210 sblock.fs_bsize, sblock.fs_fsize);
214 if (maxbsize < bsize || !POWEROF2(maxbsize)) {
215 sblock.fs_maxbsize = sblock.fs_bsize;
216 printf("Extent size set to %d\n", sblock.fs_maxbsize);
217 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) {
218 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize;
219 printf("Extent size reduced to %d\n", sblock.fs_maxbsize);
221 sblock.fs_maxbsize = maxbsize;
223 sblock.fs_maxcontig = maxcontig;
224 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) {
225 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize;
226 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize);
229 if (sblock.fs_maxcontig > 1)
230 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG);
232 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
233 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
234 sblock.fs_qbmask = ~sblock.fs_bmask;
235 sblock.fs_qfmask = ~sblock.fs_fmask;
236 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
238 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
240 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
241 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
242 sblock.fs_fragshift++;
243 if (sblock.fs_frag > MAXFRAG) {
244 printf("fragment size %d is too small, "
245 "minimum with block size %d is %d\n",
246 sblock.fs_fsize, sblock.fs_bsize,
247 sblock.fs_bsize / MAXFRAG);
250 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize);
251 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
254 sblock.fs_magic = FS_UFS1_MAGIC;
255 sblock.fs_sblockloc = SBLOCK_UFS1;
256 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t);
257 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode);
258 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
259 sizeof (ufs1_daddr_t));
260 sblock.fs_old_inodefmt = FS_44INODEFMT;
261 sblock.fs_old_cgoffset = 0;
262 sblock.fs_old_cgmask = 0xffffffff;
263 sblock.fs_old_size = sblock.fs_size;
264 sblock.fs_old_rotdelay = 0;
265 sblock.fs_old_rps = 60;
266 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize;
267 sblock.fs_old_cpg = 1;
268 sblock.fs_old_interleave = 1;
269 sblock.fs_old_trackskew = 0;
270 sblock.fs_old_cpc = 0;
271 sblock.fs_old_postblformat = 1;
272 sblock.fs_old_nrpos = 1;
274 sblock.fs_magic = FS_UFS2_MAGIC;
275 sblock.fs_sblockloc = SBLOCK_UFS2;
276 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t);
277 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode);
278 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
279 sizeof (ufs2_daddr_t));
283 roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize),
285 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
286 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag));
287 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
288 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
289 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
290 sizepb *= NINDIR(&sblock);
291 sblock.fs_maxfilesize += sizepb;
295 * Calculate the number of blocks to put into each cylinder group.
297 * This algorithm selects the number of blocks per cylinder
298 * group. The first goal is to have at least enough data blocks
299 * in each cylinder group to meet the density requirement. Once
300 * this goal is achieved we try to expand to have at least
301 * 1 cylinder group. Once this goal is achieved, we pack as
302 * many blocks into each cylinder group map as will fit.
304 * We start by calculating the smallest number of blocks that we
305 * can put into each cylinder group. If this is too big, we reduce
306 * the density until it fits.
308 origdensity = density;
310 fragsperinode = MAX(numfrags(&sblock, density), 1);
311 minfpg = fragsperinode * INOPB(&sblock);
312 if (minfpg > sblock.fs_size)
313 minfpg = sblock.fs_size;
314 sblock.fs_ipg = INOPB(&sblock);
315 sblock.fs_fpg = roundup(sblock.fs_iblkno +
316 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
317 if (sblock.fs_fpg < minfpg)
318 sblock.fs_fpg = minfpg;
319 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
321 sblock.fs_fpg = roundup(sblock.fs_iblkno +
322 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
323 if (sblock.fs_fpg < minfpg)
324 sblock.fs_fpg = minfpg;
325 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
327 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
329 density -= sblock.fs_fsize;
331 if (density != origdensity)
332 printf("density reduced from %d to %d\n", origdensity, density);
334 if (maxblkspercg <= 0 || maxblkspercg >= fssize)
335 maxblkspercg = fssize - 1;
337 * Start packing more blocks into the cylinder group until
338 * it cannot grow any larger, the number of cylinder groups
339 * drops below 1, or we reach the size requested.
341 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) {
342 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
344 if (sblock.fs_size / sblock.fs_fpg < 1)
346 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
348 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize)
350 sblock.fs_fpg -= sblock.fs_frag;
351 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
356 * Check to be sure that the last cylinder group has enough blocks
357 * to be viable. If it is too small, reduce the number of blocks
358 * per cylinder group which will have the effect of moving more
359 * blocks into the last cylinder group.
361 optimalfpg = sblock.fs_fpg;
363 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
364 lastminfpg = roundup(sblock.fs_iblkno +
365 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
366 if (sblock.fs_size < lastminfpg) {
367 printf("Filesystem size %lld < minimum size of %d\n",
368 (long long)sblock.fs_size, lastminfpg);
371 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg ||
372 sblock.fs_size % sblock.fs_fpg == 0)
374 sblock.fs_fpg -= sblock.fs_frag;
375 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
378 if (optimalfpg != sblock.fs_fpg)
379 printf("Reduced frags per cylinder group from %d to %d %s\n",
380 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group");
381 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
382 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
384 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf;
385 sblock.fs_old_nsect = sblock.fs_old_spc;
386 sblock.fs_old_npsect = sblock.fs_old_spc;
387 sblock.fs_old_ncyl = sblock.fs_ncg;
391 * fill in remaining fields of the super block
393 sblock.fs_csaddr = cgdmin(&sblock, 0);
395 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
398 * Setup memory for temporary in-core cylgroup summaries.
399 * Cribbed from ffs_mountfs().
401 size = sblock.fs_cssize;
402 blks = howmany(size, sblock.fs_fsize);
403 if (sblock.fs_contigsumsize > 0)
404 size += sblock.fs_ncg * sizeof(int32_t);
405 if ((space = (char *)calloc(1, size)) == NULL)
406 err(1, "memory allocation error for cg summaries");
407 sblock.fs_csp = space;
408 space = (char *)space + sblock.fs_cssize;
409 if (sblock.fs_contigsumsize > 0) {
412 sblock.fs_maxcluster = lp = space;
413 for (i = 0; i < sblock.fs_ncg; i++)
414 *lp++ = sblock.fs_contigsumsize;
417 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
418 if (sblock.fs_sbsize > SBLOCKSIZE)
419 sblock.fs_sbsize = SBLOCKSIZE;
420 sblock.fs_minfree = minfree;
421 sblock.fs_maxcontig = maxcontig;
422 sblock.fs_maxbpg = maxbpg;
423 sblock.fs_optim = opt;
424 sblock.fs_cgrotor = 0;
425 sblock.fs_pendingblocks = 0;
426 sblock.fs_pendinginodes = 0;
427 sblock.fs_cstotal.cs_ndir = 0;
428 sblock.fs_cstotal.cs_nbfree = 0;
429 sblock.fs_cstotal.cs_nifree = 0;
430 sblock.fs_cstotal.cs_nffree = 0;
434 sblock.fs_clean = FS_ISCLEAN;
436 sblock.fs_id[0] = start_time.tv_sec;
437 sblock.fs_id[1] = random();
438 sblock.fs_fsmnt[0] = '\0';
439 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize);
440 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno -
441 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno);
442 sblock.fs_cstotal.cs_nbfree =
443 fragstoblks(&sblock, sblock.fs_dsize) -
444 howmany(csfrags, sblock.fs_frag);
445 sblock.fs_cstotal.cs_nffree =
446 fragnum(&sblock, sblock.fs_size) +
447 (fragnum(&sblock, csfrags) > 0 ?
448 sblock.fs_frag - fragnum(&sblock, csfrags) : 0);
449 sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
450 sblock.fs_cstotal.cs_ndir = 0;
451 sblock.fs_dsize -= csfrags;
452 sblock.fs_time = start_time.tv_sec;
454 sblock.fs_old_time = start_time.tv_sec;
455 sblock.fs_old_dsize = sblock.fs_dsize;
456 sblock.fs_old_csaddr = sblock.fs_csaddr;
457 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
458 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
459 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
460 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
463 * Dump out summary information about file system.
465 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
466 printf("%s: %.1fMB (%lld sectors) block size %d, "
467 "fragment size %d\n",
468 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
469 (long long)fsbtodb(&sblock, sblock.fs_size),
470 sblock.fs_bsize, sblock.fs_fsize);
471 printf("\tusing %d cylinder groups of %.2fMB, %d blks, "
474 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
475 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
478 * Now determine how wide each column will be, and calculate how
479 * many columns will fit in a 76 char line. 76 is the width of the
480 * subwindows in sysinst.
482 printcolwidth = count_digits(
483 fsbtodb(&sblock, cgsblock(&sblock, sblock.fs_ncg -1)));
484 nprintcols = 76 / (printcolwidth + 2);
487 * allocate space for superblock, cylinder group map, and
488 * two sets of inode blocks.
490 if (sblock.fs_bsize < SBLOCKSIZE)
491 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize;
493 iobufsize = 4 * sblock.fs_bsize;
494 if ((iobuf = malloc(iobufsize)) == 0) {
495 printf("Cannot allocate I/O buffer\n");
498 memset(iobuf, 0, iobufsize);
500 * Make a copy of the superblock into the buffer that we will be
501 * writing out in each cylinder group.
503 memcpy(writebuf, &sblock, sbsize);
504 if (fsopts->needswap)
505 ffs_sb_swap(&sblock, (struct fs*)writebuf);
506 memcpy(iobuf, writebuf, SBLOCKSIZE);
508 printf("super-block backups (for fsck -b #) at:");
509 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
510 initcg(cylno, start_time.tv_sec, fsopts);
511 if (cylno % nprintcols == 0)
513 printf(" %*lld,", printcolwidth,
514 (long long)fsbtodb(&sblock, cgsblock(&sblock, cylno)));
520 * Now construct the initial file system,
521 * then write out the super-block.
523 sblock.fs_time = start_time.tv_sec;
525 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
526 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
527 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
528 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
530 if (fsopts->needswap)
531 sblock.fs_flags |= FS_SWAPPED;
532 ffs_write_superblock(&sblock, fsopts);
537 * Write out the superblock and its duplicates,
538 * and the cylinder group summaries
541 ffs_write_superblock(struct fs *fs, const fsinfo_t *fsopts)
543 int cylno, size, blks, i, saveflag;
547 saveflag = fs->fs_flags & FS_INTERNAL;
548 fs->fs_flags &= ~FS_INTERNAL;
550 memcpy(writebuf, &sblock, sbsize);
551 if (fsopts->needswap)
552 ffs_sb_swap(fs, (struct fs*)writebuf);
553 ffs_wtfs(fs->fs_sblockloc / sectorsize, sbsize, writebuf, fsopts);
555 /* Write out the duplicate super blocks */
556 for (cylno = 0; cylno < fs->fs_ncg; cylno++)
557 ffs_wtfs(fsbtodb(fs, cgsblock(fs, cylno)),
558 sbsize, writebuf, fsopts);
560 /* Write out the cylinder group summaries */
561 size = fs->fs_cssize;
562 blks = howmany(size, fs->fs_fsize);
563 space = (void *)fs->fs_csp;
564 if ((wrbuf = malloc(size)) == NULL)
565 err(1, "ffs_write_superblock: malloc %d", size);
566 for (i = 0; i < blks; i+= fs->fs_frag) {
568 if (i + fs->fs_frag > blks)
569 size = (blks - i) * fs->fs_fsize;
570 if (fsopts->needswap)
571 ffs_csum_swap((struct csum *)space,
572 (struct csum *)wrbuf, size);
574 memcpy(wrbuf, space, (u_int)size);
575 ffs_wtfs(fsbtodb(fs, fs->fs_csaddr + i), size, wrbuf, fsopts);
576 space = (char *)space + size;
579 fs->fs_flags |= saveflag;
583 * Initialize a cylinder group.
586 initcg(int cylno, time_t utime, const fsinfo_t *fsopts)
589 int32_t i, j, d, dlower, dupper, blkno;
590 struct ufs1_dinode *dp1;
591 struct ufs2_dinode *dp2;
595 * Determine block bounds for cylinder group.
596 * Allow space for super block summary information in first
599 cbase = cgbase(&sblock, cylno);
600 dmax = cbase + sblock.fs_fpg;
601 if (dmax > sblock.fs_size)
602 dmax = sblock.fs_size;
603 dlower = cgsblock(&sblock, cylno) - cbase;
604 dupper = cgdmin(&sblock, cylno) - cbase;
606 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
607 memset(&acg, 0, sblock.fs_cgsize);
609 acg.cg_magic = CG_MAGIC;
611 acg.cg_niblk = sblock.fs_ipg;
612 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
613 sblock.fs_ipg : 2 * INOPB(&sblock);
614 acg.cg_ndblk = dmax - cbase;
615 if (sblock.fs_contigsumsize > 0)
616 acg.cg_nclusterblks = acg.cg_ndblk >> sblock.fs_fragshift;
617 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
619 acg.cg_iusedoff = start;
621 if (cylno == sblock.fs_ncg - 1)
622 acg.cg_old_ncyl = howmany(acg.cg_ndblk,
623 sblock.fs_fpg / sblock.fs_old_cpg);
625 acg.cg_old_ncyl = sblock.fs_old_cpg;
626 acg.cg_old_time = acg.cg_time;
628 acg.cg_old_niblk = acg.cg_niblk;
630 acg.cg_initediblk = 0;
631 acg.cg_old_btotoff = start;
632 acg.cg_old_boff = acg.cg_old_btotoff +
633 sblock.fs_old_cpg * sizeof(int32_t);
634 acg.cg_iusedoff = acg.cg_old_boff +
635 sblock.fs_old_cpg * sizeof(u_int16_t);
637 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
638 if (sblock.fs_contigsumsize <= 0) {
639 acg.cg_nextfreeoff = acg.cg_freeoff +
640 howmany(sblock.fs_fpg, CHAR_BIT);
642 acg.cg_clustersumoff = acg.cg_freeoff +
643 howmany(sblock.fs_fpg, CHAR_BIT) - sizeof(int32_t);
644 acg.cg_clustersumoff =
645 roundup(acg.cg_clustersumoff, sizeof(int32_t));
646 acg.cg_clusteroff = acg.cg_clustersumoff +
647 (sblock.fs_contigsumsize + 1) * sizeof(int32_t);
648 acg.cg_nextfreeoff = acg.cg_clusteroff +
649 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
651 if (acg.cg_nextfreeoff > sblock.fs_cgsize) {
652 printf("Panic: cylinder group too big\n");
655 acg.cg_cs.cs_nifree += sblock.fs_ipg;
657 for (i = 0; i < ROOTINO; i++) {
658 setbit(cg_inosused_swap(&acg, 0), i);
659 acg.cg_cs.cs_nifree--;
663 * In cylno 0, beginning space is reserved
664 * for boot and super blocks.
666 for (d = 0, blkno = 0; d < dlower;) {
667 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno);
668 if (sblock.fs_contigsumsize > 0)
669 setbit(cg_clustersfree_swap(&acg, 0), blkno);
670 acg.cg_cs.cs_nbfree++;
675 if ((i = (dupper & (sblock.fs_frag - 1))) != 0) {
676 acg.cg_frsum[sblock.fs_frag - i]++;
677 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
678 setbit(cg_blksfree_swap(&acg, 0), dupper);
679 acg.cg_cs.cs_nffree++;
682 for (d = dupper, blkno = dupper >> sblock.fs_fragshift;
683 d + sblock.fs_frag <= acg.cg_ndblk; ) {
684 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno);
685 if (sblock.fs_contigsumsize > 0)
686 setbit(cg_clustersfree_swap(&acg, 0), blkno);
687 acg.cg_cs.cs_nbfree++;
691 if (d < acg.cg_ndblk) {
692 acg.cg_frsum[acg.cg_ndblk - d]++;
693 for (; d < acg.cg_ndblk; d++) {
694 setbit(cg_blksfree_swap(&acg, 0), d);
695 acg.cg_cs.cs_nffree++;
698 if (sblock.fs_contigsumsize > 0) {
699 int32_t *sump = cg_clustersum_swap(&acg, 0);
700 u_char *mapp = cg_clustersfree_swap(&acg, 0);
705 for (i = 0; i < acg.cg_nclusterblks; i++) {
706 if ((map & bit) != 0) {
708 } else if (run != 0) {
709 if (run > sblock.fs_contigsumsize)
710 run = sblock.fs_contigsumsize;
714 if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
722 if (run > sblock.fs_contigsumsize)
723 run = sblock.fs_contigsumsize;
727 sblock.fs_cs(&sblock, cylno) = acg.cg_cs;
729 * Write out the duplicate super block, the cylinder group map
730 * and two blocks worth of inodes in a single write.
732 start = sblock.fs_bsize > SBLOCKSIZE ? sblock.fs_bsize : SBLOCKSIZE;
733 memcpy(&iobuf[start], &acg, sblock.fs_cgsize);
734 if (fsopts->needswap)
735 ffs_cg_swap(&acg, (struct cg*)&iobuf[start], &sblock);
736 start += sblock.fs_bsize;
737 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
738 dp2 = (struct ufs2_dinode *)(&iobuf[start]);
739 for (i = 0; i < acg.cg_initediblk; i++) {
740 if (sblock.fs_magic == FS_UFS1_MAGIC) {
741 /* No need to swap, it'll stay random */
742 dp1->di_gen = random();
745 dp2->di_gen = random();
749 ffs_wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf,
752 * For the old file system, we have to initialize all the inodes.
755 for (i = 2 * sblock.fs_frag;
756 i < sblock.fs_ipg / INOPF(&sblock);
757 i += sblock.fs_frag) {
758 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
759 for (j = 0; j < INOPB(&sblock); j++) {
760 dp1->di_gen = random();
763 ffs_wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
764 sblock.fs_bsize, &iobuf[start], fsopts);
770 * read a block from the file system
773 ffs_rdfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts)
779 offset *= fsopts->sectorsize;
780 if (lseek(fsopts->fd, offset, SEEK_SET) < 0)
781 err(1, "ffs_rdfs: seek error for sector %lld: %s\n",
782 (long long)bno, strerror(errno));
783 n = read(fsopts->fd, bf, size);
786 err(1, "ffs_rdfs: read error bno %lld size %d", (long long)bno,
790 errx(1, "ffs_rdfs: read error for sector %lld: %s\n",
791 (long long)bno, strerror(errno));
795 * write a block to the file system
798 ffs_wtfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts)
804 offset *= fsopts->sectorsize;
805 if (lseek(fsopts->fd, offset, SEEK_SET) < 0)
806 err(1, "wtfs: seek error for sector %lld: %s\n",
807 (long long)bno, strerror(errno));
808 n = write(fsopts->fd, bf, size);
810 err(1, "wtfs: write error for sector %lld: %s\n",
811 (long long)bno, strerror(errno));
813 errx(1, "wtfs: write error for sector %lld: %s\n",
814 (long long)bno, strerror(errno));
818 /* Determine how many digits are needed to print a given integer */
820 count_digits(int num)
824 for(ndig = 1; num > 9; num /=10, ndig++);
834 for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
837 errx(1, "ilog2: %d is not a power of 2\n", val);