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