1 /*- 2 * Copyright (c) 2001, 2002 Scott Long <scottl@freebsd.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 * 26 * $FreeBSD$ 27 */ 28 29 /* udf_vnops.c */ 30 /* Take care of the vnode side of things */ 31 32 #include <sys/param.h> 33 #include <sys/systm.h> 34 #include <sys/namei.h> 35 #include <sys/kernel.h> 36 #include <sys/malloc.h> 37 #include <sys/stat.h> 38 #include <sys/bio.h> 39 #include <sys/buf.h> 40 #include <sys/mount.h> 41 #include <sys/vnode.h> 42 #include <sys/dirent.h> 43 #include <sys/queue.h> 44 #include <sys/unistd.h> 45 46 #include <vm/uma.h> 47 48 #include <fs/udf/ecma167-udf.h> 49 #include <fs/udf/osta.h> 50 #include <fs/udf/udf.h> 51 52 static int udf_access(struct vop_access_args *); 53 static int udf_getattr(struct vop_getattr_args *); 54 static int udf_ioctl(struct vop_ioctl_args *); 55 static int udf_pathconf(struct vop_pathconf_args *); 56 static int udf_read(struct vop_read_args *); 57 static int udf_readdir(struct vop_readdir_args *); 58 static int udf_readlink(struct vop_readlink_args *ap); 59 static int udf_strategy(struct vop_strategy_args *); 60 static int udf_print(struct vop_print_args *); 61 static int udf_bmap(struct vop_bmap_args *); 62 static int udf_lookup(struct vop_cachedlookup_args *); 63 static int udf_reclaim(struct vop_reclaim_args *); 64 static void udf_dumpblock(void *, int) __unused; 65 static int udf_readatoffset(struct udf_node *, int *, int, struct buf **, uint8_t **); 66 static int udf_bmap_internal(struct udf_node *, uint32_t, daddr_t *, uint32_t *); 67 68 vop_t **udf_vnodeop_p; 69 static struct vnodeopv_entry_desc udf_vnodeop_entries[] = { 70 { &vop_default_desc, (vop_t *) vop_defaultop }, 71 { &vop_access_desc, (vop_t *) udf_access }, 72 { &vop_bmap_desc, (vop_t *) udf_bmap }, 73 { &vop_cachedlookup_desc, (vop_t *) udf_lookup }, 74 { &vop_getattr_desc, (vop_t *) udf_getattr }, 75 { &vop_ioctl_desc, (vop_t *) udf_ioctl }, 76 { &vop_islocked_desc, (vop_t *) vop_stdislocked }, 77 { &vop_lock_desc, (vop_t *) vop_stdlock }, 78 { &vop_lookup_desc, (vop_t *) vfs_cache_lookup }, 79 { &vop_pathconf_desc, (vop_t *) udf_pathconf }, 80 { &vop_print_desc, (vop_t *) udf_print }, 81 { &vop_read_desc, (vop_t *) udf_read }, 82 { &vop_readdir_desc, (vop_t *) udf_readdir }, 83 { &vop_readlink_desc, (vop_t *) udf_readlink }, 84 { &vop_reclaim_desc, (vop_t *) udf_reclaim }, 85 { &vop_strategy_desc, (vop_t *) udf_strategy }, 86 { &vop_unlock_desc, (vop_t *) vop_stdunlock }, 87 { NULL, NULL } 88 }; 89 static struct vnodeopv_desc udf_vnodeop_opv_desc = 90 { &udf_vnodeop_p, udf_vnodeop_entries }; 91 VNODEOP_SET(udf_vnodeop_opv_desc); 92 93 MALLOC_DEFINE(M_UDFFID, "UDF FID", "UDF FileId structure"); 94 MALLOC_DEFINE(M_UDFDS, "UDF DS", "UDF Dirstream structure"); 95 96 #define UDF_INVALID_BMAP -1 97 98 /* Look up a udf_node based on the ino_t passed in and return it's vnode */ 99 int 100 udf_hashlookup(struct udf_mnt *udfmp, ino_t id, int flags, struct vnode **vpp) 101 { 102 struct udf_node *node; 103 int error; 104 105 *vpp = NULL; 106 107 loop: 108 mtx_lock(&udfmp->hash_mtx); 109 TAILQ_FOREACH(node, &udfmp->udf_tqh, tq) { 110 if (node->hash_id == id) { 111 VI_LOCK(node->i_vnode); 112 mtx_unlock(&udfmp->hash_mtx); 113 error = vget(node->i_vnode, flags | LK_INTERLOCK, 114 curthread); 115 if (error == ENOENT) 116 goto loop; 117 if (error) 118 return (error); 119 *vpp = node->i_vnode; 120 return (0); 121 } 122 } 123 124 mtx_unlock(&udfmp->hash_mtx); 125 return (0); 126 } 127 128 int 129 udf_hashins(struct udf_node *node) 130 { 131 struct udf_mnt *udfmp; 132 133 udfmp = node->udfmp; 134 135 mtx_lock(&udfmp->hash_mtx); 136 TAILQ_INSERT_TAIL(&udfmp->udf_tqh, node, tq); 137 mtx_unlock(&udfmp->hash_mtx); 138 lockmgr(&node->i_vnode->v_lock, LK_EXCLUSIVE, (struct mtx *)0, 139 curthread); 140 141 return (0); 142 } 143 144 int 145 udf_hashrem(struct udf_node *node) 146 { 147 struct udf_mnt *udfmp; 148 149 udfmp = node->udfmp; 150 151 mtx_lock(&udfmp->hash_mtx); 152 TAILQ_REMOVE(&udfmp->udf_tqh, node, tq); 153 mtx_unlock(&udfmp->hash_mtx); 154 155 return (0); 156 } 157 158 int 159 udf_allocv(struct mount *mp, struct vnode **vpp, struct thread *td) 160 { 161 int error; 162 struct vnode *vp; 163 164 error = getnewvnode(VT_UDF, mp, udf_vnodeop_p, &vp); 165 if (error) { 166 printf("udf_allocv: failed to allocate new vnode\n"); 167 return (error); 168 } 169 170 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY, td); 171 *vpp = vp; 172 return (0); 173 } 174 175 /* Convert file entry permission (5 bits per owner/group/user) to a mode_t */ 176 static mode_t 177 udf_permtomode(struct udf_node *node) 178 { 179 uint32_t perm; 180 uint32_t flags; 181 mode_t mode; 182 183 perm = node->fentry->perm; 184 flags = node->fentry->icbtag.flags; 185 186 mode = perm & UDF_FENTRY_PERM_USER_MASK; 187 mode |= ((perm & UDF_FENTRY_PERM_GRP_MASK) >> 2); 188 mode |= ((perm & UDF_FENTRY_PERM_OWNER_MASK) >> 4); 189 mode |= ((flags & UDF_ICB_TAG_FLAGS_STICKY) << 4); 190 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETGID) << 6); 191 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETUID) << 8); 192 193 return (mode); 194 } 195 196 static int 197 udf_access(struct vop_access_args *a) 198 { 199 struct vnode *vp; 200 struct udf_node *node; 201 mode_t a_mode, mode; 202 203 vp = a->a_vp; 204 node = VTON(vp); 205 a_mode = a->a_mode; 206 207 if (a_mode & VWRITE) { 208 switch (vp->v_type) { 209 case VDIR: 210 case VLNK: 211 case VREG: 212 return (EROFS); 213 /* NOT REACHED */ 214 default: 215 break; 216 } 217 } 218 219 mode = udf_permtomode(node); 220 221 return (vaccess(vp->v_type, mode, node->fentry->uid, node->fentry->gid, 222 a_mode, a->a_cred, NULL)); 223 } 224 225 static int mon_lens[2][12] = { 226 {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}, 227 {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31} 228 }; 229 230 static int 231 udf_isaleapyear(int year) 232 { 233 int i; 234 235 i = (year % 4) ? 0 : 1; 236 i &= (year % 100) ? 1 : 0; 237 i |= (year % 400) ? 0 : 1; 238 239 return i; 240 } 241 242 /* 243 * XXX This is just a rough hack. Daylight savings isn't calculated and tv_nsec 244 * is ignored. 245 * Timezone calculation compliments of Julian Elischer <julian@elischer.org>. 246 */ 247 static void 248 udf_timetotimespec(struct timestamp *time, struct timespec *t) 249 { 250 int i, lpyear, daysinyear; 251 union { 252 uint16_t u_tz_offset; 253 int16_t s_tz_offset; 254 } tz; 255 256 t->tv_nsec = 0; 257 258 /* DirectCD seems to like using bogus year values */ 259 if (time->year < 1970) { 260 t->tv_sec = 0; 261 return; 262 } 263 264 /* Calculate the time and day */ 265 t->tv_sec = time->second; 266 t->tv_sec += time->minute * 60; 267 t->tv_sec += time->hour * 3600; 268 t->tv_sec += time->day * 3600 * 24; 269 270 /* Calclulate the month */ 271 lpyear = udf_isaleapyear(time->year); 272 for (i = 1; i < time->month; i++) 273 t->tv_sec += mon_lens[lpyear][i] * 3600 * 24; 274 275 /* Speed up the calculation */ 276 if (time->year > 1979) 277 t->tv_sec += 315532800; 278 if (time->year > 1989) 279 t->tv_sec += 315619200; 280 if (time->year > 1999) 281 t->tv_sec += 315532800; 282 for (i = 2000; i < time->year; i++) { 283 daysinyear = udf_isaleapyear(i) + 365 ; 284 t->tv_sec += daysinyear * 3600 * 24; 285 } 286 287 /* 288 * Calculate the time zone. The timezone is 12 bit signed 2's 289 * compliment, so we gotta do some extra magic to handle it right. 290 */ 291 tz.u_tz_offset = time->type_tz; 292 tz.u_tz_offset &= 0x0fff; 293 if (tz.u_tz_offset & 0x0800) 294 tz.u_tz_offset |= 0xf000; /* extend the sign to 16 bits */ 295 if ((time->type_tz & 0x1000) && (tz.s_tz_offset != -2047)) 296 t->tv_sec -= tz.s_tz_offset * 60; 297 298 return; 299 } 300 301 static int 302 udf_getattr(struct vop_getattr_args *a) 303 { 304 struct vnode *vp; 305 struct udf_node *node; 306 struct vattr *vap; 307 struct file_entry *fentry; 308 struct timespec ts; 309 310 ts.tv_sec = 0; 311 312 vp = a->a_vp; 313 vap = a->a_vap; 314 node = VTON(vp); 315 fentry = node->fentry; 316 317 vap->va_fsid = dev2udev(node->i_dev); 318 vap->va_fileid = node->hash_id; 319 vap->va_mode = udf_permtomode(node); 320 vap->va_nlink = fentry->link_cnt; 321 /* 322 * XXX The spec says that -1 is valid for uid/gid and indicates an 323 * invalid uid/gid. How should this be represented? 324 */ 325 vap->va_uid = (fentry->uid == -1) ? 0 : fentry->uid; 326 vap->va_gid = (fentry->gid == -1) ? 0 : fentry->gid; 327 udf_timetotimespec(&fentry->atime, &vap->va_atime); 328 udf_timetotimespec(&fentry->mtime, &vap->va_mtime); 329 vap->va_ctime = vap->va_mtime; /* XXX Stored as an Extended Attribute */ 330 vap->va_rdev = 0; /* XXX */ 331 if (vp->v_type & VDIR) { 332 /* 333 * Directories that are recorded within their ICB will show 334 * as having 0 blocks recorded. Since tradition dictates 335 * that directories consume at least one logical block, 336 * make it appear so. 337 */ 338 if (fentry->logblks_rec != 0) { 339 vap->va_size = fentry->logblks_rec * node->udfmp->bsize; 340 } else { 341 vap->va_size = node->udfmp->bsize; 342 } 343 } else { 344 vap->va_size = fentry->inf_len; 345 } 346 vap->va_flags = 0; 347 vap->va_gen = 1; 348 vap->va_blocksize = node->udfmp->bsize; 349 vap->va_bytes = fentry->inf_len; 350 vap->va_type = vp->v_type; 351 vap->va_filerev = 0; /* XXX */ 352 return (0); 353 } 354 355 /* 356 * File specific ioctls. DeCSS candidate? 357 */ 358 static int 359 udf_ioctl(struct vop_ioctl_args *a) 360 { 361 printf("%s called\n", __FUNCTION__); 362 return (EOPNOTSUPP); 363 } 364 365 /* 366 * I'm not sure that this has much value in a read-only filesystem, but 367 * cd9660 has it too. 368 */ 369 static int 370 udf_pathconf(struct vop_pathconf_args *a) 371 { 372 373 switch (a->a_name) { 374 case _PC_LINK_MAX: 375 *a->a_retval = 65535; 376 return (0); 377 case _PC_NAME_MAX: 378 *a->a_retval = NAME_MAX; 379 return (0); 380 case _PC_PATH_MAX: 381 *a->a_retval = PATH_MAX; 382 return (0); 383 case _PC_NO_TRUNC: 384 *a->a_retval = 1; 385 return (0); 386 default: 387 return (EINVAL); 388 } 389 } 390 391 static int 392 udf_read(struct vop_read_args *a) 393 { 394 struct vnode *vp = a->a_vp; 395 struct uio *uio = a->a_uio; 396 struct udf_node *node = VTON(vp); 397 struct buf *bp; 398 uint8_t *data; 399 int error = 0; 400 int size, fsize, offset; 401 402 if (uio->uio_offset < 0) 403 return (EINVAL); 404 405 fsize = node->fentry->inf_len; 406 407 while (uio->uio_offset < fsize && uio->uio_resid > 0) { 408 offset = uio->uio_offset; 409 size = uio->uio_resid; 410 error = udf_readatoffset(node, &size, offset, &bp, &data); 411 if (error) 412 return (error); 413 error = uiomove((caddr_t)data, size, uio); 414 if (bp != NULL) 415 brelse(bp); 416 if (error) 417 break; 418 }; 419 420 return (error); 421 } 422 423 /* Convienience routine to dump a block in hex */ 424 static void 425 udf_dumpblock(void *data, int len) 426 { 427 int i, j; 428 429 for (i = 0; i < len; i++) { 430 printf("\noffset= %d: ", i); 431 for (j = 0; j < 8; j++) { 432 if (i + j == len) 433 break; 434 printf("0x%02x ", (uint8_t)((uint8_t*)(data))[i + j]); 435 } 436 i += j - 1; 437 } 438 printf("\n"); 439 } 440 441 /* 442 * Call the OSTA routines to translate the name from a CS0 dstring to a 443 * 16-bit Unicode String. Hooks need to be placed in here to translate from 444 * Unicode to the encoding that the kernel/user expects. For now, compact 445 * the encoding to 8 bits if possible. Return the length of the translated 446 * string. 447 * XXX This horribly pessimizes the 8bit case 448 */ 449 static int 450 udf_transname(char *cs0string, char *destname, int len) 451 { 452 unicode_t *transname; 453 int i, unilen = 0; 454 455 /* allocate a buffer big enough to hold an 8->16 bit expansion */ 456 transname = uma_zalloc(udf_zone_trans, M_WAITOK); 457 458 if ((unilen = udf_UncompressUnicode(len, cs0string, transname)) == -1) { 459 printf("udf: Unicode translation failed\n"); 460 uma_zfree(udf_zone_trans, transname); 461 return 0; 462 } 463 464 /* At this point, the name is in 16-bit Unicode. Compact it down 465 * to 8-bit 466 */ 467 for (i = 0; i < unilen ; i++) { 468 if (transname[i] & 0xff00) { 469 destname[i] = '.'; /* Fudge the 16bit chars */ 470 } else { 471 destname[i] = transname[i] & 0xff; 472 } 473 } 474 475 destname[unilen] = 0; 476 uma_zfree(udf_zone_trans, transname); 477 478 return unilen; 479 } 480 481 /* 482 * Compare a CS0 dstring with a name passed in from the VFS layer. Return 483 * 0 on a successful match, nonzero therwise. Unicode work may need to be done 484 * here also. 485 */ 486 static int 487 udf_cmpname(char *cs0string, char *cmpname, int cs0len, int cmplen) 488 { 489 char *transname; 490 int error = 0; 491 492 /* This is overkill, but not worth creating a new zone */ 493 transname = uma_zalloc(udf_zone_trans, M_WAITOK); 494 495 cs0len = udf_transname(cs0string, transname, cs0len); 496 497 /* Easy check. If they aren't the same length, they aren't equal */ 498 if ((cs0len == 0) || (cs0len != cmplen)) 499 error = -1; 500 else 501 error = bcmp(transname, cmpname, cmplen); 502 503 uma_zfree(udf_zone_trans, transname); 504 return (error); 505 } 506 507 struct udf_uiodir { 508 struct dirent *dirent; 509 u_long *cookies; 510 int ncookies; 511 int acookies; 512 int eofflag; 513 }; 514 515 static int 516 udf_uiodir(struct udf_uiodir *uiodir, int de_size, struct uio *uio, long cookie) 517 { 518 if (uiodir->cookies != NULL) { 519 if (++uiodir->acookies > uiodir->ncookies) { 520 uiodir->eofflag = 0; 521 return (-1); 522 } 523 *uiodir->cookies++ = cookie; 524 } 525 526 if (uio->uio_resid < de_size) { 527 uiodir->eofflag = 0; 528 return (-1); 529 } 530 531 return (uiomove((caddr_t)uiodir->dirent, de_size, uio)); 532 } 533 534 static struct udf_dirstream * 535 udf_opendir(struct udf_node *node, int offset, int fsize, struct udf_mnt *udfmp) 536 { 537 struct udf_dirstream *ds; 538 539 ds = uma_zalloc(udf_zone_ds, M_WAITOK | M_ZERO); 540 541 ds->node = node; 542 ds->offset = offset; 543 ds->udfmp = udfmp; 544 ds->fsize = fsize; 545 546 return (ds); 547 } 548 549 static struct fileid_desc * 550 udf_getfid(struct udf_dirstream *ds) 551 { 552 struct fileid_desc *fid; 553 int error, frag_size = 0, total_fid_size; 554 555 /* End of directory? */ 556 if (ds->offset + ds->off >= ds->fsize) { 557 ds->error = 0; 558 return (NULL); 559 } 560 561 /* Grab the first extent of the directory */ 562 if (ds->off == 0) { 563 ds->size = 0; 564 error = udf_readatoffset(ds->node, &ds->size, ds->offset, 565 &ds->bp, &ds->data); 566 if (error) { 567 ds->error = error; 568 return (NULL); 569 } 570 } 571 572 /* 573 * Clean up from a previous fragmented FID. 574 * XXX Is this the right place for this? 575 */ 576 if (ds->fid_fragment && ds->buf != NULL) { 577 ds->fid_fragment = 0; 578 FREE(ds->buf, M_UDFFID); 579 } 580 581 fid = (struct fileid_desc*)&ds->data[ds->off]; 582 583 /* 584 * Check to see if the fid is fragmented. The first test 585 * ensures that we don't wander off the end of the buffer 586 * looking for the l_iu and l_fi fields. 587 */ 588 if (ds->off + UDF_FID_SIZE > ds->size || 589 ds->off + fid->l_iu + fid->l_fi + UDF_FID_SIZE > ds->size) { 590 591 /* Copy what we have of the fid into a buffer */ 592 frag_size = ds->size - ds->off; 593 if (frag_size >= ds->udfmp->bsize) { 594 printf("udf: invalid FID fragment\n"); 595 ds->error = EINVAL; 596 return (NULL); 597 } 598 599 /* 600 * File ID descriptors can only be at most one 601 * logical sector in size. 602 */ 603 MALLOC(ds->buf, uint8_t*, ds->udfmp->bsize, M_UDFFID, 604 M_WAITOK | M_ZERO); 605 bcopy(fid, ds->buf, frag_size); 606 607 /* Reduce all of the casting magic */ 608 fid = (struct fileid_desc*)ds->buf; 609 610 if (ds->bp != NULL) 611 brelse(ds->bp); 612 613 /* Fetch the next allocation */ 614 ds->offset += ds->size; 615 ds->size = 0; 616 error = udf_readatoffset(ds->node, &ds->size, ds->offset, 617 &ds->bp, &ds->data); 618 if (error) { 619 ds->error = error; 620 return (NULL); 621 } 622 623 /* 624 * If the fragment was so small that we didn't get 625 * the l_iu and l_fi fields, copy those in. 626 */ 627 if (frag_size < UDF_FID_SIZE) 628 bcopy(ds->data, &ds->buf[frag_size], 629 UDF_FID_SIZE - frag_size); 630 631 /* 632 * Now that we have enough of the fid to work with, 633 * copy in the rest of the fid from the new 634 * allocation. 635 */ 636 total_fid_size = UDF_FID_SIZE + fid->l_iu + fid->l_fi; 637 if (total_fid_size > ds->udfmp->bsize) { 638 printf("udf: invalid FID\n"); 639 ds->error = EIO; 640 return (NULL); 641 } 642 bcopy(ds->data, &ds->buf[frag_size], 643 total_fid_size - frag_size); 644 645 ds->fid_fragment = 1; 646 } else { 647 total_fid_size = fid->l_iu + fid->l_fi + UDF_FID_SIZE; 648 } 649 650 /* 651 * Update the offset. Align on a 4 byte boundary because the 652 * UDF spec says so. 653 */ 654 ds->this_off = ds->off; 655 if (!ds->fid_fragment) { 656 ds->off += (total_fid_size + 3) & ~0x03; 657 } else { 658 ds->off = (total_fid_size - frag_size + 3) & ~0x03; 659 } 660 661 return (fid); 662 } 663 664 static void 665 udf_closedir(struct udf_dirstream *ds) 666 { 667 668 if (ds->bp != NULL) 669 brelse(ds->bp); 670 671 if (ds->fid_fragment && ds->buf != NULL) 672 FREE(ds->buf, M_UDFFID); 673 674 uma_zfree(udf_zone_ds, ds); 675 } 676 677 static int 678 udf_readdir(struct vop_readdir_args *a) 679 { 680 struct vnode *vp; 681 struct uio *uio; 682 struct dirent dir; 683 struct udf_node *node; 684 struct fileid_desc *fid; 685 struct udf_uiodir uiodir; 686 struct udf_dirstream *ds; 687 u_long *cookies = NULL; 688 int ncookies; 689 int error = 0; 690 691 vp = a->a_vp; 692 uio = a->a_uio; 693 node = VTON(vp); 694 uiodir.eofflag = 1; 695 696 if (a->a_ncookies != NULL) { 697 /* 698 * Guess how many entries are needed. If we run out, this 699 * function will be called again and thing will pick up were 700 * it left off. 701 */ 702 ncookies = uio->uio_resid / 8; 703 MALLOC(cookies, u_long *, sizeof(u_long) * ncookies, 704 M_TEMP, M_WAITOK); 705 if (cookies == NULL) 706 return (ENOMEM); 707 uiodir.ncookies = ncookies; 708 uiodir.cookies = cookies; 709 uiodir.acookies = 0; 710 } else { 711 uiodir.cookies = NULL; 712 } 713 714 /* 715 * Iterate through the file id descriptors. Give the parent dir 716 * entry special attention. 717 */ 718 ds = udf_opendir(node, uio->uio_offset, node->fentry->inf_len, 719 node->udfmp); 720 721 while ((fid = udf_getfid(ds)) != NULL) { 722 723 /* XXX Should we return an error on a bad fid? */ 724 if (udf_checktag(&fid->tag, TAGID_FID)) { 725 printf("Invalid FID tag\n"); 726 udf_dumpblock(fid, UDF_FID_SIZE); 727 error = EIO; 728 break; 729 } 730 731 /* Is this a deleted file? */ 732 if (fid->file_char & UDF_FILE_CHAR_DEL) 733 continue; 734 735 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) { 736 /* Do up the '.' and '..' entries. Dummy values are 737 * used for the cookies since the offset here is 738 * usually zero, and NFS doesn't like that value 739 */ 740 dir.d_fileno = node->hash_id; 741 dir.d_type = DT_DIR; 742 dir.d_name[0] = '.'; 743 dir.d_namlen = 1; 744 dir.d_reclen = GENERIC_DIRSIZ(&dir); 745 uiodir.dirent = &dir; 746 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 1); 747 if (error) 748 break; 749 750 dir.d_fileno = udf_getid(&fid->icb); 751 dir.d_type = DT_DIR; 752 dir.d_name[0] = '.'; 753 dir.d_name[1] = '.'; 754 dir.d_namlen = 2; 755 dir.d_reclen = GENERIC_DIRSIZ(&dir); 756 uiodir.dirent = &dir; 757 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 2); 758 } else { 759 dir.d_namlen = udf_transname(&fid->data[fid->l_iu], 760 &dir.d_name[0], fid->l_fi); 761 dir.d_fileno = udf_getid(&fid->icb); 762 dir.d_type = (fid->file_char & UDF_FILE_CHAR_DIR) ? 763 DT_DIR : DT_UNKNOWN; 764 dir.d_reclen = GENERIC_DIRSIZ(&dir); 765 uiodir.dirent = &dir; 766 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 767 ds->this_off); 768 } 769 if (error) { 770 printf("uiomove returned %d\n", error); 771 break; 772 } 773 774 } 775 776 /* tell the calling layer whether we need to be called again */ 777 *a->a_eofflag = uiodir.eofflag; 778 uio->uio_offset = ds->offset + ds->off; 779 780 if (!error) 781 error = ds->error; 782 783 udf_closedir(ds); 784 785 if (a->a_ncookies != NULL) { 786 if (error) 787 FREE(cookies, M_TEMP); 788 else { 789 *a->a_ncookies = uiodir.acookies; 790 *a->a_cookies = cookies; 791 } 792 } 793 794 return (error); 795 } 796 797 /* Are there any implementations out there that do soft-links? */ 798 static int 799 udf_readlink(struct vop_readlink_args *ap) 800 { 801 printf("%s called\n", __FUNCTION__); 802 return (EOPNOTSUPP); 803 } 804 805 static int 806 udf_strategy(struct vop_strategy_args *a) 807 { 808 struct buf *bp; 809 struct vnode *vp; 810 struct udf_node *node; 811 int maxsize; 812 813 bp = a->a_bp; 814 vp = bp->b_vp; 815 node = VTON(vp); 816 817 /* cd9660 has this test reversed, but it seems more logical this way */ 818 if (bp->b_blkno != bp->b_lblkno) { 819 /* 820 * Files that are embedded in the fentry don't translate well 821 * to a block number. Reject. 822 */ 823 if (udf_bmap_internal(node, bp->b_lblkno * node->udfmp->bsize, 824 &bp->b_lblkno, &maxsize)) { 825 clrbuf(bp); 826 bp->b_blkno = -1; 827 } 828 } 829 if ((long)bp->b_blkno == -1) { 830 bufdone(bp); 831 return (0); 832 } 833 vp = node->i_devvp; 834 bp->b_dev = vp->v_rdev; 835 VOP_STRATEGY(vp, bp); 836 return (0); 837 } 838 839 static int 840 udf_print(struct vop_print_args *a) 841 { 842 printf("%s called\n", __FUNCTION__); 843 return (EOPNOTSUPP); 844 } 845 846 static int 847 udf_bmap(struct vop_bmap_args *a) 848 { 849 struct udf_node *node; 850 uint32_t max_size; 851 daddr_t lsector; 852 int error; 853 854 node = VTON(a->a_vp); 855 856 if (a->a_vpp != NULL) 857 *a->a_vpp = node->i_devvp; 858 if (a->a_bnp == NULL) 859 return (0); 860 if (a->a_runb) 861 *a->a_runb = 0; 862 863 error = udf_bmap_internal(node, a->a_bn * node->udfmp->bsize, &lsector, 864 &max_size); 865 if (error) 866 return (error); 867 868 /* Translate logical to physical sector number */ 869 *a->a_bnp = lsector << (node->udfmp->bshift - DEV_BSHIFT); 870 871 /* Punt on read-ahead for now */ 872 if (a->a_runp) 873 *a->a_runp = 0; 874 875 return (0); 876 } 877 878 /* 879 * The all powerful VOP_LOOKUP(). 880 */ 881 static int 882 udf_lookup(struct vop_cachedlookup_args *a) 883 { 884 struct vnode *dvp; 885 struct vnode *tdp = NULL; 886 struct vnode **vpp = a->a_vpp; 887 struct udf_node *node; 888 struct udf_mnt *udfmp; 889 struct fileid_desc *fid = NULL; 890 struct udf_dirstream *ds; 891 struct thread *td; 892 u_long nameiop; 893 u_long flags; 894 char *nameptr; 895 long namelen; 896 ino_t id = 0; 897 int offset, error = 0; 898 int numdirpasses, fsize; 899 900 dvp = a->a_dvp; 901 node = VTON(dvp); 902 udfmp = node->udfmp; 903 nameiop = a->a_cnp->cn_nameiop; 904 flags = a->a_cnp->cn_flags; 905 nameptr = a->a_cnp->cn_nameptr; 906 namelen = a->a_cnp->cn_namelen; 907 fsize = node->fentry->inf_len; 908 td = a->a_cnp->cn_thread; 909 910 /* 911 * If this is a LOOKUP and we've already partially searched through 912 * the directory, pick up where we left off and flag that the 913 * directory may need to be searched twice. For a full description, 914 * see /sys/isofs/cd9660/cd9660_lookup.c:cd9660_lookup() 915 */ 916 if (nameiop != LOOKUP || node->diroff == 0 || node->diroff > fsize) { 917 offset = 0; 918 numdirpasses = 1; 919 } else { 920 offset = node->diroff; 921 numdirpasses = 2; 922 nchstats.ncs_2passes++; 923 } 924 925 lookloop: 926 ds = udf_opendir(node, offset, fsize, udfmp); 927 928 while ((fid = udf_getfid(ds)) != NULL) { 929 930 /* XXX Should we return an error on a bad fid? */ 931 if (udf_checktag(&fid->tag, TAGID_FID)) { 932 printf("udf_lookup: Invalid tag\n"); 933 error = EIO; 934 break; 935 } 936 937 /* Is this a deleted file? */ 938 if (fid->file_char & UDF_FILE_CHAR_DEL) 939 continue; 940 941 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) { 942 if (flags & ISDOTDOT) { 943 id = udf_getid(&fid->icb); 944 break; 945 } 946 } else { 947 if (!(udf_cmpname(&fid->data[fid->l_iu], 948 nameptr, fid->l_fi, namelen))) { 949 id = udf_getid(&fid->icb); 950 break; 951 } 952 } 953 } 954 955 if (!error) 956 error = ds->error; 957 958 /* XXX Bail out here? */ 959 if (error) { 960 udf_closedir(ds); 961 return (error); 962 } 963 964 /* Did we have a match? */ 965 if (id) { 966 error = udf_vget(udfmp->im_mountp, id, LK_EXCLUSIVE, &tdp); 967 if (!error) { 968 /* 969 * Remember where this entry was if it's the final 970 * component. 971 */ 972 if ((flags & ISLASTCN) && nameiop == LOOKUP) 973 node->diroff = ds->offset + ds->off; 974 if (numdirpasses == 2) 975 nchstats.ncs_pass2++; 976 if (!(flags & LOCKPARENT) || !(flags & ISLASTCN)) { 977 a->a_cnp->cn_flags |= PDIRUNLOCK; 978 VOP_UNLOCK(dvp, 0, td); 979 } 980 981 *vpp = tdp; 982 983 /* Put this entry in the cache */ 984 if (flags & MAKEENTRY) 985 cache_enter(dvp, *vpp, a->a_cnp); 986 } 987 } else { 988 /* Name wasn't found on this pass. Do another pass? */ 989 if (numdirpasses == 2) { 990 numdirpasses--; 991 offset = 0; 992 udf_closedir(ds); 993 goto lookloop; 994 } 995 996 /* Enter name into cache as non-existant */ 997 if (flags & MAKEENTRY) 998 cache_enter(dvp, *vpp, a->a_cnp); 999 1000 if ((flags & ISLASTCN) && 1001 (nameiop == CREATE || nameiop == RENAME)) { 1002 error = EROFS; 1003 } else { 1004 error = ENOENT; 1005 } 1006 } 1007 1008 udf_closedir(ds); 1009 return (error); 1010 } 1011 1012 static int 1013 udf_reclaim(struct vop_reclaim_args *a) 1014 { 1015 struct vnode *vp; 1016 struct udf_node *unode; 1017 1018 vp = a->a_vp; 1019 unode = VTON(vp); 1020 1021 cache_purge(vp); 1022 if (unode != NULL) { 1023 udf_hashrem(unode); 1024 if (unode->i_devvp) { 1025 vrele(unode->i_devvp); 1026 unode->i_devvp = 0; 1027 } 1028 1029 if (unode->fentry != NULL) 1030 FREE(unode->fentry, M_UDFFENTRY); 1031 lockdestroy(&unode->i_vnode->v_lock); 1032 uma_zfree(udf_zone_node, unode); 1033 vp->v_data = NULL; 1034 } 1035 1036 return (0); 1037 } 1038 1039 /* 1040 * Read the block and then set the data pointer to correspond with the 1041 * offset passed in. Only read in at most 'size' bytes, and then set 'size' 1042 * to the number of bytes pointed to. If 'size' is zero, try to read in a 1043 * whole extent. 1044 * XXX 'size' is limited to the logical block size for now due to problems 1045 * with udf_read() 1046 */ 1047 static int 1048 udf_readatoffset(struct udf_node *node, int *size, int offset, struct buf **bp, uint8_t **data) 1049 { 1050 struct udf_mnt *udfmp; 1051 struct file_entry *fentry = NULL; 1052 struct buf *bp1; 1053 uint32_t max_size; 1054 daddr_t sector; 1055 int error; 1056 1057 udfmp = node->udfmp; 1058 1059 error = udf_bmap_internal(node, offset, §or, &max_size); 1060 if (error == UDF_INVALID_BMAP) { 1061 /* 1062 * This error means that the file *data* is stored in the 1063 * allocation descriptor field of the file entry. 1064 */ 1065 fentry = node->fentry; 1066 *data = &fentry->data[fentry->l_ea]; 1067 *size = fentry->l_ad; 1068 *bp = NULL; 1069 return (0); 1070 } else if (error != 0) { 1071 return (error); 1072 } 1073 1074 /* Adjust the size so that it is within range */ 1075 if (*size == 0 || *size > max_size) 1076 *size = max_size; 1077 *size = min(*size, MAXBSIZE); 1078 1079 if ((error = udf_readlblks(udfmp, sector, *size, bp))) { 1080 printf("udf_readlblks returned %d\n", error); 1081 return (error); 1082 } 1083 1084 bp1 = *bp; 1085 *data = (uint8_t *)&bp1->b_data[offset % udfmp->bsize]; 1086 return (0); 1087 } 1088 1089 /* 1090 * Translate a file offset into a logical block and then into a physical 1091 * block. 1092 */ 1093 static int 1094 udf_bmap_internal(struct udf_node *node, uint32_t offset, daddr_t *sector, uint32_t *max_size) 1095 { 1096 struct udf_mnt *udfmp; 1097 struct file_entry *fentry; 1098 void *icb; 1099 struct icb_tag *tag; 1100 uint32_t icblen = 0; 1101 daddr_t lsector; 1102 int ad_offset, ad_num = 0; 1103 int i, p_offset; 1104 1105 udfmp = node->udfmp; 1106 fentry = node->fentry; 1107 tag = &fentry->icbtag; 1108 1109 switch (tag->strat_type) { 1110 case 4: 1111 break; 1112 1113 case 4096: 1114 printf("Cannot deal with strategy4096 yet!\n"); 1115 return (ENODEV); 1116 1117 default: 1118 printf("Unknown strategy type %d\n", tag->strat_type); 1119 return (ENODEV); 1120 } 1121 1122 switch (tag->flags & 0x7) { 1123 case 0: 1124 /* 1125 * The allocation descriptor field is filled with short_ad's. 1126 * If the offset is beyond the current extent, look for the 1127 * next extent. 1128 */ 1129 do { 1130 offset -= icblen; 1131 ad_offset = sizeof(struct short_ad) * ad_num; 1132 if (ad_offset > fentry->l_ad) { 1133 printf("File offset out of bounds\n"); 1134 return (EINVAL); 1135 } 1136 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset); 1137 icblen = GETICBLEN(short_ad, icb); 1138 ad_num++; 1139 } while(offset >= icblen); 1140 1141 lsector = (offset >> udfmp->bshift) + 1142 ((struct short_ad *)(icb))->pos; 1143 1144 *max_size = GETICBLEN(short_ad, icb) - offset; 1145 1146 break; 1147 case 1: 1148 /* 1149 * The allocation descriptor field is filled with long_ad's 1150 * If the offset is beyond the current extent, look for the 1151 * next extent. 1152 */ 1153 do { 1154 offset -= icblen; 1155 ad_offset = sizeof(struct long_ad) * ad_num; 1156 if (ad_offset > fentry->l_ad) { 1157 printf("File offset out of bounds\n"); 1158 return (EINVAL); 1159 } 1160 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset); 1161 icblen = GETICBLEN(long_ad, icb); 1162 ad_num++; 1163 } while(offset >= icblen); 1164 1165 lsector = (offset >> udfmp->bshift) + 1166 ((struct long_ad *)(icb))->loc.lb_num; 1167 1168 *max_size = GETICBLEN(long_ad, icb) - offset; 1169 1170 break; 1171 case 3: 1172 /* 1173 * This type means that the file *data* is stored in the 1174 * allocation descriptor field of the file entry. 1175 */ 1176 *max_size = 0; 1177 *sector = node->hash_id + udfmp->part_start; 1178 1179 return (UDF_INVALID_BMAP); 1180 case 2: 1181 /* DirectCD does not use extended_ad's */ 1182 default: 1183 printf("Unsupported allocation descriptor %d\n", 1184 tag->flags & 0x7); 1185 return (ENODEV); 1186 } 1187 1188 *sector = lsector + udfmp->part_start; 1189 1190 /* 1191 * Check the sparing table. Each entry represents the beginning of 1192 * a packet. 1193 */ 1194 if (udfmp->s_table != NULL) { 1195 for (i = 0; i< udfmp->s_table_entries; i++) { 1196 p_offset = lsector - udfmp->s_table->entries[i].org; 1197 if ((p_offset < udfmp->p_sectors) && (p_offset >= 0)) { 1198 *sector = udfmp->s_table->entries[i].map + 1199 p_offset; 1200 break; 1201 } 1202 } 1203 } 1204 1205 return (0); 1206 } 1207