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)
144 static int randinit = 0;
155 * Get the cylinder summary into the memory.
157 fscs = (struct csum *)calloc((size_t)1, (size_t)sblock.fs_cssize);
159 errx(1, "calloc failed");
160 for (i = 0; i < osblock.fs_cssize; i += osblock.fs_bsize) {
161 rdfs(fsbtodb(&osblock, osblock.fs_csaddr +
162 numfrags(&osblock, i)), (size_t)MIN(osblock.fs_cssize - i,
163 osblock.fs_bsize), (void *)(((char *)fscs) + i), fsi);
168 struct csum *dbg_csp;
174 for (dbg_csc = 0; dbg_csc < osblock.fs_ncg; dbg_csc++) {
175 snprintf(dbg_line, sizeof(dbg_line),
176 "%d. old csum in old location", dbg_csc);
177 DBG_DUMP_CSUM(&osblock, dbg_line, dbg_csp++);
180 #endif /* FS_DEBUG */
181 DBG_PRINT0("fscs read\n");
184 * Do all needed changes in the former last cylinder group.
186 updjcg(osblock.fs_ncg - 1, modtime, fsi, fso, Nflag);
189 * Dump out summary information about file system.
192 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
193 printf("growfs: %.1fMB (%jd sectors) block size %d, fragment size %d\n",
194 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
195 (intmax_t)fsbtodb(&sblock, sblock.fs_size), sblock.fs_bsize,
197 printf("\tusing %d cylinder groups of %.2fMB, %d blks, %d inodes.\n",
198 sblock.fs_ncg, (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
199 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg);
200 if (sblock.fs_flags & FS_DOSOFTDEP)
201 printf("\twith soft updates\n");
203 #endif /* FS_DEBUG */
206 * Now build the cylinders group blocks and
207 * then print out indices of cylinder groups.
209 printf("super-block backups (for fsck -b #) at:\n");
211 width = charsperline();
214 * Iterate for only the new cylinder groups.
216 for (cylno = osblock.fs_ncg; cylno < sblock.fs_ncg; cylno++) {
217 initcg(cylno, modtime, fso, Nflag);
218 j = sprintf(tmpbuf, " %jd%s",
219 (intmax_t)fsbtodb(&sblock, cgsblock(&sblock, cylno)),
220 cylno < (sblock.fs_ncg - 1) ? "," : "" );
221 if (i + j >= width) {
226 printf("%s", tmpbuf);
232 * Do all needed changes in the first cylinder group.
233 * allocate blocks in new location
235 updcsloc(modtime, fsi, fso, Nflag);
238 * Now write the cylinder summary back to disk.
240 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) {
241 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
242 (size_t)MIN(sblock.fs_cssize - i, sblock.fs_bsize),
243 (void *)(((char *)fscs) + i), fso, Nflag);
245 DBG_PRINT0("fscs written\n");
249 struct csum *dbg_csp;
254 for (dbg_csc = 0; dbg_csc < sblock.fs_ncg; dbg_csc++) {
255 snprintf(dbg_line, sizeof(dbg_line),
256 "%d. new csum in new location", dbg_csc);
257 DBG_DUMP_CSUM(&sblock, dbg_line, dbg_csp++);
260 #endif /* FS_DEBUG */
263 * Now write the new superblock back to disk.
265 sblock.fs_time = modtime;
266 wtfs(sblockloc, (size_t)SBLOCKSIZE, (void *)&sblock, fso, Nflag);
267 DBG_PRINT0("sblock written\n");
268 DBG_DUMP_FS(&sblock, "new initial sblock");
271 * Clean up the dynamic fields in our superblock copies.
276 sblock.fs_cgrotor = 0;
278 memset((void *)&sblock.fs_fsmnt, 0, sizeof(sblock.fs_fsmnt));
279 sblock.fs_flags &= FS_DOSOFTDEP;
283 * The following fields are currently distributed from the superblock
291 * fs_flags regarding SOFTPDATES
293 * We probably should rather change the summary for the cylinder group
294 * statistics here to the value of what would be in there, if the file
295 * system were created initially with the new size. Therefor we still
296 * need to find an easy way of calculating that.
297 * Possibly we can try to read the first superblock copy and apply the
298 * "diffed" stats between the old and new superblock by still copying
299 * certain parameters onto that.
303 * Write out the duplicate super blocks.
305 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
306 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
307 (size_t)SBLOCKSIZE, (void *)&sblock, fso, Nflag);
309 DBG_PRINT0("sblock copies written\n");
310 DBG_DUMP_FS(&sblock, "new other sblocks");
317 * This creates a new cylinder group structure, for more details please see
318 * the source of newfs(8), as this function is taken over almost unchanged.
319 * As this is never called for the first cylinder group, the special
320 * provisions for that case are removed here.
323 initcg(int cylno, time_t modtime, int fso, unsigned int Nflag)
326 static caddr_t iobuf;
329 ufs2_daddr_t i, cbase, dmax;
330 struct ufs1_dinode *dp1;
332 uint j, d, dupper, dlower;
334 if (iobuf == NULL && (iobuf = malloc(sblock.fs_bsize * 3)) == NULL)
335 errx(37, "panic: cannot allocate I/O buffer");
338 * Determine block bounds for cylinder group.
339 * Allow space for super block summary information in first
342 cbase = cgbase(&sblock, cylno);
343 dmax = cbase + sblock.fs_fpg;
344 if (dmax > sblock.fs_size)
345 dmax = sblock.fs_size;
346 dlower = cgsblock(&sblock, cylno) - cbase;
347 dupper = cgdmin(&sblock, cylno) - cbase;
348 if (cylno == 0) /* XXX fscs may be relocated */
349 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
351 memset(&acg, 0, sblock.fs_cgsize);
352 acg.cg_time = modtime;
353 acg.cg_magic = CG_MAGIC;
355 acg.cg_niblk = sblock.fs_ipg;
356 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ?
357 sblock.fs_ipg : 2 * INOPB(&sblock);
358 acg.cg_ndblk = dmax - cbase;
359 if (sblock.fs_contigsumsize > 0)
360 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
361 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
362 if (sblock.fs_magic == FS_UFS2_MAGIC) {
363 acg.cg_iusedoff = start;
365 acg.cg_old_ncyl = sblock.fs_old_cpg;
366 acg.cg_old_time = acg.cg_time;
368 acg.cg_old_niblk = acg.cg_niblk;
370 acg.cg_initediblk = 0;
371 acg.cg_old_btotoff = start;
372 acg.cg_old_boff = acg.cg_old_btotoff +
373 sblock.fs_old_cpg * sizeof(int32_t);
374 acg.cg_iusedoff = acg.cg_old_boff +
375 sblock.fs_old_cpg * sizeof(u_int16_t);
377 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT);
378 acg.cg_nextfreeoff = acg.cg_freeoff + howmany(sblock.fs_fpg, CHAR_BIT);
379 if (sblock.fs_contigsumsize > 0) {
380 acg.cg_clustersumoff =
381 roundup(acg.cg_nextfreeoff, sizeof(u_int32_t));
382 acg.cg_clustersumoff -= sizeof(u_int32_t);
383 acg.cg_clusteroff = acg.cg_clustersumoff +
384 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
385 acg.cg_nextfreeoff = acg.cg_clusteroff +
386 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT);
388 if (acg.cg_nextfreeoff > (unsigned)sblock.fs_cgsize) {
390 * This should never happen as we would have had that panic
391 * already on file system creation
393 errx(37, "panic: cylinder group too big");
395 acg.cg_cs.cs_nifree += sblock.fs_ipg;
397 for (ino = 0; ino < ROOTINO; ino++) {
398 setbit(cg_inosused(&acg), ino);
399 acg.cg_cs.cs_nifree--;
402 * For the old file system, we have to initialize all the inodes.
404 if (sblock.fs_magic == FS_UFS1_MAGIC) {
405 bzero(iobuf, sblock.fs_bsize);
406 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock);
407 i += sblock.fs_frag) {
408 dp1 = (struct ufs1_dinode *)(void *)iobuf;
409 for (j = 0; j < INOPB(&sblock); j++) {
410 dp1->di_gen = random();
413 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
414 sblock.fs_bsize, iobuf, fso, Nflag);
419 * In cylno 0, beginning space is reserved
420 * for boot and super blocks.
422 for (d = 0; d < dlower; d += sblock.fs_frag) {
423 blkno = d / sblock.fs_frag;
424 setblock(&sblock, cg_blksfree(&acg), blkno);
425 if (sblock.fs_contigsumsize > 0)
426 setbit(cg_clustersfree(&acg), blkno);
427 acg.cg_cs.cs_nbfree++;
429 sblock.fs_dsize += dlower;
431 sblock.fs_dsize += acg.cg_ndblk - dupper;
432 if ((i = dupper % sblock.fs_frag)) {
433 acg.cg_frsum[sblock.fs_frag - i]++;
434 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
435 setbit(cg_blksfree(&acg), dupper);
436 acg.cg_cs.cs_nffree++;
439 for (d = dupper; d + sblock.fs_frag <= acg.cg_ndblk;
440 d += sblock.fs_frag) {
441 blkno = d / sblock.fs_frag;
442 setblock(&sblock, cg_blksfree(&acg), blkno);
443 if (sblock.fs_contigsumsize > 0)
444 setbit(cg_clustersfree(&acg), blkno);
445 acg.cg_cs.cs_nbfree++;
447 if (d < acg.cg_ndblk) {
448 acg.cg_frsum[acg.cg_ndblk - d]++;
449 for (; d < acg.cg_ndblk; d++) {
450 setbit(cg_blksfree(&acg), d);
451 acg.cg_cs.cs_nffree++;
454 if (sblock.fs_contigsumsize > 0) {
455 int32_t *sump = cg_clustersum(&acg);
456 u_char *mapp = cg_clustersfree(&acg);
461 for (i = 0; i < acg.cg_nclusterblks; i++) {
462 if ((map & bit) != 0)
465 if (run > sblock.fs_contigsumsize)
466 run = sblock.fs_contigsumsize;
470 if ((i & (CHAR_BIT - 1)) != CHAR_BIT - 1)
478 if (run > sblock.fs_contigsumsize)
479 run = sblock.fs_contigsumsize;
483 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
484 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
485 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
486 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
489 memcpy(iobuf, &acg, sblock.fs_cgsize);
490 memset(iobuf + sblock.fs_cgsize, '\0',
491 sblock.fs_bsize * 3 - sblock.fs_cgsize);
493 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
494 sblock.fs_bsize * 3, iobuf, fso, Nflag);
495 DBG_DUMP_CG(&sblock, "new cg", &acg);
502 * Here we add or subtract (sign +1/-1) the available fragments in a given
503 * block to or from the fragment statistics. By subtracting before and adding
504 * after an operation on the free frag map we can easy update the fragment
505 * statistic, which seems to be otherwise a rather complex operation.
508 frag_adjust(ufs2_daddr_t frag, int sign)
510 DBG_FUNC("frag_adjust")
518 * Here frag only needs to point to any fragment in the block we want
521 for (f = rounddown(frag, sblock.fs_frag);
522 f < roundup(frag + 1, sblock.fs_frag); f++) {
524 * Count contiguous free fragments.
526 if (isset(cg_blksfree(&acg), f)) {
529 if (fragsize && fragsize < sblock.fs_frag) {
531 * We found something in between.
533 acg.cg_frsum[fragsize] += sign;
534 DBG_PRINT2("frag_adjust [%d]+=%d\n",
540 if (fragsize && fragsize < sblock.fs_frag) {
542 * We found something.
544 acg.cg_frsum[fragsize] += sign;
545 DBG_PRINT2("frag_adjust [%d]+=%d\n", fragsize, sign);
547 DBG_PRINT2("frag_adjust [[%d]]+=%d\n", fragsize, sign);
554 * Here we do all needed work for the former last cylinder group. It has to be
555 * changed in any case, even if the file system ended exactly on the end of
556 * this group, as there is some slightly inconsistent handling of the number
557 * of cylinders in the cylinder group. We start again by reading the cylinder
558 * group from disk. If the last block was not fully available, we first handle
559 * the missing fragments, then we handle all new full blocks in that file
560 * system and finally we handle the new last fragmented block in the file
561 * system. We again have to handle the fragment statistics rotational layout
562 * tables and cluster summary during all those operations.
565 updjcg(int cylno, time_t modtime, int fsi, int fso, unsigned int Nflag)
568 ufs2_daddr_t cbase, dmax, dupper;
576 * Read the former last (joining) cylinder group from disk, and make
579 rdfs(fsbtodb(&osblock, cgtod(&osblock, cylno)),
580 (size_t)osblock.fs_cgsize, (void *)&aocg, fsi);
581 DBG_PRINT0("jcg read\n");
582 DBG_DUMP_CG(&sblock, "old joining cg", &aocg);
584 memcpy((void *)&cgun1, (void *)&cgun2, sizeof(cgun2));
587 * If the cylinder group had already its new final size almost
588 * nothing is to be done ... except:
589 * For some reason the value of cg_ncyl in the last cylinder group has
590 * to be zero instead of fs_cpg. As this is now no longer the last
591 * cylinder group we have to change that value now to fs_cpg.
594 if (cgbase(&osblock, cylno + 1) == osblock.fs_size) {
595 if (sblock.fs_magic == FS_UFS1_MAGIC)
596 acg.cg_old_ncyl = sblock.fs_old_cpg;
598 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
599 (size_t)sblock.fs_cgsize, (void *)&acg, fso, Nflag);
600 DBG_PRINT0("jcg written\n");
601 DBG_DUMP_CG(&sblock, "new joining cg", &acg);
608 * Set up some variables needed later.
610 cbase = cgbase(&sblock, cylno);
611 dmax = cbase + sblock.fs_fpg;
612 if (dmax > sblock.fs_size)
613 dmax = sblock.fs_size;
614 dupper = cgdmin(&sblock, cylno) - cbase;
615 if (cylno == 0) /* XXX fscs may be relocated */
616 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
619 * Set pointer to the cylinder summary for our cylinder group.
624 * Touch the cylinder group, update all fields in the cylinder group as
625 * needed, update the free space in the superblock.
627 acg.cg_time = modtime;
628 if ((unsigned)cylno == sblock.fs_ncg - 1) {
630 * This is still the last cylinder group.
632 if (sblock.fs_magic == FS_UFS1_MAGIC)
634 sblock.fs_old_ncyl % sblock.fs_old_cpg;
636 acg.cg_old_ncyl = sblock.fs_old_cpg;
638 DBG_PRINT2("jcg dbg: %d %u", cylno, sblock.fs_ncg);
640 if (sblock.fs_magic == FS_UFS1_MAGIC)
641 DBG_PRINT2("%d %u", acg.cg_old_ncyl, sblock.fs_old_cpg);
644 acg.cg_ndblk = dmax - cbase;
645 sblock.fs_dsize += acg.cg_ndblk - aocg.cg_ndblk;
646 if (sblock.fs_contigsumsize > 0)
647 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
650 * Now we have to update the free fragment bitmap for our new free
651 * space. There again we have to handle the fragmentation and also
652 * the rotational layout tables and the cluster summary. This is
653 * also done per fragment for the first new block if the old file
654 * system end was not on a block boundary, per fragment for the new
655 * last block if the new file system end is not on a block boundary,
656 * and per block for all space in between.
658 * Handle the first new block here if it was partially available
661 if (osblock.fs_size % sblock.fs_frag) {
662 if (roundup(osblock.fs_size, sblock.fs_frag) <=
665 * The new space is enough to fill at least this
669 for (i = roundup(osblock.fs_size - cbase,
670 sblock.fs_frag) - 1; i >= osblock.fs_size - cbase;
672 setbit(cg_blksfree(&acg), i);
673 acg.cg_cs.cs_nffree++;
678 * Check if the fragment just created could join an
679 * already existing fragment at the former end of the
682 if (isblock(&sblock, cg_blksfree(&acg),
683 ((osblock.fs_size - cgbase(&sblock, cylno)) /
686 * The block is now completely available.
688 DBG_PRINT0("block was\n");
689 acg.cg_frsum[osblock.fs_size % sblock.fs_frag]--;
690 acg.cg_cs.cs_nbfree++;
691 acg.cg_cs.cs_nffree -= sblock.fs_frag;
692 k = rounddown(osblock.fs_size - cbase,
694 updclst((osblock.fs_size - cbase) /
698 * Lets rejoin a possible partially growed
702 while (isset(cg_blksfree(&acg), i) &&
703 (i >= rounddown(osblock.fs_size - cbase,
710 acg.cg_frsum[k + j]++;
714 * We only grow by some fragments within this last
717 for (i = sblock.fs_size - cbase - 1;
718 i >= osblock.fs_size - cbase; i--) {
719 setbit(cg_blksfree(&acg), i);
720 acg.cg_cs.cs_nffree++;
724 * Lets rejoin a possible partially growed fragment.
727 while (isset(cg_blksfree(&acg), i) &&
728 (i >= rounddown(osblock.fs_size - cbase,
735 acg.cg_frsum[k + j]++;
740 * Handle all new complete blocks here.
742 for (i = roundup(osblock.fs_size - cbase, sblock.fs_frag);
743 i + sblock.fs_frag <= dmax - cbase; /* XXX <= or only < ? */
744 i += sblock.fs_frag) {
745 j = i / sblock.fs_frag;
746 setblock(&sblock, cg_blksfree(&acg), j);
748 acg.cg_cs.cs_nbfree++;
752 * Handle the last new block if there are stll some new fragments left.
753 * Here we don't have to bother about the cluster summary or the even
754 * the rotational layout table.
756 if (i < (dmax - cbase)) {
757 acg.cg_frsum[dmax - cbase - i]++;
758 for (; i < dmax - cbase; i++) {
759 setbit(cg_blksfree(&acg), i);
760 acg.cg_cs.cs_nffree++;
764 sblock.fs_cstotal.cs_nffree +=
765 (acg.cg_cs.cs_nffree - aocg.cg_cs.cs_nffree);
766 sblock.fs_cstotal.cs_nbfree +=
767 (acg.cg_cs.cs_nbfree - aocg.cg_cs.cs_nbfree);
769 * The following statistics are not changed here:
770 * sblock.fs_cstotal.cs_ndir
771 * sblock.fs_cstotal.cs_nifree
772 * As the statistics for this cylinder group are ready, copy it to
773 * the summary information array.
778 * Write the updated "joining" cylinder group back to disk.
780 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)), (size_t)sblock.fs_cgsize,
781 (void *)&acg, fso, Nflag);
782 DBG_PRINT0("jcg written\n");
783 DBG_DUMP_CG(&sblock, "new joining cg", &acg);
790 * Here we update the location of the cylinder summary. We have two possible
791 * ways of growing the cylinder summary:
792 * (1) We can try to grow the summary in the current location, and relocate
793 * possibly used blocks within the current cylinder group.
794 * (2) Alternatively we can relocate the whole cylinder summary to the first
795 * new completely empty cylinder group. Once the cylinder summary is no
796 * longer in the beginning of the first cylinder group you should never
797 * use a version of fsck which is not aware of the possibility to have
798 * this structure in a non standard place.
799 * Option (2) is considered to be less intrusive to the structure of the file-
800 * system, so that's the one being used.
803 updcsloc(time_t modtime, int fsi, int fso, unsigned int Nflag)
814 if (howmany(sblock.fs_cssize, sblock.fs_fsize) ==
815 howmany(osblock.fs_cssize, osblock.fs_fsize)) {
817 * No new fragment needed.
822 ocscg = dtog(&osblock, osblock.fs_csaddr);
826 * Read original cylinder group from disk, and make a copy.
827 * XXX If Nflag is set in some very rare cases we now miss
828 * some changes done in updjcg by reading the unmodified
831 rdfs(fsbtodb(&osblock, cgtod(&osblock, ocscg)),
832 (size_t)osblock.fs_cgsize, (void *)&aocg, fsi);
833 DBG_PRINT0("oscg read\n");
834 DBG_DUMP_CG(&sblock, "old summary cg", &aocg);
836 memcpy((void *)&cgun1, (void *)&cgun2, sizeof(cgun2));
839 * Touch the cylinder group, set up local variables needed later
840 * and update the superblock.
842 acg.cg_time = modtime;
845 * XXX In the case of having active snapshots we may need much more
846 * blocks for the copy on write. We need each block twice, and
847 * also up to 8*3 blocks for indirect blocks for all possible
851 * There is not enough space in the old cylinder group to
852 * relocate all blocks as needed, so we relocate the whole
853 * cylinder group summary to a new group. We try to use the
854 * first complete new cylinder group just created. Within the
855 * cylinder group we align the area immediately after the
856 * cylinder group information location in order to be as
857 * close as possible to the original implementation of ffs.
859 * First we have to make sure we'll find enough space in the
860 * new cylinder group. If not, then we currently give up.
861 * We start with freeing everything which was used by the
862 * fragments of the old cylinder summary in the current group.
863 * Now we write back the group meta data, read in the needed
864 * meta data from the new cylinder group, and start allocating
865 * within that group. Here we can assume, the group to be
866 * completely empty. Which makes the handling of fragments and
867 * clusters a lot easier.
870 if (sblock.fs_ncg - osblock.fs_ncg < 2)
871 errx(2, "panic: not enough space");
874 * Point "d" to the first fragment not used by the cylinder
877 d = osblock.fs_csaddr + (osblock.fs_cssize / osblock.fs_fsize);
880 * Set up last cluster size ("lcs") already here. Calculate
881 * the size for the trailing cluster just behind where "d"
884 if (sblock.fs_contigsumsize > 0) {
885 for (block = howmany(d % sblock.fs_fpg, sblock.fs_frag),
886 lcs = 0; lcs < sblock.fs_contigsumsize; block++, lcs++) {
887 if (isclr(cg_clustersfree(&acg), block))
893 * Point "d" to the last frag used by the cylinder summary.
897 DBG_PRINT1("d=%jd\n", (intmax_t)d);
898 if ((d + 1) % sblock.fs_frag) {
900 * The end of the cylinder summary is not a complete
904 frag_adjust(d % sblock.fs_fpg, -1);
905 for (; (d + 1) % sblock.fs_frag; d--) {
906 DBG_PRINT1("d=%jd\n", (intmax_t)d);
907 setbit(cg_blksfree(&acg), d % sblock.fs_fpg);
908 acg.cg_cs.cs_nffree++;
909 sblock.fs_cstotal.cs_nffree++;
912 * Point "d" to the last fragment of the last
913 * (incomplete) block of the cylinder summary.
916 frag_adjust(d % sblock.fs_fpg, 1);
918 if (isblock(&sblock, cg_blksfree(&acg),
919 (d % sblock.fs_fpg) / sblock.fs_frag)) {
920 DBG_PRINT1("d=%jd\n", (intmax_t)d);
921 acg.cg_cs.cs_nffree -= sblock.fs_frag;
922 acg.cg_cs.cs_nbfree++;
923 sblock.fs_cstotal.cs_nffree -= sblock.fs_frag;
924 sblock.fs_cstotal.cs_nbfree++;
925 if (sblock.fs_contigsumsize > 0) {
926 setbit(cg_clustersfree(&acg),
927 (d % sblock.fs_fpg) / sblock.fs_frag);
928 if (lcs < sblock.fs_contigsumsize) {
930 cg_clustersum(&acg)[lcs]--;
932 cg_clustersum(&acg)[lcs]++;
937 * Point "d" to the first fragment of the block before
938 * the last incomplete block.
943 DBG_PRINT1("d=%jd\n", (intmax_t)d);
944 for (d = rounddown(d, sblock.fs_frag); d >= osblock.fs_csaddr;
945 d -= sblock.fs_frag) {
947 DBG_PRINT1("d=%jd\n", (intmax_t)d);
948 setblock(&sblock, cg_blksfree(&acg),
949 (d % sblock.fs_fpg) / sblock.fs_frag);
950 acg.cg_cs.cs_nbfree++;
951 sblock.fs_cstotal.cs_nbfree++;
952 if (sblock.fs_contigsumsize > 0) {
953 setbit(cg_clustersfree(&acg),
954 (d % sblock.fs_fpg) / sblock.fs_frag);
956 * The last cluster size is already set up.
958 if (lcs < sblock.fs_contigsumsize) {
960 cg_clustersum(&acg)[lcs]--;
962 cg_clustersum(&acg)[lcs]++;
969 * Now write the former cylinder group containing the cylinder
970 * summary back to disk.
972 wtfs(fsbtodb(&sblock, cgtod(&sblock, ocscg)),
973 (size_t)sblock.fs_cgsize, (void *)&acg, fso, Nflag);
974 DBG_PRINT0("oscg written\n");
975 DBG_DUMP_CG(&sblock, "old summary cg", &acg);
978 * Find the beginning of the new cylinder group containing the
981 sblock.fs_csaddr = cgdmin(&sblock, osblock.fs_ncg);
982 ncscg = dtog(&sblock, sblock.fs_csaddr);
986 * If Nflag is specified, we would now read random data instead
987 * of an empty cg structure from disk. So we can't simulate that
991 DBG_PRINT0("nscg update skipped\n");
997 * Read the future cylinder group containing the cylinder
998 * summary from disk, and make a copy.
1000 rdfs(fsbtodb(&sblock, cgtod(&sblock, ncscg)),
1001 (size_t)sblock.fs_cgsize, (void *)&aocg, fsi);
1002 DBG_PRINT0("nscg read\n");
1003 DBG_DUMP_CG(&sblock, "new summary cg", &aocg);
1005 memcpy((void *)&cgun1, (void *)&cgun2, sizeof(cgun2));
1008 * Allocate all complete blocks used by the new cylinder
1011 for (d = sblock.fs_csaddr; d + sblock.fs_frag <=
1012 sblock.fs_csaddr + (sblock.fs_cssize / sblock.fs_fsize);
1013 d += sblock.fs_frag) {
1014 clrblock(&sblock, cg_blksfree(&acg),
1015 (d % sblock.fs_fpg) / sblock.fs_frag);
1016 acg.cg_cs.cs_nbfree--;
1017 sblock.fs_cstotal.cs_nbfree--;
1018 if (sblock.fs_contigsumsize > 0) {
1019 clrbit(cg_clustersfree(&acg),
1020 (d % sblock.fs_fpg) / sblock.fs_frag);
1025 * Allocate all fragments used by the cylinder summary in the
1028 if (d < sblock.fs_csaddr + (sblock.fs_cssize / sblock.fs_fsize)) {
1029 for (; d - sblock.fs_csaddr <
1030 sblock.fs_cssize/sblock.fs_fsize; d++) {
1031 clrbit(cg_blksfree(&acg), d % sblock.fs_fpg);
1032 acg.cg_cs.cs_nffree--;
1033 sblock.fs_cstotal.cs_nffree--;
1035 acg.cg_cs.cs_nbfree--;
1036 acg.cg_cs.cs_nffree += sblock.fs_frag;
1037 sblock.fs_cstotal.cs_nbfree--;
1038 sblock.fs_cstotal.cs_nffree += sblock.fs_frag;
1039 if (sblock.fs_contigsumsize > 0)
1040 clrbit(cg_clustersfree(&acg),
1041 (d % sblock.fs_fpg) / sblock.fs_frag);
1043 frag_adjust(d % sblock.fs_fpg, 1);
1046 * XXX Handle the cluster statistics here in the case this
1047 * cylinder group is now almost full, and the remaining
1048 * space is less then the maximum cluster size. This is
1049 * probably not needed, as you would hardly find a file
1050 * system which has only MAXCSBUFS+FS_MAXCONTIG of free
1051 * space right behind the cylinder group information in
1052 * any new cylinder group.
1056 * Update our statistics in the cylinder summary.
1061 * Write the new cylinder group containing the cylinder summary
1064 wtfs(fsbtodb(&sblock, cgtod(&sblock, ncscg)),
1065 (size_t)sblock.fs_cgsize, (void *)&acg, fso, Nflag);
1066 DBG_PRINT0("nscg written\n");
1067 DBG_DUMP_CG(&sblock, "new summary cg", &acg);
1074 * Here we read some block(s) from disk.
1077 rdfs(ufs2_daddr_t bno, size_t size, void *bf, int fsi)
1085 err(32, "rdfs: attempting to read negative block number");
1086 if (lseek(fsi, (off_t)bno * DEV_BSIZE, 0) < 0)
1087 err(33, "rdfs: seek error: %jd", (intmax_t)bno);
1088 n = read(fsi, bf, size);
1089 if (n != (ssize_t)size)
1090 err(34, "rdfs: read error: %jd", (intmax_t)bno);
1097 * Here we write some block(s) to disk.
1100 wtfs(ufs2_daddr_t bno, size_t size, void *bf, int fso, unsigned int Nflag)
1111 if (lseek(fso, (off_t)bno * DEV_BSIZE, SEEK_SET) < 0)
1112 err(35, "wtfs: seek error: %ld", (long)bno);
1113 n = write(fso, bf, size);
1114 if (n != (ssize_t)size)
1115 err(36, "wtfs: write error: %ld", (long)bno);
1122 * Here we check if all frags of a block are free. For more details again
1123 * please see the source of newfs(8), as this function is taken over almost
1127 isblock(struct fs *fs, unsigned char *cp, int h)
1134 switch (fs->fs_frag) {
1137 return (cp[h] == 0xff);
1139 mask = 0x0f << ((h & 0x1) << 2);
1141 return ((cp[h >> 1] & mask) == mask);
1143 mask = 0x03 << ((h & 0x3) << 1);
1145 return ((cp[h >> 2] & mask) == mask);
1147 mask = 0x01 << (h & 0x7);
1149 return ((cp[h >> 3] & mask) == mask);
1151 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1158 * Here we allocate a complete block in the block map. For more details again
1159 * please see the source of newfs(8), as this function is taken over almost
1163 clrblock(struct fs *fs, unsigned char *cp, int h)
1165 DBG_FUNC("clrblock")
1169 switch ((fs)->fs_frag) {
1174 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1177 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1180 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1183 warnx("clrblock bad fs_frag %d", fs->fs_frag);
1192 * Here we free a complete block in the free block map. For more details again
1193 * please see the source of newfs(8), as this function is taken over almost
1197 setblock(struct fs *fs, unsigned char *cp, int h)
1199 DBG_FUNC("setblock")
1203 switch (fs->fs_frag) {
1208 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1211 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1214 cp[h >> 3] |= (0x01 << (h & 0x7));
1217 warnx("setblock bad fs_frag %d", fs->fs_frag);
1226 * Figure out how many lines our current terminal has. For more details again
1227 * please see the source of newfs(8), as this function is taken over almost
1233 DBG_FUNC("charsperline")
1241 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1242 columns = ws.ws_col;
1243 if (columns == 0 && (cp = getenv("COLUMNS")))
1246 columns = 80; /* last resort */
1253 is_dev(const char *name)
1255 struct stat devstat;
1257 if (stat(name, &devstat) != 0)
1259 if (!S_ISCHR(devstat.st_mode))
1265 * Return mountpoint on which the device is currently mounted.
1267 static const struct statfs *
1268 dev_to_statfs(const char *dev)
1270 struct stat devstat, mntdevstat;
1271 struct statfs *mntbuf, *statfsp;
1272 char device[MAXPATHLEN];
1277 * First check the mounted filesystems.
1279 if (stat(dev, &devstat) != 0)
1281 if (!S_ISCHR(devstat.st_mode) && !S_ISBLK(devstat.st_mode))
1284 mntsize = getmntinfo(&mntbuf, MNT_NOWAIT);
1285 for (i = 0; i < mntsize; i++) {
1286 statfsp = &mntbuf[i];
1287 mntdevname = statfsp->f_mntfromname;
1288 if (*mntdevname != '/') {
1289 strcpy(device, _PATH_DEV);
1290 strcat(device, mntdevname);
1291 mntdevname = device;
1293 if (stat(mntdevname, &mntdevstat) == 0 &&
1294 mntdevstat.st_rdev == devstat.st_rdev)
1302 mountpoint_to_dev(const char *mountpoint)
1304 struct statfs *mntbuf, *statfsp;
1309 * First check the mounted filesystems.
1311 mntsize = getmntinfo(&mntbuf, MNT_NOWAIT);
1312 for (i = 0; i < mntsize; i++) {
1313 statfsp = &mntbuf[i];
1315 if (strcmp(statfsp->f_mntonname, mountpoint) == 0)
1316 return (statfsp->f_mntfromname);
1322 fs = getfsfile(mountpoint);
1324 return (fs->fs_spec);
1330 getdev(const char *name)
1332 static char device[MAXPATHLEN];
1333 const char *cp, *dev;
1338 cp = strrchr(name, '/');
1340 snprintf(device, sizeof(device), "%s%s", _PATH_DEV, name);
1345 dev = mountpoint_to_dev(name);
1346 if (dev != NULL && is_dev(dev))
1353 * growfs(8) is a utility which allows to increase the size of an existing
1354 * ufs file system. Currently this can only be done on unmounted file system.
1355 * It recognizes some command line options to specify the new desired size,
1356 * and it does some basic checkings. The old file system size is determined
1357 * and after some more checks like we can really access the new last block
1358 * on the disk etc. we calculate the new parameters for the superblock. After
1359 * having done this we just call growfs() which will do the work.
1360 * We still have to provide support for snapshots. Therefore we first have to
1361 * understand what data structures are always replicated in the snapshot on
1362 * creation, for all other blocks we touch during our procedure, we have to
1363 * keep the old blocks unchanged somewhere available for the snapshots. If we
1364 * are lucky, then we only have to handle our blocks to be relocated in that
1366 * Also we have to consider in what order we actually update the critical
1367 * data structures of the file system to make sure, that in case of a disaster
1368 * fsck(8) is still able to restore any lost data.
1369 * The foreseen last step then will be to provide for growing even mounted
1370 * file systems. There we have to extend the mount() system call to provide
1371 * userland access to the file system locking facility.
1374 main(int argc, char **argv)
1378 const struct statfs *statfsp;
1381 int error, i, j, fsi, fso, ch, Nflag = 0, yflag = 0;
1382 char *p, reply[5], oldsizebuf[6], newsizebuf[6];
1387 while ((ch = getopt(argc, argv, "Ns:vy")) != -1) {
1393 size = (off_t)strtoumax(optarg, &p, 0);
1394 if (p == NULL || *p == '\0')
1396 else if (*p == 'b' || *p == 'B')
1398 else if (*p == 'k' || *p == 'K')
1400 else if (*p == 'm' || *p == 'M')
1402 else if (*p == 'g' || *p == 'G')
1404 else if (*p == 't' || *p == 'T') {
1408 errx(1, "unknown suffix on -s argument");
1410 case 'v': /* for compatibility to newfs */
1428 * Now try to guess the device name.
1430 device = getdev(*argv);
1432 errx(1, "cannot find special device for %s", *argv);
1434 statfsp = dev_to_statfs(device);
1436 fsi = open(device, O_RDONLY);
1438 err(1, "%s", device);
1441 * Try to guess the slice size if not specified.
1443 if (ioctl(fsi, DIOCGMEDIASIZE, &mediasize) == -1)
1444 err(1,"DIOCGMEDIASIZE");
1447 * Check if that partition is suitable for growing a file system.
1450 errx(1, "partition is unavailable");
1453 * Read the current superblock, and take a backup.
1455 for (i = 0; sblock_try[i] != -1; i++) {
1456 sblockloc = sblock_try[i] / DEV_BSIZE;
1457 rdfs(sblockloc, (size_t)SBLOCKSIZE, (void *)&(osblock), fsi);
1458 if ((osblock.fs_magic == FS_UFS1_MAGIC ||
1459 (osblock.fs_magic == FS_UFS2_MAGIC &&
1460 osblock.fs_sblockloc == sblock_try[i])) &&
1461 osblock.fs_bsize <= MAXBSIZE &&
1462 osblock.fs_bsize >= (int32_t) sizeof(struct fs))
1465 if (sblock_try[i] == -1)
1466 errx(1, "superblock not recognized");
1467 memcpy((void *)&fsun1, (void *)&fsun2, sizeof(fsun2));
1469 DBG_OPEN("/tmp/growfs.debug"); /* already here we need a superblock */
1470 DBG_DUMP_FS(&sblock, "old sblock");
1473 * Determine size to grow to. Default to the device size.
1478 if (size > (uint64_t)mediasize) {
1479 humanize_number(oldsizebuf, sizeof(oldsizebuf), size,
1480 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1481 humanize_number(newsizebuf, sizeof(newsizebuf),
1483 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1485 errx(1, "requested size %s is larger "
1486 "than the available %s", oldsizebuf, newsizebuf);
1491 * Make sure the new size is a multiple of fs_fsize; /dev/ufssuspend
1492 * only supports fragment-aligned IO requests.
1494 size -= size % osblock.fs_fsize;
1496 if (size <= (uint64_t)(osblock.fs_size * osblock.fs_fsize)) {
1497 humanize_number(oldsizebuf, sizeof(oldsizebuf),
1498 osblock.fs_size * osblock.fs_fsize,
1499 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1500 humanize_number(newsizebuf, sizeof(newsizebuf), size,
1501 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1503 errx(1, "requested size %s is not larger than the current "
1504 "filesystem size %s", newsizebuf, oldsizebuf);
1507 sblock.fs_size = dbtofsb(&osblock, size / DEV_BSIZE);
1508 sblock.fs_providersize = dbtofsb(&osblock, mediasize / DEV_BSIZE);
1511 * Are we really growing?
1513 if (osblock.fs_size >= sblock.fs_size) {
1514 errx(1, "we are not growing (%jd->%jd)",
1515 (intmax_t)osblock.fs_size, (intmax_t)sblock.fs_size);
1519 * Check if we find an active snapshot.
1522 for (j = 0; j < FSMAXSNAP; j++) {
1523 if (sblock.fs_snapinum[j]) {
1524 errx(1, "active snapshot found in file system; "
1525 "please remove all snapshots before "
1528 if (!sblock.fs_snapinum[j]) /* list is dense */
1533 if (yflag == 0 && Nflag == 0) {
1534 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) == 0)
1535 printf("Device is mounted read-write; resizing will "
1536 "result in temporary write suspension for %s.\n",
1537 statfsp->f_mntonname);
1538 printf("It's strongly recommended to make a backup "
1539 "before growing the file system.\n"
1540 "OK to grow filesystem on %s", device);
1541 if (statfsp != NULL)
1542 printf(", mounted on %s,", statfsp->f_mntonname);
1543 humanize_number(oldsizebuf, sizeof(oldsizebuf),
1544 osblock.fs_size * osblock.fs_fsize,
1545 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1546 humanize_number(newsizebuf, sizeof(newsizebuf),
1547 sblock.fs_size * sblock.fs_fsize,
1548 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1549 printf(" from %s to %s? [Yes/No] ", oldsizebuf, newsizebuf);
1551 fgets(reply, (int)sizeof(reply), stdin);
1552 if (strcmp(reply, "Yes\n")){
1553 printf("\nNothing done\n");
1559 * Try to access our device for writing. If it's not mounted,
1560 * or mounted read-only, simply open it; otherwise, use UFS
1561 * suspension mechanism.
1566 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) == 0) {
1567 fso = open(_PATH_UFSSUSPEND, O_RDWR);
1569 err(1, "unable to open %s", _PATH_UFSSUSPEND);
1570 error = ioctl(fso, UFSSUSPEND, &statfsp->f_fsid);
1572 err(1, "UFSSUSPEND");
1574 fso = open(device, O_WRONLY);
1576 err(1, "%s", device);
1581 * Try to access our new last block in the file system.
1583 testbuf = malloc(sblock.fs_fsize);
1584 if (testbuf == NULL)
1586 rdfs((ufs2_daddr_t)((size - sblock.fs_fsize) / DEV_BSIZE),
1587 sblock.fs_fsize, testbuf, fsi);
1588 wtfs((ufs2_daddr_t)((size - sblock.fs_fsize) / DEV_BSIZE),
1589 sblock.fs_fsize, testbuf, fso, Nflag);
1593 * Now calculate new superblock values and check for reasonable
1594 * bound for new file system size:
1595 * fs_size: is derived from user input
1596 * fs_dsize: should get updated in the routines creating or
1597 * updating the cylinder groups on the fly
1598 * fs_cstotal: should get updated in the routines creating or
1599 * updating the cylinder groups
1603 * Update the number of cylinders and cylinder groups in the file system.
1605 if (sblock.fs_magic == FS_UFS1_MAGIC) {
1606 sblock.fs_old_ncyl =
1607 sblock.fs_size * sblock.fs_old_nspf / sblock.fs_old_spc;
1608 if (sblock.fs_size * sblock.fs_old_nspf >
1609 sblock.fs_old_ncyl * sblock.fs_old_spc)
1610 sblock.fs_old_ncyl++;
1612 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg);
1615 * Allocate last cylinder group only if there is enough room
1616 * for at least one data block.
1618 if (sblock.fs_size % sblock.fs_fpg != 0 &&
1619 sblock.fs_size <= cgdmin(&sblock, sblock.fs_ncg - 1)) {
1620 humanize_number(oldsizebuf, sizeof(oldsizebuf),
1621 (sblock.fs_size % sblock.fs_fpg) * sblock.fs_fsize,
1622 "B", HN_AUTOSCALE, HN_B | HN_NOSPACE | HN_DECIMAL);
1623 warnx("no room to allocate last cylinder group; "
1624 "leaving %s unused", oldsizebuf);
1626 if (sblock.fs_magic == FS_UFS1_MAGIC)
1627 sblock.fs_old_ncyl = sblock.fs_ncg * sblock.fs_old_cpg;
1628 sblock.fs_size = sblock.fs_ncg * sblock.fs_fpg;
1632 * Update the space for the cylinder group summary information in the
1633 * respective cylinder group data area.
1636 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
1638 if (osblock.fs_size >= sblock.fs_size)
1639 errx(1, "not enough new space");
1641 DBG_PRINT0("sblock calculated\n");
1644 * Ok, everything prepared, so now let's do the tricks.
1646 growfs(fsi, fso, Nflag);
1650 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) == 0) {
1651 error = ioctl(fso, UFSRESUME);
1653 err(1, "UFSRESUME");
1658 if (statfsp != NULL && (statfsp->f_flags & MNT_RDONLY) != 0)
1659 mount_reload(statfsp);
1669 * Dump a line of usage.
1678 fprintf(stderr, "usage: growfs [-Ny] [-s size] special | filesystem\n");
1685 * This updates most parameters and the bitmap related to cluster. We have to
1686 * assume that sblock, osblock, acg are set up.
1696 if (sblock.fs_contigsumsize < 1) /* no clustering */
1699 * update cluster allocation map
1701 setbit(cg_clustersfree(&acg), block);
1704 * update cluster summary table
1708 * calculate size for the trailing cluster
1710 for (block--; lcs < sblock.fs_contigsumsize; block--, lcs++ ) {
1711 if (isclr(cg_clustersfree(&acg), block))
1715 if (lcs < sblock.fs_contigsumsize) {
1717 cg_clustersum(&acg)[lcs]--;
1719 cg_clustersum(&acg)[lcs]++;
1727 mount_reload(const struct statfs *stfs)
1736 build_iovec(&iov, &iovlen, "fstype", __DECONST(char *, "ffs"), 4);
1737 build_iovec(&iov, &iovlen, "fspath", __DECONST(char *, stfs->f_mntonname), (size_t)-1);
1738 build_iovec(&iov, &iovlen, "errmsg", errmsg, sizeof(errmsg));
1739 build_iovec(&iov, &iovlen, "update", NULL, 0);
1740 build_iovec(&iov, &iovlen, "reload", NULL, 0);
1742 if (nmount(iov, iovlen, stfs->f_flags) < 0) {
1743 errmsg[sizeof(errmsg) - 1] = '\0';
1744 err(9, "%s: cannot reload filesystem%s%s", stfs->f_mntonname,
1745 *errmsg != '\0' ? ": " : "", errmsg);