1 /*- 2 * Copyright (c) 1991 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 */ 7 8 #ifndef lint 9 static char sccsid[] = "@(#)lfs.c 5.4 (Berkeley) 12/14/91"; 10 #endif /* not lint */ 11 12 #include <sys/param.h> 13 #include <sys/uio.h> 14 #include <sys/disklabel.h> 15 #include <sys/time.h> 16 #include <sys/resource.h> 17 #include <sys/proc.h> 18 #include <sys/vnode.h> 19 20 #include <ufs/ufs/dir.h> 21 #include <ufs/ufs/quota.h> 22 #include <ufs/ufs/dinode.h> 23 #include <ufs/ufs/ufsmount.h> 24 #include <ufs/lfs/lfs.h> 25 26 #include <unistd.h> 27 #include <errno.h> 28 #include <stdlib.h> 29 #include <string.h> 30 #include "config.h" 31 #include "extern.h" 32 33 static struct lfs lfs_default = { 34 /* lfs_magic */ LFS_MAGIC, 35 /* lfs_version */ LFS_VERSION, 36 /* lfs_size */ 0, 37 /* lfs_ssize */ DFL_LFSSEG/DFL_LFSBLOCK, 38 /* lfs_dsize */ 0, 39 /* lfs_bsize */ DFL_LFSBLOCK, 40 /* lfs_fsize */ DFL_LFSBLOCK, 41 /* lfs_frag */ 1, 42 /* lfs_free */ LFS_FIRST_INUM, 43 /* lfs_bfree */ 0, 44 /* lfs_nfiles */ 0, 45 /* lfs_idaddr */ 0, 46 /* lfs_ifile */ LFS_IFILE_INUM, 47 /* lfs_lastseg */ 0, 48 /* lfs_nextseg */ 0, 49 /* lfs_curseg */ 0, 50 /* lfs_offset */ 0, 51 /* lfs_tstamp */ 0, 52 /* lfs_minfree */ MINFREE, 53 /* lfs_dbpseg */ DFL_LFSSEG/DEV_BSIZE, 54 /* lfs_inopb */ DFL_LFSBLOCK/sizeof(struct dinode), 55 /* lfs_ifpb */ DFL_LFSBLOCK/sizeof(IFILE), 56 /* lfs_sepb */ DFL_LFSBLOCK/sizeof(SEGUSE), 57 /* lfs_nindir */ DFL_LFSBLOCK/sizeof(daddr_t), 58 /* lfs_nseg */ 0, 59 /* lfs_nspf */ 0, 60 /* lfs_cleansz */ 0, 61 /* lfs_segtabsz */ 0, 62 /* lfs_segmask */ DFL_LFSSEG_MASK, 63 /* lfs_segshift */ DFL_LFSSEG_SHIFT, 64 /* lfs_bmask */ DFL_LFSBLOCK_MASK, 65 /* lfs_bshift */ DFL_LFSBLOCK_SHIFT, 66 /* lfs_ffmask */ 0, 67 /* lfs_ffshift */ 0, 68 /* lfs_fbmask */ 0, 69 /* lfs_fbshift */ 0, 70 /* lfs_fsbtodb */ 0, 71 /* lfs_sboffs */ { 0 }, 72 /* lfs_ivnode */ NULL, 73 /* lfs_segtab */ NULL, 74 /* lfs_seglist */ NULL, 75 /* lfs_iocount */ 0, 76 /* lfs_fmod */ 0, 77 /* lfs_clean */ 0, 78 /* lfs_ronly */ 0, 79 /* lfs_flags */ 0, 80 /* lfs_fsmnt */ { 0 }, 81 /* lfs_pad */ { 0 }, 82 /* lfs_cksum */ 0 83 }; 84 85 86 struct direct lfs_root_dir[] = { 87 { ROOTINO, sizeof(struct direct), 1, "."}, 88 { ROOTINO, sizeof(struct direct), 2, ".."}, 89 { LFS_IFILE_INUM, sizeof(struct direct), 5, "ifile"}, 90 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found"}, 91 }; 92 93 struct direct lfs_lf_dir[] = { 94 { LOSTFOUNDINO, sizeof(struct direct), 1, "." }, 95 { ROOTINO, sizeof(struct direct), 2, ".." }, 96 }; 97 98 static daddr_t make_dinode 99 __P((ino_t, struct dinode *, int, daddr_t, struct lfs *)); 100 static void make_dir __P(( void *, struct direct *, int)); 101 static void put __P((int, off_t, void *, size_t)); 102 103 int 104 make_lfs(fd, lp, partp, minfree, block_size, seg_size) 105 int fd; 106 struct disklabel *lp; 107 struct partition *partp; 108 int minfree; 109 int block_size; 110 int seg_size; 111 { 112 struct dinode *dip; /* Pointer to a disk inode */ 113 struct dinode *dpagep; /* Pointer to page of disk inodes */ 114 CLEANERINFO *cleaninfo; /* Segment cleaner information table */ 115 FINFO file_info; /* File info structure in summary blocks */ 116 IFILE *ifile; /* Pointer to array of ifile structures */ 117 IFILE *ip; /* Pointer to array of ifile structures */ 118 struct lfs *lfsp; /* Superblock */ 119 SEGUSE *segp; /* Segment usage table */ 120 SEGUSE *segtable; /* Segment usage table */ 121 SEGSUM summary; /* Segment summary structure */ 122 SEGSUM *sp; /* Segment summary pointer */ 123 daddr_t last_sb_addr; /* Address of superblocks */ 124 daddr_t last_addr; /* Previous segment address */ 125 daddr_t sb_addr; /* Address of superblocks */ 126 daddr_t seg_addr; /* Address of current segment */ 127 void *ipagep; /* Pointer to the page we use to write stuff */ 128 void *sump; /* Used to copy stuff into segment buffer */ 129 u_long *block_array; /* Array of logical block nos to put in sum */ 130 u_long blocks_used; /* Number of blocks in first segment */ 131 u_long *dp; /* Used to computed checksum on data */ 132 u_long *datasump; /* Used to computed checksum on data */ 133 int block_array_size; /* How many entries in block array */ 134 int bsize; /* Block size */ 135 int db_per_fb; /* Disk blocks per file block */ 136 int i, j; 137 int off; /* Offset at which to write */ 138 int sb_to_sum; /* offset between superblock and summary */ 139 int sb_interval; /* number of segs between super blocks */ 140 int seg_seek; /* Seek offset for a segment */ 141 int ssize; /* Segment size */ 142 int sum_size; /* Size of the summary block */ 143 int wbytes; /* Number of bytes returned by write */ 144 145 lfsp = &lfs_default; 146 147 if (!(bsize = block_size)) 148 bsize = DFL_LFSBLOCK; 149 if (!(ssize = seg_size)) 150 ssize = DFL_LFSSEG; 151 152 /* Modify parts of superblock overridden by command line arguments */ 153 if (bsize != DFL_LFSBLOCK) { 154 lfsp->lfs_bshift = log2(bsize); 155 if (1 << lfsp->lfs_bshift != bsize) 156 fatal("%d: block size not a power of 2", bsize); 157 lfsp->lfs_bsize = bsize; 158 lfsp->lfs_fsize = bsize; 159 lfsp->lfs_bmask = bsize - 1; 160 lfsp->lfs_inopb = bsize / sizeof(struct dinode); 161 /* MIS -- should I round to power of 2 */ 162 lfsp->lfs_ifpb = bsize / sizeof(IFILE); 163 lfsp->lfs_sepb = bsize / sizeof(SEGUSE); 164 lfsp->lfs_nindir = bsize / sizeof(daddr_t); 165 } 166 167 if (ssize != DFL_LFSSEG) { 168 lfsp->lfs_segshift = log2(ssize); 169 if (1 << lfsp->lfs_segshift != ssize) 170 fatal("%d: segment size not power of 2", ssize); 171 lfsp->lfs_ssize = ssize; 172 lfsp->lfs_segmask = ssize - 1; 173 } 174 lfsp->lfs_ssize = ssize >> lfsp->lfs_bshift; 175 176 if (minfree) 177 lfsp->lfs_minfree = minfree; 178 179 /* 180 * Fill in parts of superblock that can be computed from file system 181 * size, disk geometry and current time. 182 */ 183 db_per_fb = bsize/lp->d_secsize; 184 lfsp->lfs_fsbtodb = log2(db_per_fb); 185 lfsp->lfs_size = partp->p_size >> lfsp->lfs_fsbtodb; 186 lfsp->lfs_dsize = lfsp->lfs_size - (LFS_LABELPAD >> lfsp->lfs_bshift); 187 lfsp->lfs_nseg = lfsp->lfs_dsize / lfsp->lfs_ssize; 188 189 /* 190 * The number of free blocks is set from the total data size (lfs_dsize) 191 * minus one block for each segment (for the segment summary). Then 192 * we'll subtract off the room for the superblocks, ifile entries and 193 * segment usage table. 194 */ 195 lfsp->lfs_bfree = lfsp->lfs_dsize - lfsp->lfs_nseg; 196 lfsp->lfs_segtabsz = SEGTABSIZE_SU(lfsp); 197 lfsp->lfs_cleansz = CLEANSIZE_SU(lfsp); 198 if ((lfsp->lfs_tstamp = time(NULL)) == -1) 199 fatal("time: %s", strerror(errno)); 200 if ((sb_interval = lfsp->lfs_nseg / LFS_MAXNUMSB) < LFS_MIN_SBINTERVAL) 201 sb_interval = LFS_MIN_SBINTERVAL; 202 203 /* 204 * Now, lay out the file system. We need to figure out where 205 * the superblocks go, initialize the checkpoint information 206 * for the first two superblocks, initialize the segment usage 207 * information, put the segusage information in the ifile, create 208 * the first block of IFILE structures, and link all the IFILE 209 * structures into a free list. 210 */ 211 212 /* Figure out where the superblocks are going to live */ 213 lfsp->lfs_sboffs[0] = LFS_LABELPAD/lp->d_secsize; 214 for (i = 1; i < LFS_MAXNUMSB; i++) { 215 sb_addr = ((i * sb_interval) << 216 (lfsp->lfs_segshift - lfsp->lfs_bshift + lfsp->lfs_fsbtodb)) 217 + lfsp->lfs_sboffs[0]; 218 if (sb_addr > partp->p_size) 219 break; 220 lfsp->lfs_sboffs[i] = sb_addr; 221 } 222 last_sb_addr = lfsp->lfs_sboffs[i - 1]; 223 lfsp->lfs_lastseg = lfsp->lfs_sboffs[0]; 224 lfsp->lfs_nextseg = 225 lfsp->lfs_sboffs[1] ? lfsp->lfs_sboffs[1] : lfsp->lfs_sboffs[0]; 226 lfsp->lfs_curseg = lfsp->lfs_lastseg; 227 228 /* 229 * Initialize the segment usage table. The first segment will 230 * contain the superblock, the cleanerinfo (cleansz), the segusage 231 * table * (segtabsz), 1 block's worth of IFILE entries, the root 232 * directory, the lost+found directory and one block's worth of 233 * inodes (containing the ifile, root, and l+f inodes). 234 */ 235 if (!(cleaninfo = malloc(lfsp->lfs_cleansz << lfsp->lfs_bshift))) 236 fatal("%s", strerror(errno)); 237 cleaninfo->clean = lfsp->lfs_nseg - 1; 238 cleaninfo->dirty = 1; 239 240 if (!(segtable = malloc(lfsp->lfs_segtabsz << lfsp->lfs_bshift))) 241 fatal("%s", strerror(errno)); 242 segp = segtable; 243 blocks_used = lfsp->lfs_segtabsz + lfsp->lfs_cleansz + 4; 244 segp->su_nbytes = LFS_SBPAD + (blocks_used << lfsp->lfs_bshift); 245 segp->su_lastmod = lfsp->lfs_tstamp; 246 segp->su_flags = SEGUSE_SUPERBLOCK | SEGUSE_DIRTY; 247 lfsp->lfs_bfree -= lfsp->lfs_cleansz + lfsp->lfs_segtabsz + 4; 248 249 /* 250 * Now figure out the address of the ifile inode. The inode block 251 * appears immediately after the segment summary. 252 */ 253 lfsp->lfs_idaddr = (LFS_LABELPAD + LFS_SBPAD + LFS_SUMMARY_SIZE) / 254 lp->d_secsize; 255 256 for (segp = segtable + 1, i = 1; i < lfsp->lfs_nseg; i++, segp++) { 257 if ((i % sb_interval) == 0) { 258 segp->su_flags = SEGUSE_SUPERBLOCK; 259 segp->su_nbytes = LFS_SBPAD; 260 lfsp->lfs_bfree -= (LFS_SBPAD >> lfsp->lfs_bshift); 261 } else { 262 segp->su_flags = 0; 263 segp->su_nbytes = 0; 264 } 265 segp->su_lastmod = 0; 266 } 267 268 /* 269 * Ready to start writing segments. The first segment is different 270 * because it contains the segment usage table and the ifile inode 271 * as well as a superblock. For the rest of the segments, set the 272 * time stamp to be 0 so that the first segment is the most recent. 273 * For each segment that is supposed to contain a copy of the super 274 * block, initialize its first few blocks and its segment summary 275 * to indicate this. 276 */ 277 lfsp->lfs_nfiles = LFS_FIRST_INUM - 1; 278 lfsp->lfs_cksum = 279 cksum(lfsp, sizeof(struct lfs) - sizeof(lfsp->lfs_cksum)); 280 281 /* Now create a block of disk inodes */ 282 if (!(dpagep = malloc(lfsp->lfs_bsize))) 283 fatal("%s", strerror(errno)); 284 dip = (struct dinode *)dpagep; 285 bzero(dip, lfsp->lfs_bsize); 286 287 /* Create a block of IFILE structures. */ 288 if (!(ipagep = malloc(lfsp->lfs_bsize))) 289 fatal("%s", strerror(errno)); 290 ifile = (IFILE *)ipagep; 291 292 /* 293 * Initialize IFILE. It is the next block following the 294 * block of inodes (whose address has been calculated in 295 * lfsp->lfs_idaddr; 296 */ 297 sb_addr = lfsp->lfs_idaddr + lfsp->lfs_bsize / lp->d_secsize; 298 sb_addr = make_dinode(LFS_IFILE_INUM, dip, 299 lfsp->lfs_cleansz + lfsp->lfs_segtabsz+1, sb_addr, lfsp); 300 dip->di_mode = IFREG|IREAD|IWRITE; 301 ip = &ifile[LFS_IFILE_INUM]; 302 ip->if_version = 1; 303 ip->if_daddr = lfsp->lfs_idaddr; 304 ip->if_st_atime = lfsp->lfs_tstamp; 305 306 /* Initialize the ROOT Directory */ 307 sb_addr = make_dinode(ROOTINO, ++dip, 1, sb_addr, lfsp); 308 dip->di_mode = IFDIR|IREAD|IWRITE|IEXEC; 309 dip->di_size = DIRBLKSIZ; 310 dip->di_nlink = 3; 311 ip = &ifile[ROOTINO]; 312 ip->if_version = 1; 313 ip->if_daddr = lfsp->lfs_idaddr; 314 ip->if_st_atime = lfsp->lfs_tstamp; 315 316 /* Initialize the lost+found Directory */ 317 sb_addr = make_dinode(LOSTFOUNDINO, ++dip, 1, sb_addr, lfsp); 318 dip->di_mode = IFDIR|IREAD|IWRITE|IEXEC; 319 dip->di_size = DIRBLKSIZ; 320 dip->di_nlink = 2; 321 ip = &ifile[LOSTFOUNDINO]; 322 ip->if_version = 1; 323 ip->if_daddr = lfsp->lfs_idaddr; 324 ip->if_st_atime = lfsp->lfs_tstamp; 325 326 /* Make all the other dinodes invalid */ 327 for (i = INOPB(lfsp)-3, dip++; i; i--, dip++) 328 dip->di_inum = LFS_UNUSED_INUM; 329 330 331 /* Link remaining IFILE entries in free list */ 332 for (ip = &ifile[LFS_FIRST_INUM], i = LFS_FIRST_INUM; 333 i < lfsp->lfs_ifpb; ++ip) { 334 ip->if_version = 1; 335 ip->if_daddr = LFS_UNUSED_DADDR; 336 ip->if_nextfree = ++i; 337 } 338 ifile[lfsp->lfs_ifpb - 1].if_nextfree = LFS_UNUSED_INUM; 339 340 /* Now, write the segment */ 341 342 /* Compute a checksum across all the data you're writing */ 343 dp = datasump = malloc (blocks_used * sizeof(u_long)); 344 *dp++ = ((u_long *)dip)[0]; /* inode block */ 345 for (i = 0; i < lfsp->lfs_cleansz; i++) 346 *dp++ = ((u_long *)cleaninfo)[(i << lfsp->lfs_bshift) / 347 sizeof(u_long)]; /* Cleaner info */ 348 for (i = 0; i < lfsp->lfs_segtabsz; i++) 349 *dp++ = ((u_long *)segtable)[(i << lfsp->lfs_bshift) / 350 sizeof(u_long)]; /* Segusage table */ 351 *dp++ = ((u_long *)ifile)[0]; /* Ifile */ 352 353 /* Still need the root and l+f bytes; get them later */ 354 355 /* Write out the inode block */ 356 off = LFS_LABELPAD + LFS_SBPAD + LFS_SUMMARY_SIZE; 357 put(fd, off, dpagep, lfsp->lfs_bsize); 358 free(dpagep); 359 off += lfsp->lfs_bsize; 360 361 /* Write out the ifile */ 362 363 put(fd, off, cleaninfo, lfsp->lfs_cleansz << lfsp->lfs_bshift); 364 off += (lfsp->lfs_cleansz << lfsp->lfs_bshift); 365 (void)free(cleaninfo); 366 367 put(fd, off, segtable, lfsp->lfs_segtabsz << lfsp->lfs_bshift); 368 off += (lfsp->lfs_segtabsz << lfsp->lfs_bshift); 369 (void)free(segtable); 370 371 put(fd, off, ifile, lfsp->lfs_bsize); 372 off += lfsp->lfs_bsize; 373 374 /* 375 * use ipagep for space for writing out other stuff. It used to 376 * contain the ifile, but we're done with it. 377 */ 378 379 /* Write out the root and lost and found directories */ 380 bzero(ipagep, lfsp->lfs_bsize); 381 make_dir(ipagep, lfs_root_dir, 382 sizeof(lfs_root_dir) / sizeof(struct direct)); 383 *dp++ = ((u_long *)ipagep)[0]; 384 put(fd, off, ipagep, lfsp->lfs_bsize); 385 off += lfsp->lfs_bsize; 386 387 bzero(ipagep, lfsp->lfs_bsize); 388 make_dir(ipagep, lfs_lf_dir, 389 sizeof(lfs_lf_dir) / sizeof(struct direct)); 390 *dp++ = ((u_long *)ipagep)[0]; 391 put(fd, off, ipagep, lfsp->lfs_bsize); 392 393 /* Write Supberblock */ 394 lfsp->lfs_offset = (off + lfsp->lfs_bsize) / lp->d_secsize; 395 put(fd, LFS_LABELPAD, lfsp, sizeof(struct lfs)); 396 397 /* 398 * Finally, calculate all the fields for the summary structure 399 * and write it. 400 */ 401 402 summary.ss_next = lfsp->lfs_nextseg; 403 summary.ss_create = lfsp->lfs_tstamp; 404 summary.ss_nfinfo = 3; 405 summary.ss_ninos = 3; 406 summary.ss_datasum = cksum(datasump, sizeof(u_long) * blocks_used); 407 408 /* 409 * Make sure that we don't overflow a summary block. We have to 410 * record: FINFO structures for ifile, root, and l+f. The number 411 * of blocks recorded for the ifile is determined by the size of 412 * the cleaner info and the segments usage table. There is room 413 * for one block included in sizeof(FINFO) so we don't need to add 414 * any extra space for the ROOT and L+F, and one block of the ifile 415 * is already counted. Finally, we leave room for 1 inode block 416 * address. 417 */ 418 sum_size = 3*sizeof(FINFO) + sizeof(SEGSUM) + sizeof(daddr_t); 419 (lfsp->lfs_cleansz + lfsp->lfs_segtabsz) * sizeof(u_long); 420 #define SUMERR \ 421 "Multiple summary blocks in segment 1 not yet implemented\nsummary is %d bytes." 422 if (sum_size > LFS_SUMMARY_SIZE) 423 fatal(SUMERR, sum_size); 424 425 block_array_size = lfsp->lfs_cleansz + lfsp->lfs_segtabsz + 1; 426 427 if (!(block_array = malloc(block_array_size *sizeof(int)))) 428 fatal("%s: %s", special, strerror(errno)); 429 430 /* fill in the array */ 431 for (i = 0; i < block_array_size; i++) 432 block_array[i] = i; 433 434 /* copy into segment */ 435 sump = ipagep; 436 bcopy(&summary, sump, sizeof(SEGSUM)); 437 sump += sizeof(SEGSUM); 438 439 /* Now, add the ifile */ 440 file_info.fi_nblocks = block_array_size; 441 file_info.fi_version = 1; 442 file_info.fi_ino = LFS_IFILE_INUM; 443 444 bcopy(&file_info, sump, sizeof(FINFO) - sizeof(u_long)); 445 sump += sizeof(FINFO) - sizeof(u_long); 446 bcopy(block_array, sump, sizeof(u_long) * file_info.fi_nblocks); 447 sump += sizeof(u_long) * file_info.fi_nblocks; 448 449 /* Now, add the root directory */ 450 file_info.fi_nblocks = 1; 451 file_info.fi_version = 1; 452 file_info.fi_ino = ROOTINO; 453 file_info.fi_blocks[0] = 0; 454 bcopy(&file_info, sump, sizeof(FINFO)); 455 sump += sizeof(FINFO); 456 457 /* Now, add the lost and found */ 458 file_info.fi_ino = LOSTFOUNDINO; 459 bcopy(&file_info, sump, sizeof(FINFO)); 460 461 ((daddr_t *)ipagep)[LFS_SUMMARY_SIZE / sizeof(daddr_t) - 1] = 462 lfsp->lfs_idaddr; 463 ((SEGSUM *)ipagep)->ss_sumsum = cksum(ipagep+sizeof(summary.ss_sumsum), 464 LFS_SUMMARY_SIZE - sizeof(summary.ss_sumsum)); 465 put(fd, LFS_LABELPAD + LFS_SBPAD, ipagep, LFS_SUMMARY_SIZE); 466 467 sp = (SEGSUM *)ipagep; 468 sp->ss_create = 0; 469 sp->ss_nfinfo = 0; 470 sp->ss_ninos = 0; 471 sp->ss_datasum = 0; 472 473 /* Now, write rest of segments containing superblocks */ 474 lfsp->lfs_tstamp = 0; 475 lfsp->lfs_cksum = 476 cksum(lfsp, sizeof(struct lfs) - sizeof(lfsp->lfs_cksum)); 477 for (seg_addr = last_addr = lfsp->lfs_sboffs[0], j = 1, i = 1; 478 i < lfsp->lfs_nseg; i++) { 479 480 seg_addr += lfsp->lfs_ssize << lfsp->lfs_fsbtodb; 481 sp->ss_next = last_addr; 482 last_addr = seg_addr; 483 seg_seek = seg_addr * lp->d_secsize; 484 485 if (seg_addr == lfsp->lfs_sboffs[j]) { 486 if (j < (LFS_MAXNUMSB - 2)) 487 j++; 488 put(fd, seg_seek, lfsp, sizeof(struct lfs)); 489 seg_seek += LFS_SBPAD; 490 } 491 492 /* Summary */ 493 sp->ss_sumsum = cksum(&sp->ss_datasum, 494 LFS_SUMMARY_SIZE - sizeof(sp->ss_sumsum)); 495 put(fd, seg_seek, sp, LFS_SUMMARY_SIZE); 496 } 497 free(ipagep); 498 close(fd); 499 return (0); 500 } 501 502 static void 503 put(fd, off, p, len) 504 int fd; 505 off_t off; 506 void *p; 507 size_t len; 508 { 509 int wbytes; 510 511 if (lseek(fd, off, SEEK_SET) < 0) 512 fatal("%s: %s", special, strerror(errno)); 513 if ((wbytes = write(fd, p, len)) < 0) 514 fatal("%s: %s", special, strerror(errno)); 515 if (wbytes != len) 516 fatal("%s: short write (%d, not %d)", special, wbytes, len); 517 } 518 519 /* 520 * Create the root directory for this file system and the lost+found 521 * directory. 522 */ 523 524 u_long d_ino; /* inode number of entry */ 525 u_short d_reclen; /* length of this record */ 526 u_short d_namlen; /* length of string in d_name */ 527 char d_name[MAXNAMLEN + 1]; /* name with length <= MAXNAMLEN */ 528 lfsinit() 529 { 530 } 531 532 static daddr_t 533 make_dinode(ino, dip, nblocks, saddr, lfsp) 534 ino_t ino; /* inode we're creating */ 535 struct dinode *dip; /* disk inode */ 536 int nblocks; /* number of blocks in file */ 537 daddr_t saddr; /* starting block address */ 538 struct lfs *lfsp; /* superblock */ 539 { 540 int db_per_fb, i; 541 542 dip->di_nlink = 1; 543 dip->di_blocks = nblocks; 544 545 /* If we ever need something longer than 32 bits, this changes */ 546 dip->di_size = (dip->di_blocks << lfsp->lfs_bshift); 547 dip->di_atime = dip->di_mtime = dip->di_ctime = lfsp->lfs_tstamp; 548 dip->di_inum = ino; 549 550 #define SEGERR \ 551 "File requires more than the number of direct blocks; increase block or segment size." 552 if (NDADDR < nblocks) 553 fatal("%s", SEGERR); 554 555 /* Assign the block addresses for the ifile */ 556 db_per_fb = 1 << lfsp->lfs_fsbtodb; 557 for (i = 0; i < dip->di_blocks; i++, saddr += db_per_fb) 558 dip->di_db[i] = saddr; 559 560 return (saddr); 561 } 562 563 564 /* 565 * Construct a set of directory entries in "bufp". We assume that all the 566 * entries in protodir fir in the first DIRBLKSIZ. 567 */ 568 static void 569 make_dir(bufp, protodir, entries) 570 void *bufp; 571 register struct direct *protodir; 572 int entries; 573 { 574 char *cp; 575 int i, spcleft; 576 577 spcleft = DIRBLKSIZ; 578 for (cp = bufp, i = 0; i < entries - 1; i++) { 579 protodir[i].d_reclen = DIRSIZ(&protodir[i]); 580 bcopy(&protodir[i], cp, protodir[i].d_reclen); 581 cp += protodir[i].d_reclen; 582 if ((spcleft -= protodir[i].d_reclen) < 0) 583 fatal("%s: %s", special, "directory too big"); 584 } 585 protodir[i].d_reclen = spcleft; 586 bcopy(&protodir[i], cp, DIRSIZ(&protodir[i])); 587 } 588