xref: /dragonfly/sys/vfs/udf/udf.h (revision 7ea34faa22175b2ebd8ac26a6c025f3e54b3cb00)
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.h,v 1.6 2003/11/05 06:56:08 scottl Exp $
27  */
28 
29 #define UDF_HASHTBLSIZE 100
30 
31 struct udf_node {
32           LIST_ENTRY(udf_node)          le;
33           struct vnode        *i_vnode;
34           struct vnode        *i_devvp;
35           struct udf_mnt      *udfmp;
36           cdev_t              i_dev;
37           ino_t               hash_id;
38           long                diroff;
39           struct file_entry *fentry;
40 };
41 
42 struct udf_mnt {
43           int                           im_flags;
44           struct mount                  *im_mountp;
45           cdev_t                        im_dev;
46           struct vnode                  *im_devvp;
47           struct netexport    im_export;
48           int                           bsize;
49           int                           bshift;
50           int                           bmask;
51           uint32_t            part_start;
52           uint32_t            part_len;
53           uint64_t            root_id;
54           struct vnode                  *root_vp;
55           struct long_ad                root_icb;
56           LIST_HEAD(udf_hash_lh, udf_node)        *hashtbl;
57           u_long                        hashsz;
58           struct lwkt_token   hash_token;
59           int                           p_sectors;
60           int                           s_table_entries;
61           struct udf_sparing_table *s_table;
62 };
63 
64 struct udf_dirstream {
65           struct udf_node     *node;
66           struct udf_mnt      *udfmp;
67           struct buf          *bp;
68           uint8_t             *data;
69           uint8_t             *buf;
70           int                 fsize;
71           int                 off;
72           int                 this_off;
73           int                 offset;
74           int                 size;
75           int                 error;
76           int                 fid_fragment;
77 };
78 
79 #define   VFSTOUDFFS(mp)      ((struct udf_mnt *)((mp)->mnt_data))
80 #define   VTON(vp)  ((struct udf_node *)((vp)->v_data))
81 
82 /*
83  * The block layer refers to things in terms of 512 byte blocks by default.
84  * btodb() is expensive, so speed things up.
85  * XXX Can the block layer be forced to use a different block size?
86  */
87 #define   RDSECTOR(devvp, sector, size, bp) \
88           bread(devvp, (off_t)(sector) << udfmp->bshift, size, bp)
89 
90 #ifdef MALLOC_DECLARE
91 MALLOC_DECLARE(M_UDFFENTRY);
92 MALLOC_DECLARE(M_UDFNODE);
93 #endif
94 
95 static __inline int
udf_readlblks(struct udf_mnt * udfmp,int sector,int size,struct buf ** bp)96 udf_readlblks(struct udf_mnt *udfmp, int sector, int size, struct buf **bp)
97 {
98           return (RDSECTOR(udfmp->im_devvp, sector,
99                                (size + udfmp->bmask) & ~udfmp->bmask, bp));
100 }
101 
102 static __inline int
udf_readalblks(struct udf_mnt * udfmp,int lsector,int size,struct buf ** bp)103 udf_readalblks(struct udf_mnt *udfmp, int lsector, int size, struct buf **bp)
104 {
105           off_t raoffset;
106           off_t loffset;
107           int rasize;
108 
109           loffset = (off_t)(lsector + udfmp->part_start) << udfmp->bshift;
110           raoffset = loffset + (1 << udfmp->bshift);
111           rasize = size;
112 
113           return (breadn(udfmp->im_devvp, loffset,
114                            (size + udfmp->bmask) & ~udfmp->bmask,
115                            &raoffset, &rasize, 1, bp));
116 }
117 
118 /*
119  * Produce a suitable file number from an ICB.
120  * XXX If the fileno resolves to 0, we might be in big trouble.
121  * XXX Assumes the ICB is a long_ad.  This struct is compatible with short_ad,
122  *     but not ext_ad.
123  */
124 static __inline ino_t
udf_getid(struct long_ad * icb)125 udf_getid(struct long_ad *icb)
126 {
127           return (icb->loc.lb_num);
128 }
129 
130 int udf_allocv(struct mount *, struct vnode **);
131 int udf_hashlookup(struct udf_mnt *, ino_t, struct vnode **);
132 int udf_hashins(struct udf_node *);
133 int udf_hashrem(struct udf_node *);
134 int udf_checktag(struct desc_tag *, uint16_t);
135 int udf_vget(struct mount *, struct vnode *, ino_t, struct vnode **);
136