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>
34 #include <sys/namei.h>
35 #include <sys/kernel.h>
36 #include <sys/malloc.h>
38 #include <sys/module.h>
40 #include <sys/iconv.h>
41 #include <sys/mount.h>
42 #include <sys/vnode.h>
43 #include <sys/dirent.h>
44 #include <sys/queue.h>
45 #include <sys/unistd.h>
47 #include <machine/inttypes.h>
49 #include <vfs/udf/ecma167-udf.h>
50 #include <vfs/udf/osta.h>
51 #include <vfs/udf/udf.h>
52 #include <vfs/udf/udf_mount.h>
54 static int udf_access(struct vop_access_args *);
55 static int udf_getattr(struct vop_getattr_args *);
56 static int udf_ioctl(struct vop_ioctl_args *);
57 static int udf_pathconf(struct vop_pathconf_args *);
58 static int udf_read(struct vop_read_args *);
59 static int udf_readdir(struct vop_readdir_args *);
60 static int udf_readlink(struct vop_readlink_args *ap);
61 static int udf_strategy(struct vop_strategy_args *);
62 static int udf_bmap(struct vop_bmap_args *);
63 static int udf_lookup(struct vop_old_lookup_args *);
64 static int udf_reclaim(struct vop_reclaim_args *);
65 static int udf_readatoffset(struct udf_node *, int *, int, struct buf **, uint8_t **);
66 static int udf_bmap_internal(struct udf_node *, uint32_t, daddr_t *, uint32_t *);
68 struct vop_ops udf_vnode_vops = {
69 .vop_default = vop_defaultop,
70 .vop_access = udf_access,
72 .vop_old_lookup = udf_lookup,
73 .vop_getattr = udf_getattr,
74 .vop_ioctl = udf_ioctl,
75 .vop_pathconf = udf_pathconf,
77 .vop_readdir = udf_readdir,
78 .vop_readlink = udf_readlink,
79 .vop_reclaim = udf_reclaim,
80 .vop_strategy = udf_strategy
83 MALLOC_DEFINE(M_UDFFID, "UDF FID", "UDF FileId structure");
84 MALLOC_DEFINE(M_UDFDS, "UDF DS", "UDF Dirstream structure");
86 #define UDF_INVALID_BMAP -1
88 /* Look up a udf_node based on the ino_t passed in and return it's vnode */
90 udf_hashlookup(struct udf_mnt *udfmp, ino_t id, struct vnode **vpp)
92 struct udf_node *node;
93 struct udf_hash_lh *lh;
98 lwkt_gettoken(&udfmp->hash_token);
100 lh = &udfmp->hashtbl[id % udfmp->hashsz];
102 lwkt_reltoken(&udfmp->hash_token);
105 LIST_FOREACH(node, lh, le) {
106 if (node->hash_id != id)
109 if (vget(vp, LK_EXCLUSIVE))
112 * We must check to see if the inode has been ripped
113 * out from under us after blocking.
115 lh = &udfmp->hashtbl[id % udfmp->hashsz];
116 LIST_FOREACH(node, lh, le) {
117 if (node->hash_id == id)
120 if (node == NULL || vp != node->i_vnode) {
124 lwkt_reltoken(&udfmp->hash_token);
129 lwkt_reltoken(&udfmp->hash_token);
134 udf_hashins(struct udf_node *node)
136 struct udf_mnt *udfmp;
137 struct udf_hash_lh *lh;
141 lwkt_gettoken(&udfmp->hash_token);
142 lh = &udfmp->hashtbl[node->hash_id % udfmp->hashsz];
143 LIST_INSERT_HEAD(lh, node, le);
144 lwkt_reltoken(&udfmp->hash_token);
150 udf_hashrem(struct udf_node *node)
152 struct udf_mnt *udfmp;
153 struct udf_hash_lh *lh;
157 lwkt_gettoken(&udfmp->hash_token);
158 lh = &udfmp->hashtbl[node->hash_id % udfmp->hashsz];
160 panic("hash entry is NULL, node->hash_id= %"PRId64"\n", node->hash_id);
161 LIST_REMOVE(node, le);
162 lwkt_reltoken(&udfmp->hash_token);
168 udf_allocv(struct mount *mp, struct vnode **vpp)
173 error = getnewvnode(VT_UDF, mp, &vp, 0, 0);
175 kprintf("udf_allocv: failed to allocate new vnode\n");
183 /* Convert file entry permission (5 bits per owner/group/user) to a mode_t */
185 udf_permtomode(struct udf_node *node)
191 perm = node->fentry->perm;
192 flags = node->fentry->icbtag.flags;
194 mode = perm & UDF_FENTRY_PERM_USER_MASK;
195 mode |= ((perm & UDF_FENTRY_PERM_GRP_MASK) >> 2);
196 mode |= ((perm & UDF_FENTRY_PERM_OWNER_MASK) >> 4);
197 mode |= ((flags & UDF_ICB_TAG_FLAGS_STICKY) << 4);
198 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETGID) << 6);
199 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETUID) << 8);
205 udf_access(struct vop_access_args *a)
208 struct udf_node *node;
212 KKASSERT(vp->v_mount->mnt_flag & MNT_RDONLY);
213 return (vop_helper_access(a, node->fentry->uid, node->fentry->gid,
214 udf_permtomode(node), 0));
217 static int mon_lens[2][12] = {
218 {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
219 {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}
223 udf_isaleapyear(int year)
227 i = (year % 4) ? 0 : 1;
228 i &= (year % 100) ? 1 : 0;
229 i |= (year % 400) ? 0 : 1;
235 * XXX This is just a rough hack. Daylight savings isn't calculated and tv_nsec
237 * Timezone calculation compliments of Julian Elischer <julian@elischer.org>.
240 udf_timetotimespec(struct timestamp *time, struct timespec *t)
242 int i, lpyear, daysinyear;
244 uint16_t u_tz_offset;
250 /* DirectCD seems to like using bogus year values */
251 if (time->year < 1970) {
256 /* Calculate the time and day */
257 t->tv_sec = time->second;
258 t->tv_sec += time->minute * 60;
259 t->tv_sec += time->hour * 3600;
260 t->tv_sec += time->day * 3600 * 24;
262 /* Calclulate the month */
263 lpyear = udf_isaleapyear(time->year);
264 for (i = 1; i < time->month; i++)
265 t->tv_sec += mon_lens[lpyear][i] * 3600 * 24;
267 /* Speed up the calculation */
268 if (time->year > 1979)
269 t->tv_sec += 315532800;
270 if (time->year > 1989)
271 t->tv_sec += 315619200;
272 if (time->year > 1999)
273 t->tv_sec += 315532800;
274 for (i = 2000; i < time->year; i++) {
275 daysinyear = udf_isaleapyear(i) + 365 ;
276 t->tv_sec += daysinyear * 3600 * 24;
280 * Calculate the time zone. The timezone is 12 bit signed 2's
281 * compliment, so we gotta do some extra magic to handle it right.
283 tz.u_tz_offset = time->type_tz;
284 tz.u_tz_offset &= 0x0fff;
285 if (tz.u_tz_offset & 0x0800)
286 tz.u_tz_offset |= 0xf000; /* extend the sign to 16 bits */
287 if ((time->type_tz & 0x1000) && (tz.s_tz_offset != -2047))
288 t->tv_sec -= tz.s_tz_offset * 60;
294 udf_getattr(struct vop_getattr_args *a)
297 struct udf_node *node;
299 struct file_entry *fentry;
307 fentry = node->fentry;
309 vap->va_fsid = dev2udev(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 if ((error = vn_lock(vp, LK_EXCLUSIVE | LK_RETRY)) != 0)
650 if (a->a_ncookies != NULL) {
652 * Guess how many entries are needed. If we run out, this
653 * function will be called again and thing will pick up were
656 ncookies = uio->uio_resid / 8 + 1;
659 cookies = kmalloc(sizeof(off_t) * ncookies, M_TEMP, M_WAITOK);
660 uiodir.ncookies = ncookies;
661 uiodir.cookies = cookies;
664 uiodir.cookies = NULL;
669 * Iterate through the file id descriptors. Give the parent dir
670 * entry special attention.
672 ds = udf_opendir(node, uio->uio_offset, node->fentry->inf_len,
675 name = kmalloc(NAME_MAX, M_TEMP, M_WAITOK);
677 while ((fid = udf_getfid(ds)) != NULL) {
679 /* XXX Should we return an error on a bad fid? */
680 if (udf_checktag(&fid->tag, TAGID_FID)) {
681 kprintf("Invalid FID tag\n");
686 /* Is this a deleted file? */
687 if (fid->file_char & UDF_FILE_CHAR_DEL)
690 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) {
691 /* Do up the '.' and '..' entries. Dummy values are
692 * used for the cookies since the offset here is
693 * usually zero, and NFS doesn't like that value
695 if (uiodir.cookies != NULL) {
696 if (++uiodir.acookies > uiodir.ncookies) {
700 *uiodir.cookies++ = 1;
702 if (vop_write_dirent(&error, uio, node->hash_id, DT_DIR,
711 if (uiodir.cookies != NULL) {
712 if (++uiodir.acookies > uiodir.ncookies) {
716 *uiodir.cookies++ = 2;
718 if (vop_write_dirent(&error, uio, udf_getid(&fid->icb),
728 uint8_t d_type = (fid->file_char & UDF_FILE_CHAR_DIR) ?
730 uint16_t namelen = udf_transname(&fid->data[fid->l_iu],
731 name, fid->l_fi, udfmp);
733 if (uiodir.cookies != NULL) {
734 if (++uiodir.acookies > uiodir.ncookies) {
738 *uiodir.cookies++ = ds->this_off;
740 if (vop_write_dirent(&error, uio, udf_getid(&fid->icb),
741 d_type, namelen, name)) {
751 kprintf("uiomove returned %d\n", error);
759 /* tell the calling layer whether we need to be called again */
760 *a->a_eofflag = uiodir.eofflag;
761 uio->uio_offset = ds->offset + ds->off;
768 if (a->a_ncookies != NULL) {
770 kfree(cookies, M_TEMP);
772 *a->a_ncookies = uiodir.acookies;
773 *a->a_cookies = cookies;
781 /* Are there any implementations out there that do soft-links? */
783 udf_readlink(struct vop_readlink_args *ap)
785 kprintf("%s called\n", __func__);
790 udf_strategy(struct vop_strategy_args *ap)
796 struct udf_node *node;
805 nbio = push_bio(bio);
806 if (nbio->bio_offset == NOOFFSET) {
808 * Files that are embedded in the fentry don't translate well
809 * to a block number. Reject.
811 if (udf_bmap_internal(node,
813 &dblkno, &maxsize)) {
815 nbio->bio_offset = NOOFFSET;
817 nbio->bio_offset = dbtob(dblkno);
820 if (nbio->bio_offset == NOOFFSET) {
821 /* I/O was never started on nbio, must biodone(bio) */
825 vn_strategy(node->i_devvp, nbio);
830 udf_bmap(struct vop_bmap_args *a)
832 struct udf_node *node;
837 node = VTON(a->a_vp);
839 if (a->a_doffsetp == NULL)
842 KKASSERT(a->a_loffset % node->udfmp->bsize == 0);
844 error = udf_bmap_internal(node, a->a_loffset, &lsector, &max_size);
848 /* Translate logical to physical sector number */
849 *a->a_doffsetp = (off_t)lsector << node->udfmp->bshift;
851 /* Punt on read-ahead for now */
860 * The all powerful VOP_LOOKUP().
863 udf_lookup(struct vop_old_lookup_args *a)
866 struct vnode *tdp = NULL;
867 struct vnode **vpp = a->a_vpp;
868 struct udf_node *node;
869 struct udf_mnt *udfmp;
870 struct fileid_desc *fid = NULL;
871 struct udf_dirstream *ds;
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;
889 td = a->a_cnp->cn_td;
894 * If this is a LOOKUP and we've already partially searched through
895 * the directory, pick up where we left off and flag that the
896 * directory may need to be searched twice. For a full description,
897 * see /sys/isofs/cd9660/cd9660_lookup.c:cd9660_lookup()
899 if (nameiop != NAMEI_LOOKUP || node->diroff == 0 ||
900 node->diroff > fsize) {
904 offset = node->diroff;
909 ds = udf_opendir(node, offset, fsize, udfmp);
911 while ((fid = udf_getfid(ds)) != NULL) {
912 /* XXX Should we return an error on a bad fid? */
913 if (udf_checktag(&fid->tag, TAGID_FID)) {
914 kprintf("udf_lookup: Invalid tag\n");
919 /* Is this a deleted file? */
920 if (fid->file_char & UDF_FILE_CHAR_DEL)
923 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) {
924 if (flags & CNP_ISDOTDOT) {
925 id = udf_getid(&fid->icb);
929 if (!(udf_cmpname(&fid->data[fid->l_iu],
930 nameptr, fid->l_fi, namelen, udfmp))) {
931 id = udf_getid(&fid->icb);
940 /* XXX Bail out here? */
946 /* Did we have a match? */
948 error = udf_vget(udfmp->im_mountp, NULL, id, &tdp);
951 * Remember where this entry was if it's the final
954 if (nameiop == NAMEI_LOOKUP)
955 node->diroff = ds->offset + ds->off;
956 if ((flags & CNP_LOCKPARENT) == 0) {
957 a->a_cnp->cn_flags |= CNP_PDIRUNLOCK;
964 /* Name wasn't found on this pass. Do another pass? */
965 if (numdirpasses == 2) {
971 if (nameiop == NAMEI_CREATE || nameiop == NAMEI_RENAME) {
983 udf_reclaim(struct vop_reclaim_args *a)
986 struct udf_node *unode;
993 if (unode->i_devvp) {
994 vrele(unode->i_devvp);
998 if (unode->fentry != NULL)
999 kfree(unode->fentry, M_UDFFENTRY);
1000 kfree(unode, M_UDFNODE);
1008 * Read the block and then set the data pointer to correspond with the
1009 * offset passed in. Only read in at most 'size' bytes, and then set 'size'
1010 * to the number of bytes pointed to. If 'size' is zero, try to read in a
1013 * Note that *bp may be assigned error or not.
1015 * XXX 'size' is limited to the logical block size for now due to problems
1019 udf_readatoffset(struct udf_node *node, int *size, int offset, struct buf **bp,
1022 struct udf_mnt *udfmp;
1023 struct file_entry *fentry = NULL;
1029 udfmp = node->udfmp;
1032 error = udf_bmap_internal(node, offset, §or, &max_size);
1033 if (error == UDF_INVALID_BMAP) {
1035 * This error means that the file *data* is stored in the
1036 * allocation descriptor field of the file entry.
1038 fentry = node->fentry;
1039 *data = &fentry->data[fentry->l_ea];
1040 *size = fentry->l_ad;
1042 } else if (error != 0) {
1046 /* Adjust the size so that it is within range */
1047 if (*size == 0 || *size > max_size)
1049 *size = min(*size, MAXBSIZE);
1051 if ((error = udf_readlblks(udfmp, sector, *size, bp))) {
1052 kprintf("warning: udf_readlblks returned error %d\n", error);
1053 /* note: *bp may be non-NULL */
1058 *data = (uint8_t *)&bp1->b_data[offset % udfmp->bsize];
1063 * Translate a file offset into a logical block and then into a physical
1067 udf_bmap_internal(struct udf_node *node, uint32_t offset, daddr_t *sector, uint32_t *max_size)
1069 struct udf_mnt *udfmp;
1070 struct file_entry *fentry;
1072 struct icb_tag *tag;
1073 uint32_t icblen = 0;
1075 int ad_offset, ad_num = 0;
1078 udfmp = node->udfmp;
1079 fentry = node->fentry;
1080 tag = &fentry->icbtag;
1082 switch (tag->strat_type) {
1087 kprintf("Cannot deal with strategy4096 yet!\n");
1091 kprintf("Unknown strategy type %d\n", tag->strat_type);
1095 switch (tag->flags & 0x7) {
1098 * The allocation descriptor field is filled with short_ad's.
1099 * If the offset is beyond the current extent, look for the
1104 ad_offset = sizeof(struct short_ad) * ad_num;
1105 if (ad_offset > fentry->l_ad) {
1106 kprintf("File offset out of bounds\n");
1109 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset);
1110 icblen = GETICBLEN(short_ad, icb);
1112 } while(offset >= icblen);
1114 lsector = (offset >> udfmp->bshift) +
1115 ((struct short_ad *)(icb))->pos;
1117 *max_size = GETICBLEN(short_ad, icb);
1122 * The allocation descriptor field is filled with long_ad's
1123 * If the offset is beyond the current extent, look for the
1128 ad_offset = sizeof(struct long_ad) * ad_num;
1129 if (ad_offset > fentry->l_ad) {
1130 kprintf("File offset out of bounds\n");
1133 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset);
1134 icblen = GETICBLEN(long_ad, icb);
1136 } while(offset >= icblen);
1138 lsector = (offset >> udfmp->bshift) +
1139 ((struct long_ad *)(icb))->loc.lb_num;
1141 *max_size = GETICBLEN(long_ad, icb);
1146 * This type means that the file *data* is stored in the
1147 * allocation descriptor field of the file entry.
1150 *sector = node->hash_id + udfmp->part_start;
1152 return(UDF_INVALID_BMAP);
1154 /* DirectCD does not use extended_ad's */
1156 kprintf("Unsupported allocation descriptor %d\n",
1161 *sector = lsector + udfmp->part_start;
1164 * Check the sparing table. Each entry represents the beginning of
1167 if (udfmp->s_table != NULL) {
1168 for (i = 0; i< udfmp->s_table_entries; i++) {
1169 p_offset = lsector - udfmp->s_table->entries[i].org;
1170 if ((p_offset < udfmp->p_sectors) && (p_offset >= 0)) {
1171 *sector = udfmp->s_table->entries[i].map +