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 * Validate the given file system size.
156 * Verify that its last block can actually be accessed.
157 * Convert to file system fragment sized units.
160 printf("preposterous size %jd\n", (intmax_t)fssize);
163 wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize,
166 * collect and verify the file system density info
168 sblock.fs_avgfilesize = avgfilesize;
169 sblock.fs_avgfpdir = avgfilesperdir;
170 if (sblock.fs_avgfilesize <= 0)
171 printf("illegal expected average file size %d\n",
172 sblock.fs_avgfilesize), exit(14);
173 if (sblock.fs_avgfpdir <= 0)
174 printf("illegal expected number of files per directory %d\n",
175 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("increasing fragment size from %d to sector size (%jd)\n",
195 sblock.fs_fsize, (intmax_t)sectorsize);
196 sblock.fs_fsize = sectorsize;
198 if (sblock.fs_bsize > MAXBSIZE) {
199 printf("decreasing block size from %d to maximum (%d)\n",
200 sblock.fs_bsize, MAXBSIZE);
201 sblock.fs_bsize = MAXBSIZE;
203 if (sblock.fs_bsize < MINBSIZE) {
204 printf("increasing block size from %d to minimum (%d)\n",
205 sblock.fs_bsize, MINBSIZE);
206 sblock.fs_bsize = MINBSIZE;
208 if (sblock.fs_fsize > MAXBSIZE) {
209 printf("decreasing fragment size from %d to maximum (%d)\n",
210 sblock.fs_fsize, MAXBSIZE);
211 sblock.fs_fsize = MAXBSIZE;
213 if (sblock.fs_bsize < sblock.fs_fsize) {
214 printf("increasing block size from %d to fragment size (%d)\n",
215 sblock.fs_bsize, sblock.fs_fsize);
216 sblock.fs_bsize = sblock.fs_fsize;
218 if (sblock.fs_fsize * MAXFRAG < sblock.fs_bsize) {
220 "increasing fragment size from %d to block size / %d (%d)\n",
221 sblock.fs_fsize, MAXFRAG, sblock.fs_bsize / MAXFRAG);
222 sblock.fs_fsize = sblock.fs_bsize / MAXFRAG;
226 if (maxbsize < bsize || !POWEROF2(maxbsize)) {
227 sblock.fs_maxbsize = sblock.fs_bsize;
228 printf("Extent size set to %d\n", sblock.fs_maxbsize);
229 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) {
230 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize;
231 printf("Extent size reduced to %d\n", sblock.fs_maxbsize);
233 sblock.fs_maxbsize = maxbsize;
236 * Maxcontig sets the default for the maximum number of blocks
237 * that may be allocated sequentially. With file system clustering
238 * it is possible to allocate contiguous blocks up to the maximum
239 * transfer size permitted by the controller or buffering.
242 maxcontig = MAX(1, MAXPHYS / bsize);
243 sblock.fs_maxcontig = maxcontig;
244 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) {
245 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize;
246 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize);
248 if (sblock.fs_maxcontig > 1)
249 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG);
250 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
251 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
252 sblock.fs_qbmask = ~sblock.fs_bmask;
253 sblock.fs_qfmask = ~sblock.fs_fmask;
254 sblock.fs_bshift = ilog2(sblock.fs_bsize);
255 sblock.fs_fshift = ilog2(sblock.fs_fsize);
256 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
257 sblock.fs_fragshift = ilog2(sblock.fs_frag);
258 if (sblock.fs_frag > MAXFRAG) {
259 printf("fragment size %d is still too small (can't happen)\n",
260 sblock.fs_bsize / MAXFRAG);
263 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize);
264 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
267 * Before the filesystem is finally initialized, mark it
268 * as incompletely initialized.
270 sblock.fs_magic = FS_BAD_MAGIC;
273 sblock.fs_sblockloc = SBLOCK_UFS1;
274 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t);
275 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode);
276 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
277 sizeof(ufs1_daddr_t));
278 sblock.fs_old_inodefmt = FS_44INODEFMT;
279 sblock.fs_old_cgoffset = 0;
280 sblock.fs_old_cgmask = 0xffffffff;
281 sblock.fs_old_size = sblock.fs_size;
282 sblock.fs_old_rotdelay = 0;
283 sblock.fs_old_rps = 60;
284 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize;
285 sblock.fs_old_cpg = 1;
286 sblock.fs_old_interleave = 1;
287 sblock.fs_old_trackskew = 0;
288 sblock.fs_old_cpc = 0;
289 sblock.fs_old_postblformat = 1;
290 sblock.fs_old_nrpos = 1;
292 sblock.fs_sblockloc = SBLOCK_UFS2;
293 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t);
294 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode);
295 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) *
296 sizeof(ufs2_daddr_t));
299 roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize),
301 sblock.fs_cblkno = sblock.fs_sblkno +
302 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag);
303 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
304 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
305 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
306 sizepb *= NINDIR(&sblock);
307 sblock.fs_maxfilesize += sizepb;
311 * It's impossible to create a snapshot in case that fs_maxfilesize
312 * is smaller than the fssize.
314 if (sblock.fs_maxfilesize < (u_quad_t)fssize) {
315 warnx("WARNING: You will be unable to create snapshots on this "
316 "file system. Correct by using a larger blocksize.");
320 * Calculate the number of blocks to put into each cylinder group.
322 * This algorithm selects the number of blocks per cylinder
323 * group. The first goal is to have at least enough data blocks
324 * in each cylinder group to meet the density requirement. Once
325 * this goal is achieved we try to expand to have at least
326 * MINCYLGRPS cylinder groups. Once this goal is achieved, we
327 * pack as many blocks into each cylinder group map as will fit.
329 * We start by calculating the smallest number of blocks that we
330 * can put into each cylinder group. If this is too big, we reduce
331 * the density until it fits.
333 maxinum = (((int64_t)(1)) << 32) - INOPB(&sblock);
334 minfragsperinode = 1 + fssize / maxinum;
336 density = MAX(NFPI, minfragsperinode) * fsize;
337 } else if (density < minfragsperinode * fsize) {
338 origdensity = density;
339 density = minfragsperinode * fsize;
340 fprintf(stderr, "density increased from %d to %jd\n",
341 origdensity, (intmax_t)density);
343 origdensity = density;
345 fragsperinode = MAX(numfrags(&sblock, density), 1);
346 if (fragsperinode < minfragsperinode) {
349 printf("Block size too small for a file system %s %jd\n",
350 "of this size. Increasing blocksize to",
354 minfpg = fragsperinode * INOPB(&sblock);
355 if (minfpg > sblock.fs_size)
356 minfpg = sblock.fs_size;
357 sblock.fs_ipg = INOPB(&sblock);
358 sblock.fs_fpg = roundup(sblock.fs_iblkno +
359 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
360 if (sblock.fs_fpg < minfpg)
361 sblock.fs_fpg = minfpg;
362 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
364 sblock.fs_fpg = roundup(sblock.fs_iblkno +
365 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
366 if (sblock.fs_fpg < minfpg)
367 sblock.fs_fpg = minfpg;
368 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
370 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
372 density -= sblock.fs_fsize;
374 if (density != origdensity)
375 printf("density reduced from %d to %jd\n", origdensity,
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.
382 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) {
383 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
385 if (sblock.fs_size / sblock.fs_fpg < MINCYLGRPS)
387 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
389 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize)
391 sblock.fs_fpg -= sblock.fs_frag;
392 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
397 * Check to be sure that the last cylinder group has enough blocks
398 * to be viable. If it is too small, reduce the number of blocks
399 * per cylinder group which will have the effect of moving more
400 * blocks into the last cylinder group.
402 optimalfpg = sblock.fs_fpg;
404 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
405 lastminfpg = roundup(sblock.fs_iblkno +
406 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
407 if (sblock.fs_size < lastminfpg) {
408 printf("Filesystem size %jd < minimum size of %d\n",
409 (intmax_t)sblock.fs_size, lastminfpg);
412 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg ||
413 sblock.fs_size % sblock.fs_fpg == 0)
415 sblock.fs_fpg -= sblock.fs_frag;
416 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
419 if (optimalfpg != sblock.fs_fpg)
420 printf("Reduced frags per cylinder group from %d to %d %s\n",
421 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group");
422 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
423 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
425 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf;
426 sblock.fs_old_nsect = sblock.fs_old_spc;
427 sblock.fs_old_npsect = sblock.fs_old_spc;
428 sblock.fs_old_ncyl = sblock.fs_ncg;
431 * fill in remaining fields of the super block
433 sblock.fs_csaddr = cgdmin(&sblock, 0);
435 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
436 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
438 errx(31, "calloc failed");
439 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
440 if (sblock.fs_sbsize > SBLOCKSIZE)
441 sblock.fs_sbsize = SBLOCKSIZE;
442 sblock.fs_minfree = minfree;
444 sblock.fs_maxbpg = MAXBLKPG(sblock.fs_bsize);
446 sblock.fs_maxbpg = maxbpg;
447 sblock.fs_optim = opt;
448 sblock.fs_cgrotor = 0;
449 sblock.fs_pendingblocks = 0;
450 sblock.fs_pendinginodes = 0;
455 sblock.fs_id[0] = (long)utime;
456 sblock.fs_id[1] = newfs_random();
457 sblock.fs_fsmnt[0] = '\0';
458 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize);
459 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno -
460 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno);
461 sblock.fs_cstotal.cs_nbfree =
462 fragstoblks(&sblock, sblock.fs_dsize) -
463 howmany(csfrags, sblock.fs_frag);
464 sblock.fs_cstotal.cs_nffree =
465 fragnum(&sblock, sblock.fs_size) +
466 (fragnum(&sblock, csfrags) > 0 ?
467 sblock.fs_frag - fragnum(&sblock, csfrags) : 0);
468 sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO;
469 sblock.fs_cstotal.cs_ndir = 0;
470 sblock.fs_dsize -= csfrags;
471 sblock.fs_time = utime;
473 sblock.fs_old_time = utime;
474 sblock.fs_old_dsize = sblock.fs_dsize;
475 sblock.fs_old_csaddr = sblock.fs_csaddr;
476 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
477 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
478 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
479 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
483 * Dump out summary information about file system.
485 # define B2MBFACTOR (1 / (1024.0 * 1024.0))
486 printf("%s: %.1fMB (%jd sectors) block size %d, fragment size %d\n",
487 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
488 (intmax_t)fsbtodb(&sblock, sblock.fs_size), sblock.fs_bsize,
490 printf("\tusing %d cylinder groups of %.2fMB, %d blks, %d inodes.\n",
491 sblock.fs_ncg, (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
492 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
493 if (sblock.fs_flags & FS_DOSOFTDEP)
494 printf("\twith soft updates\n");
497 if (Eflag && !Nflag) {
498 printf("Erasing sectors [%jd...%jd]\n",
499 sblock.fs_sblockloc / disk.d_bsize,
500 fsbtodb(&sblock, sblock.fs_size) - 1);
501 berase(&disk, sblock.fs_sblockloc / disk.d_bsize,
502 sblock.fs_size * sblock.fs_fsize - sblock.fs_sblockloc);
505 * Wipe out old UFS1 superblock(s) if necessary.
507 if (!Nflag && Oflag != 1) {
508 i = bread(&disk, part_ofs + SBLOCK_UFS1 / disk.d_bsize, chdummy, SBLOCKSIZE);
510 err(1, "can't read old UFS1 superblock: %s", disk.d_error);
512 if (fsdummy.fs_magic == FS_UFS1_MAGIC) {
513 fsdummy.fs_magic = 0;
514 bwrite(&disk, part_ofs + SBLOCK_UFS1 / disk.d_bsize,
515 chdummy, SBLOCKSIZE);
516 for (cg = 0; cg < fsdummy.fs_ncg; cg++)
517 bwrite(&disk, part_ofs + fsbtodb(&fsdummy,
518 cgsblock(&fsdummy, cg)), chdummy, SBLOCKSIZE);
524 printf("** Exiting on Xflag 1\n");
528 printf("** Leaving BAD MAGIC on Xflag 2\n");
530 sblock.fs_magic = (Oflag != 1) ? FS_UFS2_MAGIC : FS_UFS1_MAGIC;
533 * Now build the cylinders group blocks and
534 * then print out indices of cylinder groups.
536 printf("super-block backups (for fsck -b #) at:\n");
538 width = charsperline();
540 * allocate space for superblock, cylinder group map, and
541 * two sets of inode blocks.
543 if (sblock.fs_bsize < SBLOCKSIZE)
544 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize;
546 iobufsize = 4 * sblock.fs_bsize;
547 if ((iobuf = calloc(1, iobufsize)) == 0) {
548 printf("Cannot allocate I/O buffer\n");
552 * Make a copy of the superblock into the buffer that we will be
553 * writing out in each cylinder group.
555 bcopy((char *)&sblock, iobuf, SBLOCKSIZE);
556 for (cg = 0; cg < sblock.fs_ncg; cg++) {
558 j = snprintf(tmpbuf, sizeof(tmpbuf), " %jd%s",
559 (intmax_t)fsbtodb(&sblock, cgsblock(&sblock, cg)),
560 cg < (sblock.fs_ncg-1) ? "," : "");
562 tmpbuf[j = 0] = '\0';
563 if (i + j >= width) {
568 printf("%s", tmpbuf);
575 * Now construct the initial file system,
576 * then write out the super-block.
580 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
581 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
582 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
583 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
586 printf("** Exiting on Xflag 3\n");
591 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
592 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
593 sblock.fs_cssize - i < sblock.fs_bsize ?
594 sblock.fs_cssize - i : sblock.fs_bsize,
597 * Update information about this partition in pack
598 * label, to that it may be updated on disk.
601 pp->p_fstype = FS_BSDFFS;
602 pp->p_fsize = sblock.fs_fsize;
603 pp->p_frag = sblock.fs_frag;
604 pp->p_cpg = sblock.fs_fpg;
609 * Initialize a cylinder group.
612 initcg(int cylno, time_t utime)
615 uint i, j, d, dlower, dupper;
616 ufs2_daddr_t cbase, dmax;
617 struct ufs1_dinode *dp1;
618 struct ufs2_dinode *dp2;
622 * Determine block bounds for cylinder group.
623 * Allow space for super block summary information in first
626 cbase = cgbase(&sblock, cylno);
627 dmax = cbase + sblock.fs_fpg;
628 if (dmax > sblock.fs_size)
629 dmax = sblock.fs_size;
630 dlower = cgsblock(&sblock, cylno) - cbase;
631 dupper = cgdmin(&sblock, cylno) - cbase;
633 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
635 memset(&acg, 0, sblock.fs_cgsize);
637 acg.cg_magic = CG_MAGIC;
639 acg.cg_niblk = sblock.fs_ipg;
640 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
641 sblock.fs_ipg : 2 * INOPB(&sblock);
642 acg.cg_ndblk = dmax - cbase;
643 if (sblock.fs_contigsumsize > 0)
644 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
645 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
647 acg.cg_iusedoff = start;
649 acg.cg_old_ncyl = sblock.fs_old_cpg;
650 acg.cg_old_time = acg.cg_time;
652 acg.cg_old_niblk = acg.cg_niblk;
654 acg.cg_initediblk = 0;
655 acg.cg_old_btotoff = start;
656 acg.cg_old_boff = acg.cg_old_btotoff +
657 sblock.fs_old_cpg * sizeof(int32_t);
658 acg.cg_iusedoff = acg.cg_old_boff +
659 sblock.fs_old_cpg * sizeof(u_int16_t);
661 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
662 acg.cg_nextfreeoff = acg.cg_freeoff + howmany(sblock.fs_fpg, CHAR_BIT);
663 if (sblock.fs_contigsumsize > 0) {
664 acg.cg_clustersumoff =
665 roundup(acg.cg_nextfreeoff, sizeof(u_int32_t));
666 acg.cg_clustersumoff -= sizeof(u_int32_t);
667 acg.cg_clusteroff = acg.cg_clustersumoff +
668 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
669 acg.cg_nextfreeoff = acg.cg_clusteroff +
670 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
672 if (acg.cg_nextfreeoff > (unsigned)sblock.fs_cgsize) {
673 printf("Panic: cylinder group too big\n");
676 acg.cg_cs.cs_nifree += sblock.fs_ipg;
678 for (i = 0; i < (long)ROOTINO; i++) {
679 setbit(cg_inosused(&acg), i);
680 acg.cg_cs.cs_nifree--;
684 * In cylno 0, beginning space is reserved
685 * for boot and super blocks.
687 for (d = 0; d < dlower; d += sblock.fs_frag) {
688 blkno = d / sblock.fs_frag;
689 setblock(&sblock, cg_blksfree(&acg), blkno);
690 if (sblock.fs_contigsumsize > 0)
691 setbit(cg_clustersfree(&acg), blkno);
692 acg.cg_cs.cs_nbfree++;
695 if ((i = dupper % sblock.fs_frag)) {
696 acg.cg_frsum[sblock.fs_frag - i]++;
697 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
698 setbit(cg_blksfree(&acg), dupper);
699 acg.cg_cs.cs_nffree++;
702 for (d = dupper; d + sblock.fs_frag <= acg.cg_ndblk;
703 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++;
710 if (d < acg.cg_ndblk) {
711 acg.cg_frsum[acg.cg_ndblk - d]++;
712 for (; d < acg.cg_ndblk; d++) {
713 setbit(cg_blksfree(&acg), d);
714 acg.cg_cs.cs_nffree++;
717 if (sblock.fs_contigsumsize > 0) {
718 int32_t *sump = cg_clustersum(&acg);
719 u_char *mapp = cg_clustersfree(&acg);
724 for (i = 0; i < acg.cg_nclusterblks; i++) {
725 if ((map & bit) != 0)
728 if (run > sblock.fs_contigsumsize)
729 run = sblock.fs_contigsumsize;
733 if ((i & (CHAR_BIT - 1)) != CHAR_BIT - 1)
741 if (run > sblock.fs_contigsumsize)
742 run = sblock.fs_contigsumsize;
748 * Write out the duplicate super block, the cylinder group map
749 * and two blocks worth of inodes in a single write.
751 start = sblock.fs_bsize > SBLOCKSIZE ? sblock.fs_bsize : SBLOCKSIZE;
752 bcopy((char *)&acg, &iobuf[start], sblock.fs_cgsize);
753 start += sblock.fs_bsize;
754 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
755 dp2 = (struct ufs2_dinode *)(&iobuf[start]);
756 for (i = 0; i < acg.cg_initediblk; i++) {
757 if (sblock.fs_magic == FS_UFS1_MAGIC) {
758 dp1->di_gen = newfs_random();
761 dp2->di_gen = newfs_random();
765 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf);
767 * For the old file system, we have to initialize all the inodes.
770 for (i = 2 * sblock.fs_frag;
771 i < sblock.fs_ipg / INOPF(&sblock);
772 i += sblock.fs_frag) {
773 dp1 = (struct ufs1_dinode *)(&iobuf[start]);
774 for (j = 0; j < INOPB(&sblock); j++) {
775 dp1->di_gen = newfs_random();
778 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
779 sblock.fs_bsize, &iobuf[start]);
785 * initialize the file system
787 #define ROOTLINKCNT 3
789 struct direct root_dir[] = {
790 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
791 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
792 { ROOTINO + 1, sizeof(struct direct), DT_DIR, 5, ".snap" },
795 #define SNAPLINKCNT 2
797 struct direct snap_dir[] = {
798 { ROOTINO + 1, sizeof(struct direct), DT_DIR, 1, "." },
799 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
810 memset(&node, 0, sizeof node);
811 if ((grp = getgrnam("operator")) != NULL) {
814 warnx("Cannot retrieve operator gid, using gid 0.");
817 entries = (nflag) ? ROOTLINKCNT - 1: ROOTLINKCNT;
818 if (sblock.fs_magic == FS_UFS1_MAGIC) {
820 * initialize the node
822 node.dp1.di_atime = utime;
823 node.dp1.di_mtime = utime;
824 node.dp1.di_ctime = utime;
826 * create the root directory
828 node.dp1.di_mode = IFDIR | UMASK;
829 node.dp1.di_nlink = entries;
830 node.dp1.di_size = makedir(root_dir, entries);
831 node.dp1.di_db[0] = alloc(sblock.fs_fsize, node.dp1.di_mode);
833 btodb(fragroundup(&sblock, node.dp1.di_size));
834 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]), sblock.fs_fsize,
836 iput(&node, ROOTINO);
839 * create the .snap directory
841 node.dp1.di_mode |= 020;
842 node.dp1.di_gid = gid;
843 node.dp1.di_nlink = SNAPLINKCNT;
844 node.dp1.di_size = makedir(snap_dir, SNAPLINKCNT);
846 alloc(sblock.fs_fsize, node.dp1.di_mode);
848 btodb(fragroundup(&sblock, node.dp1.di_size));
849 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]),
850 sblock.fs_fsize, iobuf);
851 iput(&node, ROOTINO + 1);
855 * initialize the node
857 node.dp2.di_atime = utime;
858 node.dp2.di_mtime = utime;
859 node.dp2.di_ctime = utime;
860 node.dp2.di_birthtime = utime;
862 * create the root directory
864 node.dp2.di_mode = IFDIR | UMASK;
865 node.dp2.di_nlink = entries;
866 node.dp2.di_size = makedir(root_dir, entries);
867 node.dp2.di_db[0] = alloc(sblock.fs_fsize, node.dp2.di_mode);
869 btodb(fragroundup(&sblock, node.dp2.di_size));
870 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]), sblock.fs_fsize,
872 iput(&node, ROOTINO);
875 * create the .snap directory
877 node.dp2.di_mode |= 020;
878 node.dp2.di_gid = gid;
879 node.dp2.di_nlink = SNAPLINKCNT;
880 node.dp2.di_size = makedir(snap_dir, SNAPLINKCNT);
882 alloc(sblock.fs_fsize, node.dp2.di_mode);
884 btodb(fragroundup(&sblock, node.dp2.di_size));
885 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]),
886 sblock.fs_fsize, iobuf);
887 iput(&node, ROOTINO + 1);
893 * construct a set of directory entries in "iobuf".
894 * return size of directory.
897 makedir(struct direct *protodir, int entries)
903 memset(iobuf, 0, DIRBLKSIZ);
904 for (cp = iobuf, i = 0; i < entries - 1; i++) {
905 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
906 memmove(cp, &protodir[i], protodir[i].d_reclen);
907 cp += protodir[i].d_reclen;
908 spcleft -= protodir[i].d_reclen;
910 protodir[i].d_reclen = spcleft;
911 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
916 * allocate a block or frag
919 alloc(int size, int mode)
924 bread(&disk, part_ofs + fsbtodb(&sblock, cgtod(&sblock, 0)), (char *)&acg,
926 if (acg.cg_magic != CG_MAGIC) {
927 printf("cg 0: bad magic number\n");
930 if (acg.cg_cs.cs_nbfree == 0) {
931 printf("first cylinder group ran out of space\n");
934 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
935 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
937 printf("internal error: can't find block in cyl 0\n");
940 blkno = fragstoblks(&sblock, d);
941 clrblock(&sblock, cg_blksfree(&acg), blkno);
942 if (sblock.fs_contigsumsize > 0)
943 clrbit(cg_clustersfree(&acg), blkno);
944 acg.cg_cs.cs_nbfree--;
945 sblock.fs_cstotal.cs_nbfree--;
949 sblock.fs_cstotal.cs_ndir++;
952 if (size != sblock.fs_bsize) {
953 frag = howmany(size, sblock.fs_fsize);
954 fscs[0].cs_nffree += sblock.fs_frag - frag;
955 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
956 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
957 acg.cg_frsum[sblock.fs_frag - frag]++;
958 for (i = frag; i < sblock.fs_frag; i++)
959 setbit(cg_blksfree(&acg), d + i);
961 /* XXX cgwrite(&disk, 0)??? */
962 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
964 return ((ufs2_daddr_t)d);
968 * Allocate an inode on the disk
971 iput(union dinode *ip, ino_t ino)
976 c = ino_to_cg(&sblock, ino);
977 bread(&disk, part_ofs + fsbtodb(&sblock, cgtod(&sblock, 0)), (char *)&acg,
979 if (acg.cg_magic != CG_MAGIC) {
980 printf("cg 0: bad magic number\n");
983 acg.cg_cs.cs_nifree--;
984 setbit(cg_inosused(&acg), ino);
985 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
987 sblock.fs_cstotal.cs_nifree--;
989 if (ino >= (unsigned long)sblock.fs_ipg * sblock.fs_ncg) {
990 printf("fsinit: inode value out of range (%d).\n", ino);
993 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
994 bread(&disk, part_ofs + d, (char *)iobuf, sblock.fs_bsize);
995 if (sblock.fs_magic == FS_UFS1_MAGIC)
996 ((struct ufs1_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] =
999 ((struct ufs2_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] =
1001 wtfs(d, sblock.fs_bsize, (char *)iobuf);
1005 * possibly write to disk
1008 wtfs(ufs2_daddr_t bno, int size, char *bf)
1012 if (bwrite(&disk, part_ofs + bno, bf, size) < 0)
1013 err(36, "wtfs: %d bytes at sector %jd", size, (intmax_t)bno);
1017 * check if a block is available
1020 isblock(struct fs *fs, unsigned char *cp, int h)
1024 switch (fs->fs_frag) {
1026 return (cp[h] == 0xff);
1028 mask = 0x0f << ((h & 0x1) << 2);
1029 return ((cp[h >> 1] & mask) == mask);
1031 mask = 0x03 << ((h & 0x3) << 1);
1032 return ((cp[h >> 2] & mask) == mask);
1034 mask = 0x01 << (h & 0x7);
1035 return ((cp[h >> 3] & mask) == mask);
1037 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1043 * take a block out of the map
1046 clrblock(struct fs *fs, unsigned char *cp, int h)
1048 switch ((fs)->fs_frag) {
1053 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1056 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1059 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1062 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1068 * put a block into the map
1071 setblock(struct fs *fs, unsigned char *cp, int h)
1073 switch (fs->fs_frag) {
1078 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1081 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1084 cp[h >> 3] |= (0x01 << (h & 0x7));
1087 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1093 * Determine the number of characters in a
1105 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1106 columns = ws.ws_col;
1107 if (columns == 0 && (cp = getenv("COLUMNS")))
1110 columns = 80; /* last resort */
1119 for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
1122 errx(1, "ilog2: %d is not a power of 2\n", val);
1126 * For the regression test, return predictable random values.
1127 * Otherwise use a true random number generator.
1132 static int nextnum = 1;
1136 return (arc4random());