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