]> CyberLeo.Net >> Repos - FreeBSD/FreeBSD.git/blob - usr.sbin/makefs/ffs/mkfs.c
Allocate an fs_summary_info structure when creating a UFS filesystem
[FreeBSD/FreeBSD.git] / usr.sbin / makefs / ffs / mkfs.c
1 /*      $NetBSD: mkfs.c,v 1.22 2011/10/09 22:30:13 christos Exp $       */
2
3 /*-
4  * SPDX-License-Identifier: BSD-3-Clause
5  *
6  * Copyright (c) 2002 Networks Associates Technology, Inc.
7  * All rights reserved.
8  *
9  * This software was developed for the FreeBSD Project by Marshall
10  * Kirk McKusick and Network Associates Laboratories, the Security
11  * Research Division of Network Associates, Inc. under DARPA/SPAWAR
12  * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
13  * research program
14  *
15  * Copyright (c) 1980, 1989, 1993
16  *      The Regents of the University of California.  All rights reserved.
17  *
18  * Redistribution and use in source and binary forms, with or without
19  * modification, are permitted provided that the following conditions
20  * are met:
21  * 1. Redistributions of source code must retain the above copyright
22  *    notice, this list of conditions and the following disclaimer.
23  * 2. Redistributions in binary form must reproduce the above copyright
24  *    notice, this list of conditions and the following disclaimer in the
25  *    documentation and/or other materials provided with the distribution.
26  * 3. Neither the name of the University nor the names of its contributors
27  *    may be used to endorse or promote products derived from this software
28  *    without specific prior written permission.
29  *
30  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
31  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
34  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40  * SUCH DAMAGE.
41  */
42
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
45
46 #include <sys/param.h>
47 #include <sys/time.h>
48 #include <sys/resource.h>
49
50 #include <stdio.h>
51 #include <stdlib.h>
52 #include <string.h>
53 #include <unistd.h>
54 #include <errno.h>
55 #include <util.h>
56
57 #include "makefs.h"
58 #include "ffs.h"
59
60 #include <ufs/ufs/dinode.h>
61 #include <ufs/ffs/fs.h>
62
63 #include "ffs/ufs_bswap.h"
64 #include "ffs/ufs_inode.h"
65 #include "ffs/ffs_extern.h"
66 #include "ffs/newfs_extern.h"
67
68 #ifndef BBSIZE
69 #define BBSIZE  8192                    /* size of boot area, with label */
70 #endif
71
72 static void initcg(uint32_t, time_t, const fsinfo_t *);
73 static int ilog2(int);
74
75 static int count_digits(int);
76
77 /*
78  * make file system for cylinder-group style file systems
79  */
80 #define UMASK           0755
81 #define POWEROF2(num)   (((num) & ((num) - 1)) == 0)
82
83 static union {
84         struct fs fs;
85         char pad[SBLOCKSIZE];
86 } fsun;
87 #define sblock  fsun.fs
88
89 static union {
90         struct cg cg;
91         char pad[FFS_MAXBSIZE];
92 } cgun;
93 #define acg     cgun.cg
94
95 static char *iobuf;
96 static int iobufsize;
97
98 static char writebuf[FFS_MAXBSIZE];
99
100 static int     Oflag;      /* format as an 4.3BSD file system */
101 static int64_t fssize;     /* file system size */
102 static int     sectorsize;         /* bytes/sector */
103 static int     fsize;      /* fragment size */
104 static int     bsize;      /* block size */
105 static int     maxbsize;   /* maximum clustering */
106 static int     maxblkspercg;
107 static int     minfree;    /* free space threshold */
108 static int     opt;                /* optimization preference (space or time) */
109 static int     density;    /* number of bytes per inode */
110 static int     maxcontig;          /* max contiguous blocks to allocate */
111 static int     maxbpg;     /* maximum blocks per file in a cyl group */
112 static int     bbsize;     /* boot block size */
113 static int     sbsize;     /* superblock size */
114 static int     avgfilesize;        /* expected average file size */
115 static int     avgfpdir;           /* expected number of files per directory */
116
117 struct fs *
118 ffs_mkfs(const char *fsys, const fsinfo_t *fsopts, time_t tstamp)
119 {
120         int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg;
121         int32_t csfrags;
122         uint32_t i, cylno;
123         long long sizepb;
124         void *space;
125         int size;
126         int nprintcols, printcolwidth;
127         ffs_opt_t       *ffs_opts = fsopts->fs_specific;
128
129         Oflag =         ffs_opts->version;
130         fssize =        fsopts->size / fsopts->sectorsize;
131         sectorsize =    fsopts->sectorsize;
132         fsize =         ffs_opts->fsize;
133         bsize =         ffs_opts->bsize;
134         maxbsize =      ffs_opts->maxbsize;
135         maxblkspercg =  ffs_opts->maxblkspercg;
136         minfree =       ffs_opts->minfree;
137         opt =           ffs_opts->optimization;
138         density =       ffs_opts->density;
139         maxcontig =     ffs_opts->maxcontig;
140         maxbpg =        ffs_opts->maxbpg;
141         avgfilesize =   ffs_opts->avgfilesize;
142         avgfpdir =      ffs_opts->avgfpdir;
143         bbsize =        BBSIZE;
144         sbsize =        SBLOCKSIZE;
145
146         strlcpy(sblock.fs_volname, ffs_opts->label, sizeof(sblock.fs_volname));
147
148         if (Oflag == 0) {
149                 sblock.fs_old_inodefmt = FS_42INODEFMT;
150                 sblock.fs_maxsymlinklen = 0;
151                 sblock.fs_old_flags = 0;
152         } else {
153                 sblock.fs_old_inodefmt = FS_44INODEFMT;
154                 sblock.fs_maxsymlinklen = (Oflag == 1 ? UFS1_MAXSYMLINKLEN :
155                     UFS2_MAXSYMLINKLEN);
156                 sblock.fs_old_flags = FS_FLAGS_UPDATED;
157                 sblock.fs_flags = 0;
158         }
159         /*
160          * Validate the given file system size.
161          * Verify that its last block can actually be accessed.
162          * Convert to file system fragment sized units.
163          */
164         if (fssize <= 0) {
165                 printf("preposterous size %lld\n", (long long)fssize);
166                 exit(13);
167         }
168         ffs_wtfs(fssize - 1, sectorsize, (char *)&sblock, fsopts);
169
170         /*
171          * collect and verify the filesystem density info
172          */
173         sblock.fs_avgfilesize = avgfilesize;
174         sblock.fs_avgfpdir = avgfpdir;
175         if (sblock.fs_avgfilesize <= 0)
176                 printf("illegal expected average file size %d\n",
177                     sblock.fs_avgfilesize), exit(14);
178         if (sblock.fs_avgfpdir <= 0)
179                 printf("illegal expected number of files per directory %d\n",
180                     sblock.fs_avgfpdir), exit(15);
181         /*
182          * collect and verify the block and fragment sizes
183          */
184         sblock.fs_bsize = bsize;
185         sblock.fs_fsize = fsize;
186         if (!POWEROF2(sblock.fs_bsize)) {
187                 printf("block size must be a power of 2, not %d\n",
188                     sblock.fs_bsize);
189                 exit(16);
190         }
191         if (!POWEROF2(sblock.fs_fsize)) {
192                 printf("fragment size must be a power of 2, not %d\n",
193                     sblock.fs_fsize);
194                 exit(17);
195         }
196         if (sblock.fs_fsize < sectorsize) {
197                 printf("fragment size %d is too small, minimum is %d\n",
198                     sblock.fs_fsize, sectorsize);
199                 exit(18);
200         }
201         if (sblock.fs_bsize < MINBSIZE) {
202                 printf("block size %d is too small, minimum is %d\n",
203                     sblock.fs_bsize, MINBSIZE);
204                 exit(19);
205         }
206         if (sblock.fs_bsize > FFS_MAXBSIZE) {
207                 printf("block size %d is too large, maximum is %d\n",
208                     sblock.fs_bsize, FFS_MAXBSIZE);
209                 exit(19);
210         }
211         if (sblock.fs_bsize < sblock.fs_fsize) {
212                 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
213                     sblock.fs_bsize, sblock.fs_fsize);
214                 exit(20);
215         }
216
217         if (maxbsize < bsize || !POWEROF2(maxbsize)) {
218                 sblock.fs_maxbsize = sblock.fs_bsize;
219                 printf("Extent size set to %d\n", sblock.fs_maxbsize);
220         } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) {
221                 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize;
222                 printf("Extent size reduced to %d\n", sblock.fs_maxbsize);
223         } else {
224                 sblock.fs_maxbsize = maxbsize;
225         }
226         sblock.fs_maxcontig = maxcontig;
227         if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) {
228                 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize;
229                 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize);
230         }
231
232         if (sblock.fs_maxcontig > 1)
233                 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG);
234
235         sblock.fs_bmask = ~(sblock.fs_bsize - 1);
236         sblock.fs_fmask = ~(sblock.fs_fsize - 1);
237         sblock.fs_qbmask = ~sblock.fs_bmask;
238         sblock.fs_qfmask = ~sblock.fs_fmask;
239         for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
240                 sblock.fs_bshift++;
241         for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
242                 sblock.fs_fshift++;
243         sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
244         for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
245                 sblock.fs_fragshift++;
246         if (sblock.fs_frag > MAXFRAG) {
247                 printf("fragment size %d is too small, "
248                         "minimum with block size %d is %d\n",
249                     sblock.fs_fsize, sblock.fs_bsize,
250                     sblock.fs_bsize / MAXFRAG);
251                 exit(21);
252         }
253         sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize);
254         sblock.fs_size = sblock.fs_providersize = fssize =
255             dbtofsb(&sblock, fssize);
256
257         if (Oflag <= 1) {
258                 sblock.fs_magic = FS_UFS1_MAGIC;
259                 sblock.fs_sblockloc = SBLOCK_UFS1;
260                 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t);
261                 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode);
262                 sblock.fs_maxsymlinklen = ((UFS_NDADDR + UFS_NIADDR) *
263                     sizeof (ufs1_daddr_t));
264                 sblock.fs_old_inodefmt = FS_44INODEFMT;
265                 sblock.fs_old_cgoffset = 0;
266                 sblock.fs_old_cgmask = 0xffffffff;
267                 sblock.fs_old_size = sblock.fs_size;
268                 sblock.fs_old_rotdelay = 0;
269                 sblock.fs_old_rps = 60;
270                 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize;
271                 sblock.fs_old_cpg = 1;
272                 sblock.fs_old_interleave = 1;
273                 sblock.fs_old_trackskew = 0;
274                 sblock.fs_old_cpc = 0;
275                 sblock.fs_old_postblformat = 1;
276                 sblock.fs_old_nrpos = 1;
277         } else {
278                 sblock.fs_magic = FS_UFS2_MAGIC;
279                 sblock.fs_sblockloc = SBLOCK_UFS2;
280                 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t);
281                 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode);
282                 sblock.fs_maxsymlinklen = ((UFS_NDADDR + UFS_NIADDR) *
283                     sizeof (ufs2_daddr_t));
284                 if (ffs_opts->softupdates == 1)
285                         sblock.fs_flags |= FS_DOSOFTDEP;
286         }
287
288         sblock.fs_sblkno =
289             roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize),
290                 sblock.fs_frag);
291         sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
292             roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag));
293         sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
294         sblock.fs_maxfilesize = sblock.fs_bsize * UFS_NDADDR - 1;
295         for (sizepb = sblock.fs_bsize, i = 0; i < UFS_NIADDR; i++) {
296                 sizepb *= NINDIR(&sblock);
297                 sblock.fs_maxfilesize += sizepb;
298         }
299
300         /*
301          * Calculate the number of blocks to put into each cylinder group.
302          *
303          * This algorithm selects the number of blocks per cylinder
304          * group. The first goal is to have at least enough data blocks
305          * in each cylinder group to meet the density requirement. Once
306          * this goal is achieved we try to expand to have at least
307          * 1 cylinder group. Once this goal is achieved, we pack as
308          * many blocks into each cylinder group map as will fit.
309          *
310          * We start by calculating the smallest number of blocks that we
311          * can put into each cylinder group. If this is too big, we reduce
312          * the density until it fits.
313          */
314         origdensity = density;
315         for (;;) {
316                 fragsperinode = MAX(numfrags(&sblock, density), 1);
317                 minfpg = fragsperinode * INOPB(&sblock);
318                 if (minfpg > sblock.fs_size)
319                         minfpg = sblock.fs_size;
320                 sblock.fs_ipg = INOPB(&sblock);
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),
326                     INOPB(&sblock));
327                 sblock.fs_fpg = roundup(sblock.fs_iblkno +
328                     sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
329                 if (sblock.fs_fpg < minfpg)
330                         sblock.fs_fpg = minfpg;
331                 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
332                     INOPB(&sblock));
333                 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
334                         break;
335                 density -= sblock.fs_fsize;
336         }
337         if (density != origdensity)
338                 printf("density reduced from %d to %d\n", origdensity, density);
339
340         if (maxblkspercg <= 0 || maxblkspercg >= fssize)
341                 maxblkspercg = fssize - 1;
342         /*
343          * Start packing more blocks into the cylinder group until
344          * it cannot grow any larger, the number of cylinder groups
345          * drops below 1, or we reach the size requested.
346          */
347         for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) {
348                 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
349                     INOPB(&sblock));
350                 if (sblock.fs_size / sblock.fs_fpg < 1)
351                         break;
352                 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize)
353                         continue;
354                 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize)
355                         break;
356                 sblock.fs_fpg -= sblock.fs_frag;
357                 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
358                     INOPB(&sblock));
359                 break;
360         }
361         /*
362          * Check to be sure that the last cylinder group has enough blocks
363          * to be viable. If it is too small, reduce the number of blocks
364          * per cylinder group which will have the effect of moving more
365          * blocks into the last cylinder group.
366          */
367         optimalfpg = sblock.fs_fpg;
368         for (;;) {
369                 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
370                 lastminfpg = roundup(sblock.fs_iblkno +
371                     sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag);
372                 if (sblock.fs_size < lastminfpg) {
373                         printf("Filesystem size %lld < minimum size of %d\n",
374                             (long long)sblock.fs_size, lastminfpg);
375                         exit(28);
376                 }
377                 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg ||
378                     sblock.fs_size % sblock.fs_fpg == 0)
379                         break;
380                 sblock.fs_fpg -= sblock.fs_frag;
381                 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode),
382                     INOPB(&sblock));
383         }
384         if (optimalfpg != sblock.fs_fpg)
385                 printf("Reduced frags per cylinder group from %d to %d %s\n",
386                    optimalfpg, sblock.fs_fpg, "to enlarge last cyl group");
387         sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
388         sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
389         if (Oflag <= 1) {
390                 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf;
391                 sblock.fs_old_nsect = sblock.fs_old_spc;
392                 sblock.fs_old_npsect = sblock.fs_old_spc;
393                 sblock.fs_old_ncyl = sblock.fs_ncg;
394         }
395
396         /*
397          * fill in remaining fields of the super block
398          */
399         sblock.fs_csaddr = cgdmin(&sblock, 0);
400         sblock.fs_cssize =
401             fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
402
403         /*
404          * Setup memory for temporary in-core cylgroup summaries.
405          * Cribbed from ffs_mountfs().
406          */
407         size = sblock.fs_cssize;
408         if (sblock.fs_contigsumsize > 0)
409                 size += sblock.fs_ncg * sizeof(int32_t);
410         space = ecalloc(1, size);
411         sblock.fs_si = ecalloc(1, sizeof(struct fs_summary_info));
412         sblock.fs_csp = space;
413         space = (char *)space + sblock.fs_cssize;
414         if (sblock.fs_contigsumsize > 0) {
415                 int32_t *lp;
416
417                 sblock.fs_maxcluster = lp = space;
418                 for (i = 0; i < sblock.fs_ncg; i++)
419                 *lp++ = sblock.fs_contigsumsize;
420         }
421
422         sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
423         if (sblock.fs_sbsize > SBLOCKSIZE)
424                 sblock.fs_sbsize = SBLOCKSIZE;
425         sblock.fs_minfree = minfree;
426         sblock.fs_maxcontig = maxcontig;
427         sblock.fs_maxbpg = maxbpg;
428         sblock.fs_optim = opt;
429         sblock.fs_cgrotor = 0;
430         sblock.fs_pendingblocks = 0;
431         sblock.fs_pendinginodes = 0;
432         sblock.fs_cstotal.cs_ndir = 0;
433         sblock.fs_cstotal.cs_nbfree = 0;
434         sblock.fs_cstotal.cs_nifree = 0;
435         sblock.fs_cstotal.cs_nffree = 0;
436         sblock.fs_fmod = 0;
437         sblock.fs_ronly = 0;
438         sblock.fs_state = 0;
439         sblock.fs_clean = FS_ISCLEAN;
440         sblock.fs_ronly = 0;
441         sblock.fs_id[0] = tstamp;
442         sblock.fs_id[1] = random();
443         sblock.fs_fsmnt[0] = '\0';
444         csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize);
445         sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno -
446             sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno);
447         sblock.fs_cstotal.cs_nbfree =
448             fragstoblks(&sblock, sblock.fs_dsize) -
449             howmany(csfrags, sblock.fs_frag);
450         sblock.fs_cstotal.cs_nffree =
451             fragnum(&sblock, sblock.fs_size) +
452             (fragnum(&sblock, csfrags) > 0 ?
453             sblock.fs_frag - fragnum(&sblock, csfrags) : 0);
454         sblock.fs_cstotal.cs_nifree =
455             sblock.fs_ncg * sblock.fs_ipg - UFS_ROOTINO;
456         sblock.fs_cstotal.cs_ndir = 0;
457         sblock.fs_dsize -= csfrags;
458         sblock.fs_time = tstamp;
459         if (Oflag <= 1) {
460                 sblock.fs_old_time = tstamp;
461                 sblock.fs_old_dsize = sblock.fs_dsize;
462                 sblock.fs_old_csaddr = sblock.fs_csaddr;
463                 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
464                 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
465                 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
466                 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
467         }
468         /*
469          * Dump out summary information about file system.
470          */
471 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
472         printf("%s: %.1fMB (%lld sectors) block size %d, "
473                "fragment size %d\n",
474             fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
475             (long long)fsbtodb(&sblock, sblock.fs_size),
476             sblock.fs_bsize, sblock.fs_fsize);
477         printf("\tusing %d cylinder groups of %.2fMB, %d blks, "
478                "%d inodes.\n",
479             sblock.fs_ncg,
480             (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
481             sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
482 #undef B2MBFACTOR
483         /*
484          * Now determine how wide each column will be, and calculate how
485          * many columns will fit in a 76 char line. 76 is the width of the
486          * subwindows in sysinst.
487          */
488         printcolwidth = count_digits(
489                         fsbtodb(&sblock, cgsblock(&sblock, sblock.fs_ncg -1)));
490         nprintcols = 76 / (printcolwidth + 2);
491
492         /*
493          * allocate space for superblock, cylinder group map, and
494          * two sets of inode blocks.
495          */
496         if (sblock.fs_bsize < SBLOCKSIZE)
497                 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize;
498         else
499                 iobufsize = 4 * sblock.fs_bsize;
500         iobuf = ecalloc(1, iobufsize);
501         /*
502          * Make a copy of the superblock into the buffer that we will be
503          * writing out in each cylinder group.
504          */
505         memcpy(writebuf, &sblock, sbsize);
506         if (fsopts->needswap)
507                 ffs_sb_swap(&sblock, (struct fs*)writebuf);
508         memcpy(iobuf, writebuf, SBLOCKSIZE);
509
510         printf("super-block backups (for fsck -b #) at:");
511         for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
512                 initcg(cylno, tstamp, fsopts);
513                 if (cylno % nprintcols == 0)
514                         printf("\n");
515                 printf(" %*lld,", printcolwidth,
516                         (long long)fsbtodb(&sblock, cgsblock(&sblock, cylno)));
517                 fflush(stdout);
518         }
519         printf("\n");
520
521         /*
522          * Now construct the initial file system,
523          * then write out the super-block.
524          */
525         sblock.fs_time = tstamp;
526         if (Oflag <= 1) {
527                 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir;
528                 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree;
529                 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree;
530                 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree;
531         }
532         if (fsopts->needswap)
533                 sblock.fs_flags |= FS_SWAPPED;
534         ffs_write_superblock(&sblock, fsopts);
535         return (&sblock);
536 }
537
538 /*
539  * Write out the superblock and its duplicates,
540  * and the cylinder group summaries
541  */
542 void
543 ffs_write_superblock(struct fs *fs, const fsinfo_t *fsopts)
544 {
545         int size, blks, i, saveflag;
546         uint32_t cylno;
547         void *space;
548         char *wrbuf;
549
550         saveflag = fs->fs_flags & FS_INTERNAL;
551         fs->fs_flags &= ~FS_INTERNAL;
552
553         memcpy(writebuf, &sblock, sbsize);
554         if (fsopts->needswap)
555                 ffs_sb_swap(fs, (struct fs*)writebuf);
556         ffs_wtfs(fs->fs_sblockloc / sectorsize, sbsize, writebuf, fsopts);
557
558         /* Write out the duplicate super blocks */
559         for (cylno = 0; cylno < fs->fs_ncg; cylno++)
560                 ffs_wtfs(fsbtodb(fs, cgsblock(fs, cylno)),
561                     sbsize, writebuf, fsopts);
562
563         /* Write out the cylinder group summaries */
564         size = fs->fs_cssize;
565         blks = howmany(size, fs->fs_fsize);
566         space = (void *)fs->fs_csp;
567         wrbuf = emalloc(size);
568         for (i = 0; i < blks; i+= fs->fs_frag) {
569                 size = fs->fs_bsize;
570                 if (i + fs->fs_frag > blks)
571                         size = (blks - i) * fs->fs_fsize;
572                 if (fsopts->needswap)
573                         ffs_csum_swap((struct csum *)space,
574                             (struct csum *)wrbuf, size);
575                 else
576                         memcpy(wrbuf, space, (u_int)size);
577                 ffs_wtfs(fsbtodb(fs, fs->fs_csaddr + i), size, wrbuf, fsopts);
578                 space = (char *)space + size;
579         }
580         free(wrbuf);
581         fs->fs_flags |= saveflag;
582 }
583
584 /*
585  * Initialize a cylinder group.
586  */
587 static void
588 initcg(uint32_t cylno, time_t utime, const fsinfo_t *fsopts)
589 {
590         daddr_t cbase, dmax;
591         int32_t blkno;
592         uint32_t i, j, d, dlower, dupper;
593         struct ufs1_dinode *dp1;
594         struct ufs2_dinode *dp2;
595         int start;
596
597         /*
598          * Determine block bounds for cylinder group.
599          * Allow space for super block summary information in first
600          * cylinder group.
601          */
602         cbase = cgbase(&sblock, cylno);
603         dmax = cbase + sblock.fs_fpg;
604         if (dmax > sblock.fs_size)
605                 dmax = sblock.fs_size;
606         dlower = cgsblock(&sblock, cylno) - cbase;
607         dupper = cgdmin(&sblock, cylno) - cbase;
608         if (cylno == 0)
609                 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
610         memset(&acg, 0, sblock.fs_cgsize);
611         acg.cg_time = utime;
612         acg.cg_magic = CG_MAGIC;
613         acg.cg_cgx = cylno;
614         acg.cg_niblk = sblock.fs_ipg;
615         acg.cg_initediblk = MIN(sblock.fs_ipg, 2 * INOPB(&sblock));
616         acg.cg_ndblk = dmax - cbase;
617         if (sblock.fs_contigsumsize > 0)
618                 acg.cg_nclusterblks = acg.cg_ndblk >> sblock.fs_fragshift;
619         start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
620         if (Oflag == 2) {
621                 acg.cg_iusedoff = start;
622         } else {
623                 if (cylno == sblock.fs_ncg - 1)
624                         acg.cg_old_ncyl = howmany(acg.cg_ndblk,
625                             sblock.fs_fpg / sblock.fs_old_cpg);
626                 else
627                         acg.cg_old_ncyl = sblock.fs_old_cpg;
628                 acg.cg_old_time = acg.cg_time;
629                 acg.cg_time = 0;
630                 acg.cg_old_niblk = acg.cg_niblk;
631                 acg.cg_niblk = 0;
632                 acg.cg_initediblk = 0;
633                 acg.cg_old_btotoff = start;
634                 acg.cg_old_boff = acg.cg_old_btotoff +
635                     sblock.fs_old_cpg * sizeof(int32_t);
636                 acg.cg_iusedoff = acg.cg_old_boff +
637                     sblock.fs_old_cpg * sizeof(u_int16_t);
638         }
639         acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
640         if (sblock.fs_contigsumsize <= 0) {
641                 acg.cg_nextfreeoff = acg.cg_freeoff +
642                    howmany(sblock.fs_fpg, CHAR_BIT);
643         } else {
644                 acg.cg_clustersumoff = acg.cg_freeoff +
645                     howmany(sblock.fs_fpg, CHAR_BIT) - sizeof(int32_t);
646                 acg.cg_clustersumoff =
647                     roundup(acg.cg_clustersumoff, sizeof(int32_t));
648                 acg.cg_clusteroff = acg.cg_clustersumoff +
649                     (sblock.fs_contigsumsize + 1) * sizeof(int32_t);
650                 acg.cg_nextfreeoff = acg.cg_clusteroff +
651                     howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
652         }
653         if (acg.cg_nextfreeoff > (uint32_t)sblock.fs_cgsize) {
654                 printf("Panic: cylinder group too big\n");
655                 exit(37);
656         }
657         acg.cg_cs.cs_nifree += sblock.fs_ipg;
658         if (cylno == 0)
659                 for (i = 0; i < UFS_ROOTINO; i++) {
660                         setbit(cg_inosused_swap(&acg, 0), i);
661                         acg.cg_cs.cs_nifree--;
662                 }
663         if (cylno > 0) {
664                 /*
665                  * In cylno 0, beginning space is reserved
666                  * for boot and super blocks.
667                  */
668                 for (d = 0, blkno = 0; d < dlower;) {
669                         ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno);
670                         if (sblock.fs_contigsumsize > 0)
671                                 setbit(cg_clustersfree_swap(&acg, 0), blkno);
672                         acg.cg_cs.cs_nbfree++;
673                         d += sblock.fs_frag;
674                         blkno++;
675                 }
676         }
677         if ((i = (dupper & (sblock.fs_frag - 1))) != 0) {
678                 acg.cg_frsum[sblock.fs_frag - i]++;
679                 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
680                         setbit(cg_blksfree_swap(&acg, 0), dupper);
681                         acg.cg_cs.cs_nffree++;
682                 }
683         }
684         for (d = dupper, blkno = dupper >> sblock.fs_fragshift;
685              d + sblock.fs_frag <= acg.cg_ndblk; ) {
686                 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno);
687                 if (sblock.fs_contigsumsize > 0)
688                         setbit(cg_clustersfree_swap(&acg, 0), blkno);
689                 acg.cg_cs.cs_nbfree++;
690                 d += sblock.fs_frag;
691                 blkno++;
692         }
693         if (d < acg.cg_ndblk) {
694                 acg.cg_frsum[acg.cg_ndblk - d]++;
695                 for (; d < acg.cg_ndblk; d++) {
696                         setbit(cg_blksfree_swap(&acg, 0), d);
697                         acg.cg_cs.cs_nffree++;
698                 }
699         }
700         if (sblock.fs_contigsumsize > 0) {
701                 int32_t *sump = cg_clustersum_swap(&acg, 0);
702                 u_char *mapp = cg_clustersfree_swap(&acg, 0);
703                 int map = *mapp++;
704                 int bit = 1;
705                 int run = 0;
706
707                 for (i = 0; i < acg.cg_nclusterblks; i++) {
708                         if ((map & bit) != 0) {
709                                 run++;
710                         } else if (run != 0) {
711                                 if (run > sblock.fs_contigsumsize)
712                                         run = sblock.fs_contigsumsize;
713                                 sump[run]++;
714                                 run = 0;
715                         }
716                         if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) {
717                                 bit <<= 1;
718                         } else {
719                                 map = *mapp++;
720                                 bit = 1;
721                         }
722                 }
723                 if (run != 0) {
724                         if (run > sblock.fs_contigsumsize)
725                                 run = sblock.fs_contigsumsize;
726                         sump[run]++;
727                 }
728         }
729         sblock.fs_cs(&sblock, cylno) = acg.cg_cs;
730         /*
731          * Write out the duplicate super block, the cylinder group map
732          * and two blocks worth of inodes in a single write.
733          */
734         start = MAX(sblock.fs_bsize, SBLOCKSIZE);
735         memcpy(&iobuf[start], &acg, sblock.fs_cgsize);
736         if (fsopts->needswap)
737                 ffs_cg_swap(&acg, (struct cg*)&iobuf[start], &sblock);
738         start += sblock.fs_bsize;
739         dp1 = (struct ufs1_dinode *)(&iobuf[start]);
740         dp2 = (struct ufs2_dinode *)(&iobuf[start]);
741         for (i = 0; i < acg.cg_initediblk; i++) {
742                 if (sblock.fs_magic == FS_UFS1_MAGIC) {
743                         /* No need to swap, it'll stay random */
744                         dp1->di_gen = random();
745                         dp1++;
746                 } else {
747                         dp2->di_gen = random();
748                         dp2++;
749                 }
750         }
751         ffs_wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf,
752             fsopts);
753         /*
754          * For the old file system, we have to initialize all the inodes.
755          */
756         if (Oflag <= 1) {
757                 for (i = 2 * sblock.fs_frag;
758                      i < sblock.fs_ipg / INOPF(&sblock);
759                      i += sblock.fs_frag) {
760                         dp1 = (struct ufs1_dinode *)(&iobuf[start]);
761                         for (j = 0; j < INOPB(&sblock); j++) {
762                                 dp1->di_gen = random();
763                                 dp1++;
764                         }
765                         ffs_wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
766                             sblock.fs_bsize, &iobuf[start], fsopts);
767                 }
768         }
769 }
770
771 /*
772  * read a block from the file system
773  */
774 void
775 ffs_rdfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts)
776 {
777         int n;
778         off_t offset;
779
780         offset = bno * fsopts->sectorsize + fsopts->offset;
781         if (lseek(fsopts->fd, offset, SEEK_SET) < 0)
782                 err(1, "%s: seek error for sector %lld", __func__,
783                     (long long)bno);
784         n = read(fsopts->fd, bf, size);
785         if (n == -1) {
786                 abort();
787                 err(1, "%s: read error bno %lld size %d", __func__,
788                     (long long)bno, size);
789         }
790         else if (n != size)
791                 errx(1, "%s: read error for sector %lld", __func__,
792                     (long long)bno);
793 }
794
795 /*
796  * write a block to the file system
797  */
798 void
799 ffs_wtfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts)
800 {
801         int n;
802         off_t offset;
803
804         offset = bno * fsopts->sectorsize + fsopts->offset;
805         if (lseek(fsopts->fd, offset, SEEK_SET) < 0)
806                 err(1, "%s: seek error for sector %lld", __func__,
807                     (long long)bno);
808         n = write(fsopts->fd, bf, size);
809         if (n == -1)
810                 err(1, "%s: write error for sector %lld", __func__,
811                     (long long)bno);
812         else if (n != size)
813                 errx(1, "%s: write error for sector %lld", __func__,
814                     (long long)bno);
815 }
816
817
818 /* Determine how many digits are needed to print a given integer */
819 static int
820 count_digits(int num)
821 {
822         int ndig;
823
824         for(ndig = 1; num > 9; num /=10, ndig++);
825
826         return (ndig);
827 }
828
829 static int
830 ilog2(int val)
831 {
832         u_int n;
833
834         for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
835                 if (1 << n == val)
836                         return (n);
837         errx(1, "%s: %d is not a power of 2", __func__, val);
838 }