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