Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/fs/udf/udf_vnops.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 3 * 4 * Copyright (c) 2001, 2002 Scott Long <scottl@freebsd.org> 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 * 28 * $FreeBSD$ 29 */ 30 31 /* udf_vnops.c */ 32 /* Take care of the vnode side of things */ 33 34 #include <sys/param.h> 35 #include <sys/systm.h> 36 #include <sys/namei.h> 37 #include <sys/kernel.h> 38 #include <sys/malloc.h> 39 #include <sys/stat.h> 40 #include <sys/bio.h> 41 #include <sys/conf.h> 42 #include <sys/buf.h> 43 #include <sys/iconv.h> 44 #include <sys/mount.h> 45 #include <sys/vnode.h> 46 #include <sys/dirent.h> 47 #include <sys/queue.h> 48 #include <sys/unistd.h> 49 #include <sys/endian.h> 50 51 #include <vm/uma.h> 52 53 #include <fs/udf/ecma167-udf.h> 54 #include <fs/udf/osta.h> 55 #include <fs/udf/udf.h> 56 #include <fs/udf/udf_mount.h> 57 58 extern struct iconv_functions *udf_iconv; 59 60 static vop_access_t udf_access; 61 static vop_getattr_t udf_getattr; 62 static vop_open_t udf_open; 63 static vop_ioctl_t udf_ioctl; 64 static vop_pathconf_t udf_pathconf; 65 static vop_print_t udf_print; 66 static vop_read_t udf_read; 67 static vop_readdir_t udf_readdir; 68 static vop_readlink_t udf_readlink; 69 static vop_setattr_t udf_setattr; 70 static vop_strategy_t udf_strategy; 71 static vop_bmap_t udf_bmap; 72 static vop_cachedlookup_t udf_lookup; 73 static vop_reclaim_t udf_reclaim; 74 static vop_vptofh_t udf_vptofh; 75 static int udf_readatoffset(struct udf_node *node, int *size, off_t offset, 76 struct buf **bp, uint8_t **data); 77 static int udf_bmap_internal(struct udf_node *node, off_t offset, 78 daddr_t *sector, uint32_t *max_size); 79 80 static struct vop_vector udf_vnodeops = { 81 .vop_default = &default_vnodeops, 82 83 .vop_access = udf_access, 84 .vop_bmap = udf_bmap, 85 .vop_cachedlookup = udf_lookup, 86 .vop_getattr = udf_getattr, 87 .vop_ioctl = udf_ioctl, 88 .vop_lookup = vfs_cache_lookup, 89 .vop_open = udf_open, 90 .vop_pathconf = udf_pathconf, 91 .vop_print = udf_print, 92 .vop_read = udf_read, 93 .vop_readdir = udf_readdir, 94 .vop_readlink = udf_readlink, 95 .vop_reclaim = udf_reclaim, 96 .vop_setattr = udf_setattr, 97 .vop_strategy = udf_strategy, 98 .vop_vptofh = udf_vptofh, 99 }; 100 VFS_VOP_VECTOR_REGISTER(udf_vnodeops); 101 102 struct vop_vector udf_fifoops = { 103 .vop_default = &fifo_specops, 104 .vop_access = udf_access, 105 .vop_getattr = udf_getattr, 106 .vop_pathconf = udf_pathconf, 107 .vop_print = udf_print, 108 .vop_reclaim = udf_reclaim, 109 .vop_setattr = udf_setattr, 110 .vop_vptofh = udf_vptofh, 111 }; 112 VFS_VOP_VECTOR_REGISTER(udf_fifoops); 113 114 static MALLOC_DEFINE(M_UDFFID, "udf_fid", "UDF FileId structure"); 115 static MALLOC_DEFINE(M_UDFDS, "udf_ds", "UDF Dirstream structure"); 116 117 #define UDF_INVALID_BMAP -1 118 119 int 120 udf_allocv(struct mount *mp, struct vnode **vpp, struct thread *td) 121 { 122 int error; 123 struct vnode *vp; 124 125 error = getnewvnode("udf", mp, &udf_vnodeops, &vp); 126 if (error) { 127 printf("udf_allocv: failed to allocate new vnode\n"); 128 return (error); 129 } 130 131 *vpp = vp; 132 return (0); 133 } 134 135 /* Convert file entry permission (5 bits per owner/group/user) to a mode_t */ 136 static mode_t 137 udf_permtomode(struct udf_node *node) 138 { 139 uint32_t perm; 140 uint16_t flags; 141 mode_t mode; 142 143 perm = le32toh(node->fentry->perm); 144 flags = le16toh(node->fentry->icbtag.flags); 145 146 mode = perm & UDF_FENTRY_PERM_USER_MASK; 147 mode |= ((perm & UDF_FENTRY_PERM_GRP_MASK) >> 2); 148 mode |= ((perm & UDF_FENTRY_PERM_OWNER_MASK) >> 4); 149 mode |= ((flags & UDF_ICB_TAG_FLAGS_STICKY) << 4); 150 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETGID) << 6); 151 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETUID) << 8); 152 153 return (mode); 154 } 155 156 static int 157 udf_access(struct vop_access_args *a) 158 { 159 struct vnode *vp; 160 struct udf_node *node; 161 accmode_t accmode; 162 mode_t mode; 163 164 vp = a->a_vp; 165 node = VTON(vp); 166 accmode = a->a_accmode; 167 168 if (accmode & VWRITE) { 169 switch (vp->v_type) { 170 case VDIR: 171 case VLNK: 172 case VREG: 173 return (EROFS); 174 /* NOT REACHED */ 175 default: 176 break; 177 } 178 } 179 180 mode = udf_permtomode(node); 181 182 return (vaccess(vp->v_type, mode, node->fentry->uid, node->fentry->gid, 183 accmode, a->a_cred)); 184 } 185 186 static int 187 udf_open(struct vop_open_args *ap) { 188 struct udf_node *np = VTON(ap->a_vp); 189 off_t fsize; 190 191 fsize = le64toh(np->fentry->inf_len); 192 vnode_create_vobject(ap->a_vp, fsize, ap->a_td); 193 return 0; 194 } 195 196 static const int mon_lens[2][12] = { 197 {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334}, 198 {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335} 199 }; 200 201 static int 202 udf_isaleapyear(int year) 203 { 204 int i; 205 206 i = (year % 4) ? 0 : 1; 207 i &= (year % 100) ? 1 : 0; 208 i |= (year % 400) ? 0 : 1; 209 210 return i; 211 } 212 213 /* 214 * Timezone calculation compliments of Julian Elischer <julian@elischer.org>. 215 */ 216 static void 217 udf_timetotimespec(struct timestamp *time, struct timespec *t) 218 { 219 int i, lpyear, daysinyear, year, startyear; 220 union { 221 uint16_t u_tz_offset; 222 int16_t s_tz_offset; 223 } tz; 224 225 /* 226 * DirectCD seems to like using bogus year values. 227 * Don't trust time->month as it will be used for an array index. 228 */ 229 year = le16toh(time->year); 230 if (year < 1970 || time->month < 1 || time->month > 12) { 231 t->tv_sec = 0; 232 t->tv_nsec = 0; 233 return; 234 } 235 236 /* Calculate the time and day */ 237 t->tv_sec = time->second; 238 t->tv_sec += time->minute * 60; 239 t->tv_sec += time->hour * 3600; 240 t->tv_sec += (time->day - 1) * 3600 * 24; 241 242 /* Calculate the month */ 243 lpyear = udf_isaleapyear(year); 244 t->tv_sec += mon_lens[lpyear][time->month - 1] * 3600 * 24; 245 246 /* Speed up the calculation */ 247 startyear = 1970; 248 if (year > 2009) { 249 t->tv_sec += 1262304000; 250 startyear += 40; 251 } else if (year > 1999) { 252 t->tv_sec += 946684800; 253 startyear += 30; 254 } else if (year > 1989) { 255 t->tv_sec += 631152000; 256 startyear += 20; 257 } else if (year > 1979) { 258 t->tv_sec += 315532800; 259 startyear += 10; 260 } 261 262 daysinyear = (year - startyear) * 365; 263 for (i = startyear; i < year; i++) 264 daysinyear += udf_isaleapyear(i); 265 t->tv_sec += daysinyear * 3600 * 24; 266 267 /* Calculate microseconds */ 268 t->tv_nsec = time->centisec * 10000 + time->hund_usec * 100 + 269 time->usec; 270 271 /* 272 * Calculate the time zone. The timezone is 12 bit signed 2's 273 * complement, so we gotta do some extra magic to handle it right. 274 */ 275 tz.u_tz_offset = le16toh(time->type_tz); 276 tz.u_tz_offset &= 0x0fff; 277 if (tz.u_tz_offset & 0x0800) 278 tz.u_tz_offset |= 0xf000; /* extend the sign to 16 bits */ 279 if ((le16toh(time->type_tz) & 0x1000) && (tz.s_tz_offset != -2047)) 280 t->tv_sec -= tz.s_tz_offset * 60; 281 282 return; 283 } 284 285 static int 286 udf_getattr(struct vop_getattr_args *a) 287 { 288 struct vnode *vp; 289 struct udf_node *node; 290 struct vattr *vap; 291 struct file_entry *fentry; 292 struct timespec ts; 293 294 ts.tv_sec = 0; 295 296 vp = a->a_vp; 297 vap = a->a_vap; 298 node = VTON(vp); 299 fentry = node->fentry; 300 301 vap->va_fsid = dev2udev(node->udfmp->im_dev); 302 vap->va_fileid = node->hash_id; 303 vap->va_mode = udf_permtomode(node); 304 vap->va_nlink = le16toh(fentry->link_cnt); 305 /* 306 * XXX The spec says that -1 is valid for uid/gid and indicates an 307 * invalid uid/gid. How should this be represented? 308 */ 309 vap->va_uid = (le32toh(fentry->uid) == -1) ? 0 : le32toh(fentry->uid); 310 vap->va_gid = (le32toh(fentry->gid) == -1) ? 0 : le32toh(fentry->gid); 311 udf_timetotimespec(&fentry->atime, &vap->va_atime); 312 udf_timetotimespec(&fentry->mtime, &vap->va_mtime); 313 vap->va_ctime = vap->va_mtime; /* XXX Stored as an Extended Attribute */ 314 vap->va_rdev = NODEV; 315 if (vp->v_type & VDIR) { 316 /* 317 * Directories that are recorded within their ICB will show 318 * as having 0 blocks recorded. Since tradition dictates 319 * that directories consume at least one logical block, 320 * make it appear so. 321 */ 322 if (fentry->logblks_rec != 0) { 323 vap->va_size = 324 le64toh(fentry->logblks_rec) * node->udfmp->bsize; 325 } else { 326 vap->va_size = node->udfmp->bsize; 327 } 328 } else { 329 vap->va_size = le64toh(fentry->inf_len); 330 } 331 vap->va_flags = 0; 332 vap->va_gen = 1; 333 vap->va_blocksize = node->udfmp->bsize; 334 vap->va_bytes = le64toh(fentry->inf_len); 335 vap->va_type = vp->v_type; 336 vap->va_filerev = 0; /* XXX */ 337 return (0); 338 } 339 340 static int 341 udf_setattr(struct vop_setattr_args *a) 342 { 343 struct vnode *vp; 344 struct vattr *vap; 345 346 vp = a->a_vp; 347 vap = a->a_vap; 348 if (vap->va_flags != (u_long)VNOVAL || vap->va_uid != (uid_t)VNOVAL || 349 vap->va_gid != (gid_t)VNOVAL || vap->va_atime.tv_sec != VNOVAL || 350 vap->va_mtime.tv_sec != VNOVAL || vap->va_mode != (mode_t)VNOVAL) 351 return (EROFS); 352 if (vap->va_size != (u_quad_t)VNOVAL) { 353 switch (vp->v_type) { 354 case VDIR: 355 return (EISDIR); 356 case VLNK: 357 case VREG: 358 return (EROFS); 359 case VCHR: 360 case VBLK: 361 case VSOCK: 362 case VFIFO: 363 case VNON: 364 case VBAD: 365 case VMARKER: 366 return (0); 367 } 368 } 369 return (0); 370 } 371 372 /* 373 * File specific ioctls. 374 */ 375 static int 376 udf_ioctl(struct vop_ioctl_args *a) 377 { 378 printf("%s called\n", __func__); 379 return (ENOTTY); 380 } 381 382 /* 383 * I'm not sure that this has much value in a read-only filesystem, but 384 * cd9660 has it too. 385 */ 386 static int 387 udf_pathconf(struct vop_pathconf_args *a) 388 { 389 390 switch (a->a_name) { 391 case _PC_FILESIZEBITS: 392 *a->a_retval = 64; 393 return (0); 394 case _PC_LINK_MAX: 395 *a->a_retval = 65535; 396 return (0); 397 case _PC_NAME_MAX: 398 *a->a_retval = NAME_MAX; 399 return (0); 400 case _PC_SYMLINK_MAX: 401 *a->a_retval = MAXPATHLEN; 402 return (0); 403 case _PC_NO_TRUNC: 404 *a->a_retval = 1; 405 return (0); 406 case _PC_PIPE_BUF: 407 if (a->a_vp->v_type == VDIR || a->a_vp->v_type == VFIFO) { 408 *a->a_retval = PIPE_BUF; 409 return (0); 410 } 411 return (EINVAL); 412 default: 413 return (vop_stdpathconf(a)); 414 } 415 } 416 417 static int 418 udf_print(struct vop_print_args *ap) 419 { 420 struct vnode *vp = ap->a_vp; 421 struct udf_node *node = VTON(vp); 422 423 printf(" ino %lu, on dev %s", (u_long)node->hash_id, 424 devtoname(node->udfmp->im_dev)); 425 if (vp->v_type == VFIFO) 426 fifo_printinfo(vp); 427 printf("\n"); 428 return (0); 429 } 430 431 #define lblkno(udfmp, loc) ((loc) >> (udfmp)->bshift) 432 #define blkoff(udfmp, loc) ((loc) & (udfmp)->bmask) 433 #define lblktosize(udfmp, blk) ((blk) << (udfmp)->bshift) 434 435 static inline int 436 is_data_in_fentry(const struct udf_node *node) 437 { 438 const struct file_entry *fentry = node->fentry; 439 440 return ((le16toh(fentry->icbtag.flags) & 0x7) == 3); 441 } 442 443 static int 444 udf_read(struct vop_read_args *ap) 445 { 446 struct vnode *vp = ap->a_vp; 447 struct uio *uio = ap->a_uio; 448 struct udf_node *node = VTON(vp); 449 struct udf_mnt *udfmp; 450 struct file_entry *fentry; 451 struct buf *bp; 452 uint8_t *data; 453 daddr_t lbn, rablock; 454 off_t diff, fsize; 455 ssize_t n; 456 int error = 0; 457 long size, on; 458 459 if (uio->uio_resid == 0) 460 return (0); 461 if (uio->uio_offset < 0) 462 return (EINVAL); 463 464 if (is_data_in_fentry(node)) { 465 fentry = node->fentry; 466 data = &fentry->data[le32toh(fentry->l_ea)]; 467 fsize = le32toh(fentry->l_ad); 468 469 n = uio->uio_resid; 470 diff = fsize - uio->uio_offset; 471 if (diff <= 0) 472 return (0); 473 if (diff < n) 474 n = diff; 475 error = uiomove(data + uio->uio_offset, (int)n, uio); 476 return (error); 477 } 478 479 fsize = le64toh(node->fentry->inf_len); 480 udfmp = node->udfmp; 481 do { 482 lbn = lblkno(udfmp, uio->uio_offset); 483 on = blkoff(udfmp, uio->uio_offset); 484 n = min((u_int)(udfmp->bsize - on), 485 uio->uio_resid); 486 diff = fsize - uio->uio_offset; 487 if (diff <= 0) 488 return (0); 489 if (diff < n) 490 n = diff; 491 size = udfmp->bsize; 492 rablock = lbn + 1; 493 if ((vp->v_mount->mnt_flag & MNT_NOCLUSTERR) == 0) { 494 if (lblktosize(udfmp, rablock) < fsize) { 495 error = cluster_read(vp, fsize, lbn, size, 496 NOCRED, uio->uio_resid, 497 (ap->a_ioflag >> 16), 0, &bp); 498 } else { 499 error = bread(vp, lbn, size, NOCRED, &bp); 500 } 501 } else { 502 error = bread(vp, lbn, size, NOCRED, &bp); 503 } 504 if (error != 0) { 505 brelse(bp); 506 return (error); 507 } 508 n = min(n, size - bp->b_resid); 509 510 error = uiomove(bp->b_data + on, (int)n, uio); 511 brelse(bp); 512 } while (error == 0 && uio->uio_resid > 0 && n != 0); 513 return (error); 514 } 515 516 /* 517 * Call the OSTA routines to translate the name from a CS0 dstring to a 518 * 16-bit Unicode String. Hooks need to be placed in here to translate from 519 * Unicode to the encoding that the kernel/user expects. Return the length 520 * of the translated string. 521 */ 522 static int 523 udf_transname(char *cs0string, char *destname, int len, struct udf_mnt *udfmp) 524 { 525 unicode_t *transname; 526 char *unibuf, *unip; 527 int i, destlen; 528 ssize_t unilen = 0; 529 size_t destleft = MAXNAMLEN; 530 531 /* Convert 16-bit Unicode to destname */ 532 if (udfmp->im_flags & UDFMNT_KICONV && udf_iconv) { 533 /* allocate a buffer big enough to hold an 8->16 bit expansion */ 534 unibuf = uma_zalloc(udf_zone_trans, M_WAITOK); 535 unip = unibuf; 536 if ((unilen = (ssize_t)udf_UncompressUnicodeByte(len, cs0string, unibuf)) == -1) { 537 printf("udf: Unicode translation failed\n"); 538 uma_zfree(udf_zone_trans, unibuf); 539 return 0; 540 } 541 542 while (unilen > 0 && destleft > 0) { 543 udf_iconv->conv(udfmp->im_d2l, __DECONST(const char **, 544 &unibuf), (size_t *)&unilen, (char **)&destname, 545 &destleft); 546 /* Unconverted character found */ 547 if (unilen > 0 && destleft > 0) { 548 *destname++ = '?'; 549 destleft--; 550 unibuf += 2; 551 unilen -= 2; 552 } 553 } 554 uma_zfree(udf_zone_trans, unip); 555 *destname = '\0'; 556 destlen = MAXNAMLEN - (int)destleft; 557 } else { 558 /* allocate a buffer big enough to hold an 8->16 bit expansion */ 559 transname = uma_zalloc(udf_zone_trans, M_WAITOK); 560 561 if ((unilen = (ssize_t)udf_UncompressUnicode(len, cs0string, transname)) == -1) { 562 printf("udf: Unicode translation failed\n"); 563 uma_zfree(udf_zone_trans, transname); 564 return 0; 565 } 566 567 for (i = 0; i < unilen ; i++) { 568 if (transname[i] & 0xff00) { 569 destname[i] = '.'; /* Fudge the 16bit chars */ 570 } else { 571 destname[i] = transname[i] & 0xff; 572 } 573 } 574 uma_zfree(udf_zone_trans, transname); 575 destname[unilen] = 0; 576 destlen = (int)unilen; 577 } 578 579 return (destlen); 580 } 581 582 /* 583 * Compare a CS0 dstring with a name passed in from the VFS layer. Return 584 * 0 on a successful match, nonzero otherwise. Unicode work may need to be done 585 * here also. 586 */ 587 static int 588 udf_cmpname(char *cs0string, char *cmpname, int cs0len, int cmplen, struct udf_mnt *udfmp) 589 { 590 char *transname; 591 int error = 0; 592 593 /* This is overkill, but not worth creating a new zone */ 594 transname = uma_zalloc(udf_zone_trans, M_WAITOK); 595 596 cs0len = udf_transname(cs0string, transname, cs0len, udfmp); 597 598 /* Easy check. If they aren't the same length, they aren't equal */ 599 if ((cs0len == 0) || (cs0len != cmplen)) 600 error = -1; 601 else 602 error = bcmp(transname, cmpname, cmplen); 603 604 uma_zfree(udf_zone_trans, transname); 605 return (error); 606 } 607 608 struct udf_uiodir { 609 struct dirent *dirent; 610 uint64_t *cookies; 611 int ncookies; 612 int acookies; 613 int eofflag; 614 }; 615 616 static int 617 udf_uiodir(struct udf_uiodir *uiodir, int de_size, struct uio *uio, long cookie) 618 { 619 if (uiodir->cookies != NULL) { 620 if (++uiodir->acookies > uiodir->ncookies) { 621 uiodir->eofflag = 0; 622 return (-1); 623 } 624 *uiodir->cookies++ = cookie; 625 } 626 627 if (uio->uio_resid < de_size) { 628 uiodir->eofflag = 0; 629 return (-1); 630 } 631 632 return (uiomove(uiodir->dirent, de_size, uio)); 633 } 634 635 static struct udf_dirstream * 636 udf_opendir(struct udf_node *node, int offset, int fsize, struct udf_mnt *udfmp) 637 { 638 struct udf_dirstream *ds; 639 640 ds = uma_zalloc(udf_zone_ds, M_WAITOK | M_ZERO); 641 642 ds->node = node; 643 ds->offset = offset; 644 ds->udfmp = udfmp; 645 ds->fsize = fsize; 646 647 return (ds); 648 } 649 650 static struct fileid_desc * 651 udf_getfid(struct udf_dirstream *ds) 652 { 653 struct fileid_desc *fid; 654 int error, frag_size = 0, total_fid_size; 655 656 /* End of directory? */ 657 if (ds->offset + ds->off >= ds->fsize) { 658 ds->error = 0; 659 return (NULL); 660 } 661 662 /* Grab the first extent of the directory */ 663 if (ds->off == 0) { 664 ds->size = 0; 665 error = udf_readatoffset(ds->node, &ds->size, ds->offset, 666 &ds->bp, &ds->data); 667 if (error) { 668 ds->error = error; 669 if (ds->bp != NULL) 670 brelse(ds->bp); 671 return (NULL); 672 } 673 } 674 675 /* 676 * Clean up from a previous fragmented FID. 677 * XXX Is this the right place for this? 678 */ 679 if (ds->fid_fragment && ds->buf != NULL) { 680 ds->fid_fragment = 0; 681 free(ds->buf, M_UDFFID); 682 } 683 684 fid = (struct fileid_desc*)&ds->data[ds->off]; 685 686 /* 687 * Check to see if the fid is fragmented. The first test 688 * ensures that we don't wander off the end of the buffer 689 * looking for the l_iu and l_fi fields. 690 */ 691 if (ds->off + UDF_FID_SIZE > ds->size || 692 ds->off + le16toh(fid->l_iu) + fid->l_fi + UDF_FID_SIZE > ds->size){ 693 /* Copy what we have of the fid into a buffer */ 694 frag_size = ds->size - ds->off; 695 if (frag_size >= ds->udfmp->bsize) { 696 printf("udf: invalid FID fragment\n"); 697 ds->error = EINVAL; 698 return (NULL); 699 } 700 701 /* 702 * File ID descriptors can only be at most one 703 * logical sector in size. 704 */ 705 ds->buf = malloc(ds->udfmp->bsize, M_UDFFID, 706 M_WAITOK | M_ZERO); 707 bcopy(fid, ds->buf, frag_size); 708 709 /* Reduce all of the casting magic */ 710 fid = (struct fileid_desc*)ds->buf; 711 712 if (ds->bp != NULL) 713 brelse(ds->bp); 714 715 /* Fetch the next allocation */ 716 ds->offset += ds->size; 717 ds->size = 0; 718 error = udf_readatoffset(ds->node, &ds->size, ds->offset, 719 &ds->bp, &ds->data); 720 if (error) { 721 ds->error = error; 722 return (NULL); 723 } 724 725 /* 726 * If the fragment was so small that we didn't get 727 * the l_iu and l_fi fields, copy those in. 728 */ 729 if (frag_size < UDF_FID_SIZE) 730 bcopy(ds->data, &ds->buf[frag_size], 731 UDF_FID_SIZE - frag_size); 732 733 /* 734 * Now that we have enough of the fid to work with, 735 * copy in the rest of the fid from the new 736 * allocation. 737 */ 738 total_fid_size = UDF_FID_SIZE + le16toh(fid->l_iu) + fid->l_fi; 739 if (total_fid_size > ds->udfmp->bsize) { 740 printf("udf: invalid FID\n"); 741 ds->error = EIO; 742 return (NULL); 743 } 744 bcopy(ds->data, &ds->buf[frag_size], 745 total_fid_size - frag_size); 746 747 ds->fid_fragment = 1; 748 } else { 749 total_fid_size = le16toh(fid->l_iu) + fid->l_fi + UDF_FID_SIZE; 750 } 751 752 /* 753 * Update the offset. Align on a 4 byte boundary because the 754 * UDF spec says so. 755 */ 756 ds->this_off = ds->offset + ds->off; 757 if (!ds->fid_fragment) { 758 ds->off += (total_fid_size + 3) & ~0x03; 759 } else { 760 ds->off = (total_fid_size - frag_size + 3) & ~0x03; 761 } 762 763 return (fid); 764 } 765 766 static void 767 udf_closedir(struct udf_dirstream *ds) 768 { 769 770 if (ds->bp != NULL) 771 brelse(ds->bp); 772 773 if (ds->fid_fragment && ds->buf != NULL) 774 free(ds->buf, M_UDFFID); 775 776 uma_zfree(udf_zone_ds, ds); 777 } 778 779 static int 780 udf_readdir(struct vop_readdir_args *a) 781 { 782 struct vnode *vp; 783 struct uio *uio; 784 struct dirent dir; 785 struct udf_node *node; 786 struct udf_mnt *udfmp; 787 struct fileid_desc *fid; 788 struct udf_uiodir uiodir; 789 struct udf_dirstream *ds; 790 uint64_t *cookies = NULL; 791 int ncookies; 792 int error = 0; 793 794 vp = a->a_vp; 795 uio = a->a_uio; 796 node = VTON(vp); 797 udfmp = node->udfmp; 798 uiodir.eofflag = 1; 799 800 if (a->a_ncookies != NULL) { 801 /* 802 * Guess how many entries are needed. If we run out, this 803 * function will be called again and thing will pick up were 804 * it left off. 805 */ 806 ncookies = uio->uio_resid / 8; 807 cookies = malloc(sizeof(*cookies) * ncookies, M_TEMP, M_WAITOK); 808 if (cookies == NULL) 809 return (ENOMEM); 810 uiodir.ncookies = ncookies; 811 uiodir.cookies = cookies; 812 uiodir.acookies = 0; 813 } else { 814 uiodir.cookies = NULL; 815 } 816 817 /* 818 * Iterate through the file id descriptors. Give the parent dir 819 * entry special attention. 820 */ 821 ds = udf_opendir(node, uio->uio_offset, le64toh(node->fentry->inf_len), 822 node->udfmp); 823 824 while ((fid = udf_getfid(ds)) != NULL) { 825 /* XXX Should we return an error on a bad fid? */ 826 if (udf_checktag(&fid->tag, TAGID_FID)) { 827 printf("Invalid FID tag\n"); 828 hexdump(fid, UDF_FID_SIZE, NULL, 0); 829 error = EIO; 830 break; 831 } 832 833 /* Is this a deleted file? */ 834 if (fid->file_char & UDF_FILE_CHAR_DEL) 835 continue; 836 837 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) { 838 /* Do up the '.' and '..' entries. Dummy values are 839 * used for the cookies since the offset here is 840 * usually zero, and NFS doesn't like that value 841 */ 842 dir.d_fileno = node->hash_id; 843 dir.d_type = DT_DIR; 844 dir.d_name[0] = '.'; 845 dir.d_namlen = 1; 846 dir.d_reclen = GENERIC_DIRSIZ(&dir); 847 dir.d_off = 1; 848 dirent_terminate(&dir); 849 uiodir.dirent = &dir; 850 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 1); 851 if (error) 852 break; 853 854 dir.d_fileno = udf_getid(&fid->icb); 855 dir.d_type = DT_DIR; 856 dir.d_name[0] = '.'; 857 dir.d_name[1] = '.'; 858 dir.d_namlen = 2; 859 dir.d_reclen = GENERIC_DIRSIZ(&dir); 860 dir.d_off = 2; 861 dirent_terminate(&dir); 862 uiodir.dirent = &dir; 863 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 2); 864 } else { 865 dir.d_namlen = udf_transname(&fid->data[fid->l_iu], 866 &dir.d_name[0], fid->l_fi, udfmp); 867 dir.d_fileno = udf_getid(&fid->icb); 868 dir.d_type = (fid->file_char & UDF_FILE_CHAR_DIR) ? 869 DT_DIR : DT_UNKNOWN; 870 dir.d_reclen = GENERIC_DIRSIZ(&dir); 871 dir.d_off = ds->this_off; 872 dirent_terminate(&dir); 873 uiodir.dirent = &dir; 874 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 875 ds->this_off); 876 } 877 if (error) 878 break; 879 uio->uio_offset = ds->offset + ds->off; 880 } 881 882 /* tell the calling layer whether we need to be called again */ 883 *a->a_eofflag = uiodir.eofflag; 884 885 if (error < 0) 886 error = 0; 887 if (!error) 888 error = ds->error; 889 890 udf_closedir(ds); 891 892 if (a->a_ncookies != NULL) { 893 if (error) 894 free(cookies, M_TEMP); 895 else { 896 *a->a_ncookies = uiodir.acookies; 897 *a->a_cookies = cookies; 898 } 899 } 900 901 return (error); 902 } 903 904 static int 905 udf_readlink(struct vop_readlink_args *ap) 906 { 907 struct path_component *pc, *end; 908 struct vnode *vp; 909 struct uio uio; 910 struct iovec iov[1]; 911 struct udf_node *node; 912 void *buf; 913 char *cp; 914 int error, len, root; 915 916 /* 917 * A symbolic link in UDF is a list of variable-length path 918 * component structures. We build a pathname in the caller's 919 * uio by traversing this list. 920 */ 921 vp = ap->a_vp; 922 node = VTON(vp); 923 len = le64toh(node->fentry->inf_len); 924 buf = malloc(len, M_DEVBUF, M_WAITOK); 925 iov[0].iov_len = len; 926 iov[0].iov_base = buf; 927 uio.uio_iov = iov; 928 uio.uio_iovcnt = 1; 929 uio.uio_offset = 0; 930 uio.uio_resid = iov[0].iov_len; 931 uio.uio_segflg = UIO_SYSSPACE; 932 uio.uio_rw = UIO_READ; 933 uio.uio_td = curthread; 934 error = VOP_READ(vp, &uio, 0, ap->a_cred); 935 if (error) 936 goto error; 937 938 pc = buf; 939 end = (void *)((char *)buf + len); 940 root = 0; 941 while (pc < end) { 942 switch (pc->type) { 943 case UDF_PATH_ROOT: 944 /* Only allow this at the beginning of a path. */ 945 if ((void *)pc != buf) { 946 error = EINVAL; 947 goto error; 948 } 949 cp = "/"; 950 len = 1; 951 root = 1; 952 break; 953 case UDF_PATH_DOT: 954 cp = "."; 955 len = 1; 956 break; 957 case UDF_PATH_DOTDOT: 958 cp = ".."; 959 len = 2; 960 break; 961 case UDF_PATH_PATH: 962 if (pc->length == 0) { 963 error = EINVAL; 964 goto error; 965 } 966 /* 967 * XXX: We only support CS8 which appears to map 968 * to ASCII directly. 969 */ 970 switch (pc->identifier[0]) { 971 case 8: 972 cp = pc->identifier + 1; 973 len = pc->length - 1; 974 break; 975 default: 976 error = EOPNOTSUPP; 977 goto error; 978 } 979 break; 980 default: 981 error = EINVAL; 982 goto error; 983 } 984 985 /* 986 * If this is not the first component, insert a path 987 * separator. 988 */ 989 if (pc != buf) { 990 /* If we started with root we already have a "/". */ 991 if (root) 992 goto skipslash; 993 root = 0; 994 if (ap->a_uio->uio_resid < 1) { 995 error = ENAMETOOLONG; 996 goto error; 997 } 998 error = uiomove("/", 1, ap->a_uio); 999 if (error) 1000 break; 1001 } 1002 skipslash: 1003 1004 /* Append string at 'cp' of length 'len' to our path. */ 1005 if (len > ap->a_uio->uio_resid) { 1006 error = ENAMETOOLONG; 1007 goto error; 1008 } 1009 error = uiomove(cp, len, ap->a_uio); 1010 if (error) 1011 break; 1012 1013 /* Advance to next component. */ 1014 pc = (void *)((char *)pc + 4 + pc->length); 1015 } 1016 error: 1017 free(buf, M_DEVBUF); 1018 return (error); 1019 } 1020 1021 static int 1022 udf_strategy(struct vop_strategy_args *a) 1023 { 1024 struct buf *bp; 1025 struct vnode *vp; 1026 struct udf_node *node; 1027 struct bufobj *bo; 1028 off_t offset; 1029 uint32_t maxsize; 1030 daddr_t sector; 1031 int error; 1032 1033 bp = a->a_bp; 1034 vp = a->a_vp; 1035 node = VTON(vp); 1036 1037 if (bp->b_blkno == bp->b_lblkno) { 1038 offset = lblktosize(node->udfmp, bp->b_lblkno); 1039 error = udf_bmap_internal(node, offset, §or, &maxsize); 1040 if (error) { 1041 clrbuf(bp); 1042 bp->b_blkno = -1; 1043 bufdone(bp); 1044 return (0); 1045 } 1046 /* bmap gives sector numbers, bio works with device blocks */ 1047 bp->b_blkno = sector << (node->udfmp->bshift - DEV_BSHIFT); 1048 } 1049 bo = node->udfmp->im_bo; 1050 bp->b_iooffset = dbtob(bp->b_blkno); 1051 BO_STRATEGY(bo, bp); 1052 return (0); 1053 } 1054 1055 static int 1056 udf_bmap(struct vop_bmap_args *a) 1057 { 1058 struct udf_node *node; 1059 uint32_t max_size; 1060 daddr_t lsector; 1061 int nblk; 1062 int error; 1063 1064 node = VTON(a->a_vp); 1065 1066 if (a->a_bop != NULL) 1067 *a->a_bop = &node->udfmp->im_devvp->v_bufobj; 1068 if (a->a_bnp == NULL) 1069 return (0); 1070 if (a->a_runb) 1071 *a->a_runb = 0; 1072 1073 /* 1074 * UDF_INVALID_BMAP means data embedded into fentry, this is an internal 1075 * error that should not be propagated to calling code. 1076 * Most obvious mapping for this error is EOPNOTSUPP as we can not truly 1077 * translate block numbers in this case. 1078 * Incidentally, this return code will make vnode pager to use VOP_READ 1079 * to get data for mmap-ed pages and udf_read knows how to do the right 1080 * thing for this kind of files. 1081 */ 1082 error = udf_bmap_internal(node, a->a_bn << node->udfmp->bshift, 1083 &lsector, &max_size); 1084 if (error == UDF_INVALID_BMAP) 1085 return (EOPNOTSUPP); 1086 if (error) 1087 return (error); 1088 1089 /* Translate logical to physical sector number */ 1090 *a->a_bnp = lsector << (node->udfmp->bshift - DEV_BSHIFT); 1091 1092 /* 1093 * Determine maximum number of readahead blocks following the 1094 * requested block. 1095 */ 1096 if (a->a_runp) { 1097 nblk = (max_size >> node->udfmp->bshift) - 1; 1098 if (nblk <= 0) 1099 *a->a_runp = 0; 1100 else if (nblk >= (MAXBSIZE >> node->udfmp->bshift)) 1101 *a->a_runp = (MAXBSIZE >> node->udfmp->bshift) - 1; 1102 else 1103 *a->a_runp = nblk; 1104 } 1105 1106 if (a->a_runb) { 1107 *a->a_runb = 0; 1108 } 1109 1110 return (0); 1111 } 1112 1113 /* 1114 * The all powerful VOP_LOOKUP(). 1115 */ 1116 static int 1117 udf_lookup(struct vop_cachedlookup_args *a) 1118 { 1119 struct vnode *dvp; 1120 struct vnode *tdp = NULL; 1121 struct vnode **vpp = a->a_vpp; 1122 struct udf_node *node; 1123 struct udf_mnt *udfmp; 1124 struct fileid_desc *fid = NULL; 1125 struct udf_dirstream *ds; 1126 u_long nameiop; 1127 u_long flags; 1128 char *nameptr; 1129 long namelen; 1130 ino_t id = 0; 1131 int offset, error = 0; 1132 int fsize, lkflags, ltype, numdirpasses; 1133 1134 dvp = a->a_dvp; 1135 node = VTON(dvp); 1136 udfmp = node->udfmp; 1137 nameiop = a->a_cnp->cn_nameiop; 1138 flags = a->a_cnp->cn_flags; 1139 lkflags = a->a_cnp->cn_lkflags; 1140 nameptr = a->a_cnp->cn_nameptr; 1141 namelen = a->a_cnp->cn_namelen; 1142 fsize = le64toh(node->fentry->inf_len); 1143 1144 /* 1145 * If this is a LOOKUP and we've already partially searched through 1146 * the directory, pick up where we left off and flag that the 1147 * directory may need to be searched twice. For a full description, 1148 * see /sys/fs/cd9660/cd9660_lookup.c:cd9660_lookup() 1149 */ 1150 if (nameiop != LOOKUP || node->diroff == 0 || node->diroff > fsize) { 1151 offset = 0; 1152 numdirpasses = 1; 1153 } else { 1154 offset = node->diroff; 1155 numdirpasses = 2; 1156 nchstats.ncs_2passes++; 1157 } 1158 1159 lookloop: 1160 ds = udf_opendir(node, offset, fsize, udfmp); 1161 1162 while ((fid = udf_getfid(ds)) != NULL) { 1163 /* XXX Should we return an error on a bad fid? */ 1164 if (udf_checktag(&fid->tag, TAGID_FID)) { 1165 printf("udf_lookup: Invalid tag\n"); 1166 error = EIO; 1167 break; 1168 } 1169 1170 /* Is this a deleted file? */ 1171 if (fid->file_char & UDF_FILE_CHAR_DEL) 1172 continue; 1173 1174 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) { 1175 if (flags & ISDOTDOT) { 1176 id = udf_getid(&fid->icb); 1177 break; 1178 } 1179 } else { 1180 if (!(udf_cmpname(&fid->data[fid->l_iu], 1181 nameptr, fid->l_fi, namelen, udfmp))) { 1182 id = udf_getid(&fid->icb); 1183 break; 1184 } 1185 } 1186 } 1187 1188 if (!error) 1189 error = ds->error; 1190 1191 /* XXX Bail out here? */ 1192 if (error) { 1193 udf_closedir(ds); 1194 return (error); 1195 } 1196 1197 /* Did we have a match? */ 1198 if (id) { 1199 /* 1200 * Remember where this entry was if it's the final 1201 * component. 1202 */ 1203 if ((flags & ISLASTCN) && nameiop == LOOKUP) 1204 node->diroff = ds->offset + ds->off; 1205 if (numdirpasses == 2) 1206 nchstats.ncs_pass2++; 1207 udf_closedir(ds); 1208 1209 if (flags & ISDOTDOT) { 1210 error = vn_vget_ino(dvp, id, lkflags, &tdp); 1211 } else if (node->hash_id == id) { 1212 VREF(dvp); /* we want ourself, ie "." */ 1213 /* 1214 * When we lookup "." we still can be asked to lock it 1215 * differently. 1216 */ 1217 ltype = lkflags & LK_TYPE_MASK; 1218 if (ltype != VOP_ISLOCKED(dvp)) { 1219 if (ltype == LK_EXCLUSIVE) 1220 vn_lock(dvp, LK_UPGRADE | LK_RETRY); 1221 else /* if (ltype == LK_SHARED) */ 1222 vn_lock(dvp, LK_DOWNGRADE | LK_RETRY); 1223 } 1224 tdp = dvp; 1225 } else 1226 error = udf_vget(udfmp->im_mountp, id, lkflags, &tdp); 1227 if (!error) { 1228 *vpp = tdp; 1229 /* Put this entry in the cache */ 1230 if (flags & MAKEENTRY) 1231 cache_enter(dvp, *vpp, a->a_cnp); 1232 } 1233 } else { 1234 /* Name wasn't found on this pass. Do another pass? */ 1235 if (numdirpasses == 2) { 1236 numdirpasses--; 1237 offset = 0; 1238 udf_closedir(ds); 1239 goto lookloop; 1240 } 1241 udf_closedir(ds); 1242 1243 /* Enter name into cache as non-existant */ 1244 if (flags & MAKEENTRY) 1245 cache_enter(dvp, *vpp, a->a_cnp); 1246 1247 if ((flags & ISLASTCN) && 1248 (nameiop == CREATE || nameiop == RENAME)) { 1249 error = EROFS; 1250 } else { 1251 error = ENOENT; 1252 } 1253 } 1254 1255 return (error); 1256 } 1257 1258 static int 1259 udf_reclaim(struct vop_reclaim_args *a) 1260 { 1261 struct vnode *vp; 1262 struct udf_node *unode; 1263 1264 vp = a->a_vp; 1265 unode = VTON(vp); 1266 1267 if (unode != NULL) { 1268 vfs_hash_remove(vp); 1269 1270 if (unode->fentry != NULL) 1271 free(unode->fentry, M_UDFFENTRY); 1272 uma_zfree(udf_zone_node, unode); 1273 vp->v_data = NULL; 1274 } 1275 1276 return (0); 1277 } 1278 1279 static int 1280 udf_vptofh(struct vop_vptofh_args *a) 1281 { 1282 struct udf_node *node; 1283 struct ifid *ifhp; 1284 1285 node = VTON(a->a_vp); 1286 ifhp = (struct ifid *)a->a_fhp; 1287 ifhp->ifid_len = sizeof(struct ifid); 1288 ifhp->ifid_ino = node->hash_id; 1289 1290 return (0); 1291 } 1292 1293 /* 1294 * Read the block and then set the data pointer to correspond with the 1295 * offset passed in. Only read in at most 'size' bytes, and then set 'size' 1296 * to the number of bytes pointed to. If 'size' is zero, try to read in a 1297 * whole extent. 1298 * 1299 * Note that *bp may be assigned error or not. 1300 * 1301 */ 1302 static int 1303 udf_readatoffset(struct udf_node *node, int *size, off_t offset, 1304 struct buf **bp, uint8_t **data) 1305 { 1306 struct udf_mnt *udfmp = node->udfmp; 1307 struct vnode *vp = node->i_vnode; 1308 struct file_entry *fentry; 1309 struct buf *bp1; 1310 uint32_t max_size; 1311 daddr_t sector; 1312 off_t off; 1313 int adj_size; 1314 int error; 1315 1316 /* 1317 * This call is made *not* only to detect UDF_INVALID_BMAP case, 1318 * max_size is used as an ad-hoc read-ahead hint for "normal" case. 1319 */ 1320 error = udf_bmap_internal(node, offset, §or, &max_size); 1321 if (error == UDF_INVALID_BMAP) { 1322 /* 1323 * This error means that the file *data* is stored in the 1324 * allocation descriptor field of the file entry. 1325 */ 1326 fentry = node->fentry; 1327 *data = &fentry->data[le32toh(fentry->l_ea)]; 1328 *size = le32toh(fentry->l_ad); 1329 if (offset >= *size) 1330 *size = 0; 1331 else { 1332 *data += offset; 1333 *size -= offset; 1334 } 1335 return (0); 1336 } else if (error != 0) { 1337 return (error); 1338 } 1339 1340 /* Adjust the size so that it is within range */ 1341 if (*size == 0 || *size > max_size) 1342 *size = max_size; 1343 1344 /* 1345 * Because we will read starting at block boundary, we need to adjust 1346 * how much we need to read so that all promised data is in. 1347 * Also, we can't promise to read more than MAXBSIZE bytes starting 1348 * from block boundary, so adjust what we promise too. 1349 */ 1350 off = blkoff(udfmp, offset); 1351 *size = min(*size, MAXBSIZE - off); 1352 adj_size = (*size + off + udfmp->bmask) & ~udfmp->bmask; 1353 *bp = NULL; 1354 if ((error = bread(vp, lblkno(udfmp, offset), adj_size, NOCRED, bp))) { 1355 printf("warning: udf_readlblks returned error %d\n", error); 1356 /* note: *bp may be non-NULL */ 1357 return (error); 1358 } 1359 1360 bp1 = *bp; 1361 *data = (uint8_t *)&bp1->b_data[offset & udfmp->bmask]; 1362 return (0); 1363 } 1364 1365 /* 1366 * Translate a file offset into a logical block and then into a physical 1367 * block. 1368 * max_size - maximum number of bytes that can be read starting from given 1369 * offset, rather than beginning of calculated sector number 1370 */ 1371 static int 1372 udf_bmap_internal(struct udf_node *node, off_t offset, daddr_t *sector, 1373 uint32_t *max_size) 1374 { 1375 struct udf_mnt *udfmp; 1376 struct file_entry *fentry; 1377 void *icb; 1378 struct icb_tag *tag; 1379 uint32_t icblen = 0; 1380 daddr_t lsector; 1381 int ad_offset, ad_num = 0; 1382 int i, p_offset; 1383 1384 udfmp = node->udfmp; 1385 fentry = node->fentry; 1386 tag = &fentry->icbtag; 1387 1388 switch (le16toh(tag->strat_type)) { 1389 case 4: 1390 break; 1391 1392 case 4096: 1393 printf("Cannot deal with strategy4096 yet!\n"); 1394 return (ENODEV); 1395 1396 default: 1397 printf("Unknown strategy type %d\n", tag->strat_type); 1398 return (ENODEV); 1399 } 1400 1401 switch (le16toh(tag->flags) & 0x7) { 1402 case 0: 1403 /* 1404 * The allocation descriptor field is filled with short_ad's. 1405 * If the offset is beyond the current extent, look for the 1406 * next extent. 1407 */ 1408 do { 1409 offset -= icblen; 1410 ad_offset = sizeof(struct short_ad) * ad_num; 1411 if (ad_offset > le32toh(fentry->l_ad)) { 1412 printf("File offset out of bounds\n"); 1413 return (EINVAL); 1414 } 1415 icb = GETICB(short_ad, fentry, 1416 le32toh(fentry->l_ea) + ad_offset); 1417 icblen = GETICBLEN(short_ad, icb); 1418 ad_num++; 1419 } while(offset >= icblen); 1420 1421 lsector = (offset >> udfmp->bshift) + 1422 le32toh(((struct short_ad *)(icb))->pos); 1423 1424 *max_size = icblen - offset; 1425 1426 break; 1427 case 1: 1428 /* 1429 * The allocation descriptor field is filled with long_ad's 1430 * If the offset is beyond the current extent, look for the 1431 * next extent. 1432 */ 1433 do { 1434 offset -= icblen; 1435 ad_offset = sizeof(struct long_ad) * ad_num; 1436 if (ad_offset > le32toh(fentry->l_ad)) { 1437 printf("File offset out of bounds\n"); 1438 return (EINVAL); 1439 } 1440 icb = GETICB(long_ad, fentry, 1441 le32toh(fentry->l_ea) + ad_offset); 1442 icblen = GETICBLEN(long_ad, icb); 1443 ad_num++; 1444 } while(offset >= icblen); 1445 1446 lsector = (offset >> udfmp->bshift) + 1447 le32toh(((struct long_ad *)(icb))->loc.lb_num); 1448 1449 *max_size = icblen - offset; 1450 1451 break; 1452 case 3: 1453 /* 1454 * This type means that the file *data* is stored in the 1455 * allocation descriptor field of the file entry. 1456 */ 1457 *max_size = 0; 1458 *sector = node->hash_id + udfmp->part_start; 1459 1460 return (UDF_INVALID_BMAP); 1461 case 2: 1462 /* DirectCD does not use extended_ad's */ 1463 default: 1464 printf("Unsupported allocation descriptor %d\n", 1465 tag->flags & 0x7); 1466 return (ENODEV); 1467 } 1468 1469 *sector = lsector + udfmp->part_start; 1470 1471 /* 1472 * Check the sparing table. Each entry represents the beginning of 1473 * a packet. 1474 */ 1475 if (udfmp->s_table != NULL) { 1476 for (i = 0; i< udfmp->s_table_entries; i++) { 1477 p_offset = 1478 lsector - le32toh(udfmp->s_table->entries[i].org); 1479 if ((p_offset < udfmp->p_sectors) && (p_offset >= 0)) { 1480 *sector = 1481 le32toh(udfmp->s_table->entries[i].map) + 1482 p_offset; 1483 break; 1484 } 1485 } 1486 } 1487 1488 return (0); 1489 }
Cache object: b6c48d137ca9af836b692d5dff41ad00
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]