2 * Copyright (c) 2001, 2002 Scott Long <scottl@freebsd.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
26 * $FreeBSD: src/sys/fs/udf/udf_vnops.c,v 1.33 2003/12/07 05:04:49 scottl Exp $
30 /* Take care of the vnode side of things */
32 #include <sys/param.h>
33 #include <sys/systm.h>
35 #include <sys/namei.h>
36 #include <sys/kernel.h>
37 #include <sys/malloc.h>
39 #include <sys/module.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>
48 #include <machine/inttypes.h>
52 #include <vfs/udf/ecma167-udf.h>
53 #include <vfs/udf/osta.h>
54 #include <vfs/udf/udf.h>
55 #include <vfs/udf/udf_mount.h>
57 static int udf_access(struct vop_access_args *);
58 static int udf_getattr(struct vop_getattr_args *);
59 static int udf_ioctl(struct vop_ioctl_args *);
60 static int udf_pathconf(struct vop_pathconf_args *);
61 static int udf_read(struct vop_read_args *);
62 static int udf_readdir(struct vop_readdir_args *);
63 static int udf_readlink(struct vop_readlink_args *ap);
64 static int udf_strategy(struct vop_strategy_args *);
65 static int udf_bmap(struct vop_bmap_args *);
66 static int udf_lookup(struct vop_old_lookup_args *);
67 static int udf_reclaim(struct vop_reclaim_args *);
68 static int udf_readatoffset(struct udf_node *, int *, int, struct buf **, uint8_t **);
69 static int udf_bmap_internal(struct udf_node *, uint32_t, daddr_t *, uint32_t *);
71 struct vop_ops udf_vnode_vops = {
72 .vop_default = vop_defaultop,
73 .vop_access = udf_access,
75 .vop_old_lookup = udf_lookup,
76 .vop_getattr = udf_getattr,
77 .vop_ioctl = udf_ioctl,
78 .vop_pathconf = udf_pathconf,
80 .vop_readdir = udf_readdir,
81 .vop_readlink = udf_readlink,
82 .vop_reclaim = udf_reclaim,
83 .vop_strategy = udf_strategy
86 MALLOC_DEFINE(M_UDFFID, "UDF FID", "UDF FileId structure");
87 MALLOC_DEFINE(M_UDFDS, "UDF DS", "UDF Dirstream structure");
89 #define UDF_INVALID_BMAP -1
91 /* Look up a udf_node based on the ino_t passed in and return it's vnode */
93 udf_hashlookup(struct udf_mnt *udfmp, ino_t id, struct vnode **vpp)
95 struct udf_node *node;
96 struct udf_hash_lh *lh;
101 lwkt_gettoken(&udfmp->hash_token);
103 lh = &udfmp->hashtbl[id % udfmp->hashsz];
105 lwkt_reltoken(&udfmp->hash_token);
108 LIST_FOREACH(node, lh, le) {
109 if (node->hash_id != id)
112 if (vget(vp, LK_EXCLUSIVE))
115 * We must check to see if the inode has been ripped
116 * out from under us after blocking.
118 lh = &udfmp->hashtbl[id % udfmp->hashsz];
119 LIST_FOREACH(node, lh, le) {
120 if (node->hash_id == id)
123 if (node == NULL || vp != node->i_vnode) {
127 lwkt_reltoken(&udfmp->hash_token);
132 lwkt_reltoken(&udfmp->hash_token);
137 udf_hashins(struct udf_node *node)
139 struct udf_mnt *udfmp;
140 struct udf_hash_lh *lh;
144 lwkt_gettoken(&udfmp->hash_token);
145 lh = &udfmp->hashtbl[node->hash_id % udfmp->hashsz];
146 LIST_INSERT_HEAD(lh, node, le);
147 lwkt_reltoken(&udfmp->hash_token);
153 udf_hashrem(struct udf_node *node)
155 struct udf_mnt *udfmp;
156 struct udf_hash_lh *lh;
160 lwkt_gettoken(&udfmp->hash_token);
161 lh = &udfmp->hashtbl[node->hash_id % udfmp->hashsz];
163 panic("hash entry is NULL, node->hash_id= %"PRId64, node->hash_id);
164 LIST_REMOVE(node, le);
165 lwkt_reltoken(&udfmp->hash_token);
171 udf_allocv(struct mount *mp, struct vnode **vpp)
176 error = getnewvnode(VT_UDF, mp, &vp, 0, 0);
178 kprintf("udf_allocv: failed to allocate new vnode\n");
186 /* Convert file entry permission (5 bits per owner/group/user) to a mode_t */
188 udf_permtomode(struct udf_node *node)
194 perm = node->fentry->perm;
195 flags = node->fentry->icbtag.flags;
197 mode = perm & UDF_FENTRY_PERM_USER_MASK;
198 mode |= ((perm & UDF_FENTRY_PERM_GRP_MASK) >> 2);
199 mode |= ((perm & UDF_FENTRY_PERM_OWNER_MASK) >> 4);
200 mode |= ((flags & UDF_ICB_TAG_FLAGS_STICKY) << 4);
201 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETGID) << 6);
202 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETUID) << 8);
208 udf_access(struct vop_access_args *a)
211 struct udf_node *node;
215 KKASSERT(vp->v_mount->mnt_flag & MNT_RDONLY);
216 return (vop_helper_access(a, node->fentry->uid, node->fentry->gid,
217 udf_permtomode(node), 0));
220 static int mon_lens[2][12] = {
221 {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
222 {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}
226 udf_isaleapyear(int year)
230 i = (year % 4) ? 0 : 1;
231 i &= (year % 100) ? 1 : 0;
232 i |= (year % 400) ? 0 : 1;
238 * XXX This is just a rough hack. Daylight savings isn't calculated and tv_nsec
240 * Timezone calculation compliments of Julian Elischer <julian@elischer.org>.
243 udf_timetotimespec(struct timestamp *time, struct timespec *t)
245 int i, lpyear, daysinyear;
247 uint16_t u_tz_offset;
253 /* DirectCD seems to like using bogus year values */
254 if (time->year < 1970) {
259 /* Calculate the time and day */
260 t->tv_sec = time->second;
261 t->tv_sec += time->minute * 60;
262 t->tv_sec += time->hour * 3600;
263 t->tv_sec += time->day * 3600 * 24;
265 /* Calclulate the month */
266 lpyear = udf_isaleapyear(time->year);
267 for (i = 1; i < time->month; i++)
268 t->tv_sec += mon_lens[lpyear][i] * 3600 * 24;
270 /* Speed up the calculation */
271 if (time->year > 1979)
272 t->tv_sec += 315532800;
273 if (time->year > 1989)
274 t->tv_sec += 315619200;
275 if (time->year > 1999)
276 t->tv_sec += 315532800;
277 for (i = 2000; i < time->year; i++) {
278 daysinyear = udf_isaleapyear(i) + 365 ;
279 t->tv_sec += daysinyear * 3600 * 24;
283 * Calculate the time zone. The timezone is 12 bit signed 2's
284 * compliment, so we gotta do some extra magic to handle it right.
286 tz.u_tz_offset = time->type_tz;
287 tz.u_tz_offset &= 0x0fff;
288 if (tz.u_tz_offset & 0x0800)
289 tz.u_tz_offset |= 0xf000; /* extend the sign to 16 bits */
290 if ((time->type_tz & 0x1000) && (tz.s_tz_offset != -2047))
291 t->tv_sec -= tz.s_tz_offset * 60;
297 udf_getattr(struct vop_getattr_args *a)
300 struct udf_node *node;
302 struct file_entry *fentry;
307 fentry = node->fentry;
309 vap->va_fsid = devid_from_dev(node->i_dev);
310 vap->va_fileid = node->hash_id;
311 vap->va_mode = udf_permtomode(node);
312 vap->va_nlink = fentry->link_cnt;
314 * XXX The spec says that -1 is valid for uid/gid and indicates an
315 * invalid uid/gid. How should this be represented?
317 vap->va_uid = (fentry->uid == 0xffffffff) ? 0 : fentry->uid;
318 vap->va_gid = (fentry->gid == 0xffffffff) ? 0 : fentry->gid;
319 udf_timetotimespec(&fentry->atime, &vap->va_atime);
320 udf_timetotimespec(&fentry->mtime, &vap->va_mtime);
321 vap->va_ctime = vap->va_mtime; /* XXX Stored as an Extended Attribute */
322 vap->va_rmajor = VNOVAL;
323 vap->va_rminor = VNOVAL;
324 if (vp->v_type & VDIR) {
326 * Directories that are recorded within their ICB will show
327 * as having 0 blocks recorded. Since tradition dictates
328 * that directories consume at least one logical block,
331 if (fentry->logblks_rec != 0)
332 vap->va_size = fentry->logblks_rec * node->udfmp->bsize;
334 vap->va_size = node->udfmp->bsize;
336 vap->va_size = fentry->inf_len;
339 vap->va_blocksize = node->udfmp->bsize;
340 vap->va_bytes = fentry->inf_len;
341 vap->va_type = vp->v_type;
342 vap->va_filerev = 0; /* XXX */
347 * File specific ioctls. DeCSS candidate?
350 udf_ioctl(struct vop_ioctl_args *a)
352 kprintf("%s called\n", __func__);
357 * I'm not sure that this has much value in a read-only filesystem, but
361 udf_pathconf(struct vop_pathconf_args *a)
366 *a->a_retval = 65535;
369 *a->a_retval = NAME_MAX;
372 *a->a_retval = PATH_MAX;
383 udf_read(struct vop_read_args *a)
385 struct vnode *vp = a->a_vp;
386 struct uio *uio = a->a_uio;
387 struct udf_node *node = VTON(vp);
391 int size, fsize, offset;
393 if (uio->uio_offset < 0)
396 fsize = node->fentry->inf_len;
398 while (uio->uio_offset < fsize && uio->uio_resid > 0) {
399 offset = uio->uio_offset;
400 size = uio->uio_resid;
401 error = udf_readatoffset(node, &size, offset, &bp, &data);
403 error = uiomove(data, size, uio);
414 * Call the OSTA routines to translate the name from a CS0 dstring to a
415 * 16-bit Unicode String. Hooks need to be placed in here to translate from
416 * Unicode to the encoding that the kernel/user expects. Return the length
417 * of the translated string.
420 udf_transname(char *cs0string, char *destname, int len, struct udf_mnt *udfmp)
422 unicode_t *transname;
423 int i, unilen = 0, destlen;
425 /* Convert 16-bit Unicode to destname */
426 /* allocate a buffer big enough to hold an 8->16 bit expansion */
427 transname = kmalloc(NAME_MAX * sizeof(unicode_t), M_TEMP, M_WAITOK | M_ZERO);
429 if ((unilen = udf_UncompressUnicode(len, cs0string, transname)) == -1) {
430 kprintf("udf: Unicode translation failed\n");
431 kfree(transname, M_TEMP);
435 for (i = 0; i < unilen ; i++)
436 if (transname[i] & 0xff00)
437 destname[i] = '.'; /* Fudge the 16bit chars */
439 destname[i] = transname[i] & 0xff;
440 kfree(transname, M_TEMP);
441 destname[unilen] = 0;
448 * Compare a CS0 dstring with a name passed in from the VFS layer. Return
449 * 0 on a successful match, nonzero therwise. Unicode work may need to be done
453 udf_cmpname(char *cs0string, char *cmpname, int cs0len, int cmplen, struct udf_mnt *udfmp)
458 /* This is overkill, but not worth creating a new zone */
460 transname = kmalloc(NAME_MAX * sizeof(unicode_t), M_TEMP,
463 cs0len = udf_transname(cs0string, transname, cs0len, udfmp);
465 /* Easy check. If they aren't the same length, they aren't equal */
466 if ((cs0len == 0) || (cs0len != cmplen))
469 error = bcmp(transname, cmpname, cmplen);
471 kfree(transname, M_TEMP);
476 struct dirent *dirent;
483 static struct udf_dirstream *
484 udf_opendir(struct udf_node *node, int offset, int fsize, struct udf_mnt *udfmp)
486 struct udf_dirstream *ds;
488 ds = kmalloc(sizeof(*ds), M_UDFDS, M_WAITOK | M_ZERO);
498 static struct fileid_desc *
499 udf_getfid(struct udf_dirstream *ds)
501 struct fileid_desc *fid;
502 int error, frag_size = 0, total_fid_size;
504 /* End of directory? */
505 if (ds->offset + ds->off >= ds->fsize) {
510 /* Grab the first extent of the directory */
515 error = udf_readatoffset(ds->node, &ds->size, ds->offset,
524 * Clean up from a previous fragmented FID.
525 * XXX Is this the right place for this?
527 if (ds->fid_fragment && ds->buf != NULL) {
528 ds->fid_fragment = 0;
529 kfree(ds->buf, M_UDFFID);
532 fid = (struct fileid_desc*)&ds->data[ds->off];
535 * Check to see if the fid is fragmented. The first test
536 * ensures that we don't wander off the end of the buffer
537 * looking for the l_iu and l_fi fields.
539 if (ds->off + UDF_FID_SIZE > ds->size ||
540 ds->off + fid->l_iu + fid->l_fi + UDF_FID_SIZE > ds->size) {
542 /* Copy what we have of the fid into a buffer */
543 frag_size = ds->size - ds->off;
544 if (frag_size >= ds->udfmp->bsize) {
545 kprintf("udf: invalid FID fragment\n");
551 * File ID descriptors can only be at most one
552 * logical sector in size.
554 ds->buf = kmalloc(ds->udfmp->bsize, M_UDFFID, M_WAITOK | M_ZERO);
555 bcopy(fid, ds->buf, frag_size);
557 /* Reduce all of the casting magic */
558 fid = (struct fileid_desc*)ds->buf;
563 /* Fetch the next allocation */
564 ds->offset += ds->size;
566 error = udf_readatoffset(ds->node, &ds->size, ds->offset,
574 * If the fragment was so small that we didn't get
575 * the l_iu and l_fi fields, copy those in.
577 if (frag_size < UDF_FID_SIZE)
578 bcopy(ds->data, &ds->buf[frag_size],
579 UDF_FID_SIZE - frag_size);
582 * Now that we have enough of the fid to work with,
583 * copy in the rest of the fid from the new
586 total_fid_size = UDF_FID_SIZE + fid->l_iu + fid->l_fi;
587 if (total_fid_size > ds->udfmp->bsize) {
588 kprintf("udf: invalid FID\n");
592 bcopy(ds->data, &ds->buf[frag_size],
593 total_fid_size - frag_size);
595 ds->fid_fragment = 1;
597 total_fid_size = fid->l_iu + fid->l_fi + UDF_FID_SIZE;
600 * Update the offset. Align on a 4 byte boundary because the
603 ds->this_off = ds->off;
604 if (!ds->fid_fragment)
605 ds->off += (total_fid_size + 3) & ~0x03;
607 ds->off = (total_fid_size - frag_size + 3) & ~0x03;
613 udf_closedir(struct udf_dirstream *ds)
619 if (ds->fid_fragment && ds->buf != NULL)
620 kfree(ds->buf, M_UDFFID);
626 udf_readdir(struct vop_readdir_args *a)
630 struct udf_node *node;
631 struct udf_mnt *udfmp;
632 struct fileid_desc *fid;
633 struct udf_uiodir uiodir;
634 struct udf_dirstream *ds;
635 off_t *cookies = NULL;
642 error = vn_lock(vp, LK_EXCLUSIVE | LK_RETRY | LK_FAILRECLAIM);
651 if (a->a_ncookies != NULL) {
653 * Guess how many entries are needed. If we run out, this
654 * function will be called again and thing will pick up were
657 ncookies = uio->uio_resid / 8 + 1;
660 cookies = kmalloc(sizeof(off_t) * ncookies, M_TEMP, M_WAITOK);
661 uiodir.ncookies = ncookies;
662 uiodir.cookies = cookies;
665 uiodir.cookies = NULL;
670 * Iterate through the file id descriptors. Give the parent dir
671 * entry special attention.
673 ds = udf_opendir(node, uio->uio_offset, node->fentry->inf_len,
676 name = kmalloc(NAME_MAX, M_TEMP, M_WAITOK);
678 while ((fid = udf_getfid(ds)) != NULL) {
680 /* XXX Should we return an error on a bad fid? */
681 if (udf_checktag(&fid->tag, TAGID_FID)) {
682 kprintf("Invalid FID tag\n");
687 /* Is this a deleted file? */
688 if (fid->file_char & UDF_FILE_CHAR_DEL)
691 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) {
692 /* Do up the '.' and '..' entries. Dummy values are
693 * used for the cookies since the offset here is
694 * usually zero, and NFS doesn't like that value
696 if (uiodir.cookies != NULL) {
697 if (++uiodir.acookies > uiodir.ncookies) {
701 *uiodir.cookies++ = 1;
703 if (vop_write_dirent(&error, uio, node->hash_id, DT_DIR,
712 if (uiodir.cookies != NULL) {
713 if (++uiodir.acookies > uiodir.ncookies) {
717 *uiodir.cookies++ = 2;
719 if (vop_write_dirent(&error, uio, udf_getid(&fid->icb),
729 uint8_t d_type = (fid->file_char & UDF_FILE_CHAR_DIR) ?
731 uint16_t namelen = udf_transname(&fid->data[fid->l_iu],
732 name, fid->l_fi, udfmp);
734 if (uiodir.cookies != NULL) {
735 if (++uiodir.acookies > uiodir.ncookies) {
739 *uiodir.cookies++ = ds->this_off;
741 if (vop_write_dirent(&error, uio, udf_getid(&fid->icb),
742 d_type, namelen, name)) {
752 kprintf("uiomove returned %d\n", error);
760 /* tell the calling layer whether we need to be called again */
761 *a->a_eofflag = uiodir.eofflag;
762 uio->uio_offset = ds->offset + ds->off;
769 if (a->a_ncookies != NULL) {
771 kfree(cookies, M_TEMP);
773 *a->a_ncookies = uiodir.acookies;
774 *a->a_cookies = cookies;
782 /* Are there any implementations out there that do soft-links? */
784 udf_readlink(struct vop_readlink_args *ap)
786 kprintf("%s called\n", __func__);
791 udf_strategy(struct vop_strategy_args *ap)
797 struct udf_node *node;
806 nbio = push_bio(bio);
807 if (nbio->bio_offset == NOOFFSET) {
809 * Files that are embedded in the fentry don't translate well
810 * to a block number. Reject.
812 if (udf_bmap_internal(node,
814 &dblkno, &maxsize)) {
816 nbio->bio_offset = NOOFFSET;
818 nbio->bio_offset = dbtob(dblkno);
821 if (nbio->bio_offset == NOOFFSET) {
822 /* I/O was never started on nbio, must biodone(bio) */
826 vn_strategy(node->i_devvp, nbio);
831 udf_bmap(struct vop_bmap_args *a)
833 struct udf_node *node;
838 node = VTON(a->a_vp);
840 if (a->a_doffsetp == NULL)
843 KKASSERT(a->a_loffset % node->udfmp->bsize == 0);
845 error = udf_bmap_internal(node, a->a_loffset, &lsector, &max_size);
849 /* Translate logical to physical sector number */
850 *a->a_doffsetp = (off_t)lsector << node->udfmp->bshift;
852 /* Punt on read-ahead for now */
861 * The all powerful VOP_LOOKUP().
864 udf_lookup(struct vop_old_lookup_args *a)
867 struct vnode *tdp = NULL;
868 struct vnode **vpp = a->a_vpp;
869 struct udf_node *node;
870 struct udf_mnt *udfmp;
871 struct fileid_desc *fid = NULL;
872 struct udf_dirstream *ds;
878 int offset, error = 0;
879 int numdirpasses, fsize;
884 nameiop = a->a_cnp->cn_nameiop;
885 flags = a->a_cnp->cn_flags;
886 nameptr = a->a_cnp->cn_nameptr;
887 namelen = a->a_cnp->cn_namelen;
888 fsize = node->fentry->inf_len;
893 * If this is a LOOKUP and we've already partially searched through
894 * the directory, pick up where we left off and flag that the
895 * directory may need to be searched twice. For a full description,
896 * see /sys/isofs/cd9660/cd9660_lookup.c:cd9660_lookup()
898 if (nameiop != NAMEI_LOOKUP || node->diroff == 0 ||
899 node->diroff > fsize) {
903 offset = node->diroff;
908 ds = udf_opendir(node, offset, fsize, udfmp);
910 while ((fid = udf_getfid(ds)) != NULL) {
911 /* XXX Should we return an error on a bad fid? */
912 if (udf_checktag(&fid->tag, TAGID_FID)) {
913 kprintf("udf_lookup: Invalid tag\n");
918 /* Is this a deleted file? */
919 if (fid->file_char & UDF_FILE_CHAR_DEL)
922 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) {
923 if (flags & CNP_ISDOTDOT) {
924 id = udf_getid(&fid->icb);
928 if (!(udf_cmpname(&fid->data[fid->l_iu],
929 nameptr, fid->l_fi, namelen, udfmp))) {
930 id = udf_getid(&fid->icb);
939 /* XXX Bail out here? */
945 /* Did we have a match? */
947 error = udf_vget(udfmp->im_mountp, NULL, id, &tdp);
950 * Remember where this entry was if it's the final
953 if (nameiop == NAMEI_LOOKUP)
954 node->diroff = ds->offset + ds->off;
955 if ((flags & CNP_LOCKPARENT) == 0) {
956 a->a_cnp->cn_flags |= CNP_PDIRUNLOCK;
963 /* Name wasn't found on this pass. Do another pass? */
964 if (numdirpasses == 2) {
970 if (nameiop == NAMEI_CREATE || nameiop == NAMEI_RENAME) {
982 udf_reclaim(struct vop_reclaim_args *a)
985 struct udf_node *unode;
992 if (unode->i_devvp) {
993 vrele(unode->i_devvp);
997 if (unode->fentry != NULL)
998 kfree(unode->fentry, M_UDFFENTRY);
999 kfree(unode, M_UDFNODE);
1007 * Read the block and then set the data pointer to correspond with the
1008 * offset passed in. Only read in at most 'size' bytes, and then set 'size'
1009 * to the number of bytes pointed to. If 'size' is zero, try to read in a
1012 * Note that *bp may be assigned error or not.
1014 * XXX 'size' is limited to the logical block size for now due to problems
1018 udf_readatoffset(struct udf_node *node, int *size, int offset, struct buf **bp,
1021 struct udf_mnt *udfmp;
1022 struct file_entry *fentry = NULL;
1028 udfmp = node->udfmp;
1031 error = udf_bmap_internal(node, offset, §or, &max_size);
1032 if (error == UDF_INVALID_BMAP) {
1034 * This error means that the file *data* is stored in the
1035 * allocation descriptor field of the file entry.
1037 fentry = node->fentry;
1038 *data = &fentry->data[fentry->l_ea];
1039 *size = fentry->l_ad;
1041 } else if (error != 0) {
1045 /* Adjust the size so that it is within range */
1046 if (*size == 0 || *size > max_size)
1048 *size = min(*size, MAXBSIZE);
1050 if ((error = udf_readlblks(udfmp, sector, *size, bp))) {
1051 kprintf("warning: udf_readlblks returned error %d\n", error);
1052 /* note: *bp may be non-NULL */
1057 *data = (uint8_t *)&bp1->b_data[offset % udfmp->bsize];
1062 * Translate a file offset into a logical block and then into a physical
1066 udf_bmap_internal(struct udf_node *node, uint32_t offset, daddr_t *sector, uint32_t *max_size)
1068 struct udf_mnt *udfmp;
1069 struct file_entry *fentry;
1071 struct icb_tag *tag;
1072 uint32_t icblen = 0;
1074 int ad_offset, ad_num = 0;
1077 udfmp = node->udfmp;
1078 fentry = node->fentry;
1079 tag = &fentry->icbtag;
1081 switch (tag->strat_type) {
1086 kprintf("Cannot deal with strategy4096 yet!\n");
1090 kprintf("Unknown strategy type %d\n", tag->strat_type);
1094 switch (tag->flags & 0x7) {
1097 * The allocation descriptor field is filled with short_ad's.
1098 * If the offset is beyond the current extent, look for the
1103 ad_offset = sizeof(struct short_ad) * ad_num;
1104 if (ad_offset > fentry->l_ad) {
1105 kprintf("File offset out of bounds\n");
1108 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset);
1109 icblen = GETICBLEN(short_ad, icb);
1111 } while(offset >= icblen);
1113 lsector = (offset >> udfmp->bshift) +
1114 ((struct short_ad *)(icb))->pos;
1116 *max_size = GETICBLEN(short_ad, icb);
1121 * The allocation descriptor field is filled with long_ad's
1122 * If the offset is beyond the current extent, look for the
1127 ad_offset = sizeof(struct long_ad) * ad_num;
1128 if (ad_offset > fentry->l_ad) {
1129 kprintf("File offset out of bounds\n");
1132 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset);
1133 icblen = GETICBLEN(long_ad, icb);
1135 } while(offset >= icblen);
1137 lsector = (offset >> udfmp->bshift) +
1138 ((struct long_ad *)(icb))->loc.lb_num;
1140 *max_size = GETICBLEN(long_ad, icb);
1145 * This type means that the file *data* is stored in the
1146 * allocation descriptor field of the file entry.
1149 *sector = node->hash_id + udfmp->part_start;
1151 return(UDF_INVALID_BMAP);
1153 /* DirectCD does not use extended_ad's */
1155 kprintf("Unsupported allocation descriptor %d\n",
1160 *sector = lsector + udfmp->part_start;
1163 * Check the sparing table. Each entry represents the beginning of
1166 if (udfmp->s_table != NULL) {
1167 for (i = 0; i< udfmp->s_table_entries; i++) {
1168 p_offset = lsector - udfmp->s_table->entries[i].org;
1169 if ((p_offset < udfmp->p_sectors) && (p_offset >= 0)) {
1170 *sector = udfmp->s_table->entries[i].map +