1 /* $NetBSD: ufs.c,v 1.20 1998/03/01 07:15:39 ross Exp $ */ 2 3 /*- 4 * Copyright (c) 2002 Networks Associates Technology, Inc. 5 * All rights reserved. 6 * 7 * This software was developed for the FreeBSD Project by Marshall 8 * Kirk McKusick and Network Associates Laboratories, the Security 9 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 10 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 11 * research program 12 * 13 * Copyright (c) 1982, 1989, 1993 14 * The Regents of the University of California. All rights reserved. 15 * 16 * This code is derived from software contributed to Berkeley by 17 * The Mach Operating System project at Carnegie-Mellon University. 18 * 19 * Redistribution and use in source and binary forms, with or without 20 * modification, are permitted provided that the following conditions 21 * are met: 22 * 1. Redistributions of source code must retain the above copyright 23 * notice, this list of conditions and the following disclaimer. 24 * 2. Redistributions in binary form must reproduce the above copyright 25 * notice, this list of conditions and the following disclaimer in the 26 * documentation and/or other materials provided with the distribution. 27 * 3. Neither the name of the University nor the names of its contributors 28 * may be used to endorse or promote products derived from this software 29 * without specific prior written permission. 30 * 31 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 32 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 33 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 34 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 35 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 36 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 37 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 38 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 39 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 40 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 41 * SUCH DAMAGE. 42 * 43 * 44 * Copyright (c) 1990, 1991 Carnegie Mellon University 45 * All Rights Reserved. 46 * 47 * Author: David Golub 48 * 49 * Permission to use, copy, modify and distribute this software and its 50 * documentation is hereby granted, provided that both the copyright 51 * notice and this permission notice appear in all copies of the 52 * software, derivative works or modified versions, and any portions 53 * thereof, and that both notices appear in supporting documentation. 54 * 55 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 56 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR 57 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 58 * 59 * Carnegie Mellon requests users of this software to return to 60 * 61 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 62 * School of Computer Science 63 * Carnegie Mellon University 64 * Pittsburgh PA 15213-3890 65 * 66 * any improvements or extensions that they make and grant Carnegie the 67 * rights to redistribute these changes. 68 */ 69 70 #include <sys/cdefs.h> 71 /* 72 * Stand-alone file reading package. 73 */ 74 75 #include <sys/param.h> 76 #include <sys/disklabel.h> 77 #include <sys/time.h> 78 #include <ufs/ufs/dinode.h> 79 #include <ufs/ufs/dir.h> 80 #include <ufs/ffs/fs.h> 81 #include "stand.h" 82 #include "string.h" 83 84 static int ufs_open(const char *path, struct open_file *f); 85 static int ufs_write(struct open_file *f, const void *buf, size_t size, 86 size_t *resid); 87 static int ufs_close(struct open_file *f); 88 static int ufs_read(struct open_file *f, void *buf, size_t size, size_t *resid); 89 static off_t ufs_seek(struct open_file *f, off_t offset, int where); 90 static int ufs_stat(struct open_file *f, struct stat *sb); 91 static int ufs_readdir(struct open_file *f, struct dirent *d); 92 static int ufs_mount(const char *dev, const char *path, void **data); 93 static int ufs_unmount(const char *dev, void *data); 94 95 struct fs_ops ufs_fsops = { 96 .fs_name = "ufs", 97 .fo_open = ufs_open, 98 .fo_close = ufs_close, 99 .fo_read = ufs_read, 100 .fo_write = ufs_write, 101 .fo_seek = ufs_seek, 102 .fo_stat = ufs_stat, 103 .fo_readdir = ufs_readdir, 104 .fo_mount = ufs_mount, 105 .fo_unmount = ufs_unmount 106 }; 107 108 /* 109 * In-core open file. 110 */ 111 struct file { 112 off_t f_seekp; /* seek pointer */ 113 struct fs *f_fs; /* pointer to super-block */ 114 union dinode { 115 struct ufs1_dinode di1; 116 struct ufs2_dinode di2; 117 } f_di; /* copy of on-disk inode */ 118 int f_nindir[UFS_NIADDR]; 119 /* number of blocks mapped by 120 indirect block at level i */ 121 char *f_blk[UFS_NIADDR]; /* buffer for indirect block at 122 level i */ 123 size_t f_blksize[UFS_NIADDR]; 124 /* size of buffer */ 125 ufs2_daddr_t f_blkno[UFS_NIADDR];/* disk address of block in buffer */ 126 ufs2_daddr_t f_buf_blkno; /* block number of data block */ 127 char *f_buf; /* buffer for data block */ 128 size_t f_buf_size; /* size of data block */ 129 int f_inumber; /* inumber */ 130 }; 131 #define DIP(fp, field) \ 132 ((fp)->f_fs->fs_magic == FS_UFS1_MAGIC ? \ 133 (fp)->f_di.di1.field : (fp)->f_di.di2.field) 134 135 typedef struct ufs_mnt { 136 char *um_dev; 137 int um_fd; 138 STAILQ_ENTRY(ufs_mnt) um_link; 139 } ufs_mnt_t; 140 141 typedef STAILQ_HEAD(ufs_mnt_list, ufs_mnt) ufs_mnt_list_t; 142 static ufs_mnt_list_t mnt_list = STAILQ_HEAD_INITIALIZER(mnt_list); 143 144 static int read_inode(ino_t, struct open_file *); 145 static int block_map(struct open_file *, ufs2_daddr_t, ufs2_daddr_t *); 146 static int buf_read_file(struct open_file *, char **, size_t *); 147 static int buf_write_file(struct open_file *, const char *, size_t *); 148 static int search_directory(char *, struct open_file *, ino_t *); 149 static int ufs_use_sa_read(void *, off_t, void **, int); 150 151 /* from ffs_subr.c */ 152 int ffs_sbget(void *devfd, struct fs **fsp, off_t sblock, int flags, 153 char *filltype, 154 int (*readfunc)(void *devfd, off_t loc, void **bufp, int size)); 155 int ffs_sbsearch(void *, struct fs **, int, char *, 156 int (*)(void *, off_t, void **, int)); 157 158 /* 159 * Read a new inode into a file structure. 160 */ 161 static int 162 read_inode(ino_t inumber, struct open_file *f) 163 { 164 struct file *fp = (struct file *)f->f_fsdata; 165 struct fs *fs = fp->f_fs; 166 char *buf; 167 size_t rsize; 168 int rc; 169 170 if (fs == NULL) 171 panic("fs == NULL"); 172 173 /* 174 * Read inode and save it. 175 */ 176 buf = malloc(fs->fs_bsize); 177 twiddle(1); 178 rc = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, 179 fsbtodb(fs, ino_to_fsba(fs, inumber)), fs->fs_bsize, 180 buf, &rsize); 181 if (rc) 182 goto out; 183 if (rsize != fs->fs_bsize) { 184 rc = EIO; 185 goto out; 186 } 187 188 if (fp->f_fs->fs_magic == FS_UFS1_MAGIC) 189 fp->f_di.di1 = ((struct ufs1_dinode *)buf) 190 [ino_to_fsbo(fs, inumber)]; 191 else 192 fp->f_di.di2 = ((struct ufs2_dinode *)buf) 193 [ino_to_fsbo(fs, inumber)]; 194 195 /* 196 * Clear out the old buffers 197 */ 198 { 199 int level; 200 201 for (level = 0; level < UFS_NIADDR; level++) 202 fp->f_blkno[level] = -1; 203 fp->f_buf_blkno = -1; 204 } 205 fp->f_seekp = 0; 206 fp->f_inumber = inumber; 207 out: 208 free(buf); 209 return (rc); 210 } 211 212 /* 213 * Given an offset in a file, find the disk block number that 214 * contains that block. 215 */ 216 static int 217 block_map(struct open_file *f, ufs2_daddr_t file_block, 218 ufs2_daddr_t *disk_block_p) 219 { 220 struct file *fp = (struct file *)f->f_fsdata; 221 struct fs *fs = fp->f_fs; 222 int level; 223 int idx; 224 ufs2_daddr_t ind_block_num; 225 int rc; 226 227 /* 228 * Index structure of an inode: 229 * 230 * di_db[0..UFS_NDADDR-1] hold block numbers for blocks 231 * 0..UFS_NDADDR-1 232 * 233 * di_ib[0] index block 0 is the single indirect block 234 * holds block numbers for blocks 235 * UFS_NDADDR .. UFS_NDADDR + NINDIR(fs)-1 236 * 237 * di_ib[1] index block 1 is the double indirect block 238 * holds block numbers for INDEX blocks for blocks 239 * UFS_NDADDR + NINDIR(fs) .. 240 * UFS_NDADDR + NINDIR(fs) + NINDIR(fs)**2 - 1 241 * 242 * di_ib[2] index block 2 is the triple indirect block 243 * holds block numbers for double-indirect 244 * blocks for blocks 245 * UFS_NDADDR + NINDIR(fs) + NINDIR(fs)**2 .. 246 * UFS_NDADDR + NINDIR(fs) + NINDIR(fs)**2 247 * + NINDIR(fs)**3 - 1 248 */ 249 250 if (file_block < UFS_NDADDR) { 251 /* Direct block. */ 252 *disk_block_p = DIP(fp, di_db[file_block]); 253 return (0); 254 } 255 256 file_block -= UFS_NDADDR; 257 258 /* 259 * nindir[0] = NINDIR 260 * nindir[1] = NINDIR**2 261 * nindir[2] = NINDIR**3 262 * etc 263 */ 264 for (level = 0; level < UFS_NIADDR; level++) { 265 if (file_block < fp->f_nindir[level]) 266 break; 267 file_block -= fp->f_nindir[level]; 268 } 269 if (level == UFS_NIADDR) { 270 /* Block number too high */ 271 return (EFBIG); 272 } 273 274 ind_block_num = DIP(fp, di_ib[level]); 275 276 for (; level >= 0; level--) { 277 if (ind_block_num == 0) { 278 *disk_block_p = 0; /* missing */ 279 return (0); 280 } 281 282 if (fp->f_blkno[level] != ind_block_num) { 283 if (fp->f_blk[level] == (char *)0) 284 fp->f_blk[level] = 285 malloc(fs->fs_bsize); 286 twiddle(1); 287 rc = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, 288 fsbtodb(fp->f_fs, ind_block_num), 289 fs->fs_bsize, 290 fp->f_blk[level], 291 &fp->f_blksize[level]); 292 if (rc) 293 return (rc); 294 if (fp->f_blksize[level] != fs->fs_bsize) 295 return (EIO); 296 fp->f_blkno[level] = ind_block_num; 297 } 298 299 if (level > 0) { 300 idx = file_block / fp->f_nindir[level - 1]; 301 file_block %= fp->f_nindir[level - 1]; 302 } else 303 idx = file_block; 304 305 if (fp->f_fs->fs_magic == FS_UFS1_MAGIC) 306 ind_block_num = ((ufs1_daddr_t *)fp->f_blk[level])[idx]; 307 else 308 ind_block_num = ((ufs2_daddr_t *)fp->f_blk[level])[idx]; 309 } 310 311 *disk_block_p = ind_block_num; 312 313 return (0); 314 } 315 316 /* 317 * Write a portion of a file from an internal buffer. 318 */ 319 static int 320 buf_write_file(struct open_file *f, const char *buf_p, size_t *size_p) 321 { 322 struct file *fp = (struct file *)f->f_fsdata; 323 struct fs *fs = fp->f_fs; 324 long off; 325 ufs_lbn_t file_block; 326 ufs2_daddr_t disk_block; 327 size_t block_size; 328 int rc; 329 330 /* 331 * Calculate the starting block address and offset. 332 */ 333 off = blkoff(fs, fp->f_seekp); 334 file_block = lblkno(fs, fp->f_seekp); 335 block_size = sblksize(fs, DIP(fp, di_size), file_block); 336 337 rc = block_map(f, file_block, &disk_block); 338 if (rc) 339 return (rc); 340 341 if (disk_block == 0) 342 /* Because we can't allocate space on the drive */ 343 return (EFBIG); 344 345 /* 346 * Truncate buffer at end of file, and at the end of 347 * this block. 348 */ 349 if (*size_p > DIP(fp, di_size) - fp->f_seekp) 350 *size_p = DIP(fp, di_size) - fp->f_seekp; 351 if (*size_p > block_size - off) 352 *size_p = block_size - off; 353 354 /* 355 * If we don't entirely occlude the block and it's not 356 * in memory already, read it in first. 357 */ 358 if (((off > 0) || (*size_p + off < block_size)) && 359 (file_block != fp->f_buf_blkno)) { 360 361 if (fp->f_buf == (char *)0) 362 fp->f_buf = malloc(fs->fs_bsize); 363 364 twiddle(4); 365 rc = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, 366 fsbtodb(fs, disk_block), 367 block_size, fp->f_buf, &fp->f_buf_size); 368 if (rc) 369 return (rc); 370 371 fp->f_buf_blkno = file_block; 372 } 373 374 /* 375 * Copy the user data into the cached block. 376 */ 377 bcopy(buf_p, fp->f_buf + off, *size_p); 378 379 /* 380 * Write the block out to storage. 381 */ 382 383 twiddle(4); 384 rc = (f->f_dev->dv_strategy)(f->f_devdata, F_WRITE, 385 fsbtodb(fs, disk_block), 386 block_size, fp->f_buf, &fp->f_buf_size); 387 return (rc); 388 } 389 390 /* 391 * Read a portion of a file into an internal buffer. Return 392 * the location in the buffer and the amount in the buffer. 393 */ 394 static int 395 buf_read_file(struct open_file *f, char **buf_p, size_t *size_p) 396 { 397 struct file *fp = (struct file *)f->f_fsdata; 398 struct fs *fs = fp->f_fs; 399 long off; 400 ufs_lbn_t file_block; 401 ufs2_daddr_t disk_block; 402 size_t block_size; 403 int rc; 404 405 off = blkoff(fs, fp->f_seekp); 406 file_block = lblkno(fs, fp->f_seekp); 407 block_size = sblksize(fs, DIP(fp, di_size), file_block); 408 409 if (file_block != fp->f_buf_blkno) { 410 if (fp->f_buf == NULL) 411 fp->f_buf = malloc(fs->fs_bsize); 412 413 rc = block_map(f, file_block, &disk_block); 414 if (rc) 415 return (rc); 416 417 if (disk_block == 0) { 418 bzero(fp->f_buf, block_size); 419 fp->f_buf_size = block_size; 420 } else { 421 twiddle(4); 422 rc = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, 423 fsbtodb(fs, disk_block), 424 block_size, fp->f_buf, &fp->f_buf_size); 425 if (rc) 426 return (rc); 427 } 428 429 fp->f_buf_blkno = file_block; 430 } 431 432 /* 433 * Return address of byte in buffer corresponding to 434 * offset, and size of remainder of buffer after that 435 * byte. 436 */ 437 *buf_p = fp->f_buf + off; 438 *size_p = block_size - off; 439 440 /* 441 * But truncate buffer at end of file. 442 */ 443 if (*size_p > DIP(fp, di_size) - fp->f_seekp) 444 *size_p = DIP(fp, di_size) - fp->f_seekp; 445 446 return (0); 447 } 448 449 /* 450 * Search a directory for a name and return its 451 * i_number. 452 */ 453 static int 454 search_directory(char *name, struct open_file *f, ino_t *inumber_p) 455 { 456 struct file *fp = (struct file *)f->f_fsdata; 457 struct direct *dp; 458 struct direct *edp; 459 char *buf; 460 size_t buf_size; 461 int namlen, length; 462 int rc; 463 464 length = strlen(name); 465 466 fp->f_seekp = 0; 467 while (fp->f_seekp < DIP(fp, di_size)) { 468 rc = buf_read_file(f, &buf, &buf_size); 469 if (rc) 470 return (rc); 471 472 dp = (struct direct *)buf; 473 edp = (struct direct *)(buf + buf_size); 474 while (dp < edp) { 475 if (dp->d_ino == (ino_t)0) 476 goto next; 477 #if BYTE_ORDER == LITTLE_ENDIAN 478 if (fp->f_fs->fs_maxsymlinklen <= 0) 479 namlen = dp->d_type; 480 else 481 #endif 482 namlen = dp->d_namlen; 483 if (namlen == length && 484 !strcmp(name, dp->d_name)) { 485 /* found entry */ 486 *inumber_p = dp->d_ino; 487 return (0); 488 } 489 next: 490 dp = (struct direct *)((char *)dp + dp->d_reclen); 491 } 492 fp->f_seekp += buf_size; 493 } 494 return (ENOENT); 495 } 496 497 /* 498 * Open a file. 499 */ 500 static int 501 ufs_open(const char *upath, struct open_file *f) 502 { 503 char *cp, *ncp; 504 int c; 505 ino_t inumber, parent_inumber; 506 struct file *fp; 507 struct fs *fs; 508 int rc; 509 int nlinks = 0; 510 char namebuf[MAXPATHLEN+1]; 511 char *buf = NULL; 512 char *path = NULL; 513 const char *dev; 514 ufs_mnt_t *mnt; 515 516 /* allocate file system specific data structure */ 517 errno = 0; 518 fp = calloc(1, sizeof(struct file)); 519 if (fp == NULL) 520 return (errno); 521 f->f_fsdata = (void *)fp; 522 523 dev = devformat((struct devdesc *)f->f_devdata); 524 /* Is this device mounted? */ 525 STAILQ_FOREACH(mnt, &mnt_list, um_link) { 526 if (strcmp(dev, mnt->um_dev) == 0) 527 break; 528 } 529 530 if (mnt == NULL) { 531 /* read super block */ 532 twiddle(1); 533 if ((rc = ffs_sbget(f, &fs, UFS_STDSB, UFS_NOHASHFAIL, "stand", 534 ufs_use_sa_read)) != 0) { 535 goto out; 536 } 537 } else { 538 struct open_file *sbf; 539 struct file *sfp; 540 541 /* get superblock from mounted file system */ 542 sbf = fd2open_file(mnt->um_fd); 543 sfp = sbf->f_fsdata; 544 fs = sfp->f_fs; 545 } 546 fp->f_fs = fs; 547 548 /* 549 * Calculate indirect block levels. 550 */ 551 { 552 ufs2_daddr_t mult; 553 int level; 554 555 mult = 1; 556 for (level = 0; level < UFS_NIADDR; level++) { 557 mult *= NINDIR(fs); 558 fp->f_nindir[level] = mult; 559 } 560 } 561 562 inumber = UFS_ROOTINO; 563 if ((rc = read_inode(inumber, f)) != 0) 564 goto out; 565 566 cp = path = strdup(upath); 567 if (path == NULL) { 568 rc = ENOMEM; 569 goto out; 570 } 571 while (*cp) { 572 573 /* 574 * Remove extra separators 575 */ 576 while (*cp == '/') 577 cp++; 578 if (*cp == '\0') 579 break; 580 581 /* 582 * Check that current node is a directory. 583 */ 584 if ((DIP(fp, di_mode) & IFMT) != IFDIR) { 585 rc = ENOTDIR; 586 goto out; 587 } 588 589 /* 590 * Get next component of path name. 591 */ 592 { 593 int len = 0; 594 595 ncp = cp; 596 while ((c = *cp) != '\0' && c != '/') { 597 if (++len > UFS_MAXNAMLEN) { 598 rc = ENOENT; 599 goto out; 600 } 601 cp++; 602 } 603 *cp = '\0'; 604 } 605 606 /* 607 * Look up component in current directory. 608 * Save directory inumber in case we find a 609 * symbolic link. 610 */ 611 parent_inumber = inumber; 612 rc = search_directory(ncp, f, &inumber); 613 *cp = c; 614 if (rc) 615 goto out; 616 617 /* 618 * Open next component. 619 */ 620 if ((rc = read_inode(inumber, f)) != 0) 621 goto out; 622 623 /* 624 * Check for symbolic link. 625 */ 626 if ((DIP(fp, di_mode) & IFMT) == IFLNK) { 627 int link_len = DIP(fp, di_size); 628 int len; 629 630 len = strlen(cp); 631 632 if (link_len + len > MAXPATHLEN || 633 ++nlinks > MAXSYMLINKS) { 634 rc = ENOENT; 635 goto out; 636 } 637 638 bcopy(cp, &namebuf[link_len], len + 1); 639 640 if (link_len < fs->fs_maxsymlinklen) { 641 bcopy(DIP(fp, di_shortlink), namebuf, 642 (unsigned) link_len); 643 } else { 644 /* 645 * Read file for symbolic link 646 */ 647 size_t buf_size; 648 ufs2_daddr_t disk_block; 649 struct fs *fs = fp->f_fs; 650 651 if (!buf) 652 buf = malloc(fs->fs_bsize); 653 rc = block_map(f, (ufs2_daddr_t)0, &disk_block); 654 if (rc) 655 goto out; 656 657 twiddle(1); 658 rc = (f->f_dev->dv_strategy)(f->f_devdata, 659 F_READ, fsbtodb(fs, disk_block), 660 fs->fs_bsize, buf, &buf_size); 661 if (rc) 662 goto out; 663 664 bcopy((char *)buf, namebuf, (unsigned)link_len); 665 } 666 667 /* 668 * If relative pathname, restart at parent directory. 669 * If absolute pathname, restart at root. 670 */ 671 cp = namebuf; 672 if (*cp != '/') 673 inumber = parent_inumber; 674 else 675 inumber = (ino_t)UFS_ROOTINO; 676 677 if ((rc = read_inode(inumber, f)) != 0) 678 goto out; 679 } 680 } 681 682 /* 683 * Found terminal component. 684 */ 685 rc = 0; 686 fp->f_seekp = 0; 687 out: 688 free(buf); 689 free(path); 690 if (rc) { 691 free(fp->f_buf); 692 693 if (mnt == NULL && fp->f_fs != NULL) { 694 free(fp->f_fs->fs_csp); 695 free(fp->f_fs->fs_si); 696 free(fp->f_fs); 697 } 698 free(fp); 699 } 700 return (rc); 701 } 702 703 /* 704 * A read function for use by standalone-layer routines. 705 */ 706 static int 707 ufs_use_sa_read(void *devfd, off_t loc, void **bufp, int size) 708 { 709 struct open_file *f; 710 size_t buf_size; 711 int error; 712 713 f = (struct open_file *)devfd; 714 if ((*bufp = malloc(size)) == NULL) 715 return (ENOSPC); 716 error = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, loc / DEV_BSIZE, 717 size, *bufp, &buf_size); 718 if (error != 0) 719 return (error); 720 if (buf_size != size) 721 return (EIO); 722 return (0); 723 } 724 725 static int 726 ufs_close(struct open_file *f) 727 { 728 ufs_mnt_t *mnt; 729 struct file *fp = (struct file *)f->f_fsdata; 730 int level; 731 char *dev; 732 733 f->f_fsdata = NULL; 734 if (fp == NULL) 735 return (0); 736 737 for (level = 0; level < UFS_NIADDR; level++) { 738 free(fp->f_blk[level]); 739 } 740 free(fp->f_buf); 741 742 dev = devformat((struct devdesc *)f->f_devdata); 743 STAILQ_FOREACH(mnt, &mnt_list, um_link) { 744 if (strcmp(dev, mnt->um_dev) == 0) 745 break; 746 } 747 748 if (mnt == NULL && fp->f_fs != NULL) { 749 free(fp->f_fs->fs_csp); 750 free(fp->f_fs->fs_si); 751 free(fp->f_fs); 752 } 753 754 free(fp); 755 return (0); 756 } 757 758 /* 759 * Copy a portion of a file into kernel memory. 760 * Cross block boundaries when necessary. 761 */ 762 static int 763 ufs_read(struct open_file *f, void *start, size_t size, size_t *resid) 764 { 765 struct file *fp = (struct file *)f->f_fsdata; 766 size_t csize; 767 char *buf; 768 size_t buf_size; 769 int rc = 0; 770 char *addr = start; 771 772 while (size != 0) { 773 if (fp->f_seekp >= DIP(fp, di_size)) 774 break; 775 776 rc = buf_read_file(f, &buf, &buf_size); 777 if (rc) 778 break; 779 780 csize = size; 781 if (csize > buf_size) 782 csize = buf_size; 783 784 bcopy(buf, addr, csize); 785 786 fp->f_seekp += csize; 787 addr += csize; 788 size -= csize; 789 } 790 if (resid) 791 *resid = size; 792 return (rc); 793 } 794 795 /* 796 * Write to a portion of an already allocated file. 797 * Cross block boundaries when necessary. Can not 798 * extend the file. 799 */ 800 static int 801 ufs_write(struct open_file *f, const void *start, size_t size, size_t *resid) 802 { 803 struct file *fp = (struct file *)f->f_fsdata; 804 size_t csize; 805 int rc = 0; 806 const char *addr = start; 807 808 csize = size; 809 while ((size != 0) && (csize != 0)) { 810 if (fp->f_seekp >= DIP(fp, di_size)) 811 break; 812 813 if (csize >= 512) csize = 512; /* XXX */ 814 815 rc = buf_write_file(f, addr, &csize); 816 if (rc) 817 break; 818 819 fp->f_seekp += csize; 820 addr += csize; 821 size -= csize; 822 } 823 if (resid) 824 *resid = size; 825 return (rc); 826 } 827 828 static off_t 829 ufs_seek(struct open_file *f, off_t offset, int where) 830 { 831 struct file *fp = (struct file *)f->f_fsdata; 832 833 switch (where) { 834 case SEEK_SET: 835 fp->f_seekp = offset; 836 break; 837 case SEEK_CUR: 838 fp->f_seekp += offset; 839 break; 840 case SEEK_END: 841 fp->f_seekp = DIP(fp, di_size) - offset; 842 break; 843 default: 844 errno = EINVAL; 845 return (-1); 846 } 847 return (fp->f_seekp); 848 } 849 850 static int 851 ufs_stat(struct open_file *f, struct stat *sb) 852 { 853 struct file *fp = (struct file *)f->f_fsdata; 854 855 /* only important stuff */ 856 sb->st_mode = DIP(fp, di_mode); 857 sb->st_uid = DIP(fp, di_uid); 858 sb->st_gid = DIP(fp, di_gid); 859 sb->st_size = DIP(fp, di_size); 860 sb->st_mtime = DIP(fp, di_mtime); 861 /* 862 * The items below are ufs specific! 863 * Other fs types will need their own solution 864 * if these fields are needed. 865 */ 866 sb->st_ino = fp->f_inumber; 867 /* 868 * We need something to differentiate devs. 869 * fs_id is unique but 64bit, we xor the two 870 * halves to squeeze it into 32bits. 871 */ 872 sb->st_dev = (dev_t)(fp->f_fs->fs_id[0] ^ fp->f_fs->fs_id[1]); 873 874 return (0); 875 } 876 877 static int 878 ufs_readdir(struct open_file *f, struct dirent *d) 879 { 880 struct file *fp = (struct file *)f->f_fsdata; 881 struct direct *dp; 882 char *buf; 883 size_t buf_size; 884 int error; 885 886 /* 887 * assume that a directory entry will not be split across blocks 888 */ 889 890 do { 891 if (fp->f_seekp >= DIP(fp, di_size)) 892 return (ENOENT); 893 error = buf_read_file(f, &buf, &buf_size); 894 if (error) 895 return (error); 896 dp = (struct direct *)buf; 897 fp->f_seekp += dp->d_reclen; 898 } while (dp->d_ino == (ino_t)0); 899 900 d->d_type = dp->d_type; 901 strcpy(d->d_name, dp->d_name); 902 return (0); 903 } 904 905 static int 906 ufs_mount(const char *dev, const char *path, void **data) 907 { 908 char *fs; 909 ufs_mnt_t *mnt; 910 struct open_file *f; 911 912 errno = 0; 913 mnt = calloc(1, sizeof(*mnt)); 914 if (mnt == NULL) 915 return (errno); 916 mnt->um_fd = -1; 917 mnt->um_dev = strdup(dev); 918 if (mnt->um_dev == NULL) 919 goto done; 920 921 if (asprintf(&fs, "%s%s", dev, path) < 0) 922 goto done; 923 924 mnt->um_fd = open(fs, O_RDONLY); 925 free(fs); 926 if (mnt->um_fd == -1) 927 goto done; 928 929 /* Is it ufs file system? */ 930 f = fd2open_file(mnt->um_fd); 931 if (strcmp(f->f_ops->fs_name, "ufs") == 0) 932 STAILQ_INSERT_TAIL(&mnt_list, mnt, um_link); 933 else 934 errno = ENXIO; 935 936 done: 937 if (errno != 0) { 938 free(mnt->um_dev); 939 if (mnt->um_fd >= 0) 940 close(mnt->um_fd); 941 free(mnt); 942 } else { 943 *data = mnt; 944 } 945 946 return (errno); 947 } 948 949 static int 950 ufs_unmount(const char *dev __unused, void *data) 951 { 952 ufs_mnt_t *mnt = data; 953 954 STAILQ_REMOVE(&mnt_list, mnt, ufs_mnt, um_link); 955 free(mnt->um_dev); 956 close(mnt->um_fd); 957 free(mnt); 958 return (0); 959 } 960