1214456Srpaulo/* $NetBSD: ffs.c,v 1.45 2011/10/09 22:49:26 christos Exp $ */ 2214456Srpaulo 3214456Srpaulo/*- 4214456Srpaulo * SPDX-License-Identifier: BSD-4-Clause 5214456Srpaulo * 6214456Srpaulo * Copyright (c) 2001 Wasabi Systems, Inc. 7214456Srpaulo * All rights reserved. 8214456Srpaulo * 9214456Srpaulo * Written by Luke Mewburn for Wasabi Systems, Inc. 10214456Srpaulo * 11214456Srpaulo * Redistribution and use in source and binary forms, with or without 12214456Srpaulo * modification, are permitted provided that the following conditions 13214456Srpaulo * are met: 14214456Srpaulo * 1. Redistributions of source code must retain the above copyright 15214456Srpaulo * notice, this list of conditions and the following disclaimer. 16214456Srpaulo * 2. Redistributions in binary form must reproduce the above copyright 17214456Srpaulo * notice, this list of conditions and the following disclaimer in the 18214456Srpaulo * documentation and/or other materials provided with the distribution. 19214456Srpaulo * 3. All advertising materials mentioning features or use of this software 20214456Srpaulo * must display the following acknowledgement: 21214456Srpaulo * This product includes software developed for the NetBSD Project by 22214456Srpaulo * Wasabi Systems, Inc. 23 * 4. The name of Wasabi Systems, Inc. may not be used to endorse 24 * or promote products derived from this software without specific prior 25 * written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND 28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39/* 40 * Copyright (c) 1982, 1986, 1989, 1993 41 * The Regents of the University of California. All rights reserved. 42 * 43 * Redistribution and use in source and binary forms, with or without 44 * modification, are permitted provided that the following conditions 45 * are met: 46 * 1. Redistributions of source code must retain the above copyright 47 * notice, this list of conditions and the following disclaimer. 48 * 2. Redistributions in binary form must reproduce the above copyright 49 * notice, this list of conditions and the following disclaimer in the 50 * documentation and/or other materials provided with the distribution. 51 * 3. Neither the name of the University nor the names of its contributors 52 * may be used to endorse or promote products derived from this software 53 * without specific prior written permission. 54 * 55 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 56 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 57 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 58 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 59 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 60 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 61 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 62 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 63 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 64 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 65 * SUCH DAMAGE. 66 */ 67 68#include <sys/cdefs.h> 69#if HAVE_NBTOOL_CONFIG_H 70#include "nbtool_config.h" 71#endif 72 73#include <sys/param.h> 74 75#include <sys/mount.h> 76 77#include <assert.h> 78#include <errno.h> 79#include <fcntl.h> 80#include <stdarg.h> 81#include <stdint.h> 82#include <stdio.h> 83#include <stdlib.h> 84#include <string.h> 85#include <time.h> 86#include <unistd.h> 87#include <util.h> 88 89#if HAVE_STRUCT_STATVFS_F_IOSIZE && HAVE_FSTATVFS 90#include <sys/statvfs.h> 91#endif 92 93#include <ufs/ufs/dinode.h> 94#include <ufs/ufs/dir.h> 95#include <ufs/ffs/fs.h> 96 97#include "ffs/ufs_bswap.h" 98#include "ffs/ufs_inode.h" 99#include "ffs/newfs_extern.h" 100#include "ffs/ffs_extern.h" 101 102#undef clrbuf 103#include "makefs.h" 104#include "ffs.h" 105 106#undef DIP 107#define DIP(dp, field) \ 108 ((ffs_opts->version == 1) ? \ 109 (dp)->ffs1_din.di_##field : (dp)->ffs2_din.di_##field) 110 111/* 112 * Various file system defaults (cribbed from newfs(8)). 113 */ 114#define DFL_FRAGSIZE 4096 /* fragment size */ 115#define DFL_BLKSIZE 32768 /* block size */ 116#define DFL_SECSIZE 512 /* sector size */ 117#define DFL_CYLSPERGROUP 65536 /* cylinders per group */ 118#define DFL_FRAGSPERINODE 4 /* fragments per inode */ 119#define DFL_ROTDELAY 0 /* rotational delay */ 120#define DFL_NRPOS 1 /* rotational positions */ 121#define DFL_RPM 3600 /* rpm of disk */ 122#define DFL_NSECTORS 64 /* # of sectors */ 123#define DFL_NTRACKS 16 /* # of tracks */ 124 125 126typedef struct { 127 u_char *buf; /* buf for directory */ 128 doff_t size; /* full size of buf */ 129 doff_t cur; /* offset of current entry */ 130} dirbuf_t; 131 132 133static int ffs_create_image(const char *, fsinfo_t *); 134static void ffs_dump_fsinfo(fsinfo_t *); 135static void ffs_dump_dirbuf(dirbuf_t *, const char *, int); 136static void ffs_make_dirbuf(dirbuf_t *, const char *, fsnode *, int); 137static int ffs_populate_dir(const char *, fsnode *, fsinfo_t *); 138static void ffs_size_dir(fsnode *, fsinfo_t *); 139static void ffs_validate(const char *, fsnode *, fsinfo_t *); 140static void ffs_write_file(union dinode *, uint32_t, void *, fsinfo_t *); 141static void ffs_write_inode(union dinode *, uint32_t, const fsinfo_t *); 142static void *ffs_build_dinode1(struct ufs1_dinode *, dirbuf_t *, fsnode *, 143 fsnode *, fsinfo_t *); 144static void *ffs_build_dinode2(struct ufs2_dinode *, dirbuf_t *, fsnode *, 145 fsnode *, fsinfo_t *); 146 147 148 /* publicly visible functions */ 149 150void 151ffs_prep_opts(fsinfo_t *fsopts) 152{ 153 ffs_opt_t *ffs_opts = ecalloc(1, sizeof(*ffs_opts)); 154 155 const option_t ffs_options[] = { 156 { 'b', "bsize", &ffs_opts->bsize, OPT_INT32, 157 1, INT_MAX, "block size" }, 158 { 'f', "fsize", &ffs_opts->fsize, OPT_INT32, 159 1, INT_MAX, "fragment size" }, 160 { 'd', "density", &ffs_opts->density, OPT_INT32, 161 1, INT_MAX, "bytes per inode" }, 162 { 'm', "minfree", &ffs_opts->minfree, OPT_INT32, 163 0, 99, "minfree" }, 164 { 'M', "maxbpg", &ffs_opts->maxbpg, OPT_INT32, 165 1, INT_MAX, "max blocks per file in a cg" }, 166 { 'a', "avgfilesize", &ffs_opts->avgfilesize, OPT_INT32, 167 1, INT_MAX, "expected average file size" }, 168 { 'n', "avgfpdir", &ffs_opts->avgfpdir, OPT_INT32, 169 1, INT_MAX, "expected # of files per directory" }, 170 { 'x', "extent", &ffs_opts->maxbsize, OPT_INT32, 171 1, INT_MAX, "maximum # extent size" }, 172 { 'g', "maxbpcg", &ffs_opts->maxblkspercg, OPT_INT32, 173 1, INT_MAX, "max # of blocks per group" }, 174 { 'v', "version", &ffs_opts->version, OPT_INT32, 175 1, 2, "UFS version" }, 176 { 'o', "optimization", NULL, OPT_STRBUF, 177 0, 0, "Optimization (time|space)" }, 178 { 'l', "label", ffs_opts->label, OPT_STRARRAY, 179 1, sizeof(ffs_opts->label), "UFS label" }, 180 { 's', "softupdates", &ffs_opts->softupdates, OPT_INT32, 181 0, 1, "enable softupdates" }, 182 { .name = NULL } 183 }; 184 185 ffs_opts->bsize= -1; 186 ffs_opts->fsize= -1; 187 ffs_opts->cpg= -1; 188 ffs_opts->density= -1; 189 ffs_opts->min_inodes= false; 190 ffs_opts->minfree= -1; 191 ffs_opts->optimization= -1; 192 ffs_opts->maxcontig= -1; 193 ffs_opts->maxbpg= -1; 194 ffs_opts->avgfilesize= -1; 195 ffs_opts->avgfpdir= -1; 196 ffs_opts->version = 1; 197 ffs_opts->softupdates = 0; 198 199 fsopts->fs_specific = ffs_opts; 200 fsopts->fs_options = copy_opts(ffs_options); 201} 202 203void 204ffs_cleanup_opts(fsinfo_t *fsopts) 205{ 206 free(fsopts->fs_specific); 207 free(fsopts->fs_options); 208} 209 210int 211ffs_parse_opts(const char *option, fsinfo_t *fsopts) 212{ 213 ffs_opt_t *ffs_opts = fsopts->fs_specific; 214 option_t *ffs_options = fsopts->fs_options; 215 char buf[1024]; 216 217 int rv; 218 219 assert(option != NULL); 220 assert(fsopts != NULL); 221 assert(ffs_opts != NULL); 222 223 if (debug & DEBUG_FS_PARSE_OPTS) 224 printf("ffs_parse_opts: got `%s'\n", option); 225 226 rv = set_option(ffs_options, option, buf, sizeof(buf)); 227 if (rv == -1) 228 return 0; 229 230 if (ffs_options[rv].name == NULL) 231 abort(); 232 233 switch (ffs_options[rv].letter) { 234 case 'o': 235 if (strcmp(buf, "time") == 0) { 236 ffs_opts->optimization = FS_OPTTIME; 237 } else if (strcmp(buf, "space") == 0) { 238 ffs_opts->optimization = FS_OPTSPACE; 239 } else { 240 warnx("Invalid optimization `%s'", buf); 241 return 0; 242 } 243 break; 244 default: 245 break; 246 } 247 return 1; 248} 249 250 251void 252ffs_makefs(const char *image, const char *dir, fsnode *root, fsinfo_t *fsopts) 253{ 254 struct fs *superblock; 255 struct timeval start; 256 257 assert(image != NULL); 258 assert(dir != NULL); 259 assert(root != NULL); 260 assert(fsopts != NULL); 261 262 if (debug & DEBUG_FS_MAKEFS) 263 printf("ffs_makefs: image %s directory %s root %p\n", 264 image, dir, root); 265 266 /* if user wants no free space, use minimum number of inodes */ 267 if (fsopts->minsize == 0 && fsopts->freeblockpc == 0 && 268 fsopts->freeblocks == 0) 269 ((ffs_opt_t *)fsopts->fs_specific)->min_inodes = true; 270 271 /* validate tree and options */ 272 TIMER_START(start); 273 ffs_validate(dir, root, fsopts); 274 TIMER_RESULTS(start, "ffs_validate"); 275 276 printf("Calculated size of `%s': %lld bytes, %lld inodes\n", 277 image, (long long)fsopts->size, (long long)fsopts->inodes); 278 279 /* create image */ 280 TIMER_START(start); 281 if (ffs_create_image(image, fsopts) == -1) 282 errx(1, "Image file `%s' not created.", image); 283 TIMER_RESULTS(start, "ffs_create_image"); 284 285 fsopts->curinode = UFS_ROOTINO; 286 287 if (debug & DEBUG_FS_MAKEFS) 288 putchar('\n'); 289 290 /* populate image */ 291 printf("Populating `%s'\n", image); 292 TIMER_START(start); 293 if (! ffs_populate_dir(dir, root, fsopts)) 294 errx(1, "Image file `%s' not populated.", image); 295 TIMER_RESULTS(start, "ffs_populate_dir"); 296 297 /* ensure no outstanding buffers remain */ 298 if (debug & DEBUG_FS_MAKEFS) 299 bcleanup(); 300 301 /* update various superblock parameters */ 302 superblock = fsopts->superblock; 303 superblock->fs_fmod = 0; 304 superblock->fs_old_cstotal.cs_ndir = superblock->fs_cstotal.cs_ndir; 305 superblock->fs_old_cstotal.cs_nbfree = superblock->fs_cstotal.cs_nbfree; 306 superblock->fs_old_cstotal.cs_nifree = superblock->fs_cstotal.cs_nifree; 307 superblock->fs_old_cstotal.cs_nffree = superblock->fs_cstotal.cs_nffree; 308 309 /* write out superblock; image is now complete */ 310 ffs_write_superblock(fsopts->superblock, fsopts); 311 if (close(fsopts->fd) == -1) 312 err(1, "Closing `%s'", image); 313 fsopts->fd = -1; 314 printf("Image `%s' complete\n", image); 315} 316 317 /* end of public functions */ 318 319 320static void 321ffs_validate(const char *dir, fsnode *root, fsinfo_t *fsopts) 322{ 323#ifdef notyet 324 int32_t spc, nspf, ncyl, fssize; 325#endif 326 ffs_opt_t *ffs_opts = fsopts->fs_specific; 327 328 assert(dir != NULL); 329 assert(root != NULL); 330 assert(fsopts != NULL); 331 assert(ffs_opts != NULL); 332 333 if (debug & DEBUG_FS_VALIDATE) { 334 printf("ffs_validate: before defaults set:\n"); 335 ffs_dump_fsinfo(fsopts); 336 } 337 338 /* set FFS defaults */ 339 if (fsopts->sectorsize == -1) 340 fsopts->sectorsize = DFL_SECSIZE; 341 if (fsopts->sectorsize != DFL_SECSIZE) 342 warnx("sectorsize %d may produce nonfunctional image", 343 fsopts->sectorsize); 344 if (ffs_opts->fsize == -1) 345 ffs_opts->fsize = MAX(DFL_FRAGSIZE, fsopts->sectorsize); 346 if (ffs_opts->bsize == -1) 347 ffs_opts->bsize = MIN(DFL_BLKSIZE, 8 * ffs_opts->fsize); 348 if (ffs_opts->cpg == -1) 349 ffs_opts->cpg = DFL_CYLSPERGROUP; 350 else 351 ffs_opts->cpgflg = 1; 352 /* fsopts->density is set below */ 353 if (ffs_opts->nsectors == -1) 354 ffs_opts->nsectors = DFL_NSECTORS; 355 if (ffs_opts->minfree == -1) 356 ffs_opts->minfree = MINFREE; 357 if (ffs_opts->optimization == -1) 358 ffs_opts->optimization = DEFAULTOPT; 359 if (ffs_opts->maxcontig == -1) 360 ffs_opts->maxcontig = 361 MAX(1, MIN(MAXPHYS, FFS_MAXBSIZE) / ffs_opts->bsize); 362 /* XXX ondisk32 */ 363 if (ffs_opts->maxbpg == -1) 364 ffs_opts->maxbpg = ffs_opts->bsize / sizeof(int32_t); 365 if (ffs_opts->avgfilesize == -1) 366 ffs_opts->avgfilesize = AVFILESIZ; 367 if (ffs_opts->avgfpdir == -1) 368 ffs_opts->avgfpdir = AFPDIR; 369 370 if (fsopts->maxsize > 0 && 371 roundup(fsopts->minsize, ffs_opts->bsize) > fsopts->maxsize) 372 errx(1, "`%s' minsize of %lld rounded up to ffs bsize of %d " 373 "exceeds maxsize %lld. Lower bsize, or round the minimum " 374 "and maximum sizes to bsize.", dir, 375 (long long)fsopts->minsize, ffs_opts->bsize, 376 (long long)fsopts->maxsize); 377 378 /* calculate size of tree */ 379 ffs_size_dir(root, fsopts); 380 fsopts->inodes += UFS_ROOTINO; /* include first two inodes */ 381 382 if (debug & DEBUG_FS_VALIDATE) 383 printf("ffs_validate: size of tree: %lld bytes, %lld inodes\n", 384 (long long)fsopts->size, (long long)fsopts->inodes); 385 386 /* add requested slop */ 387 fsopts->size += fsopts->freeblocks; 388 fsopts->inodes += fsopts->freefiles; 389 if (fsopts->freefilepc > 0) 390 fsopts->inodes = 391 fsopts->inodes * (100 + fsopts->freefilepc) / 100; 392 if (fsopts->freeblockpc > 0) 393 fsopts->size = 394 fsopts->size * (100 + fsopts->freeblockpc) / 100; 395 396 /* 397 * Add space needed for superblock, cylblock and to store inodes. 398 * All of those segments are aligned to the block size. 399 * XXX: This has to match calculations done in ffs_mkfs. 400 */ 401 if (ffs_opts->version == 1) { 402 fsopts->size += 403 roundup(SBLOCK_UFS1 + SBLOCKSIZE, ffs_opts->bsize); 404 fsopts->size += roundup(SBLOCKSIZE, ffs_opts->bsize); 405 fsopts->size += ffs_opts->bsize; 406 fsopts->size += DINODE1_SIZE * 407 roundup(fsopts->inodes, ffs_opts->bsize / DINODE1_SIZE); 408 } else { 409 fsopts->size += 410 roundup(SBLOCK_UFS2 + SBLOCKSIZE, ffs_opts->bsize); 411 fsopts->size += roundup(SBLOCKSIZE, ffs_opts->bsize); 412 fsopts->size += ffs_opts->bsize; 413 fsopts->size += DINODE2_SIZE * 414 roundup(fsopts->inodes, ffs_opts->bsize / DINODE2_SIZE); 415 } 416 417 /* add minfree */ 418 if (ffs_opts->minfree > 0) 419 fsopts->size = 420 fsopts->size * (100 + ffs_opts->minfree) / 100; 421 /* 422 * XXX any other fs slop to add, such as csum's, bitmaps, etc ?? 423 */ 424 425 if (fsopts->size < fsopts->minsize) /* ensure meets minimum size */ 426 fsopts->size = fsopts->minsize; 427 428 /* round up to the next block */ 429 fsopts->size = roundup(fsopts->size, ffs_opts->bsize); 430 431 /* round up to requested block size, if any */ 432 if (fsopts->roundup > 0) 433 fsopts->size = roundup(fsopts->size, fsopts->roundup); 434 435 /* calculate density to just fit inodes if no free space */ 436 if (ffs_opts->density == -1) 437 ffs_opts->density = fsopts->size / fsopts->inodes + 1; 438 439 if (debug & DEBUG_FS_VALIDATE) { 440 printf("ffs_validate: after defaults set:\n"); 441 ffs_dump_fsinfo(fsopts); 442 printf("ffs_validate: dir %s; %lld bytes, %lld inodes\n", 443 dir, (long long)fsopts->size, (long long)fsopts->inodes); 444 } 445 /* now check calculated sizes vs requested sizes */ 446 if (fsopts->maxsize > 0 && fsopts->size > fsopts->maxsize) { 447 errx(1, "`%s' size of %lld is larger than the maxsize of %lld.", 448 dir, (long long)fsopts->size, (long long)fsopts->maxsize); 449 } 450} 451 452 453static void 454ffs_dump_fsinfo(fsinfo_t *f) 455{ 456 457 ffs_opt_t *fs = f->fs_specific; 458 459 printf("fsopts at %p\n", f); 460 461 printf("\tsize %lld, inodes %lld, curinode %u\n", 462 (long long)f->size, (long long)f->inodes, f->curinode); 463 464 printf("\tminsize %lld, maxsize %lld\n", 465 (long long)f->minsize, (long long)f->maxsize); 466 printf("\tfree files %lld, freefile %% %d\n", 467 (long long)f->freefiles, f->freefilepc); 468 printf("\tfree blocks %lld, freeblock %% %d\n", 469 (long long)f->freeblocks, f->freeblockpc); 470 printf("\tneedswap %d, sectorsize %d\n", f->needswap, f->sectorsize); 471 472 printf("\tbsize %d, fsize %d, cpg %d, density %d\n", 473 fs->bsize, fs->fsize, fs->cpg, fs->density); 474 printf("\tnsectors %d, rpm %d, minfree %d\n", 475 fs->nsectors, fs->rpm, fs->minfree); 476 printf("\tmaxcontig %d, maxbpg %d\n", 477 fs->maxcontig, fs->maxbpg); 478 printf("\toptimization %s\n", 479 fs->optimization == FS_OPTSPACE ? "space" : "time"); 480} 481 482 483static int 484ffs_create_image(const char *image, fsinfo_t *fsopts) 485{ 486#if HAVE_STRUCT_STATVFS_F_IOSIZE && HAVE_FSTATVFS 487 struct statvfs sfs; 488#endif 489 struct fs *fs; 490 char *buf; 491 int i, bufsize; 492 off_t bufrem; 493 int oflags = O_RDWR | O_CREAT; 494 time_t tstamp; 495 496 assert (image != NULL); 497 assert (fsopts != NULL); 498 499 /* create image */ 500 if (fsopts->offset == 0) 501 oflags |= O_TRUNC; 502 if ((fsopts->fd = open(image, oflags, 0666)) == -1) { 503 warn("Can't open `%s' for writing", image); 504 return (-1); 505 } 506 507 /* zero image */ 508#if HAVE_STRUCT_STATVFS_F_IOSIZE && HAVE_FSTATVFS 509 if (fstatvfs(fsopts->fd, &sfs) == -1) { 510#endif 511 bufsize = 8192; 512#if HAVE_STRUCT_STATVFS_F_IOSIZE && HAVE_FSTATVFS 513 warn("can't fstatvfs `%s', using default %d byte chunk", 514 image, bufsize); 515 } else 516 bufsize = sfs.f_iosize; 517#endif 518 bufrem = fsopts->size; 519 if (fsopts->sparse) { 520 if (ftruncate(fsopts->fd, bufrem) == -1) { 521 warn("sparse option disabled."); 522 fsopts->sparse = 0; 523 } 524 } 525 if (fsopts->sparse) { 526 /* File truncated at bufrem. Remaining is 0 */ 527 bufrem = 0; 528 buf = NULL; 529 } else { 530 if (debug & DEBUG_FS_CREATE_IMAGE) 531 printf("zero-ing image `%s', %lld sectors, " 532 "using %d byte chunks\n", image, (long long)bufrem, 533 bufsize); 534 buf = ecalloc(1, bufsize); 535 } 536 537 if (fsopts->offset != 0) 538 if (lseek(fsopts->fd, fsopts->offset, SEEK_SET) == -1) { 539 warn("can't seek"); 540 free(buf); 541 return -1; 542 } 543 544 while (bufrem > 0) { 545 i = write(fsopts->fd, buf, MIN(bufsize, bufrem)); 546 if (i == -1) { 547 warn("zeroing image, %lld bytes to go", 548 (long long)bufrem); 549 free(buf); 550 return (-1); 551 } 552 bufrem -= i; 553 } 554 if (buf) 555 free(buf); 556 557 /* make the file system */ 558 if (debug & DEBUG_FS_CREATE_IMAGE) 559 printf("calling mkfs(\"%s\", ...)\n", image); 560 561 if (stampst.st_ino != 0) 562 tstamp = stampst.st_ctime; 563 else 564 tstamp = start_time.tv_sec; 565 566 srandom(tstamp); 567 568 fs = ffs_mkfs(image, fsopts, tstamp); 569 fsopts->superblock = (void *)fs; 570 if (debug & DEBUG_FS_CREATE_IMAGE) { 571 time_t t; 572 573 t = (time_t)((struct fs *)fsopts->superblock)->fs_time; 574 printf("mkfs returned %p; fs_time %s", 575 fsopts->superblock, ctime(&t)); 576 printf("fs totals: nbfree %lld, nffree %lld, nifree %lld, ndir %lld\n", 577 (long long)fs->fs_cstotal.cs_nbfree, 578 (long long)fs->fs_cstotal.cs_nffree, 579 (long long)fs->fs_cstotal.cs_nifree, 580 (long long)fs->fs_cstotal.cs_ndir); 581 } 582 583 if (fs->fs_cstotal.cs_nifree + (off_t)UFS_ROOTINO < fsopts->inodes) { 584 warnx( 585 "Image file `%s' has %lld free inodes; %lld are required.", 586 image, 587 (long long)(fs->fs_cstotal.cs_nifree + UFS_ROOTINO), 588 (long long)fsopts->inodes); 589 return (-1); 590 } 591 return (fsopts->fd); 592} 593 594 595static void 596ffs_size_dir(fsnode *root, fsinfo_t *fsopts) 597{ 598 struct direct tmpdir; 599 fsnode * node; 600 int curdirsize, this; 601 ffs_opt_t *ffs_opts = fsopts->fs_specific; 602 603 /* node may be NULL (empty directory) */ 604 assert(fsopts != NULL); 605 assert(ffs_opts != NULL); 606 607 if (debug & DEBUG_FS_SIZE_DIR) 608 printf("ffs_size_dir: entry: bytes %lld inodes %lld\n", 609 (long long)fsopts->size, (long long)fsopts->inodes); 610 611#define ADDDIRENT(e) do { \ 612 tmpdir.d_namlen = strlen((e)); \ 613 this = DIRSIZ_SWAP(0, &tmpdir, 0); \ 614 if (debug & DEBUG_FS_SIZE_DIR_ADD_DIRENT) \ 615 printf("ADDDIRENT: was: %s (%d) this %d cur %d\n", \ 616 e, tmpdir.d_namlen, this, curdirsize); \ 617 if (this + curdirsize > roundup(curdirsize, DIRBLKSIZ)) \ 618 curdirsize = roundup(curdirsize, DIRBLKSIZ); \ 619 curdirsize += this; \ 620 if (debug & DEBUG_FS_SIZE_DIR_ADD_DIRENT) \ 621 printf("ADDDIRENT: now: %s (%d) this %d cur %d\n", \ 622 e, tmpdir.d_namlen, this, curdirsize); \ 623} while (0); 624 625#define ADDSIZE(x) do { \ 626 if ((size_t)(x) < UFS_NDADDR * (size_t)ffs_opts->bsize) { \ 627 fsopts->size += roundup((x), ffs_opts->fsize); \ 628 } else { \ 629 /* Count space consumed by indirecttion blocks. */ \ 630 fsopts->size += ffs_opts->bsize * \ 631 (howmany((x), UFS_NDADDR * ffs_opts->bsize) - 1); \ 632 /* \ 633 * If the file is big enough to use indirect blocks, \ 634 * we allocate bsize block for trailing data. \ 635 */ \ 636 fsopts->size += roundup((x), ffs_opts->bsize); \ 637 } \ 638} while (0); 639 640 curdirsize = 0; 641 for (node = root; node != NULL; node = node->next) { 642 ADDDIRENT(node->name); 643 if (node == root) { /* we're at "." */ 644 assert(strcmp(node->name, ".") == 0); 645 ADDDIRENT(".."); 646 } else if ((node->inode->flags & FI_SIZED) == 0) { 647 /* don't count duplicate names */ 648 node->inode->flags |= FI_SIZED; 649 if (debug & DEBUG_FS_SIZE_DIR_NODE) 650 printf("ffs_size_dir: `%s' size %lld\n", 651 node->name, 652 (long long)node->inode->st.st_size); 653 fsopts->inodes++; 654 if (node->type == S_IFREG) 655 ADDSIZE(node->inode->st.st_size); 656 if (node->type == S_IFLNK) { 657 size_t slen; 658 659 slen = strlen(node->symlink) + 1; 660 if (slen >= (ffs_opts->version == 1 ? 661 UFS1_MAXSYMLINKLEN : 662 UFS2_MAXSYMLINKLEN)) 663 ADDSIZE(slen); 664 } 665 } 666 if (node->type == S_IFDIR) 667 ffs_size_dir(node->child, fsopts); 668 } 669 ADDSIZE(curdirsize); 670 671 if (debug & DEBUG_FS_SIZE_DIR) 672 printf("ffs_size_dir: exit: size %lld inodes %lld\n", 673 (long long)fsopts->size, (long long)fsopts->inodes); 674} 675 676static void * 677ffs_build_dinode1(struct ufs1_dinode *dinp, dirbuf_t *dbufp, fsnode *cur, 678 fsnode *root, fsinfo_t *fsopts) 679{ 680 size_t slen; 681 void *membuf; 682 struct stat *st = stampst.st_ino != 0 ? &stampst : &cur->inode->st; 683 684 memset(dinp, 0, sizeof(*dinp)); 685 dinp->di_mode = cur->inode->st.st_mode; 686 dinp->di_nlink = cur->inode->nlink; 687 dinp->di_size = cur->inode->st.st_size; 688#if HAVE_STRUCT_STAT_ST_FLAGS 689 dinp->di_flags = cur->inode->st.st_flags; 690#endif 691 dinp->di_gen = random(); 692 dinp->di_uid = cur->inode->st.st_uid; 693 dinp->di_gid = cur->inode->st.st_gid; 694 695 dinp->di_atime = st->st_atime; 696 dinp->di_mtime = st->st_mtime; 697 dinp->di_ctime = st->st_ctime; 698#if HAVE_STRUCT_STAT_ST_MTIMENSEC 699 dinp->di_atimensec = st->st_atimensec; 700 dinp->di_mtimensec = st->st_mtimensec; 701 dinp->di_ctimensec = st->st_ctimensec; 702#endif 703 /* not set: di_db, di_ib, di_blocks, di_spare */ 704 705 membuf = NULL; 706 if (cur == root) { /* "."; write dirbuf */ 707 membuf = dbufp->buf; 708 dinp->di_size = dbufp->size; 709 } else if (S_ISBLK(cur->type) || S_ISCHR(cur->type)) { 710 dinp->di_size = 0; /* a device */ 711 dinp->di_rdev = 712 ufs_rw32(cur->inode->st.st_rdev, fsopts->needswap); 713 } else if (S_ISLNK(cur->type)) { /* symlink */ 714 slen = strlen(cur->symlink); 715 if (slen < UFS1_MAXSYMLINKLEN) { /* short link */ 716 memcpy(dinp->di_shortlink, cur->symlink, slen); 717 } else 718 membuf = cur->symlink; 719 dinp->di_size = slen; 720 } 721 return membuf; 722} 723 724static void * 725ffs_build_dinode2(struct ufs2_dinode *dinp, dirbuf_t *dbufp, fsnode *cur, 726 fsnode *root, fsinfo_t *fsopts) 727{ 728 size_t slen; 729 void *membuf; 730 struct stat *st = stampst.st_ino != 0 ? &stampst : &cur->inode->st; 731 732 memset(dinp, 0, sizeof(*dinp)); 733 dinp->di_mode = cur->inode->st.st_mode; 734 dinp->di_nlink = cur->inode->nlink; 735 dinp->di_size = cur->inode->st.st_size; 736#if HAVE_STRUCT_STAT_ST_FLAGS 737 dinp->di_flags = cur->inode->st.st_flags; 738#endif 739 dinp->di_gen = random(); 740 dinp->di_uid = cur->inode->st.st_uid; 741 dinp->di_gid = cur->inode->st.st_gid; 742 743 dinp->di_atime = st->st_atime; 744 dinp->di_mtime = st->st_mtime; 745 dinp->di_ctime = st->st_ctime; 746#if HAVE_STRUCT_STAT_BIRTHTIME 747 dinp->di_birthtime = st->st_birthtime; 748#else 749 dinp->di_birthtime = st->st_ctime; 750#endif 751#if HAVE_STRUCT_STAT_ST_MTIMENSEC 752 dinp->di_atimensec = st->st_atimensec; 753 dinp->di_mtimensec = st->st_mtimensec; 754 dinp->di_ctimensec = st->st_ctimensec; 755#if HAVE_STRUCT_STAT_BIRTHTIME 756 dinp->di_birthnsec = st->st_birthtimensec; 757#else 758 dinp->di_birthnsec = st->st_ctimensec; 759#endif 760#endif 761 762 /* not set: di_db, di_ib, di_blocks, di_spare */ 763 764 membuf = NULL; 765 if (cur == root) { /* "."; write dirbuf */ 766 membuf = dbufp->buf; 767 dinp->di_size = dbufp->size; 768 } else if (S_ISBLK(cur->type) || S_ISCHR(cur->type)) { 769 dinp->di_size = 0; /* a device */ 770 dinp->di_rdev = 771 ufs_rw64(cur->inode->st.st_rdev, fsopts->needswap); 772 } else if (S_ISLNK(cur->type)) { /* symlink */ 773 slen = strlen(cur->symlink); 774 if (slen < UFS2_MAXSYMLINKLEN) { /* short link */ 775 memcpy(dinp->di_shortlink, cur->symlink, slen); 776 } else 777 membuf = cur->symlink; 778 dinp->di_size = slen; 779 } 780 return membuf; 781} 782 783static int 784ffs_populate_dir(const char *dir, fsnode *root, fsinfo_t *fsopts) 785{ 786 fsnode *cur; 787 dirbuf_t dirbuf; 788 union dinode din; 789 void *membuf; 790 char path[MAXPATHLEN + 1]; 791 ffs_opt_t *ffs_opts = fsopts->fs_specific; 792 793 assert(dir != NULL); 794 assert(root != NULL); 795 assert(fsopts != NULL); 796 assert(ffs_opts != NULL); 797 798 (void)memset(&dirbuf, 0, sizeof(dirbuf)); 799 800 if (debug & DEBUG_FS_POPULATE) 801 printf("ffs_populate_dir: PASS 1 dir %s node %p\n", dir, root); 802 803 /* 804 * pass 1: allocate inode numbers, build directory `file' 805 */ 806 for (cur = root; cur != NULL; cur = cur->next) { 807 if ((cur->inode->flags & FI_ALLOCATED) == 0) { 808 cur->inode->flags |= FI_ALLOCATED; 809 if (cur == root && cur->parent != NULL) 810 cur->inode->ino = cur->parent->inode->ino; 811 else { 812 cur->inode->ino = fsopts->curinode; 813 fsopts->curinode++; 814 } 815 } 816 ffs_make_dirbuf(&dirbuf, cur->name, cur, fsopts->needswap); 817 if (cur == root) { /* we're at "."; add ".." */ 818 ffs_make_dirbuf(&dirbuf, "..", 819 cur->parent == NULL ? cur : cur->parent->first, 820 fsopts->needswap); 821 root->inode->nlink++; /* count my parent's link */ 822 } else if (cur->child != NULL) 823 root->inode->nlink++; /* count my child's link */ 824 825 /* 826 * XXX possibly write file and long symlinks here, 827 * ensuring that blocks get written before inodes? 828 * otoh, this isn't a real filesystem, so who 829 * cares about ordering? :-) 830 */ 831 } 832 if (debug & DEBUG_FS_POPULATE_DIRBUF) 833 ffs_dump_dirbuf(&dirbuf, dir, fsopts->needswap); 834 835 /* 836 * pass 2: write out dirbuf, then non-directories at this level 837 */ 838 if (debug & DEBUG_FS_POPULATE) 839 printf("ffs_populate_dir: PASS 2 dir %s\n", dir); 840 for (cur = root; cur != NULL; cur = cur->next) { 841 if (cur->inode->flags & FI_WRITTEN) 842 continue; /* skip hard-linked entries */ 843 cur->inode->flags |= FI_WRITTEN; 844 845 if (cur->contents == NULL) { 846 if (snprintf(path, sizeof(path), "%s/%s/%s", cur->root, 847 cur->path, cur->name) >= (int)sizeof(path)) 848 errx(1, "Pathname too long."); 849 } 850 851 if (cur->child != NULL) 852 continue; /* child creates own inode */ 853 854 /* build on-disk inode */ 855 if (ffs_opts->version == 1) 856 membuf = ffs_build_dinode1(&din.ffs1_din, &dirbuf, cur, 857 root, fsopts); 858 else 859 membuf = ffs_build_dinode2(&din.ffs2_din, &dirbuf, cur, 860 root, fsopts); 861 862 if (debug & DEBUG_FS_POPULATE_NODE) { 863 printf("ffs_populate_dir: writing ino %d, %s", 864 cur->inode->ino, inode_type(cur->type)); 865 if (cur->inode->nlink > 1) 866 printf(", nlink %d", cur->inode->nlink); 867 putchar('\n'); 868 } 869 870 if (membuf != NULL) { 871 ffs_write_file(&din, cur->inode->ino, membuf, fsopts); 872 } else if (S_ISREG(cur->type)) { 873 ffs_write_file(&din, cur->inode->ino, 874 (cur->contents) ? cur->contents : path, fsopts); 875 } else { 876 assert (! S_ISDIR(cur->type)); 877 ffs_write_inode(&din, cur->inode->ino, fsopts); 878 } 879 } 880 881 /* 882 * pass 3: write out sub-directories 883 */ 884 if (debug & DEBUG_FS_POPULATE) 885 printf("ffs_populate_dir: PASS 3 dir %s\n", dir); 886 for (cur = root; cur != NULL; cur = cur->next) { 887 if (cur->child == NULL) 888 continue; 889 if ((size_t)snprintf(path, sizeof(path), "%s/%s", dir, 890 cur->name) >= sizeof(path)) 891 errx(1, "Pathname too long."); 892 if (! ffs_populate_dir(path, cur->child, fsopts)) 893 return (0); 894 } 895 896 if (debug & DEBUG_FS_POPULATE) 897 printf("ffs_populate_dir: DONE dir %s\n", dir); 898 899 /* cleanup */ 900 if (dirbuf.buf != NULL) 901 free(dirbuf.buf); 902 return (1); 903} 904 905 906static void 907ffs_write_file(union dinode *din, uint32_t ino, void *buf, fsinfo_t *fsopts) 908{ 909 int isfile, ffd; 910 char *fbuf, *p; 911 off_t bufleft, chunk, offset; 912 ssize_t nread; 913 struct inode in; 914 struct m_buf * bp; 915 ffs_opt_t *ffs_opts = fsopts->fs_specific; 916 struct m_vnode vp = { fsopts, NULL }; 917 918 assert (din != NULL); 919 assert (buf != NULL); 920 assert (fsopts != NULL); 921 assert (ffs_opts != NULL); 922 923 isfile = S_ISREG(DIP(din, mode)); 924 fbuf = NULL; 925 ffd = -1; 926 p = NULL; 927 928 in.i_fs = (struct fs *)fsopts->superblock; 929 in.i_devvp = (void *)&vp; 930 931 if (debug & DEBUG_FS_WRITE_FILE) { 932 printf( 933 "ffs_write_file: ino %u, din %p, isfile %d, %s, size %lld", 934 ino, din, isfile, inode_type(DIP(din, mode) & S_IFMT), 935 (long long)DIP(din, size)); 936 if (isfile) 937 printf(", file '%s'\n", (char *)buf); 938 else 939 printf(", buffer %p\n", buf); 940 } 941 942 in.i_number = ino; 943 in.i_size = DIP(din, size); 944 if (ffs_opts->version == 1) 945 memcpy(&in.i_din.ffs1_din, &din->ffs1_din, 946 sizeof(in.i_din.ffs1_din)); 947 else 948 memcpy(&in.i_din.ffs2_din, &din->ffs2_din, 949 sizeof(in.i_din.ffs2_din)); 950 951 if (DIP(din, size) == 0) 952 goto write_inode_and_leave; /* mmm, cheating */ 953 954 if (isfile) { 955 fbuf = emalloc(ffs_opts->bsize); 956 if ((ffd = open((char *)buf, O_RDONLY)) == -1) { 957 err(EXIT_FAILURE, "Can't open `%s' for reading", (char *)buf); 958 } 959 } else { 960 p = buf; 961 } 962 963 chunk = 0; 964 for (bufleft = DIP(din, size); bufleft > 0; bufleft -= chunk) { 965 chunk = MIN(bufleft, ffs_opts->bsize); 966 if (!isfile) 967 ; 968 else if ((nread = read(ffd, fbuf, chunk)) == -1) 969 err(EXIT_FAILURE, "Reading `%s', %lld bytes to go", 970 (char *)buf, (long long)bufleft); 971 else if (nread != chunk) 972 errx(EXIT_FAILURE, "Reading `%s', %lld bytes to go, " 973 "read %zd bytes, expected %ju bytes, does " 974 "metalog size= attribute mismatch source size?", 975 (char *)buf, (long long)bufleft, nread, 976 (uintmax_t)chunk); 977 else 978 p = fbuf; 979 offset = DIP(din, size) - bufleft; 980 if (debug & DEBUG_FS_WRITE_FILE_BLOCK) 981 printf( 982 "ffs_write_file: write %p offset %lld size %lld left %lld\n", 983 p, (long long)offset, 984 (long long)chunk, (long long)bufleft); 985 /* 986 * XXX if holey support is desired, do the check here 987 * 988 * XXX might need to write out last bit in fragroundup 989 * sized chunk. however, ffs_balloc() handles this for us 990 */ 991 errno = ffs_balloc(&in, offset, chunk, &bp); 992 bad_ffs_write_file: 993 if (errno != 0) 994 err(1, 995 "Writing inode %d (%s), bytes %lld + %lld", 996 ino, 997 isfile ? (char *)buf : 998 inode_type(DIP(din, mode) & S_IFMT), 999 (long long)offset, (long long)chunk); 1000 memcpy(bp->b_data, p, chunk); 1001 errno = bwrite(bp); 1002 if (errno != 0) 1003 goto bad_ffs_write_file; 1004 if (!isfile) 1005 p += chunk; 1006 } 1007 1008 write_inode_and_leave: 1009 ffs_write_inode(&in.i_din, in.i_number, fsopts); 1010 if (fbuf) 1011 free(fbuf); 1012 if (ffd != -1) 1013 close(ffd); 1014} 1015 1016 1017static void 1018ffs_dump_dirbuf(dirbuf_t *dbuf, const char *dir, int needswap) 1019{ 1020 doff_t i; 1021 struct direct *de; 1022 uint16_t reclen; 1023 1024 assert (dbuf != NULL); 1025 assert (dir != NULL); 1026 printf("ffs_dump_dirbuf: dir %s size %d cur %d\n", 1027 dir, dbuf->size, dbuf->cur); 1028 1029 for (i = 0; i < dbuf->size; ) { 1030 de = (struct direct *)(dbuf->buf + i); 1031 reclen = ufs_rw16(de->d_reclen, needswap); 1032 printf( 1033 " inode %4d %7s offset %4d reclen %3d namlen %3d name %s\n", 1034 ufs_rw32(de->d_ino, needswap), 1035 inode_type(DTTOIF(de->d_type)), i, reclen, 1036 de->d_namlen, de->d_name); 1037 i += reclen; 1038 assert(reclen > 0); 1039 } 1040} 1041 1042static void 1043ffs_make_dirbuf(dirbuf_t *dbuf, const char *name, fsnode *node, int needswap) 1044{ 1045 struct direct de, *dp; 1046 uint16_t llen, reclen; 1047 u_char *newbuf; 1048 1049 assert (dbuf != NULL); 1050 assert (name != NULL); 1051 assert (node != NULL); 1052 /* create direct entry */ 1053 (void)memset(&de, 0, sizeof(de)); 1054 de.d_ino = ufs_rw32(node->inode->ino, needswap); 1055 de.d_type = IFTODT(node->type); 1056 de.d_namlen = (uint8_t)strlen(name); 1057 strcpy(de.d_name, name); 1058 reclen = DIRSIZ_SWAP(0, &de, needswap); 1059 de.d_reclen = ufs_rw16(reclen, needswap); 1060 1061 dp = (struct direct *)(dbuf->buf + dbuf->cur); 1062 llen = 0; 1063 if (dp != NULL) 1064 llen = DIRSIZ_SWAP(0, dp, needswap); 1065 1066 if (debug & DEBUG_FS_MAKE_DIRBUF) 1067 printf( 1068 "ffs_make_dirbuf: dbuf siz %d cur %d lastlen %d\n" 1069 " ino %d type %d reclen %d namlen %d name %.30s\n", 1070 dbuf->size, dbuf->cur, llen, 1071 ufs_rw32(de.d_ino, needswap), de.d_type, reclen, 1072 de.d_namlen, de.d_name); 1073 1074 if (reclen + dbuf->cur + llen > roundup(dbuf->size, DIRBLKSIZ)) { 1075 if (debug & DEBUG_FS_MAKE_DIRBUF) 1076 printf("ffs_make_dirbuf: growing buf to %d\n", 1077 dbuf->size + DIRBLKSIZ); 1078 newbuf = erealloc(dbuf->buf, dbuf->size + DIRBLKSIZ); 1079 dbuf->buf = newbuf; 1080 dbuf->size += DIRBLKSIZ; 1081 memset(dbuf->buf + dbuf->size - DIRBLKSIZ, 0, DIRBLKSIZ); 1082 dbuf->cur = dbuf->size - DIRBLKSIZ; 1083 } else if (dp) { /* shrink end of previous */ 1084 dp->d_reclen = ufs_rw16(llen,needswap); 1085 dbuf->cur += llen; 1086 } 1087 dp = (struct direct *)(dbuf->buf + dbuf->cur); 1088 memcpy(dp, &de, reclen); 1089 dp->d_reclen = ufs_rw16(dbuf->size - dbuf->cur, needswap); 1090} 1091 1092/* 1093 * cribbed from sys/ufs/ffs/ffs_alloc.c 1094 */ 1095static void 1096ffs_write_inode(union dinode *dp, uint32_t ino, const fsinfo_t *fsopts) 1097{ 1098 char *buf; 1099 struct ufs1_dinode *dp1; 1100 struct ufs2_dinode *dp2, *dip; 1101 struct cg *cgp; 1102 struct fs *fs; 1103 int cg, cgino; 1104 uint32_t i; 1105 daddr_t d; 1106 char sbbuf[FFS_MAXBSIZE]; 1107 uint32_t initediblk; 1108 ffs_opt_t *ffs_opts = fsopts->fs_specific; 1109 1110 assert (dp != NULL); 1111 assert (ino > 0); 1112 assert (fsopts != NULL); 1113 assert (ffs_opts != NULL); 1114 1115 fs = (struct fs *)fsopts->superblock; 1116 cg = ino_to_cg(fs, ino); 1117 cgino = ino % fs->fs_ipg; 1118 if (debug & DEBUG_FS_WRITE_INODE) 1119 printf("ffs_write_inode: din %p ino %u cg %d cgino %d\n", 1120 dp, ino, cg, cgino); 1121 1122 ffs_rdfs(fsbtodb(fs, cgtod(fs, cg)), (int)fs->fs_cgsize, &sbbuf, 1123 fsopts); 1124 cgp = (struct cg *)sbbuf; 1125 if (!cg_chkmagic_swap(cgp, fsopts->needswap)) 1126 errx(1, "ffs_write_inode: cg %d: bad magic number", cg); 1127 1128 assert (isclr(cg_inosused_swap(cgp, fsopts->needswap), cgino)); 1129 1130 buf = emalloc(fs->fs_bsize); 1131 dp1 = (struct ufs1_dinode *)buf; 1132 dp2 = (struct ufs2_dinode *)buf; 1133 1134 if (fs->fs_cstotal.cs_nifree == 0) 1135 errx(1, "ffs_write_inode: fs out of inodes for ino %u", 1136 ino); 1137 if (fs->fs_cs(fs, cg).cs_nifree == 0) 1138 errx(1, 1139 "ffs_write_inode: cg %d out of inodes for ino %u", 1140 cg, ino); 1141 setbit(cg_inosused_swap(cgp, fsopts->needswap), cgino); 1142 ufs_add32(cgp->cg_cs.cs_nifree, -1, fsopts->needswap); 1143 fs->fs_cstotal.cs_nifree--; 1144 fs->fs_cs(fs, cg).cs_nifree--; 1145 if (S_ISDIR(DIP(dp, mode))) { 1146 ufs_add32(cgp->cg_cs.cs_ndir, 1, fsopts->needswap); 1147 fs->fs_cstotal.cs_ndir++; 1148 fs->fs_cs(fs, cg).cs_ndir++; 1149 } 1150 1151 /* 1152 * Initialize inode blocks on the fly for UFS2. 1153 */ 1154 initediblk = ufs_rw32(cgp->cg_initediblk, fsopts->needswap); 1155 while (ffs_opts->version == 2 && cgino + INOPB(fs) > initediblk && 1156 initediblk < ufs_rw32(cgp->cg_niblk, fsopts->needswap)) { 1157 memset(buf, 0, fs->fs_bsize); 1158 dip = (struct ufs2_dinode *)buf; 1159 for (i = 0; i < INOPB(fs); i++) { 1160 dip->di_gen = random(); 1161 dip++; 1162 } 1163 ffs_wtfs(fsbtodb(fs, ino_to_fsba(fs, 1164 cg * fs->fs_ipg + initediblk)), 1165 fs->fs_bsize, buf, fsopts); 1166 initediblk += INOPB(fs); 1167 cgp->cg_initediblk = ufs_rw32(initediblk, fsopts->needswap); 1168 } 1169 1170 1171 ffs_wtfs(fsbtodb(fs, cgtod(fs, cg)), (int)fs->fs_cgsize, &sbbuf, 1172 fsopts); 1173 1174 /* now write inode */ 1175 d = fsbtodb(fs, ino_to_fsba(fs, ino)); 1176 ffs_rdfs(d, fs->fs_bsize, buf, fsopts); 1177 if (fsopts->needswap) { 1178 if (ffs_opts->version == 1) 1179 ffs_dinode1_swap(&dp->ffs1_din, 1180 &dp1[ino_to_fsbo(fs, ino)]); 1181 else 1182 ffs_dinode2_swap(&dp->ffs2_din, 1183 &dp2[ino_to_fsbo(fs, ino)]); 1184 } else { 1185 if (ffs_opts->version == 1) 1186 dp1[ino_to_fsbo(fs, ino)] = dp->ffs1_din; 1187 else 1188 dp2[ino_to_fsbo(fs, ino)] = dp->ffs2_din; 1189 } 1190 ffs_wtfs(d, fs->fs_bsize, buf, fsopts); 1191 free(buf); 1192} 1193 1194void 1195panic(const char *fmt, ...) 1196{ 1197 va_list ap; 1198 1199 va_start(ap, fmt); 1200 vwarnx(fmt, ap); 1201 va_end(ap); 1202 exit(1); 1203} 1204