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>
56 #include <ufs/ufs/dinode.h>
57 #include <ufs/ffs/fs.h>
59 #include "ffs/ufs_bswap.h"
60 #include "ffs/ufs_inode.h"
61 #include "ffs/ffs_extern.h"
62 #include "ffs/newfs_extern.h"
64 static void initcg(int, time_t, const fsinfo_t *);
65 static int ilog2(int);
67 static int count_digits(int);
70 * make file system for cylinder-group style file systems
73 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
79 #define sblock fsun.fs
84 char pad[FFS_MAXBSIZE];
91 char writebuf[FFS_MAXBSIZE];
93 static int Oflag; /* format as an 4.3BSD file system */
94 static int64_t fssize; /* file system size */
95 static int sectorsize; /* bytes/sector */
96 static int fsize; /* fragment size */
97 static int bsize; /* block size */
98 static int maxbsize; /* maximum clustering */
99 static int maxblkspercg;
100 static int minfree; /* free space threshold */
101 static int opt; /* optimization preference (space or time) */
102 static int density; /* number of bytes per inode */
103 static int maxcontig; /* max contiguous blocks to allocate */
104 static int maxbpg; /* maximum blocks per file in a cyl group */
105 static int sbsize; /* superblock size */
106 static int avgfilesize; /* expected average file size */
107 static int avgfpdir; /* expected number of files per directory */
110 ffs_mkfs(const char *fsys, const fsinfo_t *fsopts)
112 int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg;
113 int32_t cylno, i, csfrags;
117 int nprintcols, printcolwidth;
119 Oflag = fsopts->version;
120 fssize = fsopts->size / fsopts->sectorsize;
121 sectorsize = fsopts->sectorsize;
122 fsize = fsopts->fsize;
123 bsize = fsopts->bsize;
124 maxbsize = fsopts->maxbsize;
125 maxblkspercg = fsopts->maxblkspercg;
126 minfree = fsopts->minfree;
127 opt = fsopts->optimization;
128 density = fsopts->density;
129 maxcontig = fsopts->maxcontig;
130 maxbpg = fsopts->maxbpg;
131 avgfilesize = fsopts->avgfilesize;
132 avgfpdir = fsopts->avgfpdir;
136 sblock.fs_old_inodefmt = FS_42INODEFMT;
137 sblock.fs_maxsymlinklen = 0;
138 sblock.fs_old_flags = 0;
140 sblock.fs_old_inodefmt = FS_44INODEFMT;
141 sblock.fs_maxsymlinklen = (Oflag == 1 ? MAXSYMLINKLEN_UFS1 :
143 sblock.fs_old_flags = FS_FLAGS_UPDATED;
147 * Validate the given file system size.
148 * Verify that its last block can actually be accessed.
149 * Convert to file system fragment sized units.
152 printf("preposterous size %lld\n", (long long)fssize);
155 ffs_wtfs(fssize - 1, sectorsize, (char *)&sblock, fsopts);
158 * collect and verify the filesystem density info
160 sblock.fs_avgfilesize = avgfilesize;
161 sblock.fs_avgfpdir = avgfpdir;
162 if (sblock.fs_avgfilesize <= 0)
163 printf("illegal expected average file size %d\n",
164 sblock.fs_avgfilesize), exit(14);
165 if (sblock.fs_avgfpdir <= 0)
166 printf("illegal expected number of files per directory %d\n",
167 sblock.fs_avgfpdir), exit(15);
169 * collect and verify the block and fragment sizes
171 sblock.fs_bsize = bsize;
172 sblock.fs_fsize = fsize;
173 if (!POWEROF2(sblock.fs_bsize)) {
174 printf("block size must be a power of 2, not %d\n",
178 if (!POWEROF2(sblock.fs_fsize)) {
179 printf("fragment size must be a power of 2, not %d\n",
183 if (sblock.fs_fsize < sectorsize) {
184 printf("fragment size %d is too small, minimum is %d\n",
185 sblock.fs_fsize, sectorsize);
188 if (sblock.fs_bsize < MINBSIZE) {
189 printf("block size %d is too small, minimum is %d\n",
190 sblock.fs_bsize, MINBSIZE);
193 if (sblock.fs_bsize > FFS_MAXBSIZE) {
194 printf("block size %d is too large, maximum is %d\n",
195 sblock.fs_bsize, FFS_MAXBSIZE);
198 if (sblock.fs_bsize < sblock.fs_fsize) {
199 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
200 sblock.fs_bsize, sblock.fs_fsize);
204 if (maxbsize < bsize || !POWEROF2(maxbsize)) {
205 sblock.fs_maxbsize = sblock.fs_bsize;
206 printf("Extent size set to %d\n", sblock.fs_maxbsize);
207 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) {
208 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize;
209 printf("Extent size reduced to %d\n", sblock.fs_maxbsize);
211 sblock.fs_maxbsize = maxbsize;
213 sblock.fs_maxcontig = maxcontig;
214 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) {
215 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize;
216 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize);
219 if (sblock.fs_maxcontig > 1)
220 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG);
222 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
223 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
224 sblock.fs_qbmask = ~sblock.fs_bmask;
225 sblock.fs_qfmask = ~sblock.fs_fmask;
226 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
228 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
230 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
231 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
232 sblock.fs_fragshift++;
233 if (sblock.fs_frag > MAXFRAG) {
234 printf("fragment size %d is too small, "
235 "minimum with block size %d is %d\n",
236 sblock.fs_fsize, sblock.fs_bsize,
237 sblock.fs_bsize / MAXFRAG);
240 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize);
241 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
244 sblock.fs_magic = FS_UFS1_MAGIC;
245 sblock.fs_sblockloc = SBLOCK_UFS1;
246 sblock.fs_nindir = sblock.fs_bsize / sizeof(int32_t);
247 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode);
248 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
250 sblock.fs_old_inodefmt = FS_44INODEFMT;
251 sblock.fs_old_cgoffset = 0;
252 sblock.fs_old_cgmask = 0xffffffff;
253 sblock.fs_old_size = sblock.fs_size;
254 sblock.fs_old_rotdelay = 0;
255 sblock.fs_old_rps = 60;
256 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize;
257 sblock.fs_old_cpg = 1;
258 sblock.fs_old_interleave = 1;
259 sblock.fs_old_trackskew = 0;
260 sblock.fs_old_cpc = 0;
261 sblock.fs_old_postblformat = 1;
262 sblock.fs_old_nrpos = 1;
264 sblock.fs_magic = FS_UFS2_MAGIC;
265 #if 0 /* XXX makefs is used for small filesystems. */
266 sblock.fs_sblockloc = SBLOCK_UFS2;
268 sblock.fs_sblockloc = SBLOCK_UFS1;
270 sblock.fs_nindir = sblock.fs_bsize / sizeof(int64_t);
271 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode);
272 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
277 roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize),
279 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
280 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag));
281 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
282 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
283 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
284 sizepb *= NINDIR(&sblock);
285 sblock.fs_maxfilesize += sizepb;
289 * Calculate the number of blocks to put into each cylinder group.
291 * This algorithm selects the number of blocks per cylinder
292 * group. The first goal is to have at least enough data blocks
293 * in each cylinder group to meet the density requirement. Once
294 * this goal is achieved we try to expand to have at least
295 * 1 cylinder group. Once this goal is achieved, we pack as
296 * many blocks into each cylinder group map as will fit.
298 * We start by calculating the smallest number of blocks that we
299 * can put into each cylinder group. If this is too big, we reduce
300 * the density until it fits.
302 origdensity = density;
304 fragsperinode = MAX(numfrags(&sblock, density), 1);
305 minfpg = fragsperinode * INOPB(&sblock);
306 if (minfpg > sblock.fs_size)
307 minfpg = sblock.fs_size;
308 sblock.fs_ipg = INOPB(&sblock);
309 sblock.fs_fpg = roundup(sblock.fs_iblkno +
310 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
311 if (sblock.fs_fpg < minfpg)
312 sblock.fs_fpg = minfpg;
313 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
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 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
323 density -= sblock.fs_fsize;
325 if (density != origdensity)
326 printf("density reduced from %d to %d\n", origdensity, density);
328 if (maxblkspercg <= 0 || maxblkspercg >= fssize)
329 maxblkspercg = fssize - 1;
331 * Start packing more blocks into the cylinder group until
332 * it cannot grow any larger, the number of cylinder groups
333 * drops below 1, or we reach the size requested.
335 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) {
336 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
338 if (sblock.fs_size / sblock.fs_fpg < 1)
340 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
342 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize)
344 sblock.fs_fpg -= sblock.fs_frag;
345 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
350 * Check to be sure that the last cylinder group has enough blocks
351 * to be viable. If it is too small, reduce the number of blocks
352 * per cylinder group which will have the effect of moving more
353 * blocks into the last cylinder group.
355 optimalfpg = sblock.fs_fpg;
357 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
358 lastminfpg = roundup(sblock.fs_iblkno +
359 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
360 if (sblock.fs_size < lastminfpg) {
361 printf("Filesystem size %lld < minimum size of %d\n",
362 (long long)sblock.fs_size, lastminfpg);
365 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg ||
366 sblock.fs_size % sblock.fs_fpg == 0)
368 sblock.fs_fpg -= sblock.fs_frag;
369 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
372 if (optimalfpg != sblock.fs_fpg)
373 printf("Reduced frags per cylinder group from %d to %d %s\n",
374 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group");
375 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
376 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
378 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf;
379 sblock.fs_old_nsect = sblock.fs_old_spc;
380 sblock.fs_old_npsect = sblock.fs_old_spc;
381 sblock.fs_old_ncyl = sblock.fs_ncg;
385 * fill in remaining fields of the super block
387 sblock.fs_csaddr = cgdmin(&sblock, 0);
389 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
392 * Setup memory for temporary in-core cylgroup summaries.
393 * Cribbed from ffs_mountfs().
395 size = sblock.fs_cssize;
396 blks = howmany(size, sblock.fs_fsize);
397 if (sblock.fs_contigsumsize > 0)
398 size += sblock.fs_ncg * sizeof(int32_t);
399 if ((space = (char *)calloc(1, size)) == NULL)
400 err(1, "memory allocation error for cg summaries");
401 sblock.fs_csp = space;
402 space = (char *)space + sblock.fs_cssize;
403 if (sblock.fs_contigsumsize > 0) {
406 sblock.fs_maxcluster = lp = space;
407 for (i = 0; i < sblock.fs_ncg; i++)
408 *lp++ = sblock.fs_contigsumsize;
411 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
412 if (sblock.fs_sbsize > SBLOCKSIZE)
413 sblock.fs_sbsize = SBLOCKSIZE;
414 sblock.fs_minfree = minfree;
415 sblock.fs_maxcontig = maxcontig;
416 sblock.fs_maxbpg = maxbpg;
417 sblock.fs_optim = opt;
418 sblock.fs_cgrotor = 0;
419 sblock.fs_pendingblocks = 0;
420 sblock.fs_pendinginodes = 0;
421 sblock.fs_cstotal.cs_ndir = 0;
422 sblock.fs_cstotal.cs_nbfree = 0;
423 sblock.fs_cstotal.cs_nifree = 0;
424 sblock.fs_cstotal.cs_nffree = 0;
428 sblock.fs_clean = FS_ISCLEAN;
430 sblock.fs_id[0] = start_time.tv_sec;
431 sblock.fs_id[1] = random();
432 sblock.fs_fsmnt[0] = '\0';
433 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize);
434 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno -
435 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno);
436 sblock.fs_cstotal.cs_nbfree =
437 fragstoblks(&sblock, sblock.fs_dsize) -
438 howmany(csfrags, sblock.fs_frag);
439 sblock.fs_cstotal.cs_nffree =
440 fragnum(&sblock, sblock.fs_size) +
441 (fragnum(&sblock, csfrags) > 0 ?
442 sblock.fs_frag - fragnum(&sblock, csfrags) : 0);
443 sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
444 sblock.fs_cstotal.cs_ndir = 0;
445 sblock.fs_dsize -= csfrags;
446 sblock.fs_time = start_time.tv_sec;
448 sblock.fs_old_time = start_time.tv_sec;
449 sblock.fs_old_dsize = sblock.fs_dsize;
450 sblock.fs_old_csaddr = sblock.fs_csaddr;
451 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
452 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
453 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
454 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
457 * Dump out summary information about file system.
459 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
460 printf("%s: %.1fMB (%lld sectors) block size %d, "
461 "fragment size %d\n",
462 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
463 (long long)fsbtodb(&sblock, sblock.fs_size),
464 sblock.fs_bsize, sblock.fs_fsize);
465 printf("\tusing %d cylinder groups of %.2fMB, %d blks, "
468 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
469 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
472 * Now determine how wide each column will be, and calculate how
473 * many columns will fit in a 76 char line. 76 is the width of the
474 * subwindows in sysinst.
476 printcolwidth = count_digits(
477 fsbtodb(&sblock, cgsblock(&sblock, sblock.fs_ncg -1)));
478 nprintcols = 76 / (printcolwidth + 2);
481 * allocate space for superblock, cylinder group map, and
482 * two sets of inode blocks.
484 if (sblock.fs_bsize < SBLOCKSIZE)
485 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize;
487 iobufsize = 4 * sblock.fs_bsize;
488 if ((iobuf = malloc(iobufsize)) == 0) {
489 printf("Cannot allocate I/O buffer\n");
492 memset(iobuf, 0, iobufsize);
494 * Make a copy of the superblock into the buffer that we will be
495 * writing out in each cylinder group.
497 memcpy(writebuf, &sblock, sbsize);
498 if (fsopts->needswap)
499 ffs_sb_swap(&sblock, (struct fs*)writebuf);
500 memcpy(iobuf, writebuf, SBLOCKSIZE);
502 printf("super-block backups (for fsck -b #) at:");
503 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
504 initcg(cylno, start_time.tv_sec, fsopts);
505 if (cylno % nprintcols == 0)
507 printf(" %*lld,", printcolwidth,
508 (long long)fsbtodb(&sblock, cgsblock(&sblock, cylno)));
514 * Now construct the initial file system,
515 * then write out the super-block.
517 sblock.fs_time = start_time.tv_sec;
519 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
520 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
521 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
522 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
524 if (fsopts->needswap)
525 sblock.fs_flags |= FS_SWAPPED;
526 ffs_write_superblock(&sblock, fsopts);
531 * Write out the superblock and its duplicates,
532 * and the cylinder group summaries
535 ffs_write_superblock(struct fs *fs, const fsinfo_t *fsopts)
537 int cylno, size, blks, i, saveflag;
541 saveflag = fs->fs_flags & FS_INTERNAL;
542 fs->fs_flags &= ~FS_INTERNAL;
544 memcpy(writebuf, &sblock, sbsize);
545 if (fsopts->needswap)
546 ffs_sb_swap(fs, (struct fs*)writebuf);
547 ffs_wtfs(fs->fs_sblockloc / sectorsize, sbsize, writebuf, fsopts);
549 /* Write out the duplicate super blocks */
550 for (cylno = 0; cylno < fs->fs_ncg; cylno++)
551 ffs_wtfs(fsbtodb(fs, cgsblock(fs, cylno)),
552 sbsize, writebuf, fsopts);
554 /* Write out the cylinder group summaries */
555 size = fs->fs_cssize;
556 blks = howmany(size, fs->fs_fsize);
557 space = (void *)fs->fs_csp;
558 if ((wrbuf = malloc(size)) == NULL)
559 err(1, "ffs_write_superblock: malloc %d", size);
560 for (i = 0; i < blks; i+= fs->fs_frag) {
562 if (i + fs->fs_frag > blks)
563 size = (blks - i) * fs->fs_fsize;
564 if (fsopts->needswap)
565 ffs_csum_swap((struct csum *)space,
566 (struct csum *)wrbuf, size);
568 memcpy(wrbuf, space, (u_int)size);
569 ffs_wtfs(fsbtodb(fs, fs->fs_csaddr + i), size, wrbuf, fsopts);
570 space = (char *)space + size;
573 fs->fs_flags |= saveflag;
577 * Initialize a cylinder group.
580 initcg(int cylno, time_t utime, const fsinfo_t *fsopts)
583 int32_t i, j, d, dlower, dupper, blkno;
584 struct ufs1_dinode *dp1;
585 struct ufs2_dinode *dp2;
589 * Determine block bounds for cylinder group.
590 * Allow space for super block summary information in first
593 cbase = cgbase(&sblock, cylno);
594 dmax = cbase + sblock.fs_fpg;
595 if (dmax > sblock.fs_size)
596 dmax = sblock.fs_size;
597 dlower = cgsblock(&sblock, cylno) - cbase;
598 dupper = cgdmin(&sblock, cylno) - cbase;
600 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
601 memset(&acg, 0, sblock.fs_cgsize);
603 acg.cg_magic = CG_MAGIC;
605 acg.cg_niblk = sblock.fs_ipg;
606 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
607 sblock.fs_ipg : 2 * INOPB(&sblock);
608 acg.cg_ndblk = dmax - cbase;
609 if (sblock.fs_contigsumsize > 0)
610 acg.cg_nclusterblks = acg.cg_ndblk >> sblock.fs_fragshift;
611 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
613 acg.cg_iusedoff = start;
615 if (cylno == sblock.fs_ncg - 1)
616 acg.cg_old_ncyl = howmany(acg.cg_ndblk,
617 sblock.fs_fpg / sblock.fs_old_cpg);
619 acg.cg_old_ncyl = sblock.fs_old_cpg;
620 acg.cg_old_time = acg.cg_time;
622 acg.cg_old_niblk = acg.cg_niblk;
624 acg.cg_initediblk = 0;
625 acg.cg_old_btotoff = start;
626 acg.cg_old_boff = acg.cg_old_btotoff +
627 sblock.fs_old_cpg * sizeof(int32_t);
628 acg.cg_iusedoff = acg.cg_old_boff +
629 sblock.fs_old_cpg * sizeof(u_int16_t);
631 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
632 if (sblock.fs_contigsumsize <= 0) {
633 acg.cg_nextfreeoff = acg.cg_freeoff +
634 howmany(sblock.fs_fpg, CHAR_BIT);
636 acg.cg_clustersumoff = acg.cg_freeoff +
637 howmany(sblock.fs_fpg, CHAR_BIT) - sizeof(int32_t);
638 acg.cg_clustersumoff =
639 roundup(acg.cg_clustersumoff, sizeof(int32_t));
640 acg.cg_clusteroff = acg.cg_clustersumoff +
641 (sblock.fs_contigsumsize + 1) * sizeof(int32_t);
642 acg.cg_nextfreeoff = acg.cg_clusteroff +
643 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
645 if (acg.cg_nextfreeoff > sblock.fs_cgsize) {
646 printf("Panic: cylinder group too big\n");
649 acg.cg_cs.cs_nifree += sblock.fs_ipg;
651 for (i = 0; i < ROOTINO; i++) {
652 setbit(cg_inosused_swap(&acg, 0), i);
653 acg.cg_cs.cs_nifree--;
657 * In cylno 0, beginning space is reserved
658 * for boot and super blocks.
660 for (d = 0, blkno = 0; d < dlower;) {
661 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno);
662 if (sblock.fs_contigsumsize > 0)
663 setbit(cg_clustersfree_swap(&acg, 0), blkno);
664 acg.cg_cs.cs_nbfree++;
669 if ((i = (dupper & (sblock.fs_frag - 1))) != 0) {
670 acg.cg_frsum[sblock.fs_frag - i]++;
671 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
672 setbit(cg_blksfree_swap(&acg, 0), dupper);
673 acg.cg_cs.cs_nffree++;
676 for (d = dupper, blkno = dupper >> sblock.fs_fragshift;
677 d + sblock.fs_frag <= acg.cg_ndblk; ) {
678 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno);
679 if (sblock.fs_contigsumsize > 0)
680 setbit(cg_clustersfree_swap(&acg, 0), blkno);
681 acg.cg_cs.cs_nbfree++;
685 if (d < acg.cg_ndblk) {
686 acg.cg_frsum[acg.cg_ndblk - d]++;
687 for (; d < acg.cg_ndblk; d++) {
688 setbit(cg_blksfree_swap(&acg, 0), d);
689 acg.cg_cs.cs_nffree++;
692 if (sblock.fs_contigsumsize > 0) {
693 int32_t *sump = cg_clustersum_swap(&acg, 0);
694 u_char *mapp = cg_clustersfree_swap(&acg, 0);
699 for (i = 0; i < acg.cg_nclusterblks; i++) {
700 if ((map & bit) != 0) {
702 } else if (run != 0) {
703 if (run > sblock.fs_contigsumsize)
704 run = sblock.fs_contigsumsize;
708 if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
716 if (run > sblock.fs_contigsumsize)
717 run = sblock.fs_contigsumsize;
721 sblock.fs_cs(&sblock, cylno) = acg.cg_cs;
723 * Write out the duplicate super block, the cylinder group map
724 * and two blocks worth of inodes in a single write.
726 start = sblock.fs_bsize > SBLOCKSIZE ? sblock.fs_bsize : SBLOCKSIZE;
727 memcpy(&iobuf[start], &acg, sblock.fs_cgsize);
728 if (fsopts->needswap)
729 ffs_cg_swap(&acg, (struct cg*)&iobuf[start], &sblock);
730 start += sblock.fs_bsize;
731 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
732 dp2 = (struct ufs2_dinode *)(&iobuf[start]);
733 for (i = 0; i < acg.cg_initediblk; i++) {
734 if (sblock.fs_magic == FS_UFS1_MAGIC) {
735 /* No need to swap, it'll stay random */
736 dp1->di_gen = random();
739 dp2->di_gen = random();
743 ffs_wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf,
746 * For the old file system, we have to initialize all the inodes.
749 for (i = 2 * sblock.fs_frag;
750 i < sblock.fs_ipg / INOPF(&sblock);
751 i += sblock.fs_frag) {
752 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
753 for (j = 0; j < INOPB(&sblock); j++) {
754 dp1->di_gen = random();
757 ffs_wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
758 sblock.fs_bsize, &iobuf[start], fsopts);
764 * read a block from the file system
767 ffs_rdfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts)
773 offset *= fsopts->sectorsize;
774 if (lseek(fsopts->fd, offset, SEEK_SET) < 0)
775 err(1, "ffs_rdfs: seek error for sector %lld: %s\n",
776 (long long)bno, strerror(errno));
777 n = read(fsopts->fd, bf, size);
780 err(1, "ffs_rdfs: read error bno %lld size %d", (long long)bno,
784 errx(1, "ffs_rdfs: read error for sector %lld: %s\n",
785 (long long)bno, strerror(errno));
789 * write a block to the file system
792 ffs_wtfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts)
798 offset *= fsopts->sectorsize;
799 if (lseek(fsopts->fd, offset, SEEK_SET) < 0)
800 err(1, "wtfs: seek error for sector %lld: %s\n",
801 (long long)bno, strerror(errno));
802 n = write(fsopts->fd, bf, size);
804 err(1, "wtfs: write error for sector %lld: %s\n",
805 (long long)bno, strerror(errno));
807 errx(1, "wtfs: write error for sector %lld: %s\n",
808 (long long)bno, strerror(errno));
812 /* Determine how many digits are needed to print a given integer */
814 count_digits(int num)
818 for(ndig = 1; num > 9; num /=10, ndig++);
828 for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
831 errx(1, "ilog2: %d is not a power of 2\n", val);