make_lfs.c revision 1.9 1 /* $NetBSD: make_lfs.c,v 1.9 2006/09/05 19:44:44 riz 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.9 2006/09/05 19:44:44 riz Exp $");
73 #endif
74 #endif /* not lint */
75
76 #include <sys/param.h>
77 #include <sys/disk.h>
78 #include <sys/time.h>
79 #include <sys/mount.h>
80 #include <sys/stat.h>
81
82 #include <ufs/ufs/dir.h>
83 #include <ufs/ufs/quota.h>
84 #include <ufs/ufs/inode.h>
85
86 /* Override certain things to make <ufs/lfs/lfs.h> work */
87 # undef simple_lock
88 # define simple_lock(x)
89 # undef simple_unlock
90 # define simple_unlock(x)
91 # define vnode uvnode
92 # define buf ubuf
93 # define panic call_panic
94 #include <ufs/lfs/lfs.h>
95
96 #include <err.h>
97 #include <errno.h>
98 #include <stdio.h>
99 #include <stdlib.h>
100 #include <string.h>
101 #include <time.h>
102 #include <unistd.h>
103
104 #include "config.h"
105 #include "extern.h"
106
107 #include "bufcache.h"
108 #include "vnode.h"
109 #include "lfs_user.h"
110 #include "segwrite.h"
111
112 extern int Nflag; /* Don't write anything */
113 ufs_daddr_t ifibc; /* How many indirect blocks */
114
115 #ifdef MAKE_LF_DIR
116 # define HIGHEST_USED_INO LOSTFOUNDINO
117 #else
118 # define HIGHEST_USED_INO ROOTINO
119 #endif
120
121 static struct lfs lfs_default = {
122 { /* lfs_dlfs */
123 /* dlfs_magic */ LFS_MAGIC,
124 /* dlfs_version */ LFS_VERSION,
125 /* dlfs_size */ 0,
126 /* dlfs_ssize */ DFL_LFSSEG,
127 /* dlfs_dsize */ 0,
128 /* dlfs_bsize */ DFL_LFSBLOCK,
129 /* dlfs_fsize */ DFL_LFSFRAG,
130 /* dlfs_frag */ DFL_LFSBLOCK/DFL_LFSFRAG,
131 /* dlfs_freehd */ HIGHEST_USED_INO + 1,
132 /* dlfs_bfree */ 0,
133 /* dlfs_nfiles */ 0,
134 /* dlfs_avail */ 0,
135 /* dlfs_uinodes */ 0,
136 /* dlfs_idaddr */ 0,
137 /* dlfs_ifile */ LFS_IFILE_INUM,
138 /* dlfs_lastseg */ 0,
139 /* dlfs_nextseg */ 0,
140 /* dlfs_curseg */ 0,
141 /* dlfs_offset */ 0,
142 /* dlfs_lastpseg */ 0,
143 /* dlfs_inopf */ 0,
144 /* dlfs_minfree */ MINFREE,
145 /* dlfs_maxfilesize */ 0,
146 /* dlfs_fsbpseg */ 0,
147 /* dlfs_inopb */ DFL_LFSBLOCK/sizeof(struct ufs1_dinode),
148 /* dlfs_ifpb */ DFL_LFSBLOCK/sizeof(IFILE),
149 /* dlfs_sepb */ DFL_LFSBLOCK/sizeof(SEGUSE),
150 /* XXX ondisk32 */
151 /* dlfs_nindir */ DFL_LFSBLOCK/sizeof(int32_t),
152 /* dlfs_nseg */ 0,
153 /* dlfs_nspf */ 0,
154 /* dlfs_cleansz */ 0,
155 /* dlfs_segtabsz */ 0,
156 /* dlfs_segmask */ DFL_LFSSEG_MASK,
157 /* dlfs_segshift */ DFL_LFSSEG_SHIFT,
158 /* dlfs_bshift */ DFL_LFSBLOCK_SHIFT,
159 /* dlfs_ffshift */ DFL_LFS_FFSHIFT,
160 /* dlfs_fbshift */ DFL_LFS_FBSHIFT,
161 /* dlfs_bmask */ DFL_LFSBLOCK_MASK,
162 /* dlfs_ffmask */ DFL_LFS_FFMASK,
163 /* dlfs_fbmask */ DFL_LFS_FBMASK,
164 /* dlfs_blktodb */ 0,
165 /* dlfs_sushift */ 0,
166 /* dlfs_maxsymlinklen */ MAXSYMLINKLEN_UFS1,
167 /* dlfs_sboffs */ { 0 },
168 /* dlfs_nclean */ 0,
169 /* dlfs_fsmnt */ { 0 },
170 /* dlfs_pflags */ LFS_PF_CLEAN,
171 /* dlfs_dmeta */ 0,
172 /* dlfs_minfreeseg */ 0,
173 /* dlfs_sumsize */ 0,
174 /* dlfs_serial */ 0,
175 /* dlfs_ibsize */ DFL_LFSFRAG,
176 /* dlfs_start */ 0,
177 /* dlfs_tstamp */ 0,
178 /* dlfs_inodefmt */ LFS_44INODEFMT,
179 /* dlfs_interleave */ 0,
180 /* dlfs_ident */ 0,
181 /* dlfs_fsbtodb */ 0,
182 /* dlfs_resvseg */ 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 dkwedge_info *dkw, int minfree,
321 int block_size, int frag_size, int seg_size, int minfreeseg,
322 int resvseg, 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 = NULL;
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 u_int64_t tsepb, tnseg;
348
349 /*
350 * Initialize buffer cache. Use a ballpark guess of the length of
351 * the segment table for the number of hash chains.
352 */
353 tnseg = dkw->dkw_size / ((seg_size ? seg_size : DFL_LFSSEG) / secsize);
354 tsepb = (block_size ? block_size : DFL_LFSBLOCK) / sizeof(SEGSUM);
355 if (tnseg == 0)
356 fatal("zero size partition");
357 bufinit(tnseg / tsepb);
358
359 /* Initialize LFS subsystem with blank superblock and ifile. */
360 fs = lfs_init(devfd, start, (ufs_daddr_t)0, 1, 1/* XXX debug*/);
361 save_devvp = fs->lfs_devvp;
362 vp = fs->lfs_ivnode;
363 *fs = lfs_default;
364 fs->lfs_ivnode = vp;
365 fs->lfs_devvp = save_devvp;
366
367
368 /* Set version first of all since it is used to compute other fields */
369 fs->lfs_version = version;
370
371 /* If partition is not an LFS partition, warn that that is the case */
372 if (strcmp(dkw->dkw_ptype, DKW_PTYPE_LFS) != 0) {
373 fatal("partition label indicated fs type \"%s\", "
374 "expected \"%s\"", dkw->dkw_ptype, DKW_PTYPE_LFS);
375 }
376
377 if (!(bsize = block_size))
378 bsize = DFL_LFSBLOCK;
379 if (!(fsize = frag_size))
380 fsize = DFL_LFSFRAG;
381 if (!(ssize = seg_size)) {
382 ssize = DFL_LFSSEG;
383 }
384 if (version > 1) {
385 if (ibsize == 0)
386 ibsize = fsize;
387 if (ibsize <= 0 || ibsize % fsize)
388 fatal("illegal inode block size: %d\n", ibsize);
389 } else if (ibsize && ibsize != bsize)
390 fatal("cannot specify inode block size when version == 1\n");
391
392 /* Sanity check: fsize<=bsize<ssize */
393 if (fsize > bsize) {
394 /* Only complain if fsize was explicitly set */
395 if(frag_size)
396 fatal("fragment size must be <= block size %d", bsize);
397 fsize = bsize;
398 }
399 if (bsize >= ssize) {
400 /* Only fatal if ssize was explicitly set */
401 if(seg_size)
402 fatal("block size must be < segment size");
403 warnx("%s: disklabel segment size (%d) too small, using default (%d)",
404 progname, ssize, DFL_LFSSEG);
405 ssize = DFL_LFSSEG;
406 }
407 if (start < 0 || start >= dkw->dkw_size)
408 fatal("filesystem offset %ld out of range", (long)start);
409 if (version == 1) {
410 if (start)
411 warnx("filesystem offset ignored for version 1 filesystem");
412 start = LFS_LABELPAD / secsize;
413 }
414
415 tryagain:
416 /* Modify parts of superblock overridden by command line arguments */
417 if (bsize != DFL_LFSBLOCK || fsize != DFL_LFSFRAG) {
418 fs->lfs_bshift = lfs_log2(bsize);
419 if (1 << fs->lfs_bshift != bsize)
420 fatal("%d: block size not a power of 2", bsize);
421 fs->lfs_bsize = bsize;
422 fs->lfs_fsize = fsize;
423 fs->lfs_bmask = bsize - 1;
424 fs->lfs_ffmask = fsize - 1;
425 fs->lfs_ffshift = lfs_log2(fsize);
426 if (1 << fs->lfs_ffshift != fsize)
427 fatal("%d: frag size not a power of 2", fsize);
428 fs->lfs_frag = numfrags(fs, bsize);
429 fs->lfs_fbmask = fs->lfs_frag - 1;
430 fs->lfs_fbshift = lfs_log2(fs->lfs_frag);
431 fs->lfs_ifpb = bsize / sizeof(IFILE);
432 /* XXX ondisk32 */
433 fs->lfs_nindir = bsize / sizeof(int32_t);
434 }
435
436 if (fs->lfs_version == 1) {
437 fs->lfs_sumsize = LFS_V1_SUMMARY_SIZE;
438 fs->lfs_segshift = lfs_log2(ssize);
439 if (1 << fs->lfs_segshift != ssize)
440 fatal("%d: segment size not power of 2", ssize);
441 fs->lfs_segmask = ssize - 1;
442 fs->lfs_ifpb = fs->lfs_bsize / sizeof(IFILE_V1);
443 fs->lfs_ibsize = fs->lfs_bsize;
444 fs->lfs_sepb = bsize / sizeof(SEGUSE_V1);
445 fs->lfs_ssize = ssize >> fs->lfs_bshift;
446 } else {
447 if (ssize % fsize) {
448 fprintf(stderr,
449 "Segment size %d is not a multiple of frag size; ",
450 ssize);
451 ssize = roundup(ssize, fsize);
452 fprintf(stderr, "trying size %d.\n", ssize);
453 goto tryagain;
454 }
455 fs->lfs_sumsize = fsize;
456 fs->lfs_segshift = 0;
457 fs->lfs_segmask = 0;
458 fs->lfs_sepb = bsize / sizeof(SEGUSE);
459 fs->lfs_ssize = ssize;
460 fs->lfs_ibsize = ibsize;
461 }
462 fs->lfs_inopb = fs->lfs_ibsize / sizeof(struct ufs1_dinode);
463 fs->lfs_minfree = minfree;
464
465 if (version > 1) {
466 fs->lfs_inopf = secsize/DINODE1_SIZE;
467 fs->lfs_interleave = interleave;
468 if (roll_id == 0)
469 roll_id = arc4random();
470 fs->lfs_ident = roll_id;
471 }
472
473 /*
474 * Fill in parts of superblock that can be computed from file system
475 * size, disk geometry and current time.
476 */
477 db_per_blk = bsize/secsize;
478 fs->lfs_blktodb = lfs_log2(db_per_blk);
479 fs->lfs_fsbtodb = lfs_log2(fsize / secsize);
480 if (version == 1) {
481 fs->lfs_sushift = lfs_log2(fs->lfs_sepb);
482 fs->lfs_fsbtodb = 0;
483 fs->lfs_size = dkw->dkw_size >> fs->lfs_blktodb;
484 }
485 label_fsb = btofsb(fs, roundup(LFS_LABELPAD, fsize));
486 sb_fsb = btofsb(fs, roundup(LFS_SBPAD, fsize));
487 fs->lfs_fsbpseg = dbtofsb(fs, ssize / secsize);
488 fs->lfs_size = dkw->dkw_size >> fs->lfs_fsbtodb;
489 fs->lfs_dsize = dbtofsb(fs, dkw->dkw_size) -
490 MAX(label_fsb, dbtofsb(fs, start));
491 fs->lfs_nseg = fs->lfs_dsize / segtod(fs, 1);
492
493 fs->lfs_nclean = fs->lfs_nseg - 1;
494 fs->lfs_maxfilesize = maxfilesize(fs->lfs_bshift);
495
496 if (minfreeseg == 0)
497 fs->lfs_minfreeseg = fs->lfs_nseg / DFL_MIN_FREE_SEGS;
498 else
499 fs->lfs_minfreeseg = minfreeseg;
500 if (fs->lfs_minfreeseg < MIN_FREE_SEGS)
501 fs->lfs_minfreeseg = MIN_FREE_SEGS;
502
503 if (resvseg == 0)
504 fs->lfs_resvseg = fs->lfs_minfreeseg / 2 + 1;
505 else
506 fs->lfs_resvseg = resvseg;
507 if (fs->lfs_resvseg < MIN_RESV_SEGS)
508 fs->lfs_resvseg = MIN_RESV_SEGS;
509
510 if(fs->lfs_nseg < fs->lfs_minfreeseg + 1
511 || fs->lfs_nseg < LFS_MIN_SBINTERVAL + 1)
512 {
513 if(seg_size == 0 && ssize > (bsize<<1)) {
514 if(!warned_segtoobig) {
515 fprintf(stderr,"Segment size %d is too large; "
516 "trying smaller sizes.\n", ssize);
517 if (ssize == (bsize << 16)) {
518 fprintf(stderr, "(Did you perhaps "
519 "accidentally leave \"16\" "
520 "in the disklabel's sgs "
521 "field?)\n");
522 }
523 }
524 ++warned_segtoobig;
525 ssize >>= 1;
526 goto tryagain;
527 }
528 fatal("Could not allocate enough segments with segment "
529 "size %d and block size %d;\nplease decrease the "
530 "segment size.\n", ssize, fs->lfs_bsize);
531 }
532
533 /*
534 * Now that we've determined what we're going to do, announce it
535 * to the user.
536 */
537 printf("Creating a version %d LFS", fs->lfs_version);
538 if (fs->lfs_version > 1)
539 printf(" with roll-forward ident 0x%x", fs->lfs_ident);
540 printf("\n");
541 fssize = (double)fs->lfs_nseg;
542 fssize *= (double)ssize;
543 fssize /= 1048576.0;
544 printf("%.1fMB in %d segments of size %d\n", fssize,
545 fs->lfs_nseg, ssize);
546
547 /*
548 * The number of free blocks is set from the number of segments
549 * times the segment size - lfs_minfreesegs (that we never write
550 * because we need to make sure the cleaner can run). Then
551 * we'll subtract off the room for the superblocks ifile entries
552 * and segment usage table, and half a block per segment that can't
553 * be written due to fragmentation.
554 */
555 fs->lfs_dsize = (fs->lfs_nseg - fs->lfs_minfreeseg) *
556 segtod(fs, 1);
557 fs->lfs_bfree = fs->lfs_dsize;
558 fs->lfs_bfree -= dbtofsb(fs, ((fs->lfs_nseg / 2) <<
559 fs->lfs_blktodb));
560
561 fs->lfs_segtabsz = SEGTABSIZE_SU(fs);
562 fs->lfs_cleansz = CLEANSIZE_SU(fs);
563 if ((fs->lfs_tstamp = time(NULL)) == -1)
564 fatal("time: %s", strerror(errno));
565 if (version == 1)
566 fs->lfs_otstamp = fs->lfs_tstamp;
567
568 if ((sb_interval = fs->lfs_nseg / LFS_MAXNUMSB) < LFS_MIN_SBINTERVAL)
569 sb_interval = LFS_MIN_SBINTERVAL;
570
571 /*
572 * Figure out where the superblocks are going to live.
573 *
574 * Make segment 0 start at either zero, or LFS_LABELPAD, or
575 * >= LFS_SBPAD+LFS_LABELPAD, in order to prevent segment 0
576 * from having half a superblock in it.
577 */
578 if (fsbtodb(fs, dbtofsb(fs, start)) != start)
579 fatal("Segment 0 offset is not multiple of frag size\n");
580 if (start != 0 && dbtob(start) != LFS_LABELPAD &&
581 dbtob(start) < LFS_SBPAD + LFS_LABELPAD) {
582 fatal("Using flags \"-O %" PRId64 "\" would result in the "
583 "first segment containing only\npart of a superblock. "
584 "Please choose an offset of 0, %d, or %d or more,\n",
585 start, btodb(LFS_LABELPAD),
586 btodb(LFS_LABELPAD + LFS_SBPAD));
587 }
588 fs->lfs_sboffs[0] = label_fsb;
589 if (version == 1)
590 fs->lfs_start = fs->lfs_sboffs[0];
591 else
592 fs->lfs_start = dbtofsb(fs, start);
593 fs->lfs_dsize -= sb_fsb;
594 for (i = 1; i < LFS_MAXNUMSB; i++) {
595 sb_addr = ((i * sb_interval) * segtod(fs, 1))
596 + fs->lfs_sboffs[0];
597 /* Segment 0 eats the label, except for version 1 */
598 if (fs->lfs_version > 1 && fs->lfs_start < label_fsb)
599 sb_addr -= label_fsb - start;
600 if (sb_addr + sizeof(struct dlfs)
601 >= dbtofsb(fs, dkw->dkw_size))
602 break;
603 fs->lfs_sboffs[i] = sb_addr;
604 fs->lfs_dsize -= sb_fsb;
605 }
606
607 /* We need >= 2 superblocks */
608 if(fs->lfs_sboffs[1] == 0x0) {
609 fatal("Could not assign a disk address for the second "
610 "superblock.\nPlease decrease the segment size.\n");
611 }
612
613 fs->lfs_lastseg = sntod(fs, fs->lfs_nseg - 2);
614 fs->lfs_curseg = sntod(fs, fs->lfs_nseg - 1);
615 fs->lfs_offset = sntod(fs, fs->lfs_nseg);
616 fs->lfs_nextseg = sntod(fs, 0);
617
618 /*
619 * Initialize the Ifile inode. Do this before we do anything
620 * with the Ifile or segment tables.
621 */
622 dip = VTOI(fs->lfs_ivnode)->i_din.ffs1_din = (struct ufs1_dinode *)
623 malloc(sizeof(*dip));
624 if (dip == NULL)
625 err(1, NULL);
626 memset(dip, 0, sizeof(*dip));
627 dip->di_mode = IFREG|IREAD|IWRITE;
628 dip->di_flags = SF_IMMUTABLE;
629 make_dinode(LFS_IFILE_INUM, dip,
630 blkstofrags(fs, fs->lfs_cleansz + fs->lfs_segtabsz + 1), fs);
631 dip->di_size = (fs->lfs_cleansz + fs->lfs_segtabsz + 1) << fs->lfs_bshift;
632 for (i = 0; i < NDADDR && i < (dip->di_size >> fs->lfs_bshift); i++)
633 VTOI(fs->lfs_ivnode)->i_lfs_fragsize[i] = fs->lfs_bsize;
634
635 /*
636 * Set up in-superblock segment usage cache
637 */
638 fs->lfs_suflags = (u_int32_t **) malloc(2 * sizeof(u_int32_t *));
639 if (fs->lfs_suflags == NULL)
640 err(1, NULL);
641 fs->lfs_suflags[0] = (u_int32_t *) malloc(fs->lfs_nseg * sizeof(u_int32_t));
642 if (fs->lfs_suflags[0] == NULL)
643 err(1, NULL);
644 fs->lfs_suflags[1] = (u_int32_t *) malloc(fs->lfs_nseg * sizeof(u_int32_t));
645 if (fs->lfs_suflags[1] == NULL)
646 err(1, NULL);
647
648 /*
649 * Initialize the cleanerinfo block
650 */
651 LFS_CLEANERINFO(cip, fs, bp);
652 cip->clean = fs->lfs_nseg;
653 cip->dirty = 0;
654 if (version > 1) {
655 cip->free_head = HIGHEST_USED_INO + 1;
656 cip->free_tail = fs->lfs_ifpb - 1;
657 }
658 LFS_SYNC_CLEANERINFO(cip, fs, bp, 1);
659
660 /*
661 * Run through segment table and initialize that
662 */
663 for (i = j = 0; i < fs->lfs_nseg; i++) {
664 LFS_SEGENTRY(segp, fs, i, bp);
665
666 if (i == 0 &&
667 fs->lfs_start < btofsb(fs, LFS_LABELPAD + LFS_SBPAD)) {
668 segp->su_flags = SEGUSE_SUPERBLOCK;
669 fs->lfs_bfree -= sb_fsb;
670 ++j;
671 }
672 if (i > 0) {
673 if ((i % sb_interval) == 0 && j < LFS_MAXNUMSB) {
674 segp->su_flags = SEGUSE_SUPERBLOCK;
675 fs->lfs_bfree -= sb_fsb;
676 ++j;
677 } else
678 segp->su_flags = 0;
679 }
680 segp->su_lastmod = 0;
681 segp->su_nbytes = 0;
682 segp->su_ninos = 0;
683 segp->su_nsums = 0;
684
685 LFS_WRITESEGENTRY(segp, fs, i, bp);
686 }
687
688 /* Initialize root directory */
689 vp = lfs_raw_vget(fs, ROOTINO, devfd, 0x0);
690 dip = VTOI(vp)->i_din.ffs1_din;
691 make_dinode(ROOTINO, dip, howmany(DIRBLKSIZ,fs->lfs_fsize), fs);
692 dip->di_mode = IFDIR | UMASK;
693 VTOI(vp)->i_lfs_osize = dip->di_size = DIRBLKSIZ;
694 #ifdef MAKE_LF_DIR
695 VTOI(vp)->i_ffs_effnlink = dip->di_nlink = 3;
696 #else
697 VTOI(vp)->i_ffs_effnlink = dip->di_nlink = 2;
698 #endif
699 VTOI(vp)->i_lfs_effnblks = dip->di_blocks =
700 btofsb(fs, roundup(DIRBLKSIZ,fs->lfs_fsize));
701 for (i = 0; i < NDADDR && i < howmany(DIRBLKSIZ, fs->lfs_bsize); i++)
702 VTOI(vp)->i_lfs_fragsize[i] = fs->lfs_bsize;
703 if (DIRBLKSIZ < fs->lfs_bsize)
704 VTOI(vp)->i_lfs_fragsize[i - 1] =
705 roundup(DIRBLKSIZ,fs->lfs_fsize);
706 bread(vp, 0, fs->lfs_fsize, NOCRED, &bp);
707 make_dir(bp->b_data, lfs_root_dir,
708 sizeof(lfs_root_dir) / sizeof(struct direct));
709 VOP_BWRITE(bp);
710
711 #ifdef MAKE_LF_DIR
712 /* Initialize lost+found directory */
713 vp = lfs_raw_vget(fs, LOSTFOUNDINO, devfd, 0x0);
714 dip = VTOI(vp)->i_din.ffs1_din;
715 make_dinode(LOSTFOUNDINO, dip, howmany(DIRBLKSIZ,fs->lfs_fsize), fs);
716 dip->di_mode = IFDIR | UMASK;
717 VTOI(vp)->i_lfs_osize = dip->di_size = DIRBLKSIZ;
718 VTOI(vp)->i_ffs_effnlink = dip->di_nlink = 2;
719 VTOI(vp)->i_lfs_effnblks = dip->di_blocks =
720 btofsb(fs, roundup(DIRBLKSIZ,fs->lfs_fsize));
721 for (i = 0; i < NDADDR && i < howmany(DIRBLKSIZ, fs->lfs_bsize); i++)
722 VTOI(vp)->i_lfs_fragsize[i] = fs->lfs_bsize;
723 if (DIRBLKSIZ < fs->lfs_bsize)
724 VTOI(vp)->i_lfs_fragsize[i - 1] =
725 roundup(DIRBLKSIZ,fs->lfs_fsize);
726 bread(vp, 0, fs->lfs_fsize, NOCRED, &bp);
727 make_dir(bp->b_data, lfs_lf_dir,
728 sizeof(lfs_lf_dir) / sizeof(struct direct));
729 VOP_BWRITE(bp);
730 #endif /* MAKE_LF_DIR */
731
732 /* Set their IFILE entry version numbers to 1 */
733 LFS_IENTRY(ip, fs, 1, bp);
734 if (version == 1) {
735 ip_v1 = (IFILE_V1 *)ip;
736 for (i = LFS_IFILE_INUM; i <= HIGHEST_USED_INO; i++) {
737 ip_v1->if_version = 1;
738 ip_v1->if_daddr = 0x0;
739 ip_v1->if_nextfree = 0;
740 ++ip_v1;
741 }
742 } else {
743 for (i = LFS_IFILE_INUM; i <= HIGHEST_USED_INO; i++) {
744 ip->if_version = 1;
745 ip->if_daddr = 0x0;
746 ip->if_nextfree = 0;
747 ++ip;
748 }
749 }
750 /* Link remaining IFILE entries in free list */
751 if (version == 1) {
752 for (;
753 i < fs->lfs_ifpb; ++ip_v1) {
754 ip_v1->if_version = 1;
755 ip_v1->if_daddr = LFS_UNUSED_DADDR;
756 ip_v1->if_nextfree = ++i;
757 }
758 --ip_v1;
759 ip_v1->if_nextfree = LFS_UNUSED_INUM;
760 } else {
761 for (;
762 i < fs->lfs_ifpb; ++ip) {
763 ip->if_version = 1;
764 ip->if_daddr = LFS_UNUSED_DADDR;
765 ip->if_nextfree = ++i;
766 }
767 --ip;
768 ip->if_nextfree = LFS_UNUSED_INUM;
769 }
770 VOP_BWRITE(bp);
771
772 /* Write it all to disk. */
773 if (!Nflag)
774 lfs_segwrite(fs, SEGM_CKP);
775
776 /*
777 * Now that we've written everything, look to see what's available
778 * for writing.
779 */
780 fs->lfs_avail = 0;
781 bb = ubb = dmeta = 0;
782 for (i = 0; i < fs->lfs_nseg; i++) {
783 LFS_SEGENTRY(segp, fs, i, bp);
784 if (segp->su_flags & SEGUSE_DIRTY) {
785 bb += btofsb(fs, segp->su_nbytes +
786 segp->su_nsums * fs->lfs_sumsize);
787 ubb += btofsb(fs, segp->su_nbytes +
788 segp->su_nsums * fs->lfs_sumsize +
789 segp->su_ninos * fs->lfs_ibsize);
790 dmeta += btofsb(fs,
791 fs->lfs_sumsize * segp->su_nsums);
792 dmeta += btofsb(fs,
793 fs->lfs_ibsize * segp->su_ninos);
794 } else {
795 fs->lfs_avail += segtod(fs, 1);
796 if (segp->su_flags & SEGUSE_SUPERBLOCK)
797 fs->lfs_avail -= btofsb(fs, LFS_SBPAD);
798 if (i == 0 && fs->lfs_version > 1 &&
799 fs->lfs_start < btofsb(fs, LFS_LABELPAD))
800 fs->lfs_avail -= btofsb(fs, LFS_LABELPAD) -
801 fs->lfs_start;
802 }
803 brelse(bp);
804 }
805 /* Also may be available bytes in current seg */
806 i = dtosn(fs, fs->lfs_offset);
807 fs->lfs_avail += sntod(fs, i + 1) - fs->lfs_offset;
808 /* But do not count minfreesegs */
809 fs->lfs_avail -= segtod(fs, (fs->lfs_minfreeseg - (fs->lfs_minfreeseg / 2)));
810
811 labelskew = 0;
812 if (fs->lfs_version > 1 && fs->lfs_start < btofsb(fs, LFS_LABELPAD))
813 labelskew = btofsb(fs, LFS_LABELPAD);
814 fs->lfs_bfree = fs->lfs_dsize - labelskew - (ubb + bb) / 2;
815
816 /* Put that in the Ifile version too, and write it */
817 LFS_CLEANERINFO(cip, fs, bp);
818 cip->bfree = fs->lfs_bfree;
819 cip->avail = fs->lfs_avail;
820 LFS_SYNC_CLEANERINFO(cip, fs, bp, 1);
821 if (!Nflag)
822 lfs_segwrite(fs, SEGM_CKP);
823
824 /*
825 * Finally write out superblocks.
826 */
827 printf("super-block backups (for fsck -b #) at:\n");
828 curw = 0;
829 for (i = 0; i < LFS_MAXNUMSB; i++) {
830 seg_addr = fs->lfs_sboffs[i];
831 if (seg_addr == 0)
832 break;
833
834 if (i != 0)
835 curw += printf(", ");
836 ww = snprintf(tbuf, sizeof(tbuf), "%lld",
837 (long long)fsbtodb(fs, seg_addr));
838 curw += ww;
839 if (curw >= 78) {
840 printf("\n%s", tbuf);
841 curw = ww;
842 } else
843 printf("%s", tbuf);
844 fflush(stdout);
845
846 /* Leave the time stamp on the alt sb, zero the rest */
847 if (i == 2) {
848 fs->lfs_tstamp = 0;
849 fs->lfs_cksum = lfs_sb_cksum(&(fs->lfs_dlfs));
850 }
851 if (!Nflag)
852 lfs_writesuper(fs, seg_addr);
853 }
854 printf(".\n");
855
856 return 0;
857 }
858
859 /*
860 * Compatibility with fsck_lfs, since the "generic" LFS userland code uses it.
861 */
862 void
863 pwarn(const char *fmt, ...)
864 {
865 va_list ap;
866
867 va_start(ap, fmt);
868 vfprintf(stderr, fmt, ap);
869 va_end(ap);
870 }
871