2 * Copyright (c) 2002 Networks Associates Technology, Inc.
5 * This software was developed for the FreeBSD Project by Marshall
6 * Kirk McKusick and Network Associates Laboratories, the Security
7 * Research Division of Network Associates, Inc. under DARPA/SPAWAR
8 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
11 * Copyright (c) 1980, 1989, 1993
12 * The Regents of the University of California. All rights reserved.
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions
17 * 1. Redistributions of source code must retain the above copyright
18 * notice, this list of conditions and the following disclaimer.
19 * 2. Redistributions in binary form must reproduce the above copyright
20 * notice, this list of conditions and the following disclaimer in the
21 * documentation and/or other materials provided with the distribution.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 static char sccsid[] = "@(#)mkfs.c 8.11 (Berkeley) 5/3/95";
44 #include <sys/cdefs.h>
45 __FBSDID("$FreeBSD$");
56 #include <sys/param.h>
58 #include <sys/types.h>
60 #include <sys/resource.h>
62 #include <ufs/ufs/dinode.h>
63 #include <ufs/ufs/dir.h>
64 #include <ufs/ffs/fs.h>
65 #include <sys/disklabel.h>
68 #include <sys/ioctl.h>
72 * make file system for cylinder-group style file systems
75 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
77 static struct csum *fscs;
78 #define sblock disk.d_fs
82 struct ufs1_dinode dp1;
83 struct ufs2_dinode dp2;
85 #define DIP(dp, field) \
86 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \
87 (dp)->dp1.field : (dp)->dp2.field)
90 static long iobufsize;
91 static ufs2_daddr_t alloc(int size, int mode);
92 static int charsperline(void);
93 static void clrblock(struct fs *, unsigned char *, int);
94 static void fsinit(time_t);
95 static int ilog2(int);
96 static void initcg(int, time_t);
97 static int isblock(struct fs *, unsigned char *, int);
98 static void iput(union dinode *, ino_t);
99 static int makedir(struct direct *, int);
100 static void setblock(struct fs *, unsigned char *, int);
101 static void wtfs(ufs2_daddr_t, int, char *);
102 static u_int32_t newfs_random(void);
105 do_sbwrite(struct uufsd *disk)
108 disk->d_sblock = disk->d_fs.fs_sblockloc / disk->d_bsize;
109 return (pwrite(disk->d_fd, &disk->d_fs, SBLOCKSIZE, (off_t)((part_ofs +
110 disk->d_sblock) * disk->d_bsize)));
114 mkfs(struct partition *pp, char *fsys)
116 int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg;
123 int minfragsperinode; /* minimum ratio of frags to inodes */
124 char tmpbuf[100]; /* XXX this will break in about 2,500 years */
127 char cdummy[SBLOCKSIZE];
129 #define fsdummy dummy.fdummy
130 #define chdummy dummy.cdummy
133 * Our blocks == sector size, and the version of UFS we are using is
134 * specified by Oflag.
136 disk.d_bsize = sectorsize;
144 sblock.fs_old_flags = FS_FLAGS_UPDATED;
147 sblock.fs_flags |= FS_DOSOFTDEP;
149 strlcpy(sblock.fs_volname, volumelabel, MAXVOLLEN);
151 sblock.fs_flags |= FS_GJOURNAL;
153 sblock.fs_flags |= FS_MULTILABEL;
155 sblock.fs_flags |= FS_TRIM;
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 %jd\n", (intmax_t)fssize);
165 wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize,
168 * collect and verify the file system density info
170 sblock.fs_avgfilesize = avgfilesize;
171 sblock.fs_avgfpdir = avgfilesperdir;
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);
181 * collect and verify the block and fragment sizes
183 sblock.fs_bsize = bsize;
184 sblock.fs_fsize = fsize;
185 if (!POWEROF2(sblock.fs_bsize)) {
186 printf("block size must be a power of 2, not %d\n",
190 if (!POWEROF2(sblock.fs_fsize)) {
191 printf("fragment size must be a power of 2, not %d\n",
195 if (sblock.fs_fsize < sectorsize) {
196 printf("increasing fragment size from %d to sector size (%d)\n",
197 sblock.fs_fsize, sectorsize);
198 sblock.fs_fsize = sectorsize;
200 if (sblock.fs_bsize > MAXBSIZE) {
201 printf("decreasing block size from %d to maximum (%d)\n",
202 sblock.fs_bsize, MAXBSIZE);
203 sblock.fs_bsize = MAXBSIZE;
205 if (sblock.fs_bsize < MINBSIZE) {
206 printf("increasing block size from %d to minimum (%d)\n",
207 sblock.fs_bsize, MINBSIZE);
208 sblock.fs_bsize = MINBSIZE;
210 if (sblock.fs_fsize > MAXBSIZE) {
211 printf("decreasing fragment size from %d to maximum (%d)\n",
212 sblock.fs_fsize, MAXBSIZE);
213 sblock.fs_fsize = MAXBSIZE;
215 if (sblock.fs_bsize < sblock.fs_fsize) {
216 printf("increasing block size from %d to fragment size (%d)\n",
217 sblock.fs_bsize, sblock.fs_fsize);
218 sblock.fs_bsize = sblock.fs_fsize;
220 if (sblock.fs_fsize * MAXFRAG < sblock.fs_bsize) {
222 "increasing fragment size from %d to block size / %d (%d)\n",
223 sblock.fs_fsize, MAXFRAG, sblock.fs_bsize / MAXFRAG);
224 sblock.fs_fsize = sblock.fs_bsize / MAXFRAG;
228 if (maxbsize < bsize || !POWEROF2(maxbsize)) {
229 sblock.fs_maxbsize = sblock.fs_bsize;
230 printf("Extent size set to %d\n", sblock.fs_maxbsize);
231 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) {
232 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize;
233 printf("Extent size reduced to %d\n", sblock.fs_maxbsize);
235 sblock.fs_maxbsize = maxbsize;
238 * Maxcontig sets the default for the maximum number of blocks
239 * that may be allocated sequentially. With file system clustering
240 * it is possible to allocate contiguous blocks up to the maximum
241 * transfer size permitted by the controller or buffering.
244 maxcontig = MAX(1, MAXPHYS / bsize);
245 sblock.fs_maxcontig = maxcontig;
246 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) {
247 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize;
248 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize);
250 if (sblock.fs_maxcontig > 1)
251 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG);
252 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
253 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
254 sblock.fs_qbmask = ~sblock.fs_bmask;
255 sblock.fs_qfmask = ~sblock.fs_fmask;
256 sblock.fs_bshift = ilog2(sblock.fs_bsize);
257 sblock.fs_fshift = ilog2(sblock.fs_fsize);
258 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
259 sblock.fs_fragshift = ilog2(sblock.fs_frag);
260 if (sblock.fs_frag > MAXFRAG) {
261 printf("fragment size %d is still too small (can't happen)\n",
262 sblock.fs_bsize / MAXFRAG);
265 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize);
266 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
269 * Before the filesystem is finally initialized, mark it
270 * as incompletely initialized.
272 sblock.fs_magic = FS_BAD_MAGIC;
275 sblock.fs_sblockloc = SBLOCK_UFS1;
276 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t);
277 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode);
278 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
279 sizeof(ufs1_daddr_t));
280 sblock.fs_old_inodefmt = FS_44INODEFMT;
281 sblock.fs_old_cgoffset = 0;
282 sblock.fs_old_cgmask = 0xffffffff;
283 sblock.fs_old_size = sblock.fs_size;
284 sblock.fs_old_rotdelay = 0;
285 sblock.fs_old_rps = 60;
286 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize;
287 sblock.fs_old_cpg = 1;
288 sblock.fs_old_interleave = 1;
289 sblock.fs_old_trackskew = 0;
290 sblock.fs_old_cpc = 0;
291 sblock.fs_old_postblformat = 1;
292 sblock.fs_old_nrpos = 1;
294 sblock.fs_sblockloc = SBLOCK_UFS2;
295 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t);
296 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode);
297 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
298 sizeof(ufs2_daddr_t));
301 roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize),
303 sblock.fs_cblkno = sblock.fs_sblkno +
304 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag);
305 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
306 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
307 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
308 sizepb *= NINDIR(&sblock);
309 sblock.fs_maxfilesize += sizepb;
313 * It's impossible to create a snapshot in case that fs_maxfilesize
314 * is smaller than the fssize.
316 if (sblock.fs_maxfilesize < (u_quad_t)fssize) {
317 warnx("WARNING: You will be unable to create snapshots on this "
318 "file system. Correct by using a larger blocksize.");
322 * Calculate the number of blocks to put into each cylinder group.
324 * This algorithm selects the number of blocks per cylinder
325 * group. The first goal is to have at least enough data blocks
326 * in each cylinder group to meet the density requirement. Once
327 * this goal is achieved we try to expand to have at least
328 * MINCYLGRPS cylinder groups. Once this goal is achieved, we
329 * pack as many blocks into each cylinder group map as will fit.
331 * We start by calculating the smallest number of blocks that we
332 * can put into each cylinder group. If this is too big, we reduce
333 * the density until it fits.
335 maxinum = (((int64_t)(1)) << 32) - INOPB(&sblock);
336 minfragsperinode = 1 + fssize / maxinum;
338 density = MAX(NFPI, minfragsperinode) * fsize;
339 } else if (density < minfragsperinode * fsize) {
340 origdensity = density;
341 density = minfragsperinode * fsize;
342 fprintf(stderr, "density increased from %d to %d\n",
343 origdensity, density);
345 origdensity = density;
347 fragsperinode = MAX(numfrags(&sblock, density), 1);
348 if (fragsperinode < minfragsperinode) {
351 printf("Block size too small for a file system %s %d\n",
352 "of this size. Increasing blocksize to", bsize);
355 minfpg = fragsperinode * INOPB(&sblock);
356 if (minfpg > sblock.fs_size)
357 minfpg = sblock.fs_size;
358 sblock.fs_ipg = INOPB(&sblock);
359 sblock.fs_fpg = roundup(sblock.fs_iblkno +
360 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
361 if (sblock.fs_fpg < minfpg)
362 sblock.fs_fpg = minfpg;
363 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
365 sblock.fs_fpg = roundup(sblock.fs_iblkno +
366 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
367 if (sblock.fs_fpg < minfpg)
368 sblock.fs_fpg = minfpg;
369 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
371 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
373 density -= sblock.fs_fsize;
375 if (density != origdensity)
376 printf("density reduced from %d to %d\n", origdensity, density);
378 * Start packing more blocks into the cylinder group until
379 * it cannot grow any larger, the number of cylinder groups
380 * drops below MINCYLGRPS, or we reach the size requested.
381 * For UFS1 inodes per cylinder group are stored in an int16_t
382 * so fs_ipg is limited to 2^15 - 1.
384 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) {
385 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
387 if (Oflag > 1 || (Oflag == 1 && sblock.fs_ipg <= 0x7fff)) {
388 if (sblock.fs_size / sblock.fs_fpg < MINCYLGRPS)
390 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
392 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize)
395 sblock.fs_fpg -= sblock.fs_frag;
396 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
401 * Check to be sure that the last cylinder group has enough blocks
402 * to be viable. If it is too small, reduce the number of blocks
403 * per cylinder group which will have the effect of moving more
404 * blocks into the last cylinder group.
406 optimalfpg = sblock.fs_fpg;
408 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
409 lastminfpg = roundup(sblock.fs_iblkno +
410 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
411 if (sblock.fs_size < lastminfpg) {
412 printf("Filesystem size %jd < minimum size of %d\n",
413 (intmax_t)sblock.fs_size, lastminfpg);
416 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg ||
417 sblock.fs_size % sblock.fs_fpg == 0)
419 sblock.fs_fpg -= sblock.fs_frag;
420 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
423 if (optimalfpg != sblock.fs_fpg)
424 printf("Reduced frags per cylinder group from %d to %d %s\n",
425 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group");
426 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
427 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
429 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf;
430 sblock.fs_old_nsect = sblock.fs_old_spc;
431 sblock.fs_old_npsect = sblock.fs_old_spc;
432 sblock.fs_old_ncyl = sblock.fs_ncg;
435 * fill in remaining fields of the super block
437 sblock.fs_csaddr = cgdmin(&sblock, 0);
439 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
440 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
442 errx(31, "calloc failed");
443 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
444 if (sblock.fs_sbsize > SBLOCKSIZE)
445 sblock.fs_sbsize = SBLOCKSIZE;
446 sblock.fs_minfree = minfree;
448 sblock.fs_maxbpg = MAXBLKPG(sblock.fs_bsize);
450 sblock.fs_maxbpg = maxbpg;
451 sblock.fs_optim = opt;
452 sblock.fs_cgrotor = 0;
453 sblock.fs_pendingblocks = 0;
454 sblock.fs_pendinginodes = 0;
459 sblock.fs_id[0] = (long)utime;
460 sblock.fs_id[1] = newfs_random();
461 sblock.fs_fsmnt[0] = '\0';
462 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize);
463 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno -
464 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno);
465 sblock.fs_cstotal.cs_nbfree =
466 fragstoblks(&sblock, sblock.fs_dsize) -
467 howmany(csfrags, sblock.fs_frag);
468 sblock.fs_cstotal.cs_nffree =
469 fragnum(&sblock, sblock.fs_size) +
470 (fragnum(&sblock, csfrags) > 0 ?
471 sblock.fs_frag - fragnum(&sblock, csfrags) : 0);
472 sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
473 sblock.fs_cstotal.cs_ndir = 0;
474 sblock.fs_dsize -= csfrags;
475 sblock.fs_time = utime;
477 sblock.fs_old_time = utime;
478 sblock.fs_old_dsize = sblock.fs_dsize;
479 sblock.fs_old_csaddr = sblock.fs_csaddr;
480 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
481 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
482 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
483 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
487 * Dump out summary information about file system.
489 # define B2MBFACTOR (1 / (1024.0 * 1024.0))
490 printf("%s: %.1fMB (%jd sectors) block size %d, fragment size %d\n",
491 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
492 (intmax_t)fsbtodb(&sblock, sblock.fs_size), sblock.fs_bsize,
494 printf("\tusing %d cylinder groups of %.2fMB, %d blks, %d inodes.\n",
495 sblock.fs_ncg, (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
496 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
497 if (sblock.fs_flags & FS_DOSOFTDEP)
498 printf("\twith soft updates\n");
501 if (Eflag && !Nflag) {
502 printf("Erasing sectors [%jd...%jd]\n",
503 sblock.fs_sblockloc / disk.d_bsize,
504 fsbtodb(&sblock, sblock.fs_size) - 1);
505 berase(&disk, sblock.fs_sblockloc / disk.d_bsize,
506 sblock.fs_size * sblock.fs_fsize - sblock.fs_sblockloc);
509 * Wipe out old UFS1 superblock(s) if necessary.
511 if (!Nflag && Oflag != 1) {
512 i = bread(&disk, part_ofs + SBLOCK_UFS1 / disk.d_bsize, chdummy, SBLOCKSIZE);
514 err(1, "can't read old UFS1 superblock: %s", disk.d_error);
516 if (fsdummy.fs_magic == FS_UFS1_MAGIC) {
517 fsdummy.fs_magic = 0;
518 bwrite(&disk, part_ofs + SBLOCK_UFS1 / disk.d_bsize,
519 chdummy, SBLOCKSIZE);
520 for (cg = 0; cg < fsdummy.fs_ncg; cg++)
521 bwrite(&disk, part_ofs + fsbtodb(&fsdummy,
522 cgsblock(&fsdummy, cg)), chdummy, SBLOCKSIZE);
528 printf("** Exiting on Xflag 1\n");
532 printf("** Leaving BAD MAGIC on Xflag 2\n");
534 sblock.fs_magic = (Oflag != 1) ? FS_UFS2_MAGIC : FS_UFS1_MAGIC;
537 * Now build the cylinders group blocks and
538 * then print out indices of cylinder groups.
540 printf("super-block backups (for fsck -b #) at:\n");
542 width = charsperline();
544 * allocate space for superblock, cylinder group map, and
545 * two sets of inode blocks.
547 if (sblock.fs_bsize < SBLOCKSIZE)
548 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize;
550 iobufsize = 4 * sblock.fs_bsize;
551 if ((iobuf = calloc(1, iobufsize)) == 0) {
552 printf("Cannot allocate I/O buffer\n");
556 * Make a copy of the superblock into the buffer that we will be
557 * writing out in each cylinder group.
559 bcopy((char *)&sblock, iobuf, SBLOCKSIZE);
560 for (cg = 0; cg < sblock.fs_ncg; cg++) {
562 j = snprintf(tmpbuf, sizeof(tmpbuf), " %jd%s",
563 (intmax_t)fsbtodb(&sblock, cgsblock(&sblock, cg)),
564 cg < (sblock.fs_ncg-1) ? "," : "");
566 tmpbuf[j = 0] = '\0';
567 if (i + j >= width) {
572 printf("%s", tmpbuf);
579 * Now construct the initial file system,
580 * then write out the super-block.
584 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
585 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
586 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
587 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
590 printf("** Exiting on Xflag 3\n");
596 * For UFS1 filesystems with a blocksize of 64K, the first
597 * alternate superblock resides at the location used for
598 * the default UFS2 superblock. As there is a valid
599 * superblock at this location, the boot code will use
600 * it as its first choice. Thus we have to ensure that
601 * all of its statistcs on usage are correct.
603 if (Oflag == 1 && sblock.fs_bsize == 65536)
604 wtfs(fsbtodb(&sblock, cgsblock(&sblock, 0)),
605 sblock.fs_bsize, (char *)&sblock);
607 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
608 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
609 sblock.fs_cssize - i < sblock.fs_bsize ?
610 sblock.fs_cssize - i : sblock.fs_bsize,
613 * Update information about this partion in pack
614 * label, to that it may be updated on disk.
617 pp->p_fstype = FS_BSDFFS;
618 pp->p_fsize = sblock.fs_fsize;
619 pp->p_frag = sblock.fs_frag;
620 pp->p_cpg = sblock.fs_fpg;
625 * Initialize a cylinder group.
628 initcg(int cylno, time_t utime)
631 uint i, j, d, dlower, dupper;
632 ufs2_daddr_t cbase, dmax;
633 struct ufs1_dinode *dp1;
634 struct ufs2_dinode *dp2;
638 * Determine block bounds for cylinder group.
639 * Allow space for super block summary information in first
642 cbase = cgbase(&sblock, cylno);
643 dmax = cbase + sblock.fs_fpg;
644 if (dmax > sblock.fs_size)
645 dmax = sblock.fs_size;
646 dlower = cgsblock(&sblock, cylno) - cbase;
647 dupper = cgdmin(&sblock, cylno) - cbase;
649 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
651 memset(&acg, 0, sblock.fs_cgsize);
653 acg.cg_magic = CG_MAGIC;
655 acg.cg_niblk = sblock.fs_ipg;
656 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
657 sblock.fs_ipg : 2 * INOPB(&sblock);
658 acg.cg_ndblk = dmax - cbase;
659 if (sblock.fs_contigsumsize > 0)
660 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
661 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
663 acg.cg_iusedoff = start;
665 acg.cg_old_ncyl = sblock.fs_old_cpg;
666 acg.cg_old_time = acg.cg_time;
668 acg.cg_old_niblk = acg.cg_niblk;
670 acg.cg_initediblk = 0;
671 acg.cg_old_btotoff = start;
672 acg.cg_old_boff = acg.cg_old_btotoff +
673 sblock.fs_old_cpg * sizeof(int32_t);
674 acg.cg_iusedoff = acg.cg_old_boff +
675 sblock.fs_old_cpg * sizeof(u_int16_t);
677 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
678 acg.cg_nextfreeoff = acg.cg_freeoff + howmany(sblock.fs_fpg, CHAR_BIT);
679 if (sblock.fs_contigsumsize > 0) {
680 acg.cg_clustersumoff =
681 roundup(acg.cg_nextfreeoff, sizeof(u_int32_t));
682 acg.cg_clustersumoff -= sizeof(u_int32_t);
683 acg.cg_clusteroff = acg.cg_clustersumoff +
684 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
685 acg.cg_nextfreeoff = acg.cg_clusteroff +
686 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
688 if (acg.cg_nextfreeoff > (unsigned)sblock.fs_cgsize) {
689 printf("Panic: cylinder group too big\n");
692 acg.cg_cs.cs_nifree += sblock.fs_ipg;
694 for (i = 0; i < (long)ROOTINO; i++) {
695 setbit(cg_inosused(&acg), i);
696 acg.cg_cs.cs_nifree--;
700 * In cylno 0, beginning space is reserved
701 * for boot and super blocks.
703 for (d = 0; d < dlower; d += sblock.fs_frag) {
704 blkno = d / sblock.fs_frag;
705 setblock(&sblock, cg_blksfree(&acg), blkno);
706 if (sblock.fs_contigsumsize > 0)
707 setbit(cg_clustersfree(&acg), blkno);
708 acg.cg_cs.cs_nbfree++;
711 if ((i = dupper % sblock.fs_frag)) {
712 acg.cg_frsum[sblock.fs_frag - i]++;
713 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
714 setbit(cg_blksfree(&acg), dupper);
715 acg.cg_cs.cs_nffree++;
718 for (d = dupper; d + sblock.fs_frag <= acg.cg_ndblk;
719 d += sblock.fs_frag) {
720 blkno = d / sblock.fs_frag;
721 setblock(&sblock, cg_blksfree(&acg), blkno);
722 if (sblock.fs_contigsumsize > 0)
723 setbit(cg_clustersfree(&acg), blkno);
724 acg.cg_cs.cs_nbfree++;
726 if (d < acg.cg_ndblk) {
727 acg.cg_frsum[acg.cg_ndblk - d]++;
728 for (; d < acg.cg_ndblk; d++) {
729 setbit(cg_blksfree(&acg), d);
730 acg.cg_cs.cs_nffree++;
733 if (sblock.fs_contigsumsize > 0) {
734 int32_t *sump = cg_clustersum(&acg);
735 u_char *mapp = cg_clustersfree(&acg);
740 for (i = 0; i < acg.cg_nclusterblks; i++) {
741 if ((map & bit) != 0)
744 if (run > sblock.fs_contigsumsize)
745 run = sblock.fs_contigsumsize;
749 if ((i & (CHAR_BIT - 1)) != CHAR_BIT - 1)
757 if (run > sblock.fs_contigsumsize)
758 run = sblock.fs_contigsumsize;
764 * Write out the duplicate super block, the cylinder group map
765 * and two blocks worth of inodes in a single write.
767 start = sblock.fs_bsize > SBLOCKSIZE ? sblock.fs_bsize : SBLOCKSIZE;
768 bcopy((char *)&acg, &iobuf[start], sblock.fs_cgsize);
769 start += sblock.fs_bsize;
770 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
771 dp2 = (struct ufs2_dinode *)(&iobuf[start]);
772 for (i = 0; i < acg.cg_initediblk; i++) {
773 if (sblock.fs_magic == FS_UFS1_MAGIC) {
774 dp1->di_gen = newfs_random();
777 dp2->di_gen = newfs_random();
781 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf);
783 * For the old file system, we have to initialize all the inodes.
786 for (i = 2 * sblock.fs_frag;
787 i < sblock.fs_ipg / INOPF(&sblock);
788 i += sblock.fs_frag) {
789 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
790 for (j = 0; j < INOPB(&sblock); j++) {
791 dp1->di_gen = newfs_random();
794 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
795 sblock.fs_bsize, &iobuf[start]);
801 * initialize the file system
803 #define ROOTLINKCNT 3
805 struct direct root_dir[] = {
806 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
807 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
808 { ROOTINO + 1, sizeof(struct direct), DT_DIR, 5, ".snap" },
811 #define SNAPLINKCNT 2
813 struct direct snap_dir[] = {
814 { ROOTINO + 1, sizeof(struct direct), DT_DIR, 1, "." },
815 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
826 memset(&node, 0, sizeof node);
827 if ((grp = getgrnam("operator")) != NULL) {
830 warnx("Cannot retrieve operator gid, using gid 0.");
833 entries = (nflag) ? ROOTLINKCNT - 1: ROOTLINKCNT;
834 if (sblock.fs_magic == FS_UFS1_MAGIC) {
836 * initialize the node
838 node.dp1.di_atime = utime;
839 node.dp1.di_mtime = utime;
840 node.dp1.di_ctime = utime;
842 * create the root directory
844 node.dp1.di_mode = IFDIR | UMASK;
845 node.dp1.di_nlink = entries;
846 node.dp1.di_size = makedir(root_dir, entries);
847 node.dp1.di_db[0] = alloc(sblock.fs_fsize, node.dp1.di_mode);
849 btodb(fragroundup(&sblock, node.dp1.di_size));
850 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]), sblock.fs_fsize,
852 iput(&node, ROOTINO);
855 * create the .snap directory
857 node.dp1.di_mode |= 020;
858 node.dp1.di_gid = gid;
859 node.dp1.di_nlink = SNAPLINKCNT;
860 node.dp1.di_size = makedir(snap_dir, SNAPLINKCNT);
862 alloc(sblock.fs_fsize, node.dp1.di_mode);
864 btodb(fragroundup(&sblock, node.dp1.di_size));
865 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]),
866 sblock.fs_fsize, iobuf);
867 iput(&node, ROOTINO + 1);
871 * initialize the node
873 node.dp2.di_atime = utime;
874 node.dp2.di_mtime = utime;
875 node.dp2.di_ctime = utime;
876 node.dp2.di_birthtime = utime;
878 * create the root directory
880 node.dp2.di_mode = IFDIR | UMASK;
881 node.dp2.di_nlink = entries;
882 node.dp2.di_size = makedir(root_dir, entries);
883 node.dp2.di_db[0] = alloc(sblock.fs_fsize, node.dp2.di_mode);
885 btodb(fragroundup(&sblock, node.dp2.di_size));
886 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]), sblock.fs_fsize,
888 iput(&node, ROOTINO);
891 * create the .snap directory
893 node.dp2.di_mode |= 020;
894 node.dp2.di_gid = gid;
895 node.dp2.di_nlink = SNAPLINKCNT;
896 node.dp2.di_size = makedir(snap_dir, SNAPLINKCNT);
898 alloc(sblock.fs_fsize, node.dp2.di_mode);
900 btodb(fragroundup(&sblock, node.dp2.di_size));
901 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]),
902 sblock.fs_fsize, iobuf);
903 iput(&node, ROOTINO + 1);
909 * construct a set of directory entries in "iobuf".
910 * return size of directory.
913 makedir(struct direct *protodir, int entries)
919 memset(iobuf, 0, DIRBLKSIZ);
920 for (cp = iobuf, i = 0; i < entries - 1; i++) {
921 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
922 memmove(cp, &protodir[i], protodir[i].d_reclen);
923 cp += protodir[i].d_reclen;
924 spcleft -= protodir[i].d_reclen;
926 protodir[i].d_reclen = spcleft;
927 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
932 * allocate a block or frag
935 alloc(int size, int mode)
940 bread(&disk, part_ofs + fsbtodb(&sblock, cgtod(&sblock, 0)), (char *)&acg,
942 if (acg.cg_magic != CG_MAGIC) {
943 printf("cg 0: bad magic number\n");
946 if (acg.cg_cs.cs_nbfree == 0) {
947 printf("first cylinder group ran out of space\n");
950 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
951 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
953 printf("internal error: can't find block in cyl 0\n");
956 blkno = fragstoblks(&sblock, d);
957 clrblock(&sblock, cg_blksfree(&acg), blkno);
958 if (sblock.fs_contigsumsize > 0)
959 clrbit(cg_clustersfree(&acg), blkno);
960 acg.cg_cs.cs_nbfree--;
961 sblock.fs_cstotal.cs_nbfree--;
965 sblock.fs_cstotal.cs_ndir++;
968 if (size != sblock.fs_bsize) {
969 frag = howmany(size, sblock.fs_fsize);
970 fscs[0].cs_nffree += sblock.fs_frag - frag;
971 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
972 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
973 acg.cg_frsum[sblock.fs_frag - frag]++;
974 for (i = frag; i < sblock.fs_frag; i++)
975 setbit(cg_blksfree(&acg), d + i);
977 /* XXX cgwrite(&disk, 0)??? */
978 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
980 return ((ufs2_daddr_t)d);
984 * Allocate an inode on the disk
987 iput(union dinode *ip, ino_t ino)
992 c = ino_to_cg(&sblock, ino);
993 bread(&disk, part_ofs + fsbtodb(&sblock, cgtod(&sblock, 0)), (char *)&acg,
995 if (acg.cg_magic != CG_MAGIC) {
996 printf("cg 0: bad magic number\n");
999 acg.cg_cs.cs_nifree--;
1000 setbit(cg_inosused(&acg), ino);
1001 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1003 sblock.fs_cstotal.cs_nifree--;
1004 fscs[0].cs_nifree--;
1005 if (ino >= (unsigned long)sblock.fs_ipg * sblock.fs_ncg) {
1006 printf("fsinit: inode value out of range (%d).\n", ino);
1009 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
1010 bread(&disk, part_ofs + d, (char *)iobuf, sblock.fs_bsize);
1011 if (sblock.fs_magic == FS_UFS1_MAGIC)
1012 ((struct ufs1_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] =
1015 ((struct ufs2_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] =
1017 wtfs(d, sblock.fs_bsize, (char *)iobuf);
1021 * possibly write to disk
1024 wtfs(ufs2_daddr_t bno, int size, char *bf)
1028 if (bwrite(&disk, part_ofs + bno, bf, size) < 0)
1029 err(36, "wtfs: %d bytes at sector %jd", size, (intmax_t)bno);
1033 * check if a block is available
1036 isblock(struct fs *fs, unsigned char *cp, int h)
1040 switch (fs->fs_frag) {
1042 return (cp[h] == 0xff);
1044 mask = 0x0f << ((h & 0x1) << 2);
1045 return ((cp[h >> 1] & mask) == mask);
1047 mask = 0x03 << ((h & 0x3) << 1);
1048 return ((cp[h >> 2] & mask) == mask);
1050 mask = 0x01 << (h & 0x7);
1051 return ((cp[h >> 3] & mask) == mask);
1053 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1059 * take a block out of the map
1062 clrblock(struct fs *fs, unsigned char *cp, int h)
1064 switch ((fs)->fs_frag) {
1069 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1072 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1075 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1078 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1084 * put a block into the map
1087 setblock(struct fs *fs, unsigned char *cp, int h)
1089 switch (fs->fs_frag) {
1094 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1097 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1100 cp[h >> 3] |= (0x01 << (h & 0x7));
1103 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1109 * Determine the number of characters in a
1121 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1122 columns = ws.ws_col;
1123 if (columns == 0 && (cp = getenv("COLUMNS")))
1126 columns = 80; /* last resort */
1135 for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
1138 errx(1, "ilog2: %d is not a power of 2\n", val);
1142 * For the regression test, return predictable random values.
1143 * Otherwise use a true random number generator.
1148 static int nextnum = 1;
1152 return (arc4random());