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