make_lfs.c revision 1.1 1 /* $NetBSD: make_lfs.c,v 1.1 2005/02/26 05:45:54 perseant Exp $ */
2
3 /*-
4 * Copyright (c) 2003 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Konrad E. Schroder <perseant (at) hhhh.org>.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the NetBSD
21 * Foundation, Inc. and its contributors.
22 * 4. Neither the name of The NetBSD Foundation nor the names of its
23 * contributors may be used to endorse or promote products derived
24 * from this software without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 * POSSIBILITY OF SUCH DAMAGE.
37 */
38 /*-
39 * Copyright (c) 1991, 1993
40 * The Regents of the University of California. All rights reserved.
41 *
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
44 * are met:
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. Neither the name of the University nor the names of its contributors
51 * may be used to endorse or promote products derived from this software
52 * without specific prior written permission.
53 *
54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 * SUCH DAMAGE.
65 */
66
67 #include <sys/cdefs.h>
68 #ifndef lint
69 #if 0
70 static char sccsid[] = "@(#)lfs.c 8.5 (Berkeley) 5/24/95";
71 #else
72 __RCSID("$NetBSD: make_lfs.c,v 1.1 2005/02/26 05:45:54 perseant Exp $");
73 #endif
74 #endif /* not lint */
75
76 #include <sys/param.h>
77 #define FSTYPENAMES
78 #include <sys/disklabel.h>
79 #include <sys/time.h>
80 #include <sys/mount.h>
81 #include <sys/stat.h>
82
83 #include <ufs/ufs/dir.h>
84 #include <ufs/ufs/quota.h>
85 #include <ufs/ufs/inode.h>
86
87 /* Override certain things to make <ufs/lfs/lfs.h> work */
88 # undef simple_lock
89 # define simple_lock(x)
90 # undef simple_unlock
91 # define simple_unlock(x)
92 # define vnode uvnode
93 # define buf ubuf
94 # define panic call_panic
95 #include <ufs/lfs/lfs.h>
96
97 #include <err.h>
98 #include <errno.h>
99 #include <stdio.h>
100 #include <stdlib.h>
101 #include <string.h>
102 #include <time.h>
103 #include <unistd.h>
104
105 #include "config.h"
106 #include "extern.h"
107
108 #include "bufcache.h"
109 #include "vnode.h"
110 #include "lfs.h"
111 #include "segwrite.h"
112
113 extern int Nflag; /* Don't write anything */
114 ufs_daddr_t ifibc; /* How many indirect blocks */
115
116 #ifdef MAKE_LF_DIR
117 # define HIGHEST_USED_INO LOSTFOUNDINO
118 #else
119 # define HIGHEST_USED_INO ROOTINO
120 #endif
121
122 static struct lfs lfs_default = {
123 { /* lfs_dlfs */
124 /* dlfs_magic */ LFS_MAGIC,
125 /* dlfs_version */ LFS_VERSION,
126 /* dlfs_size */ 0,
127 /* dlfs_ssize */ DFL_LFSSEG,
128 /* dlfs_dsize */ 0,
129 /* dlfs_bsize */ DFL_LFSBLOCK,
130 /* dlfs_fsize */ DFL_LFSFRAG,
131 /* dlfs_frag */ DFL_LFSBLOCK/DFL_LFSFRAG,
132 /* dlfs_free */ HIGHEST_USED_INO + 1,
133 /* dlfs_bfree */ 0,
134 /* dlfs_nfiles */ 0,
135 /* dlfs_avail */ 0,
136 /* dlfs_uinodes */ 0,
137 /* dlfs_idaddr */ 0,
138 /* dlfs_ifile */ LFS_IFILE_INUM,
139 /* dlfs_lastseg */ 0,
140 /* dlfs_nextseg */ 0,
141 /* dlfs_curseg */ 0,
142 /* dlfs_offset */ 0,
143 /* dlfs_lastpseg */ 0,
144 /* dlfs_inopf */ 0,
145 /* dlfs_minfree */ MINFREE,
146 /* dlfs_maxfilesize */ 0,
147 /* dlfs_fsbpseg */ 0,
148 /* dlfs_inopb */ DFL_LFSBLOCK/sizeof(struct ufs1_dinode),
149 /* dlfs_ifpb */ DFL_LFSBLOCK/sizeof(IFILE),
150 /* dlfs_sepb */ DFL_LFSBLOCK/sizeof(SEGUSE),
151 /* XXX ondisk32 */
152 /* dlfs_nindir */ DFL_LFSBLOCK/sizeof(int32_t),
153 /* dlfs_nseg */ 0,
154 /* dlfs_nspf */ 0,
155 /* dlfs_cleansz */ 0,
156 /* dlfs_segtabsz */ 0,
157 /* dlfs_segmask */ DFL_LFSSEG_MASK,
158 /* dlfs_segshift */ DFL_LFSSEG_SHIFT,
159 /* dlfs_bshift */ DFL_LFSBLOCK_SHIFT,
160 /* dlfs_ffshift */ DFL_LFS_FFSHIFT,
161 /* dlfs_fbshift */ DFL_LFS_FBSHIFT,
162 /* dlfs_bmask */ DFL_LFSBLOCK_MASK,
163 /* dlfs_ffmask */ DFL_LFS_FFMASK,
164 /* dlfs_fbmask */ DFL_LFS_FBMASK,
165 /* dlfs_blktodb */ 0,
166 /* dlfs_sushift */ 0,
167 /* dlfs_maxsymlinklen */ MAXSYMLINKLEN_UFS1,
168 /* dlfs_sboffs */ { 0 },
169 /* dlfs_nclean */ 0,
170 /* dlfs_fsmnt */ { 0 },
171 /* dlfs_pflags */ LFS_PF_CLEAN,
172 /* dlfs_dmeta */ 0,
173 /* dlfs_minfreeseg */ 0,
174 /* dlfs_sumsize */ 0,
175 /* dlfs_serial */ 0,
176 /* dlfs_ibsize */ DFL_LFSFRAG,
177 /* dlfs_start */ 0,
178 /* dlfs_inodefmt */ LFS_44INODEFMT,
179 /* dlfs_tstamp */ 0,
180 /* dlfs_interleave */ 0,
181 /* dlfs_ident */ 0,
182 /* dlfs_fsbtodb */ 0,
183
184 /* dlfs_pad */ { 0 },
185 /* dlfs_cksum */ 0
186 },
187 /* lfs_sp */ NULL,
188 /* lfs_ivnode */ NULL,
189 /* lfs_seglock */ 0,
190 /* lfs_lockpid */ 0,
191 /* lfs_iocount */ 0,
192 /* lfs_writer */ 0,
193 /* lfs_dirops */ 0,
194 /* lfs_doifile */ 0,
195 /* lfs_nactive */ 0,
196 /* lfs_fmod */ 0,
197 /* lfs_ronly */ 0,
198 /* lfs_flags */ 0
199 };
200
201 #define UMASK 0755
202
203 struct direct lfs_root_dir[] = {
204 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "."},
205 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".."},
206 /* { LFS_IFILE_INUM, sizeof(struct direct), DT_REG, 5, "ifile"}, */
207 #ifdef MAKE_LF_DIR
208 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found"},
209 #endif
210 };
211
212 #ifdef MAKE_LF_DIR
213 struct direct lfs_lf_dir[] = {
214 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." },
215 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
216 };
217 #endif
218
219 void pwarn(const char *, ...);
220 static void make_dinode(ino_t, struct ufs1_dinode *, int, struct lfs *);
221 static void make_dir( void *, struct direct *, int);
222 static uint64_t maxfilesize(int);
223
224 /*
225 * calculate the maximum file size allowed with the specified block shift.
226 */
227 static uint64_t
228 maxfilesize(int bshift)
229 {
230 uint64_t nptr; /* number of block pointers per block */
231 uint64_t maxblock;
232
233 nptr = (1 << bshift) / sizeof(uint32_t);
234 maxblock = NDADDR + nptr + nptr * nptr + nptr * nptr * nptr;
235
236 return maxblock << bshift;
237 }
238
239 /*
240 * Create the root directory for this file system and the lost+found
241 * directory.
242 */
243 static void
244 make_dinode(ino_t ino, struct ufs1_dinode *dip, int nfrags, struct lfs *fs)
245 {
246 int fsb_per_blk, i;
247 int nblocks, bb, base, factor, lvl;
248
249 nblocks = howmany(nfrags, fs->lfs_frag);
250 if(nblocks >= NDADDR)
251 nfrags = roundup(nfrags, fs->lfs_frag);
252
253 dip->di_nlink = 1;
254 dip->di_blocks = fragstofsb(fs, nfrags);
255
256 dip->di_size = (nfrags << fs->lfs_ffshift);
257 dip->di_atime = dip->di_mtime = dip->di_ctime = fs->lfs_tstamp;
258 dip->di_atimensec = dip->di_mtimensec = dip->di_ctimensec = 0;
259 dip->di_inumber = ino;
260 dip->di_gen = 1;
261
262 fsb_per_blk = fragstofsb(fs, blkstofrags(fs, 1));
263
264 if (NDADDR < nblocks) {
265 /* Count up how many indirect blocks we need, recursively */
266 /* XXX We are only called with nblocks > 1 for Ifile */
267 bb = nblocks - NDADDR;
268 while (bb > 0) {
269 bb = howmany(bb, NINDIR(fs));
270 ifibc += bb;
271 --bb;
272 }
273 dip->di_blocks += fragstofsb(fs, blkstofrags(fs, ifibc));
274 }
275
276 /* Assign the block addresses for the ifile */
277 for (i = 0; i < MIN(nblocks,NDADDR); i++) {
278 dip->di_db[i] = 0x0;
279 }
280 if(nblocks > NDADDR) {
281 dip->di_ib[0] = 0x0;
282 bb = howmany(nblocks - NDADDR, NINDIR(fs)) - 1;
283 factor = NINDIR(fs);
284 base = -NDADDR - factor;
285 lvl = 1;
286 while (bb > 0) {
287 dip->di_ib[lvl] = 0x0;
288 bb = howmany(bb, NINDIR(fs));
289 --bb;
290 factor *= NINDIR(fs);
291 base -= factor;
292 ++lvl;
293 }
294 }
295 }
296
297 /*
298 * Construct a set of directory entries in "bufp". We assume that all the
299 * entries in protodir fir in the first DIRBLKSIZ.
300 */
301 static void
302 make_dir(void *bufp, struct direct *protodir, int entries)
303 {
304 char *cp;
305 int i, spcleft;
306
307 spcleft = DIRBLKSIZ;
308 for (cp = bufp, i = 0; i < entries - 1; i++) {
309 protodir[i].d_reclen = DIRSIZ(NEWDIRFMT, &protodir[i], 0);
310 memmove(cp, &protodir[i], protodir[i].d_reclen);
311 cp += protodir[i].d_reclen;
312 if ((spcleft -= protodir[i].d_reclen) < 0)
313 fatal("%s: %s", special, "directory too big");
314 }
315 protodir[i].d_reclen = spcleft;
316 memmove(cp, &protodir[i], DIRSIZ(NEWDIRFMT, &protodir[i], 0));
317 }
318
319 int
320 make_lfs(int devfd, uint secsize, struct partition *partp, int minfree,
321 int block_size, int frag_size, int seg_size, int minfreeseg,
322 int version, daddr_t start, int ibsize, int interleave,
323 u_int32_t roll_id)
324 {
325 struct ufs1_dinode *dip; /* Pointer to a disk inode */
326 CLEANERINFO *cip; /* Segment cleaner information table */
327 IFILE *ip; /* Pointer to array of ifile structures */
328 IFILE_V1 *ip_v1;
329 struct lfs *fs; /* Superblock */
330 SEGUSE *segp; /* Segment usage table */
331 daddr_t sb_addr; /* Address of superblocks */
332 daddr_t seg_addr; /* Address of current segment */
333 int bsize; /* Block size */
334 int fsize; /* Fragment size */
335 int db_per_blk; /* Disk blocks per file block */
336 int i, j;
337 int sb_interval; /* number of segs between super blocks */
338 int ssize; /* Segment size */
339 double fssize;
340 int warned_segtoobig=0;
341 int label_fsb, sb_fsb;
342 int curw, ww;
343 char tbuf[BUFSIZ];
344 struct ubuf *bp;
345 struct uvnode *vp, *save_devvp;
346 int bb, ubb, dmeta, labelskew;
347
348 /* Initialize buffer cache */
349 bufinit();
350
351 /* Initialize LFS subsystem with blank superblock and ifile. */
352 fs = lfs_init(devfd, start, (ufs_daddr_t)0, 1, 1/* XXX debug*/);
353 save_devvp = fs->lfs_unlockvp;
354 vp = fs->lfs_ivnode;
355 *fs = lfs_default;
356 fs->lfs_ivnode = vp;
357 fs->lfs_unlockvp = save_devvp;
358
359
360 /* Set version first of all since it is used to compute other fields */
361 fs->lfs_version = version;
362
363 /* If partition is not an LFS partition, warn that that is the case */
364 if(partp->p_fstype != FS_BSDLFS) {
365 fatal("partition label indicated fs type \"%s\", expected \"%s\"",
366 fstypenames[partp->p_fstype], fstypenames[FS_BSDLFS]);
367 }
368
369 if (!(bsize = block_size))
370 if (!(bsize = partp->p_fsize * partp->p_frag))
371 bsize = DFL_LFSBLOCK;
372 if (!(fsize = frag_size))
373 if (!(fsize = partp->p_fsize))
374 fsize = DFL_LFSFRAG;
375 if (!(ssize = seg_size)) {
376 ssize = DFL_LFSSEG;
377 if (partp->p_sgs == 0 ||
378 !(ssize = (partp->p_fsize * partp->p_frag) << partp->p_sgs))
379 {
380 ssize = DFL_LFSSEG;
381 }
382 }
383 if (version > 1) {
384 if (ibsize == 0)
385 ibsize = fsize;
386 if (ibsize <= 0 || ibsize % fsize)
387 fatal("illegal inode block size: %d\n", ibsize);
388 } else if (ibsize && ibsize != bsize)
389 fatal("cannot specify inode block size when version == 1\n");
390
391 /* Sanity check: fsize<=bsize<ssize */
392 if (fsize > bsize) {
393 /* Only complain if fsize was explicitly set */
394 if(frag_size)
395 fatal("fragment size must be <= block size %d", bsize);
396 fsize = bsize;
397 }
398 if (bsize >= ssize) {
399 /* Only fatal if ssize was explicitly set */
400 if(seg_size)
401 fatal("block size must be < segment size");
402 warnx("%s: disklabel segment size (%d) too small, using default (%d)",
403 progname, ssize, DFL_LFSSEG);
404 ssize = DFL_LFSSEG;
405 }
406 if (start < 0 || start >= partp->p_size)
407 fatal("filesystem offset %ld out of range", (long)start);
408 if (version == 1) {
409 if (start)
410 warnx("filesystem offset ignored for version 1 filesystem");
411 start = LFS_LABELPAD / secsize;
412 }
413
414 tryagain:
415 /* Modify parts of superblock overridden by command line arguments */
416 if (bsize != DFL_LFSBLOCK || fsize != DFL_LFSFRAG) {
417 fs->lfs_bshift = log2(bsize);
418 if (1 << fs->lfs_bshift != bsize)
419 fatal("%d: block size not a power of 2", bsize);
420 fs->lfs_bsize = bsize;
421 fs->lfs_fsize = fsize;
422 fs->lfs_bmask = bsize - 1;
423 fs->lfs_ffmask = fsize - 1;
424 fs->lfs_ffshift = log2(fsize);
425 if (1 << fs->lfs_ffshift != fsize)
426 fatal("%d: frag size not a power of 2", fsize);
427 fs->lfs_frag = numfrags(fs, bsize);
428 fs->lfs_fbmask = fs->lfs_frag - 1;
429 fs->lfs_fbshift = log2(fs->lfs_frag);
430 fs->lfs_ifpb = bsize / sizeof(IFILE);
431 /* XXX ondisk32 */
432 fs->lfs_nindir = bsize / sizeof(int32_t);
433 }
434
435 if (fs->lfs_version == 1) {
436 fs->lfs_sumsize = LFS_V1_SUMMARY_SIZE;
437 fs->lfs_segshift = log2(ssize);
438 if (1 << fs->lfs_segshift != ssize)
439 fatal("%d: segment size not power of 2", ssize);
440 fs->lfs_segmask = ssize - 1;
441 fs->lfs_ifpb = fs->lfs_bsize / sizeof(IFILE_V1);
442 fs->lfs_ibsize = fs->lfs_bsize;
443 fs->lfs_sepb = bsize / sizeof(SEGUSE_V1);
444 fs->lfs_ssize = ssize >> fs->lfs_bshift;
445 } else {
446 if (ssize % fsize) {
447 fprintf(stderr,
448 "Segment size %d is not a multiple of frag size; ",
449 ssize);
450 ssize = roundup(ssize, fsize);
451 fprintf(stderr, "trying size %d.\n", ssize);
452 goto tryagain;
453 }
454 fs->lfs_sumsize = fsize;
455 fs->lfs_segshift = 0;
456 fs->lfs_segmask = 0;
457 fs->lfs_sepb = bsize / sizeof(SEGUSE);
458 fs->lfs_ssize = ssize;
459 fs->lfs_ibsize = ibsize;
460 }
461 fs->lfs_inopb = fs->lfs_ibsize / sizeof(struct ufs1_dinode);
462 fs->lfs_minfree = minfree;
463
464 if (version > 1) {
465 fs->lfs_inopf = secsize/DINODE1_SIZE;
466 fs->lfs_interleave = interleave;
467 if (roll_id == 0)
468 roll_id = arc4random();
469 fs->lfs_ident = roll_id;
470 }
471
472 /*
473 * Fill in parts of superblock that can be computed from file system
474 * size, disk geometry and current time.
475 */
476 db_per_blk = bsize/secsize;
477 fs->lfs_blktodb = log2(db_per_blk);
478 fs->lfs_fsbtodb = log2(fsize / secsize);
479 if (version == 1) {
480 fs->lfs_sushift = log2(fs->lfs_sepb);
481 fs->lfs_fsbtodb = 0;
482 fs->lfs_size = partp->p_size >> fs->lfs_blktodb;
483 }
484 label_fsb = btofsb(fs, roundup(LFS_LABELPAD, fsize));
485 sb_fsb = btofsb(fs, roundup(LFS_SBPAD, fsize));
486 fs->lfs_fsbpseg = dbtofsb(fs, ssize / secsize);
487 fs->lfs_size = partp->p_size >> fs->lfs_fsbtodb;
488 fs->lfs_dsize = dbtofsb(fs, partp->p_size) -
489 MAX(label_fsb, dbtofsb(fs, start));
490 fs->lfs_nseg = fs->lfs_dsize / segtod(fs, 1);
491
492 fs->lfs_nclean = fs->lfs_nseg - 1;
493 fs->lfs_maxfilesize = maxfilesize(fs->lfs_bshift);
494 if (minfreeseg == 0)
495 fs->lfs_minfreeseg = fs->lfs_nseg / DFL_MIN_FREE_SEGS;
496 else
497 fs->lfs_minfreeseg = minfreeseg;
498 if (fs->lfs_minfreeseg < MIN_FREE_SEGS)
499 fs->lfs_minfreeseg = MIN_FREE_SEGS;
500
501 if(fs->lfs_nseg < fs->lfs_minfreeseg + 1
502 || fs->lfs_nseg < LFS_MIN_SBINTERVAL + 1)
503 {
504 if(seg_size == 0 && ssize > (bsize<<1)) {
505 if(!warned_segtoobig) {
506 fprintf(stderr,"Segment size %d is too large; "
507 "trying smaller sizes.\n", ssize);
508 if (ssize == (bsize << 16)) {
509 fprintf(stderr, "(Did you perhaps "
510 "accidentally leave \"16\" "
511 "in the disklabel's sgs "
512 "field?)\n");
513 }
514 }
515 ++warned_segtoobig;
516 ssize >>= 1;
517 goto tryagain;
518 }
519 fatal("Could not allocate enough segments with segment "
520 "size %d and block size %d;\nplease decrease the "
521 "segment size.\n", ssize, fs->lfs_bsize);
522 }
523
524 /*
525 * Now that we've determined what we're going to do, announce it
526 * to the user.
527 */
528 printf("Creating a version %d LFS", fs->lfs_version);
529 if (fs->lfs_version > 1)
530 printf(" with roll-forward ident 0x%x", fs->lfs_ident);
531 printf("\n");
532 fssize = (double)fs->lfs_nseg;
533 fssize *= (double)ssize;
534 fssize /= 1048576.0;
535 printf("%.1fMB in %d segments of size %d\n", fssize,
536 fs->lfs_nseg, ssize);
537
538 /*
539 * The number of free blocks is set from the number of segments
540 * times the segment size - lfs_minfreesegs (that we never write
541 * because we need to make sure the cleaner can run). Then
542 * we'll subtract off the room for the superblocks ifile entries
543 * and segment usage table, and half a block per segment that can't
544 * be written due to fragmentation.
545 */
546 fs->lfs_dsize = (fs->lfs_nseg - fs->lfs_minfreeseg) *
547 segtod(fs, 1);
548 fs->lfs_bfree = fs->lfs_dsize;
549 fs->lfs_bfree -= dbtofsb(fs, ((fs->lfs_nseg / 2) <<
550 fs->lfs_blktodb));
551
552 fs->lfs_segtabsz = SEGTABSIZE_SU(fs);
553 fs->lfs_cleansz = CLEANSIZE_SU(fs);
554 if ((fs->lfs_tstamp = time(NULL)) == -1)
555 fatal("time: %s", strerror(errno));
556 if (version == 1)
557 fs->lfs_otstamp = fs->lfs_tstamp;
558
559 if ((sb_interval = fs->lfs_nseg / LFS_MAXNUMSB) < LFS_MIN_SBINTERVAL)
560 sb_interval = LFS_MIN_SBINTERVAL;
561
562 /*
563 * Figure out where the superblocks are going to live.
564 *
565 * Make segment 0 start at either zero, or LFS_LABELPAD, or
566 * >= LFS_SBPAD+LFS_LABELPAD, in order to prevent segment 0
567 * from having half a superblock in it.
568 */
569 if (fsbtodb(fs, dbtofsb(fs, start)) != start)
570 fatal("Segment 0 offset is not multiple of frag size\n");
571 if (start != 0 && dbtob(start) != LFS_LABELPAD &&
572 dbtob(start) < LFS_SBPAD + LFS_LABELPAD) {
573 fatal("Using flags \"-O %" PRId64 "\" would result in the "
574 "first segment containing only\npart of a superblock. "
575 "Please choose an offset of 0, %d, or %d or more,\n",
576 start, btodb(LFS_LABELPAD),
577 btodb(LFS_LABELPAD + LFS_SBPAD));
578 }
579 fs->lfs_sboffs[0] = label_fsb;
580 if (version == 1)
581 fs->lfs_start = fs->lfs_sboffs[0];
582 else
583 fs->lfs_start = dbtofsb(fs, start);
584 fs->lfs_dsize -= sb_fsb;
585 for (i = 1; i < LFS_MAXNUMSB; i++) {
586 sb_addr = ((i * sb_interval) * segtod(fs, 1))
587 + fs->lfs_sboffs[0];
588 /* Segment 0 eats the label, except for version 1 */
589 if (fs->lfs_version > 1 && fs->lfs_start < label_fsb)
590 sb_addr -= label_fsb - start;
591 if (sb_addr + sizeof(struct dlfs)
592 >= dbtofsb(fs, partp->p_size))
593 break;
594 fs->lfs_sboffs[i] = sb_addr;
595 fs->lfs_dsize -= sb_fsb;
596 }
597
598 /* We need >= 2 superblocks */
599 if(fs->lfs_sboffs[1] == 0x0) {
600 fatal("Could not assign a disk address for the second "
601 "superblock.\nPlease decrease the segment size.\n");
602 }
603
604 fs->lfs_lastseg = sntod(fs, fs->lfs_nseg - 2);
605 fs->lfs_curseg = sntod(fs, fs->lfs_nseg - 1);
606 fs->lfs_offset = sntod(fs, fs->lfs_nseg);
607 fs->lfs_nextseg = sntod(fs, 0);
608
609 /*
610 * Initialize the Ifile inode. Do this before we do anything
611 * with the Ifile or segment tables.
612 */
613 dip = VTOI(fs->lfs_ivnode)->i_din.ffs1_din = (struct ufs1_dinode *)
614 malloc(sizeof(*dip));
615 memset(dip, 0, sizeof(*dip));
616 dip->di_mode = IFREG|IREAD|IWRITE;
617 dip->di_flags = SF_IMMUTABLE;
618 make_dinode(LFS_IFILE_INUM, dip,
619 blkstofrags(fs, fs->lfs_cleansz + fs->lfs_segtabsz + 1), fs);
620 dip->di_size = (fs->lfs_cleansz + fs->lfs_segtabsz + 1) << fs->lfs_bshift;
621 for (i = 0; i < NDADDR && i < (dip->di_size >> fs->lfs_bshift); i++)
622 VTOI(fs->lfs_ivnode)->i_lfs_fragsize[i] = fs->lfs_bsize;
623
624 /*
625 * Set up in-superblock segment usage cache
626 */
627 fs->lfs_suflags = (u_int32_t **) malloc(2 * sizeof(u_int32_t *));
628 fs->lfs_suflags[0] = (u_int32_t *) malloc(fs->lfs_nseg * sizeof(u_int32_t));
629 fs->lfs_suflags[1] = (u_int32_t *) malloc(fs->lfs_nseg * sizeof(u_int32_t));
630
631 /*
632 * Initialize the cleanerinfo block
633 */
634 LFS_CLEANERINFO(cip, fs, bp);
635 cip->clean = fs->lfs_nseg;
636 cip->dirty = 0;
637 if (version > 1) {
638 cip->free_head = HIGHEST_USED_INO + 1;
639 cip->free_tail = fs->lfs_ifpb - 1;
640 }
641 LFS_SYNC_CLEANERINFO(cip, fs, bp, 1);
642
643 /*
644 * Run through segment table and initialize that
645 */
646 for (i = j = 0; i < fs->lfs_nseg; i++) {
647 LFS_SEGENTRY(segp, fs, i, bp);
648
649 if (i == 0 &&
650 fs->lfs_start < btofsb(fs, LFS_LABELPAD + LFS_SBPAD)) {
651 segp->su_flags = SEGUSE_SUPERBLOCK;
652 fs->lfs_bfree -= sb_fsb;
653 ++j;
654 }
655 if (i > 0) {
656 if ((i % sb_interval) == 0 && j < LFS_MAXNUMSB) {
657 segp->su_flags = SEGUSE_SUPERBLOCK;
658 fs->lfs_bfree -= sb_fsb;
659 ++j;
660 } else
661 segp->su_flags = 0;
662 }
663 segp->su_lastmod = 0;
664 segp->su_nbytes = 0;
665 segp->su_ninos = 0;
666 segp->su_nsums = 0;
667
668 LFS_WRITESEGENTRY(segp, fs, i, bp);
669 }
670
671 /* Initialize root directory */
672 vp = lfs_raw_vget(fs, ROOTINO, devfd, 0x0);
673 dip = VTOI(vp)->i_din.ffs1_din;
674 make_dinode(ROOTINO, dip, howmany(DIRBLKSIZ,fs->lfs_fsize), fs);
675 dip->di_mode = IFDIR | UMASK;
676 VTOI(vp)->i_lfs_osize = dip->di_size = DIRBLKSIZ;
677 #ifdef MAKE_LF_DIR
678 VTOI(vp)->i_ffs_effnlink = dip->di_nlink = 3;
679 #else
680 VTOI(vp)->i_ffs_effnlink = dip->di_nlink = 2;
681 #endif
682 VTOI(vp)->i_lfs_effnblks = dip->di_blocks =
683 btofsb(fs, roundup(DIRBLKSIZ,fs->lfs_fsize));
684 for (i = 0; i < NDADDR && i < howmany(DIRBLKSIZ, fs->lfs_bsize); i++)
685 VTOI(vp)->i_lfs_fragsize[i] = fs->lfs_bsize;
686 if (DIRBLKSIZ < fs->lfs_bsize)
687 VTOI(vp)->i_lfs_fragsize[i - 1] =
688 roundup(DIRBLKSIZ,fs->lfs_fsize);
689 bread(vp, 0, fs->lfs_fsize, NOCRED, &bp);
690 make_dir(bp->b_data, lfs_root_dir,
691 sizeof(lfs_root_dir) / sizeof(struct direct));
692 VOP_BWRITE(bp);
693
694 #ifdef MAKE_LF_DIR
695 /* Initialize lost+found directory */
696 vp = lfs_raw_vget(fs, LOSTFOUNDINO, devfd, 0x0);
697 dip = VTOI(vp)->i_din.ffs1_din;
698 make_dinode(LOSTFOUNDINO, dip, howmany(DIRBLKSIZ,fs->lfs_fsize), fs);
699 dip->di_mode = IFDIR | UMASK;
700 VTOI(vp)->i_lfs_osize = dip->di_size = DIRBLKSIZ;
701 VTOI(vp)->i_ffs_effnlink = dip->di_nlink = 2;
702 VTOI(vp)->i_lfs_effnblks = dip->di_blocks =
703 btofsb(fs, roundup(DIRBLKSIZ,fs->lfs_fsize));
704 for (i = 0; i < NDADDR && i < howmany(DIRBLKSIZ, fs->lfs_bsize); i++)
705 VTOI(vp)->i_lfs_fragsize[i] = fs->lfs_bsize;
706 if (DIRBLKSIZ < fs->lfs_bsize)
707 VTOI(vp)->i_lfs_fragsize[i - 1] =
708 roundup(DIRBLKSIZ,fs->lfs_fsize);
709 bread(vp, 0, fs->lfs_fsize, NOCRED, &bp);
710 make_dir(bp->b_data, lfs_lf_dir,
711 sizeof(lfs_lf_dir) / sizeof(struct direct));
712 VOP_BWRITE(bp);
713 #endif /* MAKE_LF_DIR */
714
715 /* Set their IFILE entry version numbers to 1 */
716 LFS_IENTRY(ip, fs, 1, bp);
717 if (version == 1) {
718 ip_v1 = (IFILE_V1 *)ip;
719 for (i = LFS_IFILE_INUM; i <= HIGHEST_USED_INO; i++) {
720 ip_v1->if_version = 1;
721 ip_v1->if_daddr = 0x0;
722 ip_v1->if_nextfree = 0;
723 ++ip_v1;
724 }
725 } else {
726 for (i = LFS_IFILE_INUM; i <= HIGHEST_USED_INO; i++) {
727 ip->if_version = 1;
728 ip->if_daddr = 0x0;
729 ip->if_nextfree = 0;
730 ++ip;
731 }
732 }
733 /* Link remaining IFILE entries in free list */
734 if (version == 1) {
735 for (;
736 i < fs->lfs_ifpb; ++ip_v1) {
737 ip_v1->if_version = 1;
738 ip_v1->if_daddr = LFS_UNUSED_DADDR;
739 ip_v1->if_nextfree = ++i;
740 }
741 --ip_v1;
742 ip_v1->if_nextfree = LFS_UNUSED_INUM;
743 } else {
744 for (;
745 i < fs->lfs_ifpb; ++ip) {
746 ip->if_version = 1;
747 ip->if_daddr = LFS_UNUSED_DADDR;
748 ip->if_nextfree = ++i;
749 }
750 --ip;
751 ip->if_nextfree = LFS_UNUSED_INUM;
752 }
753 VOP_BWRITE(bp);
754
755 /* Write it all to disk. */
756 if (!Nflag)
757 lfs_segwrite(fs, SEGM_CKP);
758
759 /*
760 * Now that we've written everything, look to see what's available
761 * for writing.
762 */
763 fs->lfs_avail = 0;
764 bb = ubb = dmeta = 0;
765 for (i = 0; i < fs->lfs_nseg; i++) {
766 LFS_SEGENTRY(segp, fs, i, bp);
767 if (segp->su_flags & SEGUSE_DIRTY) {
768 bb += btofsb(fs, segp->su_nbytes +
769 segp->su_nsums * fs->lfs_sumsize);
770 ubb += btofsb(fs, segp->su_nbytes +
771 segp->su_nsums * fs->lfs_sumsize +
772 segp->su_ninos * fs->lfs_ibsize);
773 dmeta += btofsb(fs,
774 fs->lfs_sumsize * segp->su_nsums);
775 dmeta += btofsb(fs,
776 fs->lfs_ibsize * segp->su_ninos);
777 } else {
778 fs->lfs_avail += segtod(fs, 1);
779 if (segp->su_flags & SEGUSE_SUPERBLOCK)
780 fs->lfs_avail -= btofsb(fs, LFS_SBPAD);
781 if (i == 0 && fs->lfs_version > 1 &&
782 fs->lfs_start < btofsb(fs, LFS_LABELPAD))
783 fs->lfs_avail -= btofsb(fs, LFS_LABELPAD) -
784 fs->lfs_start;
785 }
786 brelse(bp);
787 }
788 /* Also may be available bytes in current seg */
789 i = dtosn(fs, fs->lfs_offset);
790 fs->lfs_avail += sntod(fs, i + 1) - fs->lfs_offset;
791 /* But do not count minfreesegs */
792 fs->lfs_avail -= segtod(fs, (fs->lfs_minfreeseg - (fs->lfs_minfreeseg / 2)));
793
794 labelskew = 0;
795 if (fs->lfs_version > 1 && fs->lfs_start < btofsb(fs, LFS_LABELPAD))
796 labelskew = btofsb(fs, LFS_LABELPAD);
797 fs->lfs_bfree = fs->lfs_dsize - labelskew - (ubb + bb) / 2;
798
799 /* Put that in the Ifile version too, and write it */
800 LFS_CLEANERINFO(cip, fs, bp);
801 cip->bfree = fs->lfs_bfree;
802 cip->avail = fs->lfs_avail;
803 LFS_SYNC_CLEANERINFO(cip, fs, bp, 1);
804 if (!Nflag)
805 lfs_segwrite(fs, SEGM_CKP);
806
807 /*
808 * Finally write out superblocks.
809 */
810 printf("super-block backups (for fsck -b #) at:\n");
811 curw = 0;
812 for (i = 0; i < LFS_MAXNUMSB; i++) {
813 seg_addr = fs->lfs_sboffs[i];
814 if (seg_addr == 0)
815 break;
816
817 if (i != 0)
818 curw += printf(", ");
819 ww = snprintf(tbuf, sizeof(tbuf), "%lld",
820 (long long)fsbtodb(fs, seg_addr));
821 curw += ww;
822 if (curw >= 78) {
823 printf("\n%s", tbuf);
824 curw = ww;
825 } else
826 printf("%s", tbuf);
827 fflush(stdout);
828
829 /* Leave the time stamp on the alt sb, zero the rest */
830 if (i == 2) {
831 fs->lfs_tstamp = 0;
832 fs->lfs_cksum = lfs_sb_cksum(&(fs->lfs_dlfs));
833 }
834 if (!Nflag)
835 lfs_writesuper(fs, seg_addr);
836 }
837 printf(".\n");
838
839 return 0;
840 }
841
842 /*
843 * Compatibility with fsck_lfs, since the "generic" LFS userland code uses it.
844 */
845 void
846 pwarn(const char *fmt, ...)
847 {
848 va_list ap;
849
850 va_start(ap, fmt);
851 vfprintf(stderr, fmt, ap);
852 va_end(ap);
853 }
854