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 $
27 * $DragonFly: src/sys/vfs/udf/udf_vnops.c,v 1.6 2004/08/17 18:57:35 dillon Exp $
31 /* Take care of the vnode side of things */
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>
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 <vfs/udf/ecma167-udf.h>
49 #include <vfs/udf/osta.h>
50 #include <vfs/udf/udf.h>
51 #include <vfs/udf/udf_mount.h>
53 static int udf_access(struct vop_access_args *);
54 static int udf_getattr(struct vop_getattr_args *);
55 static int udf_ioctl(struct vop_ioctl_args *);
56 static int udf_pathconf(struct vop_pathconf_args *);
57 static int udf_read(struct vop_read_args *);
58 static int udf_readdir(struct vop_readdir_args *);
59 static int udf_readlink(struct vop_readlink_args *ap);
60 static int udf_strategy(struct vop_strategy_args *);
61 static int udf_bmap(struct vop_bmap_args *);
62 static int udf_lookup(struct vop_cachedlookup_args *);
63 static int udf_reclaim(struct vop_reclaim_args *);
64 static int udf_readatoffset(struct udf_node *, int *, int, struct buf **, uint8_t **);
65 static int udf_bmap_internal(struct udf_node *, uint32_t, daddr_t *, uint32_t *);
67 struct vnodeopv_entry_desc udf_vnodeop_entries[] = {
68 { &vop_default_desc, vop_defaultop },
69 { &vop_access_desc, (void *) udf_access },
70 { &vop_bmap_desc, (void *) udf_bmap },
71 { &vop_cachedlookup_desc, (void *) udf_lookup },
72 { &vop_getattr_desc, (void *) udf_getattr },
73 { &vop_ioctl_desc, (void *) udf_ioctl },
74 { &vop_lookup_desc, (void *) vfs_cache_lookup },
75 { &vop_pathconf_desc, (void *) udf_pathconf },
76 { &vop_read_desc, (void *) udf_read },
77 { &vop_readdir_desc, (void *) udf_readdir },
78 { &vop_readlink_desc, (void *) udf_readlink },
79 { &vop_reclaim_desc, (void *) udf_reclaim },
80 { &vop_strategy_desc, (void *) udf_strategy },
84 MALLOC_DEFINE(M_UDFFID, "UDF FID", "UDF FileId structure");
85 MALLOC_DEFINE(M_UDFDS, "UDF DS", "UDF Dirstream structure");
87 #define UDF_INVALID_BMAP -1
89 /* Look up a udf_node based on the ino_t passed in and return it's vnode */
91 udf_hashlookup(struct udf_mnt *udfmp, ino_t id, struct vnode **vpp)
93 struct udf_node *node;
94 struct udf_hash_lh *lh;
96 lwkt_tokref vlock, hashlock;
100 lwkt_gettoken(&hashlock, &udfmp->hash_token);
102 lh = &udfmp->hashtbl[id % udfmp->hashsz];
105 LIST_FOREACH(node, lh, le) {
106 if (node->hash_id != id)
108 lwkt_gettoken(&vlock, node->i_vnode->v_interlock);
110 * We must check to see if the inode has been ripped
111 * out from under us after blocking.
113 lh = &udfmp->hashtbl[id % udfmp->hashsz];
114 LIST_FOREACH(node, lh, le)
115 if (node->hash_id == id)
118 lwkt_reltoken(&vlock);
121 error = vget(node->i_vnode, &vlock, LK_EXCLUSIVE | LK_INTERLOCK,
125 lwkt_reltoken(&hashlock);
128 *vpp = node->i_vnode;
132 lwkt_reltoken(&hashlock);
137 udf_hashins(struct udf_node *node)
139 struct udf_mnt *udfmp;
140 struct udf_hash_lh *lh;
141 lwkt_tokref hashlock;
145 vn_lock(node->i_vnode, NULL, LK_EXCLUSIVE | LK_RETRY, curthread);
146 lwkt_gettoken(&hashlock, &udfmp->hash_token);
147 lh = &udfmp->hashtbl[node->hash_id % udfmp->hashsz];
150 LIST_INSERT_HEAD(lh, node, le);
151 lwkt_reltoken(&hashlock);
157 udf_hashrem(struct udf_node *node)
159 struct udf_mnt *udfmp;
160 struct udf_hash_lh *lh;
161 lwkt_tokref hashlock;
165 lwkt_gettoken(&hashlock, &udfmp->hash_token);
166 lh = &udfmp->hashtbl[node->hash_id % udfmp->hashsz];
168 panic("hash entry is NULL, node->hash_id= %d\n", node->hash_id);
169 LIST_REMOVE(node, le);
170 lwkt_reltoken(&hashlock);
176 udf_allocv(struct mount *mp, struct vnode **vpp)
181 error = getnewvnode(VT_UDF, mp, mp->mnt_vn_ops, &vp);
183 printf("udf_allocv: failed to allocate new vnode\n");
191 /* Convert file entry permission (5 bits per owner/group/user) to a mode_t */
193 udf_permtomode(struct udf_node *node)
199 perm = node->fentry->perm;
200 flags = node->fentry->icbtag.flags;
202 mode = perm & UDF_FENTRY_PERM_USER_MASK;
203 mode |= ((perm & UDF_FENTRY_PERM_GRP_MASK) >> 2);
204 mode |= ((perm & UDF_FENTRY_PERM_OWNER_MASK) >> 4);
205 mode |= ((flags & UDF_ICB_TAG_FLAGS_STICKY) << 4);
206 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETGID) << 6);
207 mode |= ((flags & UDF_ICB_TAG_FLAGS_SETUID) << 8);
213 udf_access(struct vop_access_args *a)
216 struct udf_node *node;
217 mode_t a_mode, mode, mask;
218 struct ucred *cred = a->a_cred;
226 if (a_mode & VWRITE) {
227 switch (vp->v_type) {
238 mode = udf_permtomode(node);
240 if (cred->cr_uid == 0)
245 /* Otherwise, check the owner. */
246 if (cred->cr_uid == node->fentry->uid) {
253 return((mode & mask) == mask ? 0 : EACCES);
256 /* Otherwise, check the groups. */
257 for (i = 0, gp = cred->cr_groups; i < cred->cr_ngroups; i++, gp++)
258 if (node->fentry->gid == *gp) {
265 return((mode & mask) == mask ? 0 : EACCES);
268 /* Otherwise, check everyone else. */
275 return((mode & mask) == mask ? 0 : EACCES);
278 static int mon_lens[2][12] = {
279 {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
280 {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}
284 udf_isaleapyear(int year)
288 i = (year % 4) ? 0 : 1;
289 i &= (year % 100) ? 1 : 0;
290 i |= (year % 400) ? 0 : 1;
296 * XXX This is just a rough hack. Daylight savings isn't calculated and tv_nsec
298 * Timezone calculation compliments of Julian Elischer <julian@elischer.org>.
301 udf_timetotimespec(struct timestamp *time, struct timespec *t)
303 int i, lpyear, daysinyear;
305 uint16_t u_tz_offset;
311 /* DirectCD seems to like using bogus year values */
312 if (time->year < 1970) {
317 /* Calculate the time and day */
318 t->tv_sec = time->second;
319 t->tv_sec += time->minute * 60;
320 t->tv_sec += time->hour * 3600;
321 t->tv_sec += time->day * 3600 * 24;
323 /* Calclulate the month */
324 lpyear = udf_isaleapyear(time->year);
325 for (i = 1; i < time->month; i++)
326 t->tv_sec += mon_lens[lpyear][i] * 3600 * 24;
328 /* Speed up the calculation */
329 if (time->year > 1979)
330 t->tv_sec += 315532800;
331 if (time->year > 1989)
332 t->tv_sec += 315619200;
333 if (time->year > 1999)
334 t->tv_sec += 315532800;
335 for (i = 2000; i < time->year; i++) {
336 daysinyear = udf_isaleapyear(i) + 365 ;
337 t->tv_sec += daysinyear * 3600 * 24;
341 * Calculate the time zone. The timezone is 12 bit signed 2's
342 * compliment, so we gotta do some extra magic to handle it right.
344 tz.u_tz_offset = time->type_tz;
345 tz.u_tz_offset &= 0x0fff;
346 if (tz.u_tz_offset & 0x0800)
347 tz.u_tz_offset |= 0xf000; /* extend the sign to 16 bits */
348 if ((time->type_tz & 0x1000) && (tz.s_tz_offset != -2047))
349 t->tv_sec -= tz.s_tz_offset * 60;
355 udf_getattr(struct vop_getattr_args *a)
358 struct udf_node *node;
360 struct file_entry *fentry;
368 fentry = node->fentry;
370 vap->va_fsid = dev2udev(node->i_dev);
371 vap->va_fileid = node->hash_id;
372 vap->va_mode = udf_permtomode(node);
373 vap->va_nlink = fentry->link_cnt;
375 * XXX The spec says that -1 is valid for uid/gid and indicates an
376 * invalid uid/gid. How should this be represented?
378 vap->va_uid = (fentry->uid == 0xffffffff) ? 0 : fentry->uid;
379 vap->va_gid = (fentry->gid == 0xffffffff) ? 0 : fentry->gid;
380 udf_timetotimespec(&fentry->atime, &vap->va_atime);
381 udf_timetotimespec(&fentry->mtime, &vap->va_mtime);
382 vap->va_ctime = vap->va_mtime; /* XXX Stored as an Extended Attribute */
383 vap->va_rdev = 0; /* XXX */
384 if (vp->v_type & VDIR) {
386 * Directories that are recorded within their ICB will show
387 * as having 0 blocks recorded. Since tradition dictates
388 * that directories consume at least one logical block,
391 if (fentry->logblks_rec != 0)
392 vap->va_size = fentry->logblks_rec * node->udfmp->bsize;
394 vap->va_size = node->udfmp->bsize;
396 vap->va_size = fentry->inf_len;
399 vap->va_blocksize = node->udfmp->bsize;
400 vap->va_bytes = fentry->inf_len;
401 vap->va_type = vp->v_type;
402 vap->va_filerev = 0; /* XXX */
407 * File specific ioctls. DeCSS candidate?
410 udf_ioctl(struct vop_ioctl_args *a)
412 printf("%s called\n", __FUNCTION__);
417 * I'm not sure that this has much value in a read-only filesystem, but
421 udf_pathconf(struct vop_pathconf_args *a)
426 *a->a_retval = 65535;
429 *a->a_retval = NAME_MAX;
432 *a->a_retval = PATH_MAX;
443 udf_read(struct vop_read_args *a)
445 struct vnode *vp = a->a_vp;
446 struct uio *uio = a->a_uio;
447 struct udf_node *node = VTON(vp);
451 int size, fsize, offset;
453 if (uio->uio_offset < 0)
456 fsize = node->fentry->inf_len;
458 while (uio->uio_offset < fsize && uio->uio_resid > 0) {
459 offset = uio->uio_offset;
460 size = uio->uio_resid;
461 error = udf_readatoffset(node, &size, offset, &bp, &data);
463 error = uiomove(data, size, uio);
474 * Call the OSTA routines to translate the name from a CS0 dstring to a
475 * 16-bit Unicode String. Hooks need to be placed in here to translate from
476 * Unicode to the encoding that the kernel/user expects. Return the length
477 * of the translated string.
480 udf_transname(char *cs0string, char *destname, int len, struct udf_mnt *udfmp)
482 unicode_t *transname;
483 int i, unilen = 0, destlen;
485 /* Convert 16-bit Unicode to destname */
486 /* allocate a buffer big enough to hold an 8->16 bit expansion */
487 transname = malloc(MAXNAMLEN * sizeof(unicode_t), M_TEMP, M_WAITOK | M_ZERO);
489 if ((unilen = udf_UncompressUnicode(len, cs0string, transname)) == -1) {
490 printf("udf: Unicode translation failed\n");
491 free(transname, M_TEMP);
495 for (i = 0; i < unilen ; i++)
496 if (transname[i] & 0xff00)
497 destname[i] = '.'; /* Fudge the 16bit chars */
499 destname[i] = transname[i] & 0xff;
500 free(transname, M_TEMP);
501 destname[unilen] = 0;
508 * Compare a CS0 dstring with a name passed in from the VFS layer. Return
509 * 0 on a successful match, nonzero therwise. Unicode work may need to be done
513 udf_cmpname(char *cs0string, char *cmpname, int cs0len, int cmplen, struct udf_mnt *udfmp)
518 /* This is overkill, but not worth creating a new zone */
520 transname = malloc(MAXNAMLEN * sizeof(unicode_t), M_TEMP,
523 cs0len = udf_transname(cs0string, transname, cs0len, udfmp);
525 /* Easy check. If they aren't the same length, they aren't equal */
526 if ((cs0len == 0) || (cs0len != cmplen))
529 error = bcmp(transname, cmpname, cmplen);
531 free(transname, M_TEMP);
536 struct dirent *dirent;
544 udf_uiodir(struct udf_uiodir *uiodir, int de_size, struct uio *uio, long cookie)
546 if (uiodir->cookies != NULL) {
547 if (++uiodir->acookies > uiodir->ncookies) {
551 *uiodir->cookies++ = cookie;
554 if (uio->uio_resid < de_size) {
559 return(uiomove((caddr_t)uiodir->dirent, de_size, uio));
562 static struct udf_dirstream *
563 udf_opendir(struct udf_node *node, int offset, int fsize, struct udf_mnt *udfmp)
565 struct udf_dirstream *ds;
567 ds = malloc(sizeof(*ds), M_UDFDS, M_WAITOK | M_ZERO);
577 static struct fileid_desc *
578 udf_getfid(struct udf_dirstream *ds)
580 struct fileid_desc *fid;
581 int error, frag_size = 0, total_fid_size;
583 /* End of directory? */
584 if (ds->offset + ds->off >= ds->fsize) {
589 /* Grab the first extent of the directory */
594 error = udf_readatoffset(ds->node, &ds->size, ds->offset,
603 * Clean up from a previous fragmented FID.
604 * XXX Is this the right place for this?
606 if (ds->fid_fragment && ds->buf != NULL) {
607 ds->fid_fragment = 0;
608 free(ds->buf, M_UDFFID);
611 fid = (struct fileid_desc*)&ds->data[ds->off];
614 * Check to see if the fid is fragmented. The first test
615 * ensures that we don't wander off the end of the buffer
616 * looking for the l_iu and l_fi fields.
618 if (ds->off + UDF_FID_SIZE > ds->size ||
619 ds->off + fid->l_iu + fid->l_fi + UDF_FID_SIZE > ds->size) {
621 /* Copy what we have of the fid into a buffer */
622 frag_size = ds->size - ds->off;
623 if (frag_size >= ds->udfmp->bsize) {
624 printf("udf: invalid FID fragment\n");
630 * File ID descriptors can only be at most one
631 * logical sector in size.
633 ds->buf = malloc(ds->udfmp->bsize, M_UDFFID, M_WAITOK | M_ZERO);
634 bcopy(fid, ds->buf, frag_size);
636 /* Reduce all of the casting magic */
637 fid = (struct fileid_desc*)ds->buf;
642 /* Fetch the next allocation */
643 ds->offset += ds->size;
645 error = udf_readatoffset(ds->node, &ds->size, ds->offset,
653 * If the fragment was so small that we didn't get
654 * the l_iu and l_fi fields, copy those in.
656 if (frag_size < UDF_FID_SIZE)
657 bcopy(ds->data, &ds->buf[frag_size],
658 UDF_FID_SIZE - frag_size);
661 * Now that we have enough of the fid to work with,
662 * copy in the rest of the fid from the new
665 total_fid_size = UDF_FID_SIZE + fid->l_iu + fid->l_fi;
666 if (total_fid_size > ds->udfmp->bsize) {
667 printf("udf: invalid FID\n");
671 bcopy(ds->data, &ds->buf[frag_size],
672 total_fid_size - frag_size);
674 ds->fid_fragment = 1;
676 total_fid_size = fid->l_iu + fid->l_fi + UDF_FID_SIZE;
679 * Update the offset. Align on a 4 byte boundary because the
682 ds->this_off = ds->off;
683 if (!ds->fid_fragment)
684 ds->off += (total_fid_size + 3) & ~0x03;
686 ds->off = (total_fid_size - frag_size + 3) & ~0x03;
692 udf_closedir(struct udf_dirstream *ds)
698 if (ds->fid_fragment && ds->buf != NULL)
699 free(ds->buf, M_UDFFID);
705 udf_readdir(struct vop_readdir_args *a)
710 struct udf_node *node;
711 struct udf_mnt *udfmp;
712 struct fileid_desc *fid;
713 struct udf_uiodir uiodir;
714 struct udf_dirstream *ds;
715 u_long *cookies = NULL;
725 if (a->a_ncookies != NULL) {
727 * Guess how many entries are needed. If we run out, this
728 * function will be called again and thing will pick up were
731 ncookies = uio->uio_resid / 8;
732 cookies = malloc(sizeof(u_long) * ncookies, M_TEMP, M_WAITOK);
733 uiodir.ncookies = ncookies;
734 uiodir.cookies = cookies;
737 uiodir.cookies = NULL;
740 * Iterate through the file id descriptors. Give the parent dir
741 * entry special attention.
743 ds = udf_opendir(node, uio->uio_offset, node->fentry->inf_len,
746 while ((fid = udf_getfid(ds)) != NULL) {
748 /* XXX Should we return an error on a bad fid? */
749 if (udf_checktag(&fid->tag, TAGID_FID)) {
750 printf("Invalid FID tag\n");
755 /* Is this a deleted file? */
756 if (fid->file_char & UDF_FILE_CHAR_DEL)
759 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) {
760 /* Do up the '.' and '..' entries. Dummy values are
761 * used for the cookies since the offset here is
762 * usually zero, and NFS doesn't like that value
764 dir.d_fileno = node->hash_id;
768 dir.d_reclen = GENERIC_DIRSIZ(&dir);
769 uiodir.dirent = &dir;
770 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 1);
774 dir.d_fileno = udf_getid(&fid->icb);
779 dir.d_reclen = GENERIC_DIRSIZ(&dir);
780 uiodir.dirent = &dir;
781 error = udf_uiodir(&uiodir, dir.d_reclen, uio, 2);
783 dir.d_namlen = udf_transname(&fid->data[fid->l_iu],
784 &dir.d_name[0], fid->l_fi, udfmp);
785 dir.d_fileno = udf_getid(&fid->icb);
786 dir.d_type = (fid->file_char & UDF_FILE_CHAR_DIR) ?
788 dir.d_reclen = GENERIC_DIRSIZ(&dir);
789 uiodir.dirent = &dir;
790 error = udf_uiodir(&uiodir, dir.d_reclen, uio,
794 printf("uiomove returned %d\n", error);
800 /* tell the calling layer whether we need to be called again */
801 *a->a_eofflag = uiodir.eofflag;
802 uio->uio_offset = ds->offset + ds->off;
809 if (a->a_ncookies != NULL) {
811 free(cookies, M_TEMP);
813 *a->a_ncookies = uiodir.acookies;
814 *a->a_cookies = cookies;
821 /* Are there any implementations out there that do soft-links? */
823 udf_readlink(struct vop_readlink_args *ap)
825 printf("%s called\n", __FUNCTION__);
830 udf_strategy(struct vop_strategy_args *a)
834 struct udf_node *node;
841 KASSERT(a->a_vp == a->a_bp->b_vp, ("%s(%p != %p)",
842 __func__, a->a_vp, a->a_bp->b_vp));
843 /* cd9660 has this test reversed, but it seems more logical this way */
844 if (bp->b_blkno != bp->b_lblkno) {
846 * Files that are embedded in the fentry don't translate well
847 * to a block number. Reject.
849 if (udf_bmap_internal(node, bp->b_lblkno * node->udfmp->bsize,
850 &bp->b_lblkno, &maxsize)) {
855 if ((long)bp->b_blkno == -1) {
860 bp->b_dev = vp->v_rdev;
861 bp->b_offset = dbtob(bp->b_blkno);
862 VOP_STRATEGY(vp, bp);
867 udf_bmap(struct vop_bmap_args *a)
869 struct udf_node *node;
874 node = VTON(a->a_vp);
876 if (a->a_vpp != NULL)
877 *a->a_vpp = node->i_devvp;
878 if (a->a_bnp == NULL)
883 error = udf_bmap_internal(node, a->a_bn * node->udfmp->bsize, &lsector,
888 /* Translate logical to physical sector number */
889 *a->a_bnp = lsector << (node->udfmp->bshift - DEV_BSHIFT);
891 /* Punt on read-ahead for now */
899 * The all powerful VOP_LOOKUP().
902 udf_lookup(struct vop_cachedlookup_args *a)
905 struct vnode *tdp = NULL;
906 struct vnode **vpp = a->a_vpp;
907 struct udf_node *node;
908 struct udf_mnt *udfmp;
909 struct fileid_desc *fid = NULL;
910 struct udf_dirstream *ds;
912 globaldata_t gd = mycpu;
918 int offset, error = 0;
919 int numdirpasses, fsize;
924 nameiop = a->a_cnp->cn_nameiop;
925 flags = a->a_cnp->cn_flags;
926 nameptr = a->a_cnp->cn_nameptr;
927 namelen = a->a_cnp->cn_namelen;
928 fsize = node->fentry->inf_len;
929 td = a->a_cnp->cn_td;
932 * If this is a LOOKUP and we've already partially searched through
933 * the directory, pick up where we left off and flag that the
934 * directory may need to be searched twice. For a full description,
935 * see /sys/isofs/cd9660/cd9660_lookup.c:cd9660_lookup()
937 if (nameiop != NAMEI_LOOKUP || node->diroff == 0 ||
938 node->diroff > fsize) {
942 offset = node->diroff;
944 gd->gd_nchstats->ncs_2passes++;
948 ds = udf_opendir(node, offset, fsize, udfmp);
950 while ((fid = udf_getfid(ds)) != NULL) {
951 /* XXX Should we return an error on a bad fid? */
952 if (udf_checktag(&fid->tag, TAGID_FID)) {
953 printf("udf_lookup: Invalid tag\n");
958 /* Is this a deleted file? */
959 if (fid->file_char & UDF_FILE_CHAR_DEL)
962 if ((fid->l_fi == 0) && (fid->file_char & UDF_FILE_CHAR_PAR)) {
963 if (flags & CNP_ISDOTDOT) {
964 id = udf_getid(&fid->icb);
968 if (!(udf_cmpname(&fid->data[fid->l_iu],
969 nameptr, fid->l_fi, namelen, udfmp))) {
970 id = udf_getid(&fid->icb);
979 /* XXX Bail out here? */
985 /* Did we have a match? */
987 error = udf_vget(udfmp->im_mountp, id, &tdp);
990 * Remember where this entry was if it's the final
993 if ((flags & CNP_ISLASTCN) && nameiop == NAMEI_LOOKUP)
994 node->diroff = ds->offset + ds->off;
995 if (numdirpasses == 2)
996 gd->gd_nchstats->ncs_pass2++;
997 if (!(flags & CNP_LOCKPARENT) || !(flags & CNP_ISLASTCN)) {
998 a->a_cnp->cn_flags |= CNP_PDIRUNLOCK;
999 VOP_UNLOCK(dvp, NULL, 0, td);
1004 /* Put this entry in the cache */
1005 if (flags & CNP_MAKEENTRY)
1006 cache_enter(dvp, NCPNULL, *vpp, a->a_cnp);
1009 /* Name wasn't found on this pass. Do another pass? */
1010 if (numdirpasses == 2) {
1017 /* Enter name into cache as non-existant */
1018 if (flags & CNP_MAKEENTRY)
1019 cache_enter(dvp, NCPNULL, *vpp, a->a_cnp);
1021 if ((flags & CNP_ISLASTCN) &&
1022 (nameiop == NAMEI_CREATE || nameiop == NAMEI_RENAME)) {
1034 udf_reclaim(struct vop_reclaim_args *a)
1037 struct udf_node *unode;
1042 if (unode != NULL) {
1044 if (unode->i_devvp) {
1045 vrele(unode->i_devvp);
1049 if (unode->fentry != NULL)
1050 free(unode->fentry, M_UDFFENTRY);
1051 free(unode, M_UDFNODE);
1059 * Read the block and then set the data pointer to correspond with the
1060 * offset passed in. Only read in at most 'size' bytes, and then set 'size'
1061 * to the number of bytes pointed to. If 'size' is zero, try to read in a
1064 * Note that *bp may be assigned error or not.
1066 * XXX 'size' is limited to the logical block size for now due to problems
1070 udf_readatoffset(struct udf_node *node, int *size, int offset, struct buf **bp,
1073 struct udf_mnt *udfmp;
1074 struct file_entry *fentry = NULL;
1080 udfmp = node->udfmp;
1083 error = udf_bmap_internal(node, offset, §or, &max_size);
1084 if (error == UDF_INVALID_BMAP) {
1086 * This error means that the file *data* is stored in the
1087 * allocation descriptor field of the file entry.
1089 fentry = node->fentry;
1090 *data = &fentry->data[fentry->l_ea];
1091 *size = fentry->l_ad;
1093 } else if (error != 0) {
1097 /* Adjust the size so that it is within range */
1098 if (*size == 0 || *size > max_size)
1100 *size = min(*size, MAXBSIZE);
1102 if ((error = udf_readlblks(udfmp, sector, *size, bp))) {
1103 printf("warning: udf_readlblks returned error %d\n", error);
1104 /* note: *bp may be non-NULL */
1109 *data = (uint8_t *)&bp1->b_data[offset % udfmp->bsize];
1114 * Translate a file offset into a logical block and then into a physical
1118 udf_bmap_internal(struct udf_node *node, uint32_t offset, daddr_t *sector, uint32_t *max_size)
1120 struct udf_mnt *udfmp;
1121 struct file_entry *fentry;
1123 struct icb_tag *tag;
1124 uint32_t icblen = 0;
1126 int ad_offset, ad_num = 0;
1129 udfmp = node->udfmp;
1130 fentry = node->fentry;
1131 tag = &fentry->icbtag;
1133 switch (tag->strat_type) {
1138 printf("Cannot deal with strategy4096 yet!\n");
1142 printf("Unknown strategy type %d\n", tag->strat_type);
1146 switch (tag->flags & 0x7) {
1149 * The allocation descriptor field is filled with short_ad's.
1150 * If the offset is beyond the current extent, look for the
1155 ad_offset = sizeof(struct short_ad) * ad_num;
1156 if (ad_offset > fentry->l_ad) {
1157 printf("File offset out of bounds\n");
1160 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset);
1161 icblen = GETICBLEN(short_ad, icb);
1163 } while(offset >= icblen);
1165 lsector = (offset >> udfmp->bshift) +
1166 ((struct short_ad *)(icb))->pos;
1168 *max_size = GETICBLEN(short_ad, icb);
1173 * The allocation descriptor field is filled with long_ad's
1174 * If the offset is beyond the current extent, look for the
1179 ad_offset = sizeof(struct long_ad) * ad_num;
1180 if (ad_offset > fentry->l_ad) {
1181 printf("File offset out of bounds\n");
1184 icb = GETICB(long_ad, fentry, fentry->l_ea + ad_offset);
1185 icblen = GETICBLEN(long_ad, icb);
1187 } while(offset >= icblen);
1189 lsector = (offset >> udfmp->bshift) +
1190 ((struct long_ad *)(icb))->loc.lb_num;
1192 *max_size = GETICBLEN(long_ad, icb);
1197 * This type means that the file *data* is stored in the
1198 * allocation descriptor field of the file entry.
1201 *sector = node->hash_id + udfmp->part_start;
1203 return(UDF_INVALID_BMAP);
1205 /* DirectCD does not use extended_ad's */
1207 printf("Unsupported allocation descriptor %d\n",
1212 *sector = lsector + udfmp->part_start;
1215 * Check the sparing table. Each entry represents the beginning of
1218 if (udfmp->s_table != NULL) {
1219 for (i = 0; i< udfmp->s_table_entries; i++) {
1220 p_offset = lsector - udfmp->s_table->entries[i].org;
1221 if ((p_offset < udfmp->p_sectors) && (p_offset >= 0)) {
1222 *sector = udfmp->s_table->entries[i].map +