mke2fs.c revision 1.26
1/*	$NetBSD: mke2fs.c,v 1.26 2023/05/17 09:54:59 tsutsui Exp $	*/
2
3/*-
4 * Copyright (c) 2007 Izumi Tsutsui.  All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 *    notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 *    notice, this list of conditions and the following disclaimer in the
13 *    documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27/*
28 * Copyright (c) 1980, 1989, 1993
29 *	The Regents of the University of California.  All rights reserved.
30 *
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions
33 * are met:
34 * 1. Redistributions of source code must retain the above copyright
35 *    notice, this list of conditions and the following disclaimer.
36 * 2. Redistributions in binary form must reproduce the above copyright
37 *    notice, this list of conditions and the following disclaimer in the
38 *    documentation and/or other materials provided with the distribution.
39 * 3. Neither the name of the University nor the names of its contributors
40 *    may be used to endorse or promote products derived from this software
41 *    without specific prior written permission.
42 *
43 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
44 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
47 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * SUCH DAMAGE.
54 */
55
56/*
57 * Copyright (c) 1997 Manuel Bouyer.
58 *
59 * Redistribution and use in source and binary forms, with or without
60 * modification, are permitted provided that the following conditions
61 * are met:
62 * 1. Redistributions of source code must retain the above copyright
63 *	notice, this list of conditions and the following disclaimer.
64 * 2. Redistributions in binary form must reproduce the above copyright
65 *	notice, this list of conditions and the following disclaimer in the
66 *	documentation and/or other materials provided with the distribution.
67 *
68 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
69 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
70 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
71 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
72 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
73 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
74 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
75 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
76 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
77 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
78 */
79
80/*
81 * mke2fs.c: "re-invent (dumb but non-GPLed) wheel as a fun project"
82 *
83 *	In spite of this name, there is no piece of code
84 *	derived from GPLed e2fsprogs written for Linux.
85 *	I referred them only to see how each structure
86 *	member should be initialized.
87 *
88 * Reference:
89 *	- All NetBSD sources under src/sys/ufs/ext2fs and src/sbin/fsck_ext2fs
90 *	- Ext2fs Home Page
91 *		https://e2fsprogs.sourceforge.net/ext2.html
92 *	- Design and Implementation of the Second Extended Filesystem
93 *		https://e2fsprogs.sourceforge.net/ext2intro.html
94 *	- Linux Documentation "The Second Extended Filesystem"
95 *		https://www.kernel.org/doc/Documentation/filesystems/ext2.txt
96 */
97
98#include <sys/cdefs.h>
99#ifndef lint
100#if 0
101static char sccsid[] = "@(#)mkfs.c	8.11 (Berkeley) 5/3/95";
102#else
103__RCSID("$NetBSD: mke2fs.c,v 1.26 2023/05/17 09:54:59 tsutsui Exp $");
104#endif
105#endif /* not lint */
106
107#include <sys/param.h>
108#include <sys/mman.h>
109#include <sys/time.h>
110#include <ufs/ext2fs/ext2fs_dinode.h>
111#include <ufs/ext2fs/ext2fs_dir.h>
112#include <ufs/ext2fs/ext2fs.h>
113#include <sys/ioctl.h>
114
115#include <err.h>
116#include <errno.h>
117#include <string.h>
118#include <unistd.h>
119#include <stdlib.h>
120#include <stddef.h>
121#include <stdio.h>
122#include <uuid.h>
123
124#include "extern.h"
125
126static void initcg(uint);
127static void zap_old_sblock(int);
128static uint cgoverhead(uint);
129static int fsinit(const struct timeval *);
130static int makedir(struct ext2fs_direct *, int);
131static void copy_dir(struct ext2fs_direct *, struct ext2fs_direct *);
132static void init_resizeino(const struct timeval *);
133static uint32_t alloc(uint32_t, uint16_t);
134static void iput(struct ext2fs_dinode *, ino_t);
135static void rdfs(daddr_t, int, void *);
136static void wtfs(daddr_t, int, void *);
137static int ilog2(uint);
138static int skpc(int, size_t, uint8_t *);
139
140/* XXX: some of these macro should be into <ufs/ext2fs/ext2fs.h>? */
141#define EXT2_DEF_MAX_MNT_COUNT	20
142#define EXT2_DEF_FSCKINTV	(180 * 24 * 60 * 60)	/* 180 days */
143#define EXT2_RESERVED_INODES	(EXT2_FIRSTINO - 1)
144#define EXT2_UMASK		0755
145
146#define EXT2_INO_INDEX(ino)	((ino) - 1)		/* no inode zero */
147
148#define EXT2_LOSTFOUNDSIZE	16384
149#define EXT2_LOSTFOUNDINO	EXT2_FIRSTINO		/* XXX: not quite */
150#define EXT2_LOSTFOUNDUMASK	0700
151
152#define EXT2_RESIZEINOUMASK	0600
153
154#define NBLOCK_SUPERBLOCK	1
155#define NBLOCK_BLOCK_BITMAP	1
156#define NBLOCK_INODE_BITMAP	1
157
158#define cgbase(fs, c)	\
159	((fs)->e2fs.e2fs_first_dblock + (fs)->e2fs.e2fs_bpg * (c))
160
161
162/*
163 * ext2fs super block and group descriptor structures
164 *
165 *   We don't have to use or setup whole in-memory m_ext2fs structure,
166 *   but prepare it to use several macro defined in kernel headers.
167 */
168union {
169	struct m_ext2fs m_ext2fs;
170	char pad[SBSIZE];
171} ext2fsun;
172#define sblock	ext2fsun.m_ext2fs
173#define gd	ext2fsun.m_ext2fs.e2fs_gd
174
175static uint8_t *iobuf;		/* for superblock and group descriptors */
176static int iobufsize;
177
178static uint8_t buf[MAXBSIZE];	/* for initcg() and makedir() ops */
179
180static int fsi, fso;
181
182void
183mke2fs(const char *fsys, int fi, int fo)
184{
185	struct timeval tv;
186	int64_t minfssize;
187	uint bcount, fbcount, ficount;
188	uint blocks_gd, blocks_per_cg, inodes_per_cg, iblocks_per_cg;
189	uint minblocks_per_cg, blocks_lastcg;
190	uint ncg, cylno, sboff;
191	uuid_t uuid;
192	uint32_t uustat;
193	int i, len, col, delta, fld_width, max_cols;
194	struct winsize winsize;
195
196	gettimeofday(&tv, NULL);
197	fsi = fi;
198	fso = fo;
199
200	/*
201	 * collect and verify the block and fragment sizes
202	 */
203	if (!powerof2(bsize)) {
204		errx(EXIT_FAILURE,
205		    "block size must be a power of 2, not %u",
206		    bsize);
207	}
208	if (!powerof2(fsize)) {
209		errx(EXIT_FAILURE,
210		    "fragment size must be a power of 2, not %u",
211		    fsize);
212	}
213	if (fsize < sectorsize) {
214		errx(EXIT_FAILURE,
215		    "fragment size %u is too small, minimum is %u",
216		    fsize, sectorsize);
217	}
218	if (bsize < MINBSIZE) {
219		errx(EXIT_FAILURE,
220		    "block size %u is too small, minimum is %u",
221		    bsize, MINBSIZE);
222	}
223	if (bsize > EXT2_MAXBSIZE) {
224		errx(EXIT_FAILURE,
225		    "block size %u is too large, maximum is %u",
226		    bsize, MAXBSIZE);
227	}
228	if (bsize != fsize) {
229		/*
230		 * There is no fragment support on current ext2fs (yet?),
231		 * but some kernel code refers fsize or fpg as bsize or bpg
232		 * and Linux seems to set the same values to them.
233		 */
234		errx(EXIT_FAILURE,
235		    "block size (%u) can't be different from "
236		    "fragment size (%u)",
237		    bsize, fsize);
238	}
239
240	/* variable inodesize is REV1 feature */
241	if (Oflag == 0 && inodesize != EXT2_REV0_DINODE_SIZE) {
242		errx(EXIT_FAILURE, "GOOD_OLD_REV file system format"
243		    " doesn't support %d byte inode", inodesize);
244	}
245
246	sblock.e2fs.e2fs_log_bsize = ilog2(bsize) - LOG_MINBSIZE;
247	/* Umm, why not e2fs_log_fsize? */
248	sblock.e2fs.e2fs_fsize = ilog2(fsize) - LOG_MINBSIZE;
249
250	sblock.e2fs_bsize = bsize;
251	sblock.e2fs_bshift = sblock.e2fs.e2fs_log_bsize + LOG_MINBSIZE;
252	sblock.e2fs_qbmask = sblock.e2fs_bsize - 1;
253	sblock.e2fs_bmask = ~sblock.e2fs_qbmask;
254	sblock.e2fs_fsbtodb = ilog2(sblock.e2fs_bsize) - ilog2(sectorsize);
255	sblock.e2fs_ipb = sblock.e2fs_bsize / inodesize;
256
257	/*
258	 * Ext2fs preserves BBSIZE (1024 bytes) space at the top for
259	 * bootloader (though it is not enough at all for our bootloader).
260	 * If bsize == BBSIZE we have to preserve one block.
261	 * If bsize > BBSIZE, the first block already contains BBSIZE space
262	 * before superblock because superblock is allocated at SBOFF and
263	 * bsize is a power of two (i.e. 2048 bytes or more).
264	 */
265	sblock.e2fs.e2fs_first_dblock = (sblock.e2fs_bsize > BBSIZE) ? 0 : 1;
266	minfssize = EXT2_FSBTODB(&sblock,
267	    sblock.e2fs.e2fs_first_dblock +
268	    NBLOCK_SUPERBLOCK +
269	    1 /* at least one group descriptor */ +
270	    NBLOCK_BLOCK_BITMAP	+
271	    NBLOCK_INODE_BITMAP +
272	    1 /* at least one inode table block */ +
273	    1 /* at least one data block for rootdir */ +
274	    1 /* at least one data block for data */
275	    );			/* XXX and more? */
276
277	if (fssize < minfssize)
278		errx(EXIT_FAILURE, "Filesystem size %" PRId64
279		    " < minimum size of %" PRId64, fssize, minfssize);
280
281	bcount = EXT2_DBTOFSB(&sblock, fssize);
282
283	/*
284	 * While many people claim that ext2fs is a (bad) clone of ufs/ffs,
285	 * it isn't actual ffs so maybe we should call it "block group"
286	 * as their native name rather than ffs derived "cylinder group."
287	 * But we'll use the latter here since other kernel sources use it.
288	 * (I also agree "cylinder" based allocation is obsolete though)
289	 */
290
291	/* maybe "simple is the best" */
292	blocks_per_cg = sblock.e2fs_bsize * NBBY;
293
294	ncg = howmany(bcount - sblock.e2fs.e2fs_first_dblock, blocks_per_cg);
295	blocks_gd = howmany(sizeof(struct ext2_gd) * ncg, bsize);
296
297	/* check range of inode number */
298	if (num_inodes < EXT2_FIRSTINO)
299		num_inodes = EXT2_FIRSTINO;	/* needs reserved inodes + 1 */
300	if (num_inodes > UINT16_MAX * ncg)
301		num_inodes = UINT16_MAX * ncg;	/* ext2bgd_nifree is uint16_t */
302
303	inodes_per_cg = num_inodes / ncg;
304	iblocks_per_cg = howmany(inodesize * inodes_per_cg, bsize);
305
306	/* Check that the last cylinder group has enough space for inodes */
307	minblocks_per_cg =
308	    NBLOCK_BLOCK_BITMAP +
309	    NBLOCK_INODE_BITMAP +
310	    iblocks_per_cg +
311	    1;	/* at least one data block */
312	if (Oflag == 0 || cg_has_sb(ncg - 1) != 0)
313		minblocks_per_cg += NBLOCK_SUPERBLOCK + blocks_gd;
314
315	blocks_lastcg = bcount - sblock.e2fs.e2fs_first_dblock -
316	    blocks_per_cg * (ncg - 1);
317	if (blocks_lastcg < minblocks_per_cg) {
318		/*
319		 * Since we make all the cylinder groups the same size, the
320		 * last will only be small if there are more than one
321		 * cylinder groups. If the last one is too small to store
322		 * filesystem data, just kill it.
323		 *
324		 * XXX: Does fsck_ext2fs(8) properly handle this case?
325		 */
326		bcount -= blocks_lastcg;
327		ncg--;
328		blocks_lastcg = blocks_per_cg;
329		blocks_gd = howmany(sizeof(struct ext2_gd) * ncg, bsize);
330		inodes_per_cg = num_inodes / ncg;
331	}
332	/* roundup inodes_per_cg to make it use whole inode table blocks */
333	inodes_per_cg = roundup(inodes_per_cg, sblock.e2fs_ipb);
334	num_inodes = inodes_per_cg * ncg;
335	iblocks_per_cg = inodes_per_cg / sblock.e2fs_ipb;
336
337	/* XXX: probably we should check these adjusted values again */
338
339	sblock.e2fs.e2fs_bcount = bcount;
340	sblock.e2fs.e2fs_icount = num_inodes;
341
342	sblock.e2fs_ncg = ncg;
343	sblock.e2fs_ngdb = blocks_gd;
344	sblock.e2fs_itpg = iblocks_per_cg;
345
346	sblock.e2fs.e2fs_rbcount = sblock.e2fs.e2fs_bcount * minfree / 100;
347	/* e2fs_fbcount will be accounted later */
348	/* e2fs_ficount will be accounted later */
349
350	sblock.e2fs.e2fs_bpg = blocks_per_cg;
351	sblock.e2fs.e2fs_fpg = blocks_per_cg;
352
353	sblock.e2fs.e2fs_ipg = inodes_per_cg;
354
355	sblock.e2fs.e2fs_mtime = 0;
356	sblock.e2fs.e2fs_wtime = tv.tv_sec;
357	sblock.e2fs.e2fs_mnt_count = 0;
358	/* XXX: should add some entropy to avoid checking all fs at once? */
359	sblock.e2fs.e2fs_max_mnt_count = EXT2_DEF_MAX_MNT_COUNT;
360
361	sblock.e2fs.e2fs_magic = E2FS_MAGIC;
362	sblock.e2fs.e2fs_state = E2FS_ISCLEAN;
363	sblock.e2fs.e2fs_beh = E2FS_BEH_DEFAULT;
364	sblock.e2fs.e2fs_minrev = 0;
365	sblock.e2fs.e2fs_lastfsck = tv.tv_sec;
366	sblock.e2fs.e2fs_fsckintv = EXT2_DEF_FSCKINTV;
367
368	/*
369	 * Maybe we can use E2FS_OS_FREEBSD here and it would be more proper,
370	 * but the purpose of this newfs_ext2fs(8) command is to provide
371	 * a filesystem which can be recognized by firmware on some
372	 * Linux based appliances that can load bootstrap files only from
373	 * (their native) ext2fs, and anyway we will (and should) try to
374	 * act like them as much as possible.
375	 *
376	 * Anyway, I hope that all newer such boxes will keep their support
377	 * for the "GOOD_OLD_REV" ext2fs.
378	 */
379	sblock.e2fs.e2fs_creator = E2FS_OS_LINUX;
380
381	if (Oflag == 0) {
382		sblock.e2fs.e2fs_rev = E2FS_REV0;
383		sblock.e2fs.e2fs_features_compat   = 0;
384		sblock.e2fs.e2fs_features_incompat = 0;
385		sblock.e2fs.e2fs_features_rocompat = 0;
386	} else {
387		sblock.e2fs.e2fs_rev = E2FS_REV1;
388		/*
389		 * e2fsprogs say "REV1" is "dynamic" so
390		 * it isn't quite a version and maybe it means
391		 * "extended from REV0 so check compat features."
392		 *
393		 * XXX: We don't have any native tool to activate
394		 *      the EXT2F_COMPAT_RESIZE feature and
395		 *      fsck_ext2fs(8) might not fix structures for it.
396		 */
397		sblock.e2fs.e2fs_features_compat   = EXT2F_COMPAT_RESIZE;
398		sblock.e2fs.e2fs_features_incompat = EXT2F_INCOMPAT_FTYPE;
399		sblock.e2fs.e2fs_features_rocompat =
400		    EXT2F_ROCOMPAT_SPARSESUPER | EXT2F_ROCOMPAT_LARGEFILE;
401	}
402
403	sblock.e2fs.e2fs_ruid = geteuid();
404	sblock.e2fs.e2fs_rgid = getegid();
405
406	sblock.e2fs.e2fs_first_ino = EXT2_FIRSTINO;
407	sblock.e2fs.e2fs_inode_size = inodesize;
408
409	/* e2fs_block_group_nr is set on writing superblock to each group */
410
411	uuid_create(&uuid, &uustat);
412	if (uustat != uuid_s_ok)
413		errx(EXIT_FAILURE, "Failed to generate uuid");
414	uuid_enc_le(sblock.e2fs.e2fs_uuid, &uuid);
415	if (volname != NULL) {
416		if (strlen(volname) > sizeof(sblock.e2fs.e2fs_vname))
417			errx(EXIT_FAILURE, "Volume name is too long");
418		strlcpy(sblock.e2fs.e2fs_vname, volname,
419		    sizeof(sblock.e2fs.e2fs_vname));
420	}
421
422	sblock.e2fs.e2fs_fsmnt[0] = '\0';
423	sblock.e2fs_fsmnt[0] = '\0';
424
425	sblock.e2fs.e2fs_algo = 0;		/* XXX unsupported? */
426	sblock.e2fs.e2fs_prealloc = 0;		/* XXX unsupported? */
427	sblock.e2fs.e2fs_dir_prealloc = 0;	/* XXX unsupported? */
428
429	/* calculate blocks for reserved group descriptors for resize */
430	sblock.e2fs.e2fs_reserved_ngdb = 0;
431	if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
432	    (sblock.e2fs.e2fs_features_compat & EXT2F_COMPAT_RESIZE) != 0) {
433		uint64_t target_blocks;
434		uint target_ncg, target_ngdb, reserved_ngdb;
435
436		/* reserve descriptors for size as 1024 times as current */
437		target_blocks =
438		    (sblock.e2fs.e2fs_bcount - sblock.e2fs.e2fs_first_dblock)
439		    * 1024ULL;
440		/* number of blocks must be in uint32_t */
441		if (target_blocks > UINT32_MAX)
442			target_blocks = UINT32_MAX;
443		target_ncg = howmany(target_blocks, sblock.e2fs.e2fs_bpg);
444		target_ngdb = howmany(sizeof(struct ext2_gd) * target_ncg,
445		    sblock.e2fs_bsize);
446		/*
447		 * Reserved group descriptor blocks are preserved as
448		 * the second level double indirect reference blocks in
449		 * the EXT2_RESIZEINO inode, so the maximum number of
450		 * the blocks is EXT2_NINDIR(fs).
451		 * (see also descriptions in init_resizeino() function)
452		 *
453		 * We check a number including current e2fs_ngdb here
454		 * because they will be moved into reserved gdb on
455		 * possible future size shrink, though e2fsprogs don't
456		 * seem to care about it.
457		 */
458		if (target_ngdb > EXT2_NINDIR(&sblock))
459			target_ngdb = EXT2_NINDIR(&sblock);
460
461		reserved_ngdb = target_ngdb - sblock.e2fs_ngdb;
462
463		/* make sure reserved_ngdb fits in the last cg */
464		if (reserved_ngdb >= blocks_lastcg - cgoverhead(ncg - 1))
465			reserved_ngdb = blocks_lastcg - cgoverhead(ncg - 1);
466		if (reserved_ngdb == 0) {
467			/* if no space for reserved gdb, disable the feature */
468			sblock.e2fs.e2fs_features_compat &=
469			    ~EXT2F_COMPAT_RESIZE;
470		}
471		sblock.e2fs.e2fs_reserved_ngdb = reserved_ngdb;
472	}
473
474	/*
475	 * Initialize group descriptors
476	 */
477	gd = malloc(sblock.e2fs_ngdb * bsize);
478	if (gd == NULL)
479		errx(EXIT_FAILURE, "Can't allocate descriptors buffer");
480	memset(gd, 0, sblock.e2fs_ngdb * bsize);
481
482	fbcount = 0;
483	ficount = 0;
484	for (cylno = 0; cylno < ncg; cylno++) {
485		uint boffset;
486
487		boffset = cgbase(&sblock, cylno);
488		if (sblock.e2fs.e2fs_rev == E2FS_REV0 ||
489		    (sblock.e2fs.e2fs_features_rocompat &
490		     EXT2F_ROCOMPAT_SPARSESUPER) == 0 ||
491		    cg_has_sb(cylno)) {
492			boffset += NBLOCK_SUPERBLOCK + sblock.e2fs_ngdb;
493			if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
494			    (sblock.e2fs.e2fs_features_compat &
495			     EXT2F_COMPAT_RESIZE) != 0)
496				boffset += sblock.e2fs.e2fs_reserved_ngdb;
497		}
498		gd[cylno].ext2bgd_b_bitmap = h2fs32(boffset);
499		boffset += NBLOCK_BLOCK_BITMAP;
500		gd[cylno].ext2bgd_i_bitmap = h2fs32(boffset);
501		boffset += NBLOCK_INODE_BITMAP;
502		gd[cylno].ext2bgd_i_tables = h2fs32(boffset);
503		if (cylno == (ncg - 1))
504			gd[cylno].ext2bgd_nbfree = h2fs16(
505			    blocks_lastcg - cgoverhead(cylno));
506		else
507			gd[cylno].ext2bgd_nbfree = h2fs16(
508			    sblock.e2fs.e2fs_bpg - cgoverhead(cylno));
509		fbcount += fs2h16(gd[cylno].ext2bgd_nbfree);
510		if (cylno == 0) {
511			/* take reserved inodes off nifree */
512			gd[cylno].ext2bgd_nifree = h2fs16(
513			    sblock.e2fs.e2fs_ipg-EXT2_RESERVED_INODES);
514		} else {
515			gd[cylno].ext2bgd_nifree =
516			    h2fs16(sblock.e2fs.e2fs_ipg);
517		}
518		ficount += fs2h16(gd[cylno].ext2bgd_nifree);
519		gd[cylno].ext2bgd_ndirs = 0;
520	}
521	sblock.e2fs.e2fs_fbcount = fbcount;
522	sblock.e2fs.e2fs_ficount = ficount;
523
524	/*
525	 * Dump out summary information about file system.
526	 */
527	if (verbosity > 0) {
528		printf("%s: %u.%1uMB (%" PRId64 " sectors) "
529		    "block size %u, fragment size %u\n",
530		    fsys,
531		    (uint)(((uint64_t)bcount * bsize) / (1024 * 1024)),
532		    (uint)((uint64_t)bcount * bsize -
533		    rounddown((uint64_t)bcount * bsize, 1024 * 1024))
534		    / 1024 / 100,
535		    fssize, bsize, fsize);
536		printf("\tusing %u block groups of %u.0MB, %u blks, "
537		    "%u inodes.\n",
538		    ncg, bsize * sblock.e2fs.e2fs_bpg / (1024 * 1024),
539		    sblock.e2fs.e2fs_bpg, sblock.e2fs.e2fs_ipg);
540	}
541
542	/*
543	 * allocate space for superblock and group descriptors
544	 */
545	iobufsize = (NBLOCK_SUPERBLOCK + sblock.e2fs_ngdb) * sblock.e2fs_bsize;
546	iobuf = mmap(0, iobufsize, PROT_READ|PROT_WRITE,
547	    MAP_ANON|MAP_PRIVATE, -1, 0);
548	if (iobuf == NULL)
549		errx(EXIT_FAILURE, "Cannot allocate I/O buffer");
550	memset(iobuf, 0, iobufsize);
551
552	/*
553	 * We now start writing to the filesystem
554	 */
555
556	if (!Nflag) {
557		static const uint pbsize[] = { 1024, 2048, 4096, 0 };
558		uint pblock;
559		/*
560		 * Validate the given file system size.
561		 * Verify that its last block can actually be accessed.
562		 * Convert to file system fragment sized units.
563		 */
564		if (fssize <= 0)
565			errx(EXIT_FAILURE, "Preposterous size %" PRId64,
566			    fssize);
567		wtfs(fssize - 1, sectorsize, iobuf);
568
569		/*
570		 * Ensure there is nothing that looks like a filesystem
571		 * superblock anywhere other than where ours will be.
572		 *
573		 * Ext2fs superblock is always placed at the same SBOFF,
574		 * so we just zap possible first backups.
575		 */
576		for (i = 0; pbsize[i] != 0; i++) {
577 			pblock = (pbsize[i] > BBSIZE) ? 0 : 1;	/* 1st dblk */
578			pblock += pbsize[i] * NBBY;		/* next bg */
579			/* zap first backup */
580			zap_old_sblock(pblock * pbsize[i]);
581		}
582		/*
583		 * Also zap possbile FFS magic leftover to prevent
584		 * kernel vfs_mountroot() and bootloadres from mis-recognizing
585		 * this file system as FFS.
586		 */
587		zap_old_sblock(8192);	/* SBLOCK_UFS1 */
588		zap_old_sblock(65536);	/* SBLOCK_UFS2 */
589	}
590
591	if (verbosity >= 3)
592		printf("super-block backups (for fsck_ext2fs -b #) at:\n");
593	/* If we are printing more than one line of numbers, line up columns */
594	fld_width = verbosity < 4 ? 1 : snprintf(NULL, 0, "%" PRIu64,
595	    (uint64_t)cgbase(&sblock, ncg - 1));
596	/* Get terminal width */
597	if (ioctl(fileno(stdout), TIOCGWINSZ, &winsize) == 0)
598		max_cols = winsize.ws_col;
599	else
600		max_cols = 80;
601	if (Nflag && verbosity == 3)
602		/* Leave space to add " ..." after one row of numbers */
603		max_cols -= 4;
604#define BASE 0x10000	/* For some fixed-point maths */
605	col = 0;
606	delta = verbosity > 2 ? 0 : max_cols * BASE / ncg;
607	for (cylno = 0; cylno < ncg; cylno++) {
608		fflush(stdout);
609		initcg(cylno);
610		if (verbosity < 2)
611			continue;
612		/* the first one is a master, not backup */
613		if (cylno == 0)
614			continue;
615		/* skip if this cylinder doesn't have a backup */
616		if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
617		    (sblock.e2fs.e2fs_features_rocompat &
618		     EXT2F_ROCOMPAT_SPARSESUPER) != 0 &&
619		    cg_has_sb(cylno) == 0)
620			continue;
621
622		if (delta > 0) {
623			if (Nflag)
624				/* No point doing dots for -N */
625				break;
626			/* Print dots scaled to end near RH margin */
627			for (col += delta; col > BASE; col -= BASE)
628				printf(".");
629			continue;
630		}
631		/* Print superblock numbers */
632		len = printf("%s%*" PRIu64 ",", (col ? " " : ""), fld_width,
633		    (uint64_t)cgbase(&sblock, cylno));
634		col += len;
635		if (col + len < max_cols)
636			/* Next number fits */
637			continue;
638		/* Next number won't fit, need a newline */
639		if (verbosity <= 3) {
640			/* Print dots for subsequent cylinder groups */
641			delta = sblock.e2fs_ncg - cylno - 1;
642			if (delta != 0) {
643				if (Nflag) {
644					printf(" ...");
645					break;
646				}
647				delta = max_cols * BASE / delta;
648			}
649		}
650		col = 0;
651		printf("\n");
652	}
653#undef BASE
654	if (col > 0)
655		printf("\n");
656	if (Nflag)
657		return;
658
659	/*
660	 * Now construct the initial file system,
661	 */
662	if (fsinit(&tv) == 0)
663		errx(EXIT_FAILURE, "Error making filesystem");
664	/*
665	 * Write out the superblock and group descriptors
666	 */
667	sblock.e2fs.e2fs_block_group_nr = 0;
668	sboff = 0;
669	if (cgbase(&sblock, 0) == 0) {
670		/*
671		 * If the first block contains the boot block sectors,
672		 * (i.e. in case of sblock.e2fs.e2fs_bsize > BBSIZE)
673		 * we have to preserve data in it.
674		 */
675		sboff = SBOFF;
676	}
677	e2fs_sbsave(&sblock.e2fs, (struct ext2fs *)(iobuf + sboff));
678	e2fs_cgsave(gd, (struct ext2_gd *)(iobuf + sblock.e2fs_bsize),
679	   sizeof(struct ext2_gd) * sblock.e2fs_ncg);
680	wtfs(EXT2_FSBTODB(&sblock, cgbase(&sblock, 0)) + sboff / sectorsize,
681	    iobufsize - sboff, iobuf + sboff);
682
683	munmap(iobuf, iobufsize);
684}
685
686/*
687 * Initialize a cylinder (block) group.
688 */
689void
690initcg(uint cylno)
691{
692	uint nblcg, i, j, sboff;
693	struct ext2fs_dinode *dp;
694
695	/*
696	 * Make a copy of the superblock and group descriptors.
697	 */
698	if (sblock.e2fs.e2fs_rev == E2FS_REV0 ||
699	    (sblock.e2fs.e2fs_features_rocompat &
700	     EXT2F_ROCOMPAT_SPARSESUPER) == 0 ||
701	    cg_has_sb(cylno)) {
702		sblock.e2fs.e2fs_block_group_nr = cylno;
703		sboff = 0;
704		if (cgbase(&sblock, cylno) == 0) {
705			/* preserve data in bootblock in cg0 */
706			sboff = SBOFF;
707		}
708		e2fs_sbsave(&sblock.e2fs, (struct ext2fs *)(iobuf + sboff));
709		e2fs_cgsave(gd, (struct ext2_gd *)(iobuf +
710		    sblock.e2fs_bsize * NBLOCK_SUPERBLOCK),
711		    sizeof(struct ext2_gd) * sblock.e2fs_ncg);
712		/* write superblock and group descriptor backups */
713		wtfs(EXT2_FSBTODB(&sblock, cgbase(&sblock, cylno)) +
714		    sboff / sectorsize, iobufsize - sboff, iobuf + sboff);
715	}
716
717	/*
718	 * Initialize block bitmap.
719	 */
720	memset(buf, 0, sblock.e2fs_bsize);
721	if (cylno == (sblock.e2fs_ncg - 1)) {
722		/* The last group could have less blocks than e2fs_bpg. */
723		nblcg = sblock.e2fs.e2fs_bcount -
724		    cgbase(&sblock, sblock.e2fs_ncg - 1);
725		for (i = nblcg; i < roundup(nblcg, NBBY); i++)
726			setbit(buf, i);
727		memset(&buf[i / NBBY], ~0U, sblock.e2fs.e2fs_bpg - i);
728	}
729	/* set overhead (superblock, group descriptor etc.) blocks used */
730	for (i = 0; i < cgoverhead(cylno) / NBBY; i++)
731		buf[i] = ~0;
732	i = i * NBBY;
733	for (; i < cgoverhead(cylno); i++)
734		setbit(buf, i);
735	wtfs(EXT2_FSBTODB(&sblock, fs2h32(gd[cylno].ext2bgd_b_bitmap)),
736	    sblock.e2fs_bsize, buf);
737
738	/*
739	 * Initialize inode bitmap.
740	 *
741	 *  Assume e2fs_ipg is a multiple of NBBY since
742	 *  it's a multiple of e2fs_ipb (as we did above).
743	 *  Note even (possibly smaller) the last group has the same e2fs_ipg.
744	 */
745	i = sblock.e2fs.e2fs_ipg / NBBY;
746	memset(buf, 0, i);
747	memset(buf + i, ~0U, sblock.e2fs_bsize - i);
748	if (cylno == 0) {
749		/* mark reserved inodes */
750		for (i = 1; i < EXT2_FIRSTINO; i++)
751			setbit(buf, EXT2_INO_INDEX(i));
752	}
753	wtfs(EXT2_FSBTODB(&sblock, fs2h32(gd[cylno].ext2bgd_i_bitmap)),
754	    sblock.e2fs_bsize, buf);
755
756	/*
757	 * Initialize inode tables.
758	 *
759	 *  Just initialize generation numbers for NFS security.
760	 *  XXX: sys/ufs/ext2fs/ext2fs_alloc.c:ext2fs_valloc() seems
761	 *       to override these generated numbers.
762	 */
763	memset(buf, 0, sblock.e2fs_bsize);
764	for (i = 0; i < sblock.e2fs_itpg; i++) {
765		for (j = 0; j < sblock.e2fs_ipb; j++) {
766			dp = (struct ext2fs_dinode *)(buf + inodesize * j);
767			/* h2fs32() just for consistency */
768			dp->e2di_gen = h2fs32(arc4random());
769		}
770		wtfs(EXT2_FSBTODB(&sblock, fs2h32(gd[cylno].ext2bgd_i_tables) + i),
771		    sblock.e2fs_bsize, buf);
772	}
773}
774
775/*
776 * Zap possible lingering old superblock data
777 */
778static void
779zap_old_sblock(int sblkoff)
780{
781	static int cg0_data;
782	uint32_t oldfs[SBSIZE / sizeof(uint32_t)];
783	static const struct fsm {
784		uint32_t offset;
785		uint32_t magic;
786		uint32_t mask;
787	} fs_magics[] = {
788		{offsetof(struct ext2fs, e2fs_magic) / 4, E2FS_MAGIC, 0xffff},
789		{offsetof(struct ext2fs, e2fs_magic) / 4,
790		    E2FS_MAGIC << 16, 0xffff0000},
791		{14, 0xef530000, 0xffff0000},	/* EXT2FS (big) */
792		{0x55c / 4, 0x00011954, ~0U},	/* FS_UFS1_MAGIC */
793		{0x55c / 4, 0x19540119, ~0U},	/* FS_UFS2_MAGIC */
794		{0, 0x70162, ~0U},		/* LFS_MAGIC */
795		{.offset = ~0U},
796	};
797	const struct fsm *fsm;
798
799	if (Nflag)
800		return;
801
802	/* don't override data before superblock */
803	if (sblkoff < SBOFF)
804		return;
805
806	if (cg0_data == 0) {
807		cg0_data =
808		    ((daddr_t)sblock.e2fs.e2fs_first_dblock + cgoverhead(0)) *
809		    sblock.e2fs_bsize;
810	}
811
812	/* Ignore anything that is beyond our filesystem */
813	if (sblkoff / sectorsize >= fssize)
814		return;
815	/* Zero anything inside our filesystem... */
816	if (sblkoff >= sblock.e2fs.e2fs_first_dblock * bsize) {
817		/* ...unless we will write that area anyway */
818		if (sblkoff >= cg0_data)
819			/* assume iobuf is zero'ed here */
820			wtfs(sblkoff / sectorsize,
821			    roundup(SBSIZE, sectorsize), iobuf);
822		return;
823	}
824
825	/*
826	 * The sector might contain boot code, so we must validate it
827	 *
828	 * XXX: ext2fs won't preserve data after SBOFF,
829	 *      but first_dblock could have a different value.
830	 */
831	rdfs(sblkoff / sectorsize, sizeof(oldfs), &oldfs);
832	for (fsm = fs_magics;; fsm++) {
833		uint32_t v;
834		if (fsm->mask == 0)
835			return;
836		v = oldfs[fsm->offset];
837		if ((v & fsm->mask) == fsm->magic ||
838		    (bswap32(v) & fsm->mask) == fsm->magic)
839			break;
840	}
841
842	/* Just zap the magic number */
843	oldfs[fsm->offset] = 0;
844	wtfs(sblkoff / sectorsize, sizeof(oldfs), &oldfs);
845}
846
847/*
848 * uint cgoverhead(uint c)
849 *
850 * 	Return a number of reserved blocks on the specified group.
851 * 	XXX: should be shared with src/sbin/fsck_ext2fs/setup.c
852 */
853uint
854cgoverhead(uint c)
855{
856	uint overh;
857
858	overh = NBLOCK_BLOCK_BITMAP + NBLOCK_INODE_BITMAP + sblock.e2fs_itpg;
859
860	if (sblock.e2fs.e2fs_rev == E2FS_REV0 ||
861	    (sblock.e2fs.e2fs_features_rocompat &
862	     EXT2F_ROCOMPAT_SPARSESUPER) == 0 ||
863	    cg_has_sb(c) != 0) {
864		overh += NBLOCK_SUPERBLOCK + sblock.e2fs_ngdb;
865
866		if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
867		    (sblock.e2fs.e2fs_features_compat &
868		     EXT2F_COMPAT_RESIZE) != 0)
869			overh += sblock.e2fs.e2fs_reserved_ngdb;
870	}
871
872	return overh;
873}
874
875/*
876 * Initialize the file system
877 */
878
879#define LOSTDIR		/* e2fsck complains if there is no lost+found */
880
881#define	PREDEFDIR	2
882
883#ifdef LOSTDIR
884#define	PREDEFROOTDIR	(PREDEFDIR + 1)
885#else
886#define	PREDEFROOTDIR	PREDEFDIR
887#endif
888
889struct ext2fs_direct root_dir[] = {
890	{ EXT2_ROOTINO, 0, 1, 0, "." },
891	{ EXT2_ROOTINO, 0, 2, 0, ".." },
892#ifdef LOSTDIR
893	{ EXT2_LOSTFOUNDINO, 0, 10, 0, "lost+found" },
894#endif
895};
896
897#ifdef LOSTDIR
898struct ext2fs_direct lost_found_dir[] = {
899	{ EXT2_LOSTFOUNDINO, 0, 1, 0, "." },
900	{ EXT2_ROOTINO, 0, 2, 0, ".." },
901};
902struct ext2fs_direct pad_dir = { 0, sizeof(struct ext2fs_direct), 0, 0, "" };
903#endif
904
905int
906fsinit(const struct timeval *tv)
907{
908	struct ext2fs_dinode node;
909#ifdef LOSTDIR
910	uint i, nblks_lostfound, blk;
911#endif
912
913	/*
914	 * Initialize the inode for the resizefs feature
915	 */
916	if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
917	    (sblock.e2fs.e2fs_features_compat & EXT2F_COMPAT_RESIZE) != 0)
918		init_resizeino(tv);
919
920	/*
921	 * Initialize the node
922	 */
923
924#ifdef LOSTDIR
925	/*
926	 * Create the lost+found directory
927	 */
928	if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
929	    sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE) {
930		lost_found_dir[0].e2d_type = EXT2_FT_DIR;
931		lost_found_dir[1].e2d_type = EXT2_FT_DIR;
932	}
933	(void)makedir(lost_found_dir, __arraycount(lost_found_dir));
934
935	/* prepare a bit large directory for preserved files */
936	nblks_lostfound = EXT2_LOSTFOUNDSIZE / sblock.e2fs_bsize;
937	/* ...but only with direct blocks */
938	if (nblks_lostfound > EXT2FS_NDADDR)
939		nblks_lostfound = EXT2FS_NDADDR;
940
941	memset(&node, 0, sizeof(node));
942	node.e2di_mode = EXT2_IFDIR | EXT2_LOSTFOUNDUMASK;
943	node.e2di_uid = geteuid();
944	node.e2di_size = sblock.e2fs_bsize * nblks_lostfound;
945	node.e2di_atime = tv->tv_sec;
946	node.e2di_ctime = tv->tv_sec;
947	node.e2di_mtime = tv->tv_sec;
948	node.e2di_gid = getegid();
949	node.e2di_nlink = PREDEFDIR;
950	/* e2di_nblock is a number of disk blocks, not ext2fs blocks */
951	node.e2di_nblock = EXT2_FSBTODB(&sblock, nblks_lostfound);
952	node.e2di_blocks[0] = alloc(sblock.e2fs_bsize, node.e2di_mode);
953	if (node.e2di_blocks[0] == 0) {
954		printf("%s: can't allocate block for lost+found\n", __func__);
955		return 0;
956	}
957	for (i = 1; i < nblks_lostfound; i++) {
958		blk = alloc(sblock.e2fs_bsize, 0);
959		if (blk == 0) {
960			printf("%s: can't allocate blocks for lost+found\n",
961			    __func__);
962			return 0;
963		}
964		node.e2di_blocks[i] = blk;
965	}
966	wtfs(EXT2_FSBTODB(&sblock, node.e2di_blocks[0]),
967	    sblock.e2fs_bsize, buf);
968	pad_dir.e2d_reclen = sblock.e2fs_bsize;
969	for (i = 1; i < nblks_lostfound; i++) {
970		memset(buf, 0, sblock.e2fs_bsize);
971		copy_dir(&pad_dir, (struct ext2fs_direct *)buf);
972		wtfs(EXT2_FSBTODB(&sblock, node.e2di_blocks[i]),
973		    sblock.e2fs_bsize, buf);
974	}
975	iput(&node, EXT2_LOSTFOUNDINO);
976#endif
977	/*
978	 * create the root directory
979	 */
980	memset(&node, 0, sizeof(node));
981	if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
982	    sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE) {
983		root_dir[0].e2d_type = EXT2_FT_DIR;
984		root_dir[1].e2d_type = EXT2_FT_DIR;
985#ifdef LOSTDIR
986		root_dir[2].e2d_type = EXT2_FT_DIR;
987#endif
988	}
989	node.e2di_mode = EXT2_IFDIR | EXT2_UMASK;
990	node.e2di_uid = geteuid();
991	node.e2di_size = makedir(root_dir, __arraycount(root_dir));
992	node.e2di_atime = tv->tv_sec;
993	node.e2di_ctime = tv->tv_sec;
994	node.e2di_mtime = tv->tv_sec;
995	node.e2di_gid = getegid();
996	node.e2di_nlink = PREDEFROOTDIR;
997	/* e2di_nblock is a number of disk block, not ext2fs block */
998	node.e2di_nblock = EXT2_FSBTODB(&sblock, 1);
999	node.e2di_blocks[0] = alloc(node.e2di_size, node.e2di_mode);
1000	if (node.e2di_blocks[0] == 0) {
1001		printf("%s: can't allocate block for root dir\n", __func__);
1002		return 0;
1003	}
1004	wtfs(EXT2_FSBTODB(&sblock, node.e2di_blocks[0]),
1005	    sblock.e2fs_bsize, buf);
1006	iput(&node, EXT2_ROOTINO);
1007	return 1;
1008}
1009
1010/*
1011 * Construct a set of directory entries in "buf".
1012 * return size of directory.
1013 */
1014int
1015makedir(struct ext2fs_direct *protodir, int entries)
1016{
1017	uint8_t *cp;
1018	uint i, spcleft;
1019	uint dirblksiz;
1020
1021	dirblksiz = sblock.e2fs_bsize;
1022	memset(buf, 0, dirblksiz);
1023	spcleft = dirblksiz;
1024	for (cp = buf, i = 0; i < entries - 1; i++) {
1025		protodir[i].e2d_reclen = EXT2FS_DIRSIZ(protodir[i].e2d_namlen);
1026		copy_dir(&protodir[i], (struct ext2fs_direct *)cp);
1027		cp += protodir[i].e2d_reclen;
1028		spcleft -= protodir[i].e2d_reclen;
1029	}
1030	protodir[i].e2d_reclen = spcleft;
1031	copy_dir(&protodir[i], (struct ext2fs_direct *)cp);
1032	return dirblksiz;
1033}
1034
1035/*
1036 * Copy a direntry to a buffer, in fs byte order
1037 */
1038static void
1039copy_dir(struct ext2fs_direct *dir, struct ext2fs_direct *dbuf)
1040{
1041
1042	memcpy(dbuf, dir, EXT2FS_DIRSIZ(dir->e2d_namlen));
1043	dbuf->e2d_ino = h2fs32(dir->e2d_ino);
1044	dbuf->e2d_reclen = h2fs16(dir->e2d_reclen);
1045}
1046
1047/*
1048 * void init_resizeino(const struct timeval *tv);
1049 *
1050 *	Initialize the EXT2_RESEIZE_INO inode to preserve
1051 *	reserved group descriptor blocks for future growth of this ext2fs.
1052 */
1053void
1054init_resizeino(const struct timeval *tv)
1055{
1056	struct ext2fs_dinode node;
1057	uint64_t isize;
1058	uint32_t *dindir_block, *reserved_gdb;
1059	uint nblock, i, cylno, n;
1060
1061	memset(&node, 0, sizeof(node));
1062
1063	/*
1064	 * Note this function only prepares required structures for
1065	 * future resize. It's a quite different work to implement
1066	 * a utility like resize_ext2fs(8) which handles actual
1067	 * resize ops even on offline.
1068	 *
1069	 * Anyway, I'm not sure if there is any documentation about
1070	 * this resize ext2fs feature and related data structures,
1071	 * and I've written this function based on things what I see
1072	 * on some existing implementation and real file system data
1073	 * created by existing tools. To be honest, they are not
1074	 * so easy to read, so I will try to implement it here without
1075	 * any dumb optimization for people who would eventually
1076	 * work on "yet another wheel" like resize_ext2fs(8).
1077	 */
1078
1079	/*
1080	 * I'm not sure what type is appropriate for this inode.
1081	 * The release notes of e2fsprogs says they changed e2fsck to allow
1082	 * IFREG for RESIZEINO since a certain resize tool used it. Hmm.
1083	 */
1084	node.e2di_mode = EXT2_IFREG | EXT2_RESIZEINOUMASK;
1085	node.e2di_uid = geteuid();
1086	node.e2di_atime = tv->tv_sec;
1087	node.e2di_ctime = tv->tv_sec;
1088	node.e2di_mtime = tv->tv_sec;
1089	node.e2di_gid = getegid();
1090	node.e2di_nlink = 1;
1091
1092	/*
1093	 * To preserve the reserved group descriptor blocks,
1094	 * EXT2_RESIZEINO uses only double indirect reference
1095	 * blocks in its inode entries.
1096	 *
1097	 * All entries for direct, single indirect and triple
1098	 * indirect references are left zero'ed. Maybe it's safe
1099	 * because no write operation will happen with this inode.
1100	 *
1101	 * We have to allocate a block for the first level double
1102	 * indirect reference block. Indexes of inode entries in
1103	 * this first level dindirect block are corresponding to
1104	 * indexes of group descriptors including both used (e2fs_ngdb)
1105	 * and reserved (e2fs_reserved_ngdb) group descriptor blocks.
1106	 *
1107	 * Inode entries of indexes for used (e2fs_ngdb) descriptors are
1108	 * left zero'ed. Entries for reserved (e2fs_reserved_ngdb) ones
1109	 * have block numbers of actual reserved group descriptors
1110	 * allocated at block group zero. This means e2fs_reserved_ngdb
1111	 * blocks are reserved as the second level dindirect reference
1112	 * blocks, and they actually contain block numbers of indirect
1113	 * references. It may be safe since they don't have to keep any
1114	 * data yet.
1115	 *
1116	 * Each these second dindirect blocks (i.e. reserved group
1117	 * descriptor blocks in the first block group) should have
1118	 * block numbers of its backups in all other block groups.
1119	 * I.e. reserved_ngdb[0] block in block group 0 contains block
1120	 * numbers of resreved_ngdb[0] from group 1 through (e2fs_ncg - 1).
1121	 * The number of backups can be determined by the
1122	 * EXT2_ROCOMPAT_SPARSESUPER feature and cg_has_sb() macro
1123	 * as done in the above initcg() function.
1124	 */
1125
1126	/* set e2di_size which occupies whole blocks through DINDIR blocks */
1127	isize = (uint64_t)sblock.e2fs_bsize * EXT2FS_NDADDR +
1128	    (uint64_t)sblock.e2fs_bsize * EXT2_NINDIR(&sblock) +
1129	    (uint64_t)sblock.e2fs_bsize * EXT2_NINDIR(&sblock) *
1130	    EXT2_NINDIR(&sblock);
1131	if (isize > UINT32_MAX &&
1132	    (sblock.e2fs.e2fs_features_rocompat &
1133	     EXT2F_ROCOMPAT_LARGEFILE) == 0) {
1134		/* XXX should enable it here and update all backups? */
1135		errx(EXIT_FAILURE, "%s: large_file rocompat feature is "
1136		    "required to enable resize feature for this filesystem",
1137		    __func__);
1138	}
1139	/* upper 32bit is stored into e2di_size_high on REV1 feature */
1140	node.e2di_size 	    = isize & UINT32_MAX;
1141	node.e2di_size_high = isize >> 32;
1142
1143#define SINGLE	0	/* index of single indirect block */
1144#define DOUBLE	1	/* index of double indirect block */
1145#define TRIPLE	2	/* index of triple indirect block */
1146
1147	/* zero out entries for direct references */
1148	for (i = 0; i < EXT2FS_NDADDR; i++)
1149		node.e2di_blocks[i] = 0;
1150	/* also zero out entries for single and triple indirect references */
1151	node.e2di_blocks[EXT2FS_NDADDR + SINGLE] = 0;
1152	node.e2di_blocks[EXT2FS_NDADDR + TRIPLE] = 0;
1153
1154	/* allocate a block for the first level double indirect reference */
1155	node.e2di_blocks[EXT2FS_NDADDR + DOUBLE] =
1156	    alloc(sblock.e2fs_bsize, node.e2di_mode);
1157	if (node.e2di_blocks[EXT2FS_NDADDR + DOUBLE] == 0)
1158		errx(EXIT_FAILURE, "%s: Can't allocate a dindirect block",
1159		    __func__);
1160
1161	/* account this first block */
1162	nblock = EXT2_FSBTODB(&sblock, 1);
1163
1164	/* allocate buffer to set data in the dindirect block */
1165	dindir_block = malloc(sblock.e2fs_bsize);
1166	if (dindir_block == NULL)
1167		errx(EXIT_FAILURE,
1168		    "%s: Can't allocate buffer for a dindirect block",
1169		    __func__);
1170
1171	/* allocate buffer to set data in the group descriptor blocks */
1172	reserved_gdb = malloc(sblock.e2fs_bsize);
1173	if (reserved_gdb == NULL)
1174		errx(EXIT_FAILURE,
1175		    "%s: Can't allocate buffer for group descriptor blocks",
1176		    __func__);
1177
1178	/*
1179	 * Setup block entries in the first level dindirect blocks
1180	 */
1181	for (i = 0; i < sblock.e2fs_ngdb; i++) {
1182		/* no need to handle used group descriptor blocks */
1183		dindir_block[i] = 0;
1184	}
1185	for (; i < sblock.e2fs_ngdb + sblock.e2fs.e2fs_reserved_ngdb; i++) {
1186		/*
1187		 * point reserved group descriptor block in the first
1188		 * (i.e. master) block group
1189		 *
1190		 * XXX: e2fsprogs seem to use "(i % EXT2_NINDIR(&sblock))" here
1191		 *      to store maximum EXT2_NINDIR(&sblock) reserved gdbs.
1192		 *      I'm not sure what will be done on future filesystem
1193		 *      shrink in that case on their way.
1194		 */
1195		if (i >= EXT2_NINDIR(&sblock))
1196			errx(EXIT_FAILURE, "%s: too many reserved "
1197			    "group descriptors (%u) for resize inode",
1198			    __func__, sblock.e2fs.e2fs_reserved_ngdb);
1199		dindir_block[i] =
1200		    h2fs32(cgbase(&sblock, 0) + NBLOCK_SUPERBLOCK + i);
1201
1202		/*
1203		 * Setup block entries in the second dindirect blocks
1204		 * (which are primary reserved group descriptor blocks)
1205		 * to point their backups.
1206		 */
1207		for (n = 0, cylno = 1; cylno < sblock.e2fs_ncg; cylno++) {
1208			/* skip block groups without backup */
1209			if ((sblock.e2fs.e2fs_features_rocompat &
1210			     EXT2F_ROCOMPAT_SPARSESUPER) != 0 &&
1211			    cg_has_sb(cylno) == 0)
1212				continue;
1213
1214			if (n >= EXT2_NINDIR(&sblock))
1215				errx(EXIT_FAILURE, "%s: too many block groups "
1216				    "for the resize feature", __func__);
1217			/*
1218			 * These blocks are already reserved in
1219			 * initcg() so no need to use alloc() here.
1220			 */
1221			reserved_gdb[n++] = h2fs32(cgbase(&sblock, cylno) +
1222			    NBLOCK_SUPERBLOCK + i);
1223			nblock += EXT2_FSBTODB(&sblock, 1);
1224		}
1225		for (; n < EXT2_NINDIR(&sblock); n++)
1226			reserved_gdb[n] = 0;
1227
1228		/* write group descriptor block as the second dindirect refs */
1229		wtfs(EXT2_FSBTODB(&sblock, fs2h32(dindir_block[i])),
1230		    sblock.e2fs_bsize, reserved_gdb);
1231		nblock += EXT2_FSBTODB(&sblock, 1);
1232	}
1233	for (; i < EXT2_NINDIR(&sblock); i++) {
1234		/* leave trailing entries unallocated */
1235		dindir_block[i] = 0;
1236	}
1237	free(reserved_gdb);
1238
1239	/* finally write the first level dindirect block */
1240	wtfs(EXT2_FSBTODB(&sblock, node.e2di_blocks[EXT2FS_NDADDR + DOUBLE]),
1241	    sblock.e2fs_bsize, dindir_block);
1242	free(dindir_block);
1243
1244	node.e2di_nblock = nblock;
1245	iput(&node, EXT2_RESIZEINO);
1246}
1247
1248/*
1249 * uint32_t alloc(uint32_t size, uint16_t mode)
1250 *
1251 *	Allocate a block (from cylinder group 0)
1252 *	Reference: src/sys/ufs/ext2fs/ext2fs_alloc.c:ext2fs_alloccg()
1253 */
1254uint32_t
1255alloc(uint32_t size, uint16_t mode)
1256{
1257	uint32_t loc, bno;
1258	uint8_t *bbp;
1259	uint len, map, i;
1260
1261	if (gd[0].ext2bgd_nbfree == 0)
1262		return 0;
1263
1264	if (size > sblock.e2fs_bsize)
1265		return 0;
1266
1267	bbp = malloc(sblock.e2fs_bsize);
1268	if (bbp == NULL)
1269		return 0;
1270	rdfs(EXT2_FSBTODB(&sblock, fs2h32(gd[0].ext2bgd_b_bitmap)),
1271	    sblock.e2fs_bsize, bbp);
1272
1273	/* XXX: kernel uses e2fs_fpg here */
1274	len = sblock.e2fs.e2fs_bpg / NBBY;
1275
1276#if 0	/* no need block allocation for root or lost+found dir */
1277	for (loc = 0; loc < len; loc++) {
1278		if (bbp[loc] == 0) {
1279			bno = loc * NBBY;
1280			goto gotit;
1281		}
1282	}
1283#endif
1284
1285	loc = skpc(~0U, len, bbp);
1286	if (loc == 0) {
1287		free(bbp);
1288		return 0;
1289	}
1290	loc = len - loc;
1291	map = bbp[loc];
1292	bno = loc * NBBY;
1293	for (i = 0; i < NBBY; i++, bno++) {
1294		if ((map & (1 << i)) == 0)
1295			goto gotit;
1296	}
1297	free(bbp);
1298	return 0;
1299
1300 gotit:
1301	if (isset(bbp, bno))
1302		errx(EXIT_FAILURE, "%s: inconsistent bitmap", __func__);
1303
1304	setbit(bbp, bno);
1305	wtfs(EXT2_FSBTODB(&sblock, fs2h32(gd[0].ext2bgd_b_bitmap)),
1306	    sblock.e2fs_bsize, bbp);
1307	free(bbp);
1308	/* XXX: modified group descriptors won't be written into backups */
1309	gd[0].ext2bgd_nbfree = h2fs16(fs2h16(gd[0].ext2bgd_nbfree)-1);
1310	if ((mode & EXT2_IFDIR) != 0)
1311		gd[0].ext2bgd_ndirs = h2fs16(fs2h16(gd[0].ext2bgd_ndirs)+1);
1312	sblock.e2fs.e2fs_fbcount--;
1313
1314	return sblock.e2fs.e2fs_first_dblock + bno;
1315}
1316
1317/*
1318 * void iput(struct ext2fs_dinode *ip, ino_t ino)
1319 *
1320 *	Put an inode entry into the corresponding table.
1321 */
1322static void
1323iput(struct ext2fs_dinode *ip, ino_t ino)
1324{
1325	daddr_t d;
1326	uint c, i;
1327	struct ext2fs_dinode *dp;
1328	uint8_t *bp;
1329
1330	bp = malloc(sblock.e2fs_bsize);
1331	if (bp == NULL)
1332		errx(EXIT_FAILURE, "%s: can't allocate buffer for inode",
1333		    __func__);
1334
1335	/*
1336	 * Reserved inodes are allocated and accounted in initcg()
1337	 * so skip checks of the bitmap and allocation for them.
1338	 */
1339	if (ino >= EXT2_FIRSTINO) {
1340		c = ino_to_cg(&sblock, ino);
1341
1342		/* sanity check */
1343		if (gd[c].ext2bgd_nifree == 0)
1344			errx(EXIT_FAILURE,
1345			    "%s: no free inode %" PRIu64 " in block group %u",
1346			    __func__, (uint64_t)ino, c);
1347
1348		/* update inode bitmap */
1349		rdfs(EXT2_FSBTODB(&sblock, fs2h32(gd[0].ext2bgd_i_bitmap)),
1350		    sblock.e2fs_bsize, bp);
1351
1352		/* more sanity */
1353		if (isset(bp, EXT2_INO_INDEX(ino)))
1354			errx(EXIT_FAILURE, "%s: inode %" PRIu64
1355			    " already in use", __func__, (uint64_t)ino);
1356		setbit(bp, EXT2_INO_INDEX(ino));
1357		wtfs(EXT2_FSBTODB(&sblock, fs2h32(gd[0].ext2bgd_i_bitmap)),
1358		    sblock.e2fs_bsize, bp);
1359		gd[c].ext2bgd_nifree = h2fs16(fs2h16(gd[c].ext2bgd_nifree)-1);
1360		sblock.e2fs.e2fs_ficount--;
1361	}
1362
1363	if (ino >= sblock.e2fs.e2fs_ipg * sblock.e2fs_ncg)
1364		errx(EXIT_FAILURE, "%s: inode value out of range (%" PRIu64
1365		    ")", __func__, (uint64_t)ino);
1366
1367	/* update an inode entry in the table */
1368	d = EXT2_FSBTODB(&sblock, ino_to_fsba(&sblock, ino));
1369	rdfs(d, sblock.e2fs_bsize, bp);
1370
1371	dp = (struct ext2fs_dinode *)(bp +
1372	    inodesize * ino_to_fsbo(&sblock, ino));
1373	e2fs_isave(ip, dp, EXT2_DINODE_SIZE(&sblock));
1374	/* e2fs_i_bswap() doesn't swap e2di_blocks addrs */
1375	if ((ip->e2di_mode & EXT2_IFMT) != EXT2_IFLNK) {
1376		for (i = 0; i < EXT2FS_NDADDR + EXT2FS_NIADDR; i++)
1377			dp->e2di_blocks[i] = h2fs32(ip->e2di_blocks[i]);
1378	}
1379	/* h2fs32() just for consistency */
1380	dp->e2di_gen = h2fs32(arc4random());
1381
1382	wtfs(d, sblock.e2fs_bsize, bp);
1383	free(bp);
1384}
1385
1386/*
1387 * Read a block from the file system
1388 */
1389void
1390rdfs(daddr_t bno, int size, void *bf)
1391{
1392	int n;
1393	off_t offset;
1394
1395	offset = bno;
1396	n = pread(fsi, bf, size, offset * sectorsize);
1397	if (n != size)
1398		err(EXIT_FAILURE, "%s: read error for sector %" PRId64,
1399		    __func__, (int64_t)bno);
1400}
1401
1402/*
1403 * Write a block to the file system
1404 */
1405void
1406wtfs(daddr_t bno, int size, void *bf)
1407{
1408	int n;
1409	off_t offset;
1410
1411	if (Nflag)
1412		return;
1413	offset = bno;
1414	n = pwrite(fso, bf, size, offset * sectorsize);
1415	if (n != size)
1416		err(EXIT_FAILURE, "%s: write error for sector %" PRId64,
1417		    __func__, (int64_t)bno);
1418}
1419
1420int
1421ilog2(uint val)
1422{
1423
1424	if (val == 0 || !powerof2(val))
1425		errx(EXIT_FAILURE, "%s: %u is not a power of 2",
1426		    __func__, val);
1427
1428	return ffs(val) - 1;
1429}
1430
1431/*
1432 * int skpc(int mask, size_t size, uint8_t *cp)
1433 *
1434 *	Locate an unsigned character of value mask inside cp[].
1435 * 	(from src/sys/lib/libkern/skpc.c)
1436 */
1437int
1438skpc(int mask, size_t size, uint8_t *cp)
1439{
1440	uint8_t *end;
1441
1442	end = &cp[size];
1443	while (cp < end && *cp == (uint8_t)mask)
1444		cp++;
1445
1446	return end - cp;
1447}
1448