2 * Copyright (c) 1980, 1989, 1993 The Regents of the University of California.
3 * Copyright (c) 2000 Christoph Herrmann, Thomas-Henning von Kamptz
4 * Copyright (c) 2012 The FreeBSD Foundation
7 * This code is derived from software contributed to Berkeley by
8 * Christoph Herrmann and Thomas-Henning von Kamptz, Munich and Frankfurt.
10 * Portions of this software were developed by Edward Tomasz Napierala
11 * under sponsorship from the FreeBSD Foundation.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgment:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors, as well as Christoph
25 * Herrmann and Thomas-Henning von Kamptz.
26 * 4. 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.
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
42 * $TSHeader: src/sbin/growfs/growfs.c,v 1.5 2000/12/12 19:31:00 tomsoft Exp $
47 static const char copyright[] =
48 "@(#) Copyright (c) 2000 Christoph Herrmann, Thomas-Henning von Kamptz\n\
49 Copyright (c) 1980, 1989, 1993 The Regents of the University of California.\n\
50 All rights reserved.\n";
53 #include <sys/cdefs.h>
54 __FBSDID("$FreeBSD$");
56 #include <sys/param.h>
57 #include <sys/ioctl.h>
60 #include <sys/ucred.h>
61 #include <sys/mount.h>
78 #include <ufs/ufs/dinode.h>
79 #include <ufs/ffs/fs.h>
85 int _dbg_lvl_ = (DL_INFO); /* DL_TRC */
92 #define sblock fsun1.fs /* the new superblock */
93 #define osblock fsun2.fs /* the old superblock */
96 * Possible superblock locations ordered from most to least likely.
98 static int sblock_try[] = SBLOCKSEARCH;
99 static ufs2_daddr_t sblockloc;
105 #define acg cgun1.cg /* a cylinder cgroup (new) */
106 #define aocg cgun2.cg /* an old cylinder group */
108 static struct csum *fscs; /* cylinder summary */
110 static void growfs(int, int, unsigned int);
111 static void rdfs(ufs2_daddr_t, size_t, void *, int);
112 static void wtfs(ufs2_daddr_t, size_t, void *, int, unsigned int);
113 static int charsperline(void);
114 static void usage(void);
115 static int isblock(struct fs *, unsigned char *, int);
116 static void clrblock(struct fs *, unsigned char *, int);
117 static void setblock(struct fs *, unsigned char *, int);
118 static void initcg(int, time_t, int, unsigned int);
119 static void updjcg(int, time_t, int, int, unsigned int);
120 static void updcsloc(time_t, int, int, unsigned int);
121 static void frag_adjust(ufs2_daddr_t, int);
122 static void updclst(int);
123 static void mount_reload(const struct statfs *stfs);
126 * Here we actually start growing the file system. We basically read the
127 * cylinder summary from the first cylinder group as we want to update
128 * this on the fly during our various operations. First we handle the
129 * changes in the former last cylinder group. Afterwards we create all new
130 * cylinder groups. Now we handle the cylinder group containing the
131 * cylinder summary which might result in a relocation of the whole
132 * structure. In the end we write back the updated cylinder summary, the
133 * new superblock, and slightly patched versions of the super block
137 growfs(int fsi, int fso, unsigned int Nflag)
150 * Get the cylinder summary into the memory.
152 fscs = (struct csum *)calloc((size_t)1, (size_t)sblock.fs_cssize);
154 errx(1, "calloc failed");
155 for (i = 0; i < osblock.fs_cssize; i += osblock.fs_bsize) {
156 rdfs(fsbtodb(&osblock, osblock.fs_csaddr +
157 numfrags(&osblock, i)), (size_t)MIN(osblock.fs_cssize - i,
158 osblock.fs_bsize), (void *)(((char *)fscs) + i), fsi);
163 struct csum *dbg_csp;
169 for (dbg_csc = 0; dbg_csc < osblock.fs_ncg; dbg_csc++) {
170 snprintf(dbg_line, sizeof(dbg_line),
171 "%d. old csum in old location", dbg_csc);
172 DBG_DUMP_CSUM(&osblock, dbg_line, dbg_csp++);
175 #endif /* FS_DEBUG */
176 DBG_PRINT0("fscs read\n");
179 * Do all needed changes in the former last cylinder group.
181 updjcg(osblock.fs_ncg - 1, modtime, fsi, fso, Nflag);
184 * Dump out summary information about file system.
187 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
188 printf("growfs: %.1fMB (%jd sectors) block size %d, fragment size %d\n",
189 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
190 (intmax_t)fsbtodb(&sblock, sblock.fs_size), sblock.fs_bsize,
192 printf("\tusing %d cylinder groups of %.2fMB, %d blks, %d inodes.\n",
193 sblock.fs_ncg, (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
194 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
195 if (sblock.fs_flags & FS_DOSOFTDEP)
196 printf("\twith soft updates\n");
198 #endif /* FS_DEBUG */
201 * Now build the cylinders group blocks and
202 * then print out indices of cylinder groups.
204 printf("super-block backups (for fsck_ffs -b #) at:\n");
206 width = charsperline();
209 * Iterate for only the new cylinder groups.
211 for (cylno = osblock.fs_ncg; cylno < sblock.fs_ncg; cylno++) {
212 initcg(cylno, modtime, fso, Nflag);
213 j = sprintf(tmpbuf, " %jd%s",
214 (intmax_t)fsbtodb(&sblock, cgsblock(&sblock, cylno)),
215 cylno < (sblock.fs_ncg - 1) ? "," : "" );
216 if (i + j >= width) {
221 printf("%s", tmpbuf);
227 * Do all needed changes in the first cylinder group.
228 * allocate blocks in new location
230 updcsloc(modtime, fsi, fso, Nflag);
233 * Now write the cylinder summary back to disk.
235 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) {
236 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
237 (size_t)MIN(sblock.fs_cssize - i, sblock.fs_bsize),
238 (void *)(((char *)fscs) + i), fso, Nflag);
240 DBG_PRINT0("fscs written\n");
244 struct csum *dbg_csp;
249 for (dbg_csc = 0; dbg_csc < sblock.fs_ncg; dbg_csc++) {
250 snprintf(dbg_line, sizeof(dbg_line),
251 "%d. new csum in new location", dbg_csc);
252 DBG_DUMP_CSUM(&sblock, dbg_line, dbg_csp++);
255 #endif /* FS_DEBUG */
258 * Now write the new superblock back to disk.
260 sblock.fs_time = modtime;
261 wtfs(sblockloc, (size_t)SBLOCKSIZE, (void *)&sblock, fso, Nflag);
262 DBG_PRINT0("sblock written\n");
263 DBG_DUMP_FS(&sblock, "new initial sblock");
266 * Clean up the dynamic fields in our superblock copies.
271 sblock.fs_cgrotor = 0;
273 memset((void *)&sblock.fs_fsmnt, 0, sizeof(sblock.fs_fsmnt));
274 sblock.fs_flags &= FS_DOSOFTDEP;
278 * The following fields are currently distributed from the superblock
286 * fs_flags regarding SOFTPDATES
288 * We probably should rather change the summary for the cylinder group
289 * statistics here to the value of what would be in there, if the file
290 * system were created initially with the new size. Therefor we still
291 * need to find an easy way of calculating that.
292 * Possibly we can try to read the first superblock copy and apply the
293 * "diffed" stats between the old and new superblock by still copying
294 * certain parameters onto that.
298 * Write out the duplicate super blocks.
300 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
301 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
302 (size_t)SBLOCKSIZE, (void *)&sblock, fso, Nflag);
304 DBG_PRINT0("sblock copies written\n");
305 DBG_DUMP_FS(&sblock, "new other sblocks");
312 * This creates a new cylinder group structure, for more details please see
313 * the source of newfs(8), as this function is taken over almost unchanged.
314 * As this is never called for the first cylinder group, the special
315 * provisions for that case are removed here.
318 initcg(int cylno, time_t modtime, int fso, unsigned int Nflag)
321 static caddr_t iobuf;
324 ufs2_daddr_t i, cbase, dmax;
325 struct ufs1_dinode *dp1;
327 uint j, d, dupper, dlower;
329 if (iobuf == NULL && (iobuf = malloc(sblock.fs_bsize * 3)) == NULL)
330 errx(37, "panic: cannot allocate I/O buffer");
333 * Determine block bounds for cylinder group.
334 * Allow space for super block summary information in first
337 cbase = cgbase(&sblock, cylno);
338 dmax = cbase + sblock.fs_fpg;
339 if (dmax > sblock.fs_size)
340 dmax = sblock.fs_size;
341 dlower = cgsblock(&sblock, cylno) - cbase;
342 dupper = cgdmin(&sblock, cylno) - cbase;
343 if (cylno == 0) /* XXX fscs may be relocated */
344 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
346 memset(&acg, 0, sblock.fs_cgsize);
347 acg.cg_time = modtime;
348 acg.cg_magic = CG_MAGIC;
350 acg.cg_niblk = sblock.fs_ipg;
351 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
352 sblock.fs_ipg : 2 * INOPB(&sblock);
353 acg.cg_ndblk = dmax - cbase;
354 if (sblock.fs_contigsumsize > 0)
355 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
356 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
357 if (sblock.fs_magic == FS_UFS2_MAGIC) {
358 acg.cg_iusedoff = start;
360 acg.cg_old_ncyl = sblock.fs_old_cpg;
361 acg.cg_old_time = acg.cg_time;
363 acg.cg_old_niblk = acg.cg_niblk;
365 acg.cg_initediblk = 0;
366 acg.cg_old_btotoff = start;
367 acg.cg_old_boff = acg.cg_old_btotoff +
368 sblock.fs_old_cpg * sizeof(int32_t);
369 acg.cg_iusedoff = acg.cg_old_boff +
370 sblock.fs_old_cpg * sizeof(u_int16_t);
372 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
373 acg.cg_nextfreeoff = acg.cg_freeoff + howmany(sblock.fs_fpg, CHAR_BIT);
374 if (sblock.fs_contigsumsize > 0) {
375 acg.cg_clustersumoff =
376 roundup(acg.cg_nextfreeoff, sizeof(u_int32_t));
377 acg.cg_clustersumoff -= sizeof(u_int32_t);
378 acg.cg_clusteroff = acg.cg_clustersumoff +
379 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
380 acg.cg_nextfreeoff = acg.cg_clusteroff +
381 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
383 if (acg.cg_nextfreeoff > (unsigned)sblock.fs_cgsize) {
385 * This should never happen as we would have had that panic
386 * already on file system creation
388 errx(37, "panic: cylinder group too big");
390 acg.cg_cs.cs_nifree += sblock.fs_ipg;
392 for (ino = 0; ino < ROOTINO; ino++) {
393 setbit(cg_inosused(&acg), ino);
394 acg.cg_cs.cs_nifree--;
397 * For the old file system, we have to initialize all the inodes.
399 if (sblock.fs_magic == FS_UFS1_MAGIC) {
400 bzero(iobuf, sblock.fs_bsize);
401 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock);
402 i += sblock.fs_frag) {
403 dp1 = (struct ufs1_dinode *)(void *)iobuf;
404 for (j = 0; j < INOPB(&sblock); j++) {
405 dp1->di_gen = arc4random();
408 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
409 sblock.fs_bsize, iobuf, fso, Nflag);
414 * In cylno 0, beginning space is reserved
415 * for boot and super blocks.
417 for (d = 0; d < dlower; d += sblock.fs_frag) {
418 blkno = d / sblock.fs_frag;
419 setblock(&sblock, cg_blksfree(&acg), blkno);
420 if (sblock.fs_contigsumsize > 0)
421 setbit(cg_clustersfree(&acg), blkno);
422 acg.cg_cs.cs_nbfree++;
424 sblock.fs_dsize += dlower;
426 sblock.fs_dsize += acg.cg_ndblk - dupper;
427 if ((i = dupper % sblock.fs_frag)) {
428 acg.cg_frsum[sblock.fs_frag - i]++;
429 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
430 setbit(cg_blksfree(&acg), dupper);
431 acg.cg_cs.cs_nffree++;
434 for (d = dupper; d + sblock.fs_frag <= acg.cg_ndblk;
435 d += sblock.fs_frag) {
436 blkno = d / sblock.fs_frag;
437 setblock(&sblock, cg_blksfree(&acg), blkno);
438 if (sblock.fs_contigsumsize > 0)
439 setbit(cg_clustersfree(&acg), blkno);
440 acg.cg_cs.cs_nbfree++;
442 if (d < acg.cg_ndblk) {
443 acg.cg_frsum[acg.cg_ndblk - d]++;
444 for (; d < acg.cg_ndblk; d++) {
445 setbit(cg_blksfree(&acg), d);
446 acg.cg_cs.cs_nffree++;
449 if (sblock.fs_contigsumsize > 0) {
450 int32_t *sump = cg_clustersum(&acg);
451 u_char *mapp = cg_clustersfree(&acg);
456 for (i = 0; i < acg.cg_nclusterblks; i++) {
457 if ((map & bit) != 0)
460 if (run > sblock.fs_contigsumsize)
461 run = sblock.fs_contigsumsize;
465 if ((i & (CHAR_BIT - 1)) != CHAR_BIT - 1)
473 if (run > sblock.fs_contigsumsize)
474 run = sblock.fs_contigsumsize;
478 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
479 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
480 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
481 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
484 memcpy(iobuf, &acg, sblock.fs_cgsize);
485 memset(iobuf + sblock.fs_cgsize, '\0',
486 sblock.fs_bsize * 3 - sblock.fs_cgsize);
488 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
489 sblock.fs_bsize * 3, iobuf, fso, Nflag);
490 DBG_DUMP_CG(&sblock, "new cg", &acg);
497 * Here we add or subtract (sign +1/-1) the available fragments in a given
498 * block to or from the fragment statistics. By subtracting before and adding
499 * after an operation on the free frag map we can easy update the fragment
500 * statistic, which seems to be otherwise a rather complex operation.
503 frag_adjust(ufs2_daddr_t frag, int sign)
505 DBG_FUNC("frag_adjust")
513 * Here frag only needs to point to any fragment in the block we want
516 for (f = rounddown(frag, sblock.fs_frag);
517 f < roundup(frag + 1, sblock.fs_frag); f++) {
519 * Count contiguous free fragments.
521 if (isset(cg_blksfree(&acg), f)) {
524 if (fragsize && fragsize < sblock.fs_frag) {
526 * We found something in between.
528 acg.cg_frsum[fragsize] += sign;
529 DBG_PRINT2("frag_adjust [%d]+=%d\n",
535 if (fragsize && fragsize < sblock.fs_frag) {
537 * We found something.
539 acg.cg_frsum[fragsize] += sign;
540 DBG_PRINT2("frag_adjust [%d]+=%d\n", fragsize, sign);
542 DBG_PRINT2("frag_adjust [[%d]]+=%d\n", fragsize, sign);
549 * Here we do all needed work for the former last cylinder group. It has to be
550 * changed in any case, even if the file system ended exactly on the end of
551 * this group, as there is some slightly inconsistent handling of the number
552 * of cylinders in the cylinder group. We start again by reading the cylinder
553 * group from disk. If the last block was not fully available, we first handle
554 * the missing fragments, then we handle all new full blocks in that file
555 * system and finally we handle the new last fragmented block in the file
556 * system. We again have to handle the fragment statistics rotational layout
557 * tables and cluster summary during all those operations.
560 updjcg(int cylno, time_t modtime, int fsi, int fso, unsigned int Nflag)
563 ufs2_daddr_t cbase, dmax, dupper;
571 * Read the former last (joining) cylinder group from disk, and make
574 rdfs(fsbtodb(&osblock, cgtod(&osblock, cylno)),
575 (size_t)osblock.fs_cgsize, (void *)&aocg, fsi);
576 DBG_PRINT0("jcg read\n");
577 DBG_DUMP_CG(&sblock, "old joining cg", &aocg);
579 memcpy((void *)&cgun1, (void *)&cgun2, sizeof(cgun2));
582 * If the cylinder group had already its new final size almost
583 * nothing is to be done ... except:
584 * For some reason the value of cg_ncyl in the last cylinder group has
585 * to be zero instead of fs_cpg. As this is now no longer the last
586 * cylinder group we have to change that value now to fs_cpg.
589 if (cgbase(&osblock, cylno + 1) == osblock.fs_size) {
590 if (sblock.fs_magic == FS_UFS1_MAGIC)
591 acg.cg_old_ncyl = sblock.fs_old_cpg;
593 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
594 (size_t)sblock.fs_cgsize, (void *)&acg, fso, Nflag);
595 DBG_PRINT0("jcg written\n");
596 DBG_DUMP_CG(&sblock, "new joining cg", &acg);
603 * Set up some variables needed later.
605 cbase = cgbase(&sblock, cylno);
606 dmax = cbase + sblock.fs_fpg;
607 if (dmax > sblock.fs_size)
608 dmax = sblock.fs_size;
609 dupper = cgdmin(&sblock, cylno) - cbase;
610 if (cylno == 0) /* XXX fscs may be relocated */
611 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
614 * Set pointer to the cylinder summary for our cylinder group.
619 * Touch the cylinder group, update all fields in the cylinder group as
620 * needed, update the free space in the superblock.
622 acg.cg_time = modtime;
623 if ((unsigned)cylno == sblock.fs_ncg - 1) {
625 * This is still the last cylinder group.
627 if (sblock.fs_magic == FS_UFS1_MAGIC)
629 sblock.fs_old_ncyl % sblock.fs_old_cpg;
631 acg.cg_old_ncyl = sblock.fs_old_cpg;
633 DBG_PRINT2("jcg dbg: %d %u", cylno, sblock.fs_ncg);
635 if (sblock.fs_magic == FS_UFS1_MAGIC)
636 DBG_PRINT2("%d %u", acg.cg_old_ncyl, sblock.fs_old_cpg);
639 acg.cg_ndblk = dmax - cbase;
640 sblock.fs_dsize += acg.cg_ndblk - aocg.cg_ndblk;
641 if (sblock.fs_contigsumsize > 0)
642 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
645 * Now we have to update the free fragment bitmap for our new free
646 * space. There again we have to handle the fragmentation and also
647 * the rotational layout tables and the cluster summary. This is
648 * also done per fragment for the first new block if the old file
649 * system end was not on a block boundary, per fragment for the new
650 * last block if the new file system end is not on a block boundary,
651 * and per block for all space in between.
653 * Handle the first new block here if it was partially available
656 if (osblock.fs_size % sblock.fs_frag) {
657 if (roundup(osblock.fs_size, sblock.fs_frag) <=
660 * The new space is enough to fill at least this
664 for (i = roundup(osblock.fs_size - cbase,
665 sblock.fs_frag) - 1; i >= osblock.fs_size - cbase;
667 setbit(cg_blksfree(&acg), i);
668 acg.cg_cs.cs_nffree++;
673 * Check if the fragment just created could join an
674 * already existing fragment at the former end of the
677 if (isblock(&sblock, cg_blksfree(&acg),
678 ((osblock.fs_size - cgbase(&sblock, cylno)) /
681 * The block is now completely available.
683 DBG_PRINT0("block was\n");
684 acg.cg_frsum[osblock.fs_size % sblock.fs_frag]--;
685 acg.cg_cs.cs_nbfree++;
686 acg.cg_cs.cs_nffree -= sblock.fs_frag;
687 k = rounddown(osblock.fs_size - cbase,
689 updclst((osblock.fs_size - cbase) /
693 * Lets rejoin a possible partially growed
697 while (isset(cg_blksfree(&acg), i) &&
698 (i >= rounddown(osblock.fs_size - cbase,
705 acg.cg_frsum[k + j]++;
709 * We only grow by some fragments within this last
712 for (i = sblock.fs_size - cbase - 1;
713 i >= osblock.fs_size - cbase; i--) {
714 setbit(cg_blksfree(&acg), i);
715 acg.cg_cs.cs_nffree++;
719 * Lets rejoin a possible partially growed fragment.
722 while (isset(cg_blksfree(&acg), i) &&
723 (i >= rounddown(osblock.fs_size - cbase,
730 acg.cg_frsum[k + j]++;
735 * Handle all new complete blocks here.
737 for (i = roundup(osblock.fs_size - cbase, sblock.fs_frag);
738 i + sblock.fs_frag <= dmax - cbase; /* XXX <= or only < ? */
739 i += sblock.fs_frag) {
740 j = i / sblock.fs_frag;
741 setblock(&sblock, cg_blksfree(&acg), j);
743 acg.cg_cs.cs_nbfree++;
747 * Handle the last new block if there are stll some new fragments left.
748 * Here we don't have to bother about the cluster summary or the even
749 * the rotational layout table.
751 if (i < (dmax - cbase)) {
752 acg.cg_frsum[dmax - cbase - i]++;
753 for (; i < dmax - cbase; i++) {
754 setbit(cg_blksfree(&acg), i);
755 acg.cg_cs.cs_nffree++;
759 sblock.fs_cstotal.cs_nffree +=
760 (acg.cg_cs.cs_nffree - aocg.cg_cs.cs_nffree);
761 sblock.fs_cstotal.cs_nbfree +=
762 (acg.cg_cs.cs_nbfree - aocg.cg_cs.cs_nbfree);
764 * The following statistics are not changed here:
765 * sblock.fs_cstotal.cs_ndir
766 * sblock.fs_cstotal.cs_nifree
767 * As the statistics for this cylinder group are ready, copy it to
768 * the summary information array.
773 * Write the updated "joining" cylinder group back to disk.
775 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)), (size_t)sblock.fs_cgsize,
776 (void *)&acg, fso, Nflag);
777 DBG_PRINT0("jcg written\n");
778 DBG_DUMP_CG(&sblock, "new joining cg", &acg);
785 * Here we update the location of the cylinder summary. We have two possible
786 * ways of growing the cylinder summary:
787 * (1) We can try to grow the summary in the current location, and relocate
788 * possibly used blocks within the current cylinder group.
789 * (2) Alternatively we can relocate the whole cylinder summary to the first
790 * new completely empty cylinder group. Once the cylinder summary is no
791 * longer in the beginning of the first cylinder group you should never
792 * use a version of fsck which is not aware of the possibility to have
793 * this structure in a non standard place.
794 * Option (2) is considered to be less intrusive to the structure of the file-
795 * system, so that's the one being used.
798 updcsloc(time_t modtime, int fsi, int fso, unsigned int Nflag)
809 if (howmany(sblock.fs_cssize, sblock.fs_fsize) ==
810 howmany(osblock.fs_cssize, osblock.fs_fsize)) {
812 * No new fragment needed.
817 ocscg = dtog(&osblock, osblock.fs_csaddr);
821 * Read original cylinder group from disk, and make a copy.
822 * XXX If Nflag is set in some very rare cases we now miss
823 * some changes done in updjcg by reading the unmodified
826 rdfs(fsbtodb(&osblock, cgtod(&osblock, ocscg)),
827 (size_t)osblock.fs_cgsize, (void *)&aocg, fsi);
828 DBG_PRINT0("oscg read\n");
829 DBG_DUMP_CG(&sblock, "old summary cg", &aocg);
831 memcpy((void *)&cgun1, (void *)&cgun2, sizeof(cgun2));
834 * Touch the cylinder group, set up local variables needed later
835 * and update the superblock.
837 acg.cg_time = modtime;
840 * XXX In the case of having active snapshots we may need much more
841 * blocks for the copy on write. We need each block twice, and
842 * also up to 8*3 blocks for indirect blocks for all possible
846 * There is not enough space in the old cylinder group to
847 * relocate all blocks as needed, so we relocate the whole
848 * cylinder group summary to a new group. We try to use the
849 * first complete new cylinder group just created. Within the
850 * cylinder group we align the area immediately after the
851 * cylinder group information location in order to be as
852 * close as possible to the original implementation of ffs.
854 * First we have to make sure we'll find enough space in the
855 * new cylinder group. If not, then we currently give up.
856 * We start with freeing everything which was used by the
857 * fragments of the old cylinder summary in the current group.
858 * Now we write back the group meta data, read in the needed
859 * meta data from the new cylinder group, and start allocating
860 * within that group. Here we can assume, the group to be
861 * completely empty. Which makes the handling of fragments and
862 * clusters a lot easier.
865 if (sblock.fs_ncg - osblock.fs_ncg < 2)
866 errx(2, "panic: not enough space");
869 * Point "d" to the first fragment not used by the cylinder
872 d = osblock.fs_csaddr + (osblock.fs_cssize / osblock.fs_fsize);
875 * Set up last cluster size ("lcs") already here. Calculate
876 * the size for the trailing cluster just behind where "d"
879 if (sblock.fs_contigsumsize > 0) {
880 for (block = howmany(d % sblock.fs_fpg, sblock.fs_frag),
881 lcs = 0; lcs < sblock.fs_contigsumsize; block++, lcs++) {
882 if (isclr(cg_clustersfree(&acg), block))
888 * Point "d" to the last frag used by the cylinder summary.
892 DBG_PRINT1("d=%jd\n", (intmax_t)d);
893 if ((d + 1) % sblock.fs_frag) {
895 * The end of the cylinder summary is not a complete
899 frag_adjust(d % sblock.fs_fpg, -1);
900 for (; (d + 1) % sblock.fs_frag; d--) {
901 DBG_PRINT1("d=%jd\n", (intmax_t)d);
902 setbit(cg_blksfree(&acg), d % sblock.fs_fpg);
903 acg.cg_cs.cs_nffree++;
904 sblock.fs_cstotal.cs_nffree++;
907 * Point "d" to the last fragment of the last
908 * (incomplete) block of the cylinder summary.
911 frag_adjust(d % sblock.fs_fpg, 1);
913 if (isblock(&sblock, cg_blksfree(&acg),
914 (d % sblock.fs_fpg) / sblock.fs_frag)) {
915 DBG_PRINT1("d=%jd\n", (intmax_t)d);
916 acg.cg_cs.cs_nffree -= sblock.fs_frag;
917 acg.cg_cs.cs_nbfree++;
918 sblock.fs_cstotal.cs_nffree -= sblock.fs_frag;
919 sblock.fs_cstotal.cs_nbfree++;
920 if (sblock.fs_contigsumsize > 0) {
921 setbit(cg_clustersfree(&acg),
922 (d % sblock.fs_fpg) / sblock.fs_frag);
923 if (lcs < sblock.fs_contigsumsize) {
925 cg_clustersum(&acg)[lcs]--;
927 cg_clustersum(&acg)[lcs]++;
932 * Point "d" to the first fragment of the block before
933 * the last incomplete block.
938 DBG_PRINT1("d=%jd\n", (intmax_t)d);
939 for (d = rounddown(d, sblock.fs_frag); d >= osblock.fs_csaddr;
940 d -= sblock.fs_frag) {
942 DBG_PRINT1("d=%jd\n", (intmax_t)d);
943 setblock(&sblock, cg_blksfree(&acg),
944 (d % sblock.fs_fpg) / sblock.fs_frag);
945 acg.cg_cs.cs_nbfree++;
946 sblock.fs_cstotal.cs_nbfree++;
947 if (sblock.fs_contigsumsize > 0) {
948 setbit(cg_clustersfree(&acg),
949 (d % sblock.fs_fpg) / sblock.fs_frag);
951 * The last cluster size is already set up.
953 if (lcs < sblock.fs_contigsumsize) {
955 cg_clustersum(&acg)[lcs]--;
957 cg_clustersum(&acg)[lcs]++;
964 * Now write the former cylinder group containing the cylinder
965 * summary back to disk.
967 wtfs(fsbtodb(&sblock, cgtod(&sblock, ocscg)),
968 (size_t)sblock.fs_cgsize, (void *)&acg, fso, Nflag);
969 DBG_PRINT0("oscg written\n");
970 DBG_DUMP_CG(&sblock, "old summary cg", &acg);
973 * Find the beginning of the new cylinder group containing the
976 sblock.fs_csaddr = cgdmin(&sblock, osblock.fs_ncg);
977 ncscg = dtog(&sblock, sblock.fs_csaddr);
981 * If Nflag is specified, we would now read random data instead
982 * of an empty cg structure from disk. So we can't simulate that
986 DBG_PRINT0("nscg update skipped\n");
992 * Read the future cylinder group containing the cylinder
993 * summary from disk, and make a copy.
995 rdfs(fsbtodb(&sblock, cgtod(&sblock, ncscg)),
996 (size_t)sblock.fs_cgsize, (void *)&aocg, fsi);
997 DBG_PRINT0("nscg read\n");
998 DBG_DUMP_CG(&sblock, "new summary cg", &aocg);
1000 memcpy((void *)&cgun1, (void *)&cgun2, sizeof(cgun2));
1003 * Allocate all complete blocks used by the new cylinder
1006 for (d = sblock.fs_csaddr; d + sblock.fs_frag <=
1007 sblock.fs_csaddr + (sblock.fs_cssize / sblock.fs_fsize);
1008 d += sblock.fs_frag) {
1009 clrblock(&sblock, cg_blksfree(&acg),
1010 (d % sblock.fs_fpg) / sblock.fs_frag);
1011 acg.cg_cs.cs_nbfree--;
1012 sblock.fs_cstotal.cs_nbfree--;
1013 if (sblock.fs_contigsumsize > 0) {
1014 clrbit(cg_clustersfree(&acg),
1015 (d % sblock.fs_fpg) / sblock.fs_frag);
1020 * Allocate all fragments used by the cylinder summary in the
1023 if (d < sblock.fs_csaddr + (sblock.fs_cssize / sblock.fs_fsize)) {
1024 for (; d - sblock.fs_csaddr <
1025 sblock.fs_cssize/sblock.fs_fsize; d++) {
1026 clrbit(cg_blksfree(&acg), d % sblock.fs_fpg);
1027 acg.cg_cs.cs_nffree--;
1028 sblock.fs_cstotal.cs_nffree--;
1030 acg.cg_cs.cs_nbfree--;
1031 acg.cg_cs.cs_nffree += sblock.fs_frag;
1032 sblock.fs_cstotal.cs_nbfree--;
1033 sblock.fs_cstotal.cs_nffree += sblock.fs_frag;
1034 if (sblock.fs_contigsumsize > 0)
1035 clrbit(cg_clustersfree(&acg),
1036 (d % sblock.fs_fpg) / sblock.fs_frag);
1038 frag_adjust(d % sblock.fs_fpg, 1);
1041 * XXX Handle the cluster statistics here in the case this
1042 * cylinder group is now almost full, and the remaining
1043 * space is less then the maximum cluster size. This is
1044 * probably not needed, as you would hardly find a file
1045 * system which has only MAXCSBUFS+FS_MAXCONTIG of free
1046 * space right behind the cylinder group information in
1047 * any new cylinder group.
1051 * Update our statistics in the cylinder summary.
1056 * Write the new cylinder group containing the cylinder summary
1059 wtfs(fsbtodb(&sblock, cgtod(&sblock, ncscg)),
1060 (size_t)sblock.fs_cgsize, (void *)&acg, fso, Nflag);
1061 DBG_PRINT0("nscg written\n");
1062 DBG_DUMP_CG(&sblock, "new summary cg", &acg);
1069 * Here we read some block(s) from disk.
1072 rdfs(ufs2_daddr_t bno, size_t size, void *bf, int fsi)
1080 err(32, "rdfs: attempting to read negative block number");
1081 if (lseek(fsi, (off_t)bno * DEV_BSIZE, 0) < 0)
1082 err(33, "rdfs: seek error: %jd", (intmax_t)bno);
1083 n = read(fsi, bf, size);
1084 if (n != (ssize_t)size)
1085 err(34, "rdfs: read error: %jd", (intmax_t)bno);
1092 * Here we write some block(s) to disk.
1095 wtfs(ufs2_daddr_t bno, size_t size, void *bf, int fso, unsigned int Nflag)
1106 if (lseek(fso, (off_t)bno * DEV_BSIZE, SEEK_SET) < 0)
1107 err(35, "wtfs: seek error: %ld", (long)bno);
1108 n = write(fso, bf, size);
1109 if (n != (ssize_t)size)
1110 err(36, "wtfs: write error: %ld", (long)bno);
1117 * Here we check if all frags of a block are free. For more details again
1118 * please see the source of newfs(8), as this function is taken over almost
1122 isblock(struct fs *fs, unsigned char *cp, int h)
1129 switch (fs->fs_frag) {
1132 return (cp[h] == 0xff);
1134 mask = 0x0f << ((h & 0x1) << 2);
1136 return ((cp[h >> 1] & mask) == mask);
1138 mask = 0x03 << ((h & 0x3) << 1);
1140 return ((cp[h >> 2] & mask) == mask);
1142 mask = 0x01 << (h & 0x7);
1144 return ((cp[h >> 3] & mask) == mask);
1146 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1153 * Here we allocate a complete block in the block map. For more details again
1154 * please see the source of newfs(8), as this function is taken over almost
1158 clrblock(struct fs *fs, unsigned char *cp, int h)
1160 DBG_FUNC("clrblock")
1164 switch ((fs)->fs_frag) {
1169 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1172 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1175 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1178 warnx("clrblock bad fs_frag %d", fs->fs_frag);
1187 * Here we free a complete block in the free block map. For more details again
1188 * please see the source of newfs(8), as this function is taken over almost
1192 setblock(struct fs *fs, unsigned char *cp, int h)
1194 DBG_FUNC("setblock")
1198 switch (fs->fs_frag) {
1203 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1206 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1209 cp[h >> 3] |= (0x01 << (h & 0x7));
1212 warnx("setblock bad fs_frag %d", fs->fs_frag);
1221 * Figure out how many lines our current terminal has. For more details again
1222 * please see the source of newfs(8), as this function is taken over almost
1228 DBG_FUNC("charsperline")
1236 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1237 columns = ws.ws_col;
1238 if (columns == 0 && (cp = getenv("COLUMNS")))
1241 columns = 80; /* last resort */
1248 is_dev(const char *name)
1250 struct stat devstat;
1252 if (stat(name, &devstat) != 0)
1254 if (!S_ISCHR(devstat.st_mode))
1260 * Return mountpoint on which the device is currently mounted.
1262 static const struct statfs *
1263 dev_to_statfs(const char *dev)
1265 struct stat devstat, mntdevstat;
1266 struct statfs *mntbuf, *statfsp;
1267 char device[MAXPATHLEN];
1272 * First check the mounted filesystems.
1274 if (stat(dev, &devstat) != 0)
1276 if (!S_ISCHR(devstat.st_mode) && !S_ISBLK(devstat.st_mode))
1279 mntsize = getmntinfo(&mntbuf, MNT_NOWAIT);
1280 for (i = 0; i < mntsize; i++) {
1281 statfsp = &mntbuf[i];
1282 mntdevname = statfsp->f_mntfromname;
1283 if (*mntdevname != '/') {
1284 strcpy(device, _PATH_DEV);
1285 strcat(device, mntdevname);
1286 mntdevname = device;
1288 if (stat(mntdevname, &mntdevstat) == 0 &&
1289 mntdevstat.st_rdev == devstat.st_rdev)
1297 mountpoint_to_dev(const char *mountpoint)
1299 struct statfs *mntbuf, *statfsp;
1304 * First check the mounted filesystems.
1306 mntsize = getmntinfo(&mntbuf, MNT_NOWAIT);
1307 for (i = 0; i < mntsize; i++) {
1308 statfsp = &mntbuf[i];
1310 if (strcmp(statfsp->f_mntonname, mountpoint) == 0)
1311 return (statfsp->f_mntfromname);
1317 fs = getfsfile(mountpoint);
1319 return (fs->fs_spec);
1325 getdev(const char *name)
1327 static char device[MAXPATHLEN];
1328 const char *cp, *dev;
1333 cp = strrchr(name, '/');
1335 snprintf(device, sizeof(device), "%s%s", _PATH_DEV, name);
1340 dev = mountpoint_to_dev(name);
1341 if (dev != NULL && is_dev(dev))
1348 * growfs(8) is a utility which allows to increase the size of an existing
1349 * ufs file system. Currently this can only be done on unmounted file system.
1350 * It recognizes some command line options to specify the new desired size,
1351 * and it does some basic checkings. The old file system size is determined
1352 * and after some more checks like we can really access the new last block
1353 * on the disk etc. we calculate the new parameters for the superblock. After
1354 * having done this we just call growfs() which will do the work.
1355 * We still have to provide support for snapshots. Therefore we first have to
1356 * understand what data structures are always replicated in the snapshot on
1357 * creation, for all other blocks we touch during our procedure, we have to
1358 * keep the old blocks unchanged somewhere available for the snapshots. If we
1359 * are lucky, then we only have to handle our blocks to be relocated in that
1361 * Also we have to consider in what order we actually update the critical
1362 * data structures of the file system to make sure, that in case of a disaster
1363 * fsck(8) is still able to restore any lost data.
1364 * The foreseen last step then will be to provide for growing even mounted
1365 * file systems. There we have to extend the mount() system call to provide
1366 * userland access to the file system locking facility.
1369 main(int argc, char **argv)
1373 const struct statfs *statfsp;
1376 int error, i, j, fsi, fso, ch, Nflag = 0, yflag = 0;
1377 char *p, reply[5], oldsizebuf[6], newsizebuf[6];
1382 while ((ch = getopt(argc, argv, "Ns:vy")) != -1) {
1388 size = (off_t)strtoumax(optarg, &p, 0);
1389 if (p == NULL || *p == '\0')
1391 else if (*p == 'b' || *p == 'B')
1393 else if (*p == 'k' || *p == 'K')
1395 else if (*p == 'm' || *p == 'M')
1397 else if (*p == 'g' || *p == 'G')
1399 else if (*p == 't' || *p == 'T') {
1403 errx(1, "unknown suffix on -s argument");
1405 case 'v': /* for compatibility to newfs */
1423 * Now try to guess the device name.
1425 device = getdev(*argv);
1427 errx(1, "cannot find special device for %s", *argv);
1429 statfsp = dev_to_statfs(device);
1431 fsi = open(device, O_RDONLY);
1433 err(1, "%s", device);
1436 * Try to guess the slice size if not specified.
1438 if (ioctl(fsi, DIOCGMEDIASIZE, &mediasize) == -1)
1439 err(1,"DIOCGMEDIASIZE");
1442 * Check if that partition is suitable for growing a file system.
1445 errx(1, "partition is unavailable");
1448 * Read the current superblock, and take a backup.
1450 for (i = 0; sblock_try[i] != -1; i++) {
1451 sblockloc = sblock_try[i] / DEV_BSIZE;
1452 rdfs(sblockloc, (size_t)SBLOCKSIZE, (void *)&(osblock), fsi);
1453 if ((osblock.fs_magic == FS_UFS1_MAGIC ||
1454 (osblock.fs_magic == FS_UFS2_MAGIC &&
1455 osblock.fs_sblockloc == sblock_try[i])) &&
1456 osblock.fs_bsize <= MAXBSIZE &&
1457 osblock.fs_bsize >= (int32_t) sizeof(struct fs))
1460 if (sblock_try[i] == -1)
1461 errx(1, "superblock not recognized");
1462 memcpy((void *)&fsun1, (void *)&fsun2, sizeof(fsun2));
1464 DBG_OPEN("/tmp/growfs.debug"); /* already here we need a superblock */
1465 DBG_DUMP_FS(&sblock, "old sblock");
1468 * Determine size to grow to. Default to the device size.
1473 if (size > (uint64_t)mediasize) {
1474 humanize_number(oldsizebuf, sizeof(oldsizebuf), size,
1475 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1476 humanize_number(newsizebuf, sizeof(newsizebuf),
1478 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1480 errx(1, "requested size %s is larger "
1481 "than the available %s", oldsizebuf, newsizebuf);
1486 * Make sure the new size is a multiple of fs_fsize; /dev/ufssuspend
1487 * only supports fragment-aligned IO requests.
1489 size -= size % osblock.fs_fsize;
1491 if (size <= (uint64_t)(osblock.fs_size * osblock.fs_fsize)) {
1492 humanize_number(oldsizebuf, sizeof(oldsizebuf),
1493 osblock.fs_size * osblock.fs_fsize,
1494 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1495 humanize_number(newsizebuf, sizeof(newsizebuf), size,
1496 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1498 errx(1, "requested size %s is not larger than the current "
1499 "filesystem size %s", newsizebuf, oldsizebuf);
1502 sblock.fs_size = dbtofsb(&osblock, size / DEV_BSIZE);
1503 sblock.fs_providersize = dbtofsb(&osblock, mediasize / DEV_BSIZE);
1506 * Are we really growing?
1508 if (osblock.fs_size >= sblock.fs_size) {
1509 errx(1, "we are not growing (%jd->%jd)",
1510 (intmax_t)osblock.fs_size, (intmax_t)sblock.fs_size);
1514 * Check if we find an active snapshot.
1517 for (j = 0; j < FSMAXSNAP; j++) {
1518 if (sblock.fs_snapinum[j]) {
1519 errx(1, "active snapshot found in file system; "
1520 "please remove all snapshots before "
1523 if (!sblock.fs_snapinum[j]) /* list is dense */
1528 if (yflag == 0 && Nflag == 0) {
1529 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) == 0)
1530 printf("Device is mounted read-write; resizing will "
1531 "result in temporary write suspension for %s.\n",
1532 statfsp->f_mntonname);
1533 printf("It's strongly recommended to make a backup "
1534 "before growing the file system.\n"
1535 "OK to grow filesystem on %s", device);
1536 if (statfsp != NULL)
1537 printf(", mounted on %s,", statfsp->f_mntonname);
1538 humanize_number(oldsizebuf, sizeof(oldsizebuf),
1539 osblock.fs_size * osblock.fs_fsize,
1540 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1541 humanize_number(newsizebuf, sizeof(newsizebuf),
1542 sblock.fs_size * sblock.fs_fsize,
1543 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1544 printf(" from %s to %s? [Yes/No] ", oldsizebuf, newsizebuf);
1546 fgets(reply, (int)sizeof(reply), stdin);
1547 if (strcasecmp(reply, "Yes\n")){
1548 printf("\nNothing done\n");
1554 * Try to access our device for writing. If it's not mounted,
1555 * or mounted read-only, simply open it; otherwise, use UFS
1556 * suspension mechanism.
1561 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) == 0) {
1562 fso = open(_PATH_UFSSUSPEND, O_RDWR);
1564 err(1, "unable to open %s", _PATH_UFSSUSPEND);
1565 error = ioctl(fso, UFSSUSPEND, &statfsp->f_fsid);
1567 err(1, "UFSSUSPEND");
1569 fso = open(device, O_WRONLY);
1571 err(1, "%s", device);
1576 * Try to access our new last block in the file system.
1578 testbuf = malloc(sblock.fs_fsize);
1579 if (testbuf == NULL)
1581 rdfs((ufs2_daddr_t)((size - sblock.fs_fsize) / DEV_BSIZE),
1582 sblock.fs_fsize, testbuf, fsi);
1583 wtfs((ufs2_daddr_t)((size - sblock.fs_fsize) / DEV_BSIZE),
1584 sblock.fs_fsize, testbuf, fso, Nflag);
1588 * Now calculate new superblock values and check for reasonable
1589 * bound for new file system size:
1590 * fs_size: is derived from user input
1591 * fs_dsize: should get updated in the routines creating or
1592 * updating the cylinder groups on the fly
1593 * fs_cstotal: should get updated in the routines creating or
1594 * updating the cylinder groups
1598 * Update the number of cylinders and cylinder groups in the file system.
1600 if (sblock.fs_magic == FS_UFS1_MAGIC) {
1601 sblock.fs_old_ncyl =
1602 sblock.fs_size * sblock.fs_old_nspf / sblock.fs_old_spc;
1603 if (sblock.fs_size * sblock.fs_old_nspf >
1604 sblock.fs_old_ncyl * sblock.fs_old_spc)
1605 sblock.fs_old_ncyl++;
1607 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
1610 * Allocate last cylinder group only if there is enough room
1611 * for at least one data block.
1613 if (sblock.fs_size % sblock.fs_fpg != 0 &&
1614 sblock.fs_size <= cgdmin(&sblock, sblock.fs_ncg - 1)) {
1615 humanize_number(oldsizebuf, sizeof(oldsizebuf),
1616 (sblock.fs_size % sblock.fs_fpg) * sblock.fs_fsize,
1617 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1618 warnx("no room to allocate last cylinder group; "
1619 "leaving %s unused", oldsizebuf);
1621 if (sblock.fs_magic == FS_UFS1_MAGIC)
1622 sblock.fs_old_ncyl = sblock.fs_ncg * sblock.fs_old_cpg;
1623 sblock.fs_size = sblock.fs_ncg * sblock.fs_fpg;
1627 * Update the space for the cylinder group summary information in the
1628 * respective cylinder group data area.
1631 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
1633 if (osblock.fs_size >= sblock.fs_size)
1634 errx(1, "not enough new space");
1636 DBG_PRINT0("sblock calculated\n");
1639 * Ok, everything prepared, so now let's do the tricks.
1641 growfs(fsi, fso, Nflag);
1645 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) == 0) {
1646 error = ioctl(fso, UFSRESUME);
1648 err(1, "UFSRESUME");
1653 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) != 0)
1654 mount_reload(statfsp);
1664 * Dump a line of usage.
1673 fprintf(stderr, "usage: growfs [-Ny] [-s size] special | filesystem\n");
1680 * This updates most parameters and the bitmap related to cluster. We have to
1681 * assume that sblock, osblock, acg are set up.
1691 if (sblock.fs_contigsumsize < 1) /* no clustering */
1694 * update cluster allocation map
1696 setbit(cg_clustersfree(&acg), block);
1699 * update cluster summary table
1703 * calculate size for the trailing cluster
1705 for (block--; lcs < sblock.fs_contigsumsize; block--, lcs++ ) {
1706 if (isclr(cg_clustersfree(&acg), block))
1710 if (lcs < sblock.fs_contigsumsize) {
1712 cg_clustersum(&acg)[lcs]--;
1714 cg_clustersum(&acg)[lcs]++;
1722 mount_reload(const struct statfs *stfs)
1731 build_iovec(&iov, &iovlen, "fstype", __DECONST(char *, "ffs"), 4);
1732 build_iovec(&iov, &iovlen, "fspath", __DECONST(char *, stfs->f_mntonname), (size_t)-1);
1733 build_iovec(&iov, &iovlen, "errmsg", errmsg, sizeof(errmsg));
1734 build_iovec(&iov, &iovlen, "update", NULL, 0);
1735 build_iovec(&iov, &iovlen, "reload", NULL, 0);
1737 if (nmount(iov, iovlen, stfs->f_flags) < 0) {
1738 errmsg[sizeof(errmsg) - 1] = '\0';
1739 err(9, "%s: cannot reload filesystem%s%s", stfs->f_mntonname,
1740 *errmsg != '\0' ? ": " : "", errmsg);