udf.h revision 1.11 1 1.11 reinoud /* $NetBSD: udf.h,v 1.11 2008/05/14 16:49:48 reinoud Exp $ */
2 1.1 reinoud
3 1.1 reinoud /*
4 1.11 reinoud * Copyright (c) 2006, 2008 Reinoud Zandijk
5 1.1 reinoud * All rights reserved.
6 1.1 reinoud *
7 1.1 reinoud * Redistribution and use in source and binary forms, with or without
8 1.1 reinoud * modification, are permitted provided that the following conditions
9 1.1 reinoud * are met:
10 1.1 reinoud * 1. Redistributions of source code must retain the above copyright
11 1.1 reinoud * notice, this list of conditions and the following disclaimer.
12 1.1 reinoud * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 reinoud * notice, this list of conditions and the following disclaimer in the
14 1.1 reinoud * documentation and/or other materials provided with the distribution.
15 1.1 reinoud *
16 1.1 reinoud * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17 1.1 reinoud * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 1.1 reinoud * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19 1.1 reinoud * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20 1.1 reinoud * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21 1.1 reinoud * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 1.1 reinoud * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 1.1 reinoud * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 1.1 reinoud * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25 1.1 reinoud * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 1.1 reinoud *
27 1.1 reinoud */
28 1.1 reinoud
29 1.4 christos #ifndef _FS_UDF_UDF_H_
30 1.4 christos #define _FS_UDF_UDF_H_
31 1.1 reinoud
32 1.1 reinoud #include <sys/queue.h>
33 1.1 reinoud #include <sys/uio.h>
34 1.10 ad #include <sys/mutex.h>
35 1.1 reinoud
36 1.1 reinoud #include "udf_osta.h"
37 1.1 reinoud #include "ecma167-udf.h"
38 1.1 reinoud #include <sys/cdio.h>
39 1.11 reinoud #include <sys/bufq.h>
40 1.11 reinoud #include <sys/disk.h>
41 1.11 reinoud #include <sys/kthread.h>
42 1.1 reinoud #include <miscfs/genfs/genfs_node.h>
43 1.1 reinoud
44 1.1 reinoud /* debug section */
45 1.1 reinoud extern int udf_verbose;
46 1.1 reinoud
47 1.11 reinoud /* undefine UDF_COMPLETE_DELETE to need `purge'; but purge is not implemented */
48 1.11 reinoud #define UDF_COMPLETE_DELETE
49 1.1 reinoud
50 1.1 reinoud /* debug categories */
51 1.11 reinoud #define UDF_DEBUG_VOLUMES 0x00001
52 1.11 reinoud #define UDF_DEBUG_LOCKING 0x00002
53 1.11 reinoud #define UDF_DEBUG_NODE 0x00004
54 1.11 reinoud #define UDF_DEBUG_LOOKUP 0x00008
55 1.11 reinoud #define UDF_DEBUG_READDIR 0x00010
56 1.11 reinoud #define UDF_DEBUG_FIDS 0x00020
57 1.11 reinoud #define UDF_DEBUG_DESCRIPTOR 0x00040
58 1.11 reinoud #define UDF_DEBUG_TRANSLATE 0x00080
59 1.11 reinoud #define UDF_DEBUG_STRATEGY 0x00100
60 1.11 reinoud #define UDF_DEBUG_READ 0x00200
61 1.11 reinoud #define UDF_DEBUG_WRITE 0x00400
62 1.11 reinoud #define UDF_DEBUG_CALL 0x00800
63 1.11 reinoud #define UDF_DEBUG_ATTR 0x01000
64 1.11 reinoud #define UDF_DEBUG_EXTATTR 0x02000
65 1.11 reinoud #define UDF_DEBUG_ALLOC 0x04000
66 1.11 reinoud #define UDF_DEBUG_ADWLK 0x08000
67 1.11 reinoud #define UDF_DEBUG_NOTIMPL 0x10000
68 1.11 reinoud #define UDF_DEBUG_SHEDULE 0x20000
69 1.11 reinoud #define UDF_DEBUG_SYNC 0x40000
70 1.11 reinoud #define UDF_DEBUG_PARANOIA 0x80000
71 1.11 reinoud
72 1.11 reinoud /* initial value of udf_verbose */
73 1.11 reinoud #define UDF_DEBUGGING 0
74 1.1 reinoud
75 1.1 reinoud
76 1.1 reinoud #ifdef DEBUG
77 1.8 reinoud #ifdef SYSCTL_SETUP_PROTO
78 1.8 reinoud SYSCTL_SETUP_PROTO(sysctl_vfs_udf_setup);
79 1.8 reinoud #endif /* SYSCTL_SETUP_PROTO */
80 1.8 reinoud #endif
81 1.8 reinoud
82 1.8 reinoud
83 1.8 reinoud #ifdef DEBUG
84 1.1 reinoud #define DPRINTF(name, arg) { \
85 1.1 reinoud if (udf_verbose & UDF_DEBUG_##name) {\
86 1.1 reinoud printf arg;\
87 1.1 reinoud };\
88 1.1 reinoud }
89 1.1 reinoud #define DPRINTFIF(name, cond, arg) { \
90 1.1 reinoud if (udf_verbose & UDF_DEBUG_##name) { \
91 1.1 reinoud if (cond) printf arg;\
92 1.1 reinoud };\
93 1.1 reinoud }
94 1.1 reinoud #else
95 1.1 reinoud #define DPRINTF(name, arg) {}
96 1.1 reinoud #define DPRINTFIF(name, cond, arg) {}
97 1.1 reinoud #endif
98 1.1 reinoud
99 1.1 reinoud
100 1.1 reinoud /* constants to identify what kind of identifier we are dealing with */
101 1.1 reinoud #define UDF_REGID_DOMAIN 1
102 1.1 reinoud #define UDF_REGID_UDF 2
103 1.1 reinoud #define UDF_REGID_IMPLEMENTATION 3
104 1.1 reinoud #define UDF_REGID_APPLICATION 4
105 1.1 reinoud #define UDF_REGID_NAME 99
106 1.1 reinoud
107 1.1 reinoud
108 1.1 reinoud /* DON'T change these: they identify 13thmonkey's UDF implementation */
109 1.1 reinoud #define APP_NAME "*NetBSD UDF"
110 1.11 reinoud #define APP_VERSION_MAIN 0
111 1.11 reinoud #define APP_VERSION_SUB 4
112 1.11 reinoud #define IMPL_NAME "*NetBSD kernel UDF"
113 1.1 reinoud
114 1.1 reinoud
115 1.1 reinoud /* Configuration values */
116 1.1 reinoud #define UDF_INODE_HASHBITS 10
117 1.1 reinoud #define UDF_INODE_HASHSIZE (1<<UDF_INODE_HASHBITS)
118 1.1 reinoud #define UDF_INODE_HASHMASK (UDF_INODE_HASHSIZE - 1)
119 1.11 reinoud #define UDF_ECCBUF_HASHBITS 10
120 1.11 reinoud #define UDF_ECCBUF_HASHSIZE (1<<UDF_ECCBUF_HASHBITS)
121 1.11 reinoud #define UDF_ECCBUF_HASHMASK (UDF_ECCBUF_HASHSIZE -1)
122 1.11 reinoud
123 1.11 reinoud #define UDF_ECCLINE_MAXFREE 10 /* picked */
124 1.11 reinoud #define UDF_ECCLINE_MAXBUSY 100 /* picked */
125 1.11 reinoud
126 1.11 reinoud #define UDF_MAX_MAPPINGS (MAXPHYS/DEV_BSIZE) /* 128 */
127 1.11 reinoud #define UDF_VAT_CHUNKSIZE (64*1024) /* picked */
128 1.11 reinoud #define UDF_SYMLINKBUFLEN (64*1024) /* picked */
129 1.1 reinoud
130 1.1 reinoud
131 1.1 reinoud /* structure space */
132 1.1 reinoud #define UDF_ANCHORS 4 /* 256, 512, N-256, N */
133 1.1 reinoud #define UDF_PARTITIONS 4 /* overkill */
134 1.11 reinoud #define UDF_PMAPS 5 /* overkill */
135 1.11 reinoud #define UDF_LVDINT_SEGMENTS 100 /* big overkill */
136 1.11 reinoud #define UDF_LVINT_LOSSAGE 4 /* lose 2 openings */
137 1.11 reinoud #define UDF_MAX_ALLOC_EXTENTS 10 /* overkill */
138 1.1 reinoud
139 1.1 reinoud
140 1.1 reinoud /* constants */
141 1.1 reinoud #define UDF_MAX_NAMELEN 255 /* as per SPEC */
142 1.1 reinoud #define UDF_TRANS_ZERO ((uint64_t) -1)
143 1.1 reinoud #define UDF_TRANS_UNMAPPED ((uint64_t) -2)
144 1.1 reinoud #define UDF_TRANS_INTERN ((uint64_t) -3)
145 1.1 reinoud #define UDF_MAX_SECTOR ((uint64_t) -10) /* high water mark */
146 1.1 reinoud
147 1.1 reinoud
148 1.11 reinoud /* RW content hint for allocation and other purposes */
149 1.11 reinoud #define UDF_C_PROCESSED 0 /* not relevant */
150 1.11 reinoud #define UDF_C_USERDATA 1 /* all but userdata is metadata */
151 1.11 reinoud //#define UDF_C_METADATA 2 /* unspecified metadata */
152 1.11 reinoud #define UDF_C_DSCR 3 /* update sectornr and CRC */
153 1.11 reinoud #define UDF_C_NODE 4 /* file/dir node, update sectornr and CRC */
154 1.11 reinoud #define UDF_C_EXTATTRS 5 /* dunno what to do yet */
155 1.11 reinoud #define UDF_C_FIDS 6 /* update all contained fids */
156 1.11 reinoud
157 1.11 reinoud
158 1.11 reinoud /* use unused b_freelistindex for our UDF_C_TYPE */
159 1.11 reinoud #define b_udf_c_type b_freelistindex
160 1.11 reinoud
161 1.11 reinoud
162 1.11 reinoud /* virtual to physical mapping types */
163 1.11 reinoud #define UDF_VTOP_RAWPART UDF_PMAPS /* [0..UDF_PMAPS> are normal */
164 1.11 reinoud
165 1.11 reinoud #define UDF_VTOP_TYPE_RAW 0
166 1.11 reinoud #define UDF_VTOP_TYPE_UNKNOWN 0
167 1.11 reinoud #define UDF_VTOP_TYPE_PHYS 1
168 1.11 reinoud #define UDF_VTOP_TYPE_VIRT 2
169 1.11 reinoud #define UDF_VTOP_TYPE_SPARABLE 3
170 1.11 reinoud #define UDF_VTOP_TYPE_META 4
171 1.11 reinoud
172 1.11 reinoud
173 1.11 reinoud /* allocation strategies */
174 1.11 reinoud #define UDF_ALLOC_SEQUENTIAL 1 /* linear on NWA */
175 1.11 reinoud #define UDF_ALLOC_VAT 2 /* VAT handling */
176 1.11 reinoud #define UDF_ALLOC_SPACEMAP 3 /* spacemaps */
177 1.11 reinoud #define UDF_ALLOC_METABITMAP 4 /* metadata bitmap */
178 1.11 reinoud #define UDF_ALLOC_METASEQUENTIAL 5 /* in chunks seq., nodes not seq */
179 1.11 reinoud #define UDF_ALLOC_RELAXEDSEQUENTIAL 6 /* only nodes not seq. */
180 1.11 reinoud
181 1.11 reinoud
182 1.11 reinoud /* logical volume open/close actions */
183 1.11 reinoud #define UDF_OPEN_SESSION 0x01 /* if needed writeout VRS + VDS */
184 1.11 reinoud #define UDF_CLOSE_SESSION 0x02 /* close session after writing VAT */
185 1.11 reinoud #define UDF_WRITE_VAT 0x04 /* sequential VAT filesystem */
186 1.11 reinoud #define UDF_WRITE_LVINT 0x08 /* write out open lvint */
187 1.11 reinoud #define UDF_WRITE_PART_BITMAPS 0x10 /* write out partition space bitmaps */
188 1.11 reinoud #define UDF_APPENDONLY_LVINT 0x20 /* no shifting, only appending */
189 1.11 reinoud #define UDFLOGVOL_BITS "\20\1OPENSESSION\2CLOSESESSION\3WRITEVAT\4WRITELVINT"\
190 1.11 reinoud "\5APPENDONLY"
191 1.11 reinoud
192 1.11 reinoud /* logical volume error handling actions */
193 1.11 reinoud #define UDF_UPDATE_TRACKINFO 0x01 /* update trackinfo and re-shedule */
194 1.11 reinoud #define UDF_REMAP_BLOCK 0x02 /* remap the failing block length */
195 1.11 reinoud #define UDFONERROR_BITS "\20\1UPDATE_TRACKINFO\2REMAP_BLOCK"
196 1.11 reinoud
197 1.11 reinoud
198 1.11 reinoud /* readdir cookies */
199 1.11 reinoud #define UDF_DIRCOOKIE_DOT 1
200 1.11 reinoud
201 1.11 reinoud
202 1.1 reinoud /* malloc pools */
203 1.1 reinoud MALLOC_DECLARE(M_UDFMNT);
204 1.1 reinoud MALLOC_DECLARE(M_UDFVOLD);
205 1.1 reinoud MALLOC_DECLARE(M_UDFTEMP);
206 1.1 reinoud
207 1.1 reinoud struct pool udf_node_pool;
208 1.11 reinoud struct udf_node;
209 1.11 reinoud struct udf_strategy;
210 1.11 reinoud
211 1.11 reinoud
212 1.11 reinoud struct udf_lvintq {
213 1.11 reinoud uint32_t start;
214 1.11 reinoud uint32_t end;
215 1.11 reinoud uint32_t pos;
216 1.11 reinoud uint32_t wpos;
217 1.11 reinoud };
218 1.11 reinoud
219 1.11 reinoud
220 1.11 reinoud struct udf_bitmap {
221 1.11 reinoud uint8_t *blob; /* allocated */
222 1.11 reinoud uint8_t *bits; /* bits themselves */
223 1.11 reinoud uint8_t *pages; /* dirty pages */
224 1.11 reinoud uint32_t max_offset; /* in bits */
225 1.11 reinoud uint32_t data_pos; /* position in data */
226 1.11 reinoud uint32_t metadata_pos; /* .. in metadata */
227 1.11 reinoud };
228 1.11 reinoud
229 1.11 reinoud
230 1.11 reinoud struct udf_strat_args {
231 1.11 reinoud struct udf_mount *ump;
232 1.11 reinoud struct udf_node *udf_node;
233 1.11 reinoud struct long_ad *icb;
234 1.11 reinoud union dscrptr *dscr;
235 1.11 reinoud struct buf *nestbuf;
236 1.11 reinoud kauth_cred_t cred;
237 1.11 reinoud int waitfor;
238 1.11 reinoud };
239 1.11 reinoud
240 1.11 reinoud struct udf_strategy {
241 1.11 reinoud int (*create_logvol_dscr) (struct udf_strat_args *args);
242 1.11 reinoud void (*free_logvol_dscr) (struct udf_strat_args *args);
243 1.11 reinoud int (*read_logvol_dscr) (struct udf_strat_args *args);
244 1.11 reinoud int (*write_logvol_dscr) (struct udf_strat_args *args);
245 1.11 reinoud void (*queuebuf) (struct udf_strat_args *args);
246 1.11 reinoud void (*discstrat_init) (struct udf_strat_args *args);
247 1.11 reinoud void (*discstrat_finish) (struct udf_strat_args *args);
248 1.11 reinoud };
249 1.11 reinoud
250 1.11 reinoud extern struct udf_strategy udf_strat_bootstrap;
251 1.11 reinoud extern struct udf_strategy udf_strat_sequential;
252 1.11 reinoud extern struct udf_strategy udf_strat_direct;
253 1.11 reinoud extern struct udf_strategy udf_strat_rmw;
254 1.1 reinoud
255 1.1 reinoud
256 1.1 reinoud /* pre cleanup */
257 1.1 reinoud struct udf_mount {
258 1.1 reinoud struct mount *vfs_mountp;
259 1.1 reinoud struct vnode *devvp;
260 1.1 reinoud struct mmc_discinfo discinfo;
261 1.1 reinoud struct udf_args mount_args;
262 1.1 reinoud
263 1.11 reinoud /* format descriptors */
264 1.11 reinoud kmutex_t logvol_mutex;
265 1.1 reinoud struct anchor_vdp *anchors[UDF_ANCHORS]; /* anchors to VDS */
266 1.1 reinoud struct pri_vol_desc *primary_vol; /* identification */
267 1.1 reinoud struct logvol_desc *logical_vol; /* main mapping v->p */
268 1.1 reinoud struct unalloc_sp_desc *unallocated; /* free UDF space */
269 1.1 reinoud struct impvol_desc *implementation; /* likely reduntant */
270 1.1 reinoud struct logvol_int_desc *logvol_integrity; /* current integrity */
271 1.1 reinoud struct part_desc *partitions[UDF_PARTITIONS]; /* partitions */
272 1.11 reinoud /* logvol_info is derived; points *into* other structures */
273 1.1 reinoud struct udf_logvol_info *logvol_info; /* integrity descr. */
274 1.1 reinoud
275 1.1 reinoud /* fileset and root directories */
276 1.1 reinoud struct fileset_desc *fileset_desc; /* normally one */
277 1.1 reinoud
278 1.11 reinoud /* tracing logvol integrity history */
279 1.11 reinoud struct udf_lvintq lvint_trace[UDF_LVDINT_SEGMENTS];
280 1.11 reinoud int lvopen; /* logvol actions */
281 1.11 reinoud int lvclose; /* logvol actions */
282 1.11 reinoud
283 1.11 reinoud /* disc allocation / writing method */
284 1.11 reinoud int lvreadwrite; /* bits */
285 1.11 reinoud int data_alloc; /* all userdata */
286 1.11 reinoud int meta_alloc; /* all metadata */
287 1.11 reinoud int data_part;
288 1.11 reinoud int metadata_part;
289 1.11 reinoud kmutex_t allocate_mutex;
290 1.11 reinoud
291 1.1 reinoud /* logical to physical translations */
292 1.1 reinoud int vtop[UDF_PMAPS+1]; /* vpartnr trans */
293 1.1 reinoud int vtop_tp[UDF_PMAPS+1]; /* type of trans */
294 1.1 reinoud
295 1.11 reinoud /* sequential track info */
296 1.11 reinoud struct mmc_trackinfo data_track;
297 1.11 reinoud struct mmc_trackinfo metadata_track;
298 1.11 reinoud
299 1.5 reinoud /* VAT */
300 1.5 reinoud uint32_t first_possible_vat_location;
301 1.5 reinoud uint32_t last_possible_vat_location;
302 1.1 reinoud uint32_t vat_entries;
303 1.1 reinoud uint32_t vat_offset; /* offset in table */
304 1.11 reinoud uint32_t vat_last_free_lb; /* last free lb_num */
305 1.11 reinoud uint32_t vat_table_len;
306 1.11 reinoud uint32_t vat_table_alloc_len;
307 1.11 reinoud uint8_t *vat_table;
308 1.11 reinoud uint8_t *vat_pages; /* TODO */
309 1.11 reinoud struct udf_node *vat_node; /* system node */
310 1.11 reinoud
311 1.11 reinoud /* space bitmaps */
312 1.11 reinoud struct space_bitmap_desc*part_unalloc_dscr[UDF_PARTITIONS];
313 1.11 reinoud struct space_bitmap_desc*part_freed_dscr [UDF_PARTITIONS];
314 1.11 reinoud struct udf_bitmap part_unalloc_bits[UDF_PARTITIONS];
315 1.11 reinoud struct udf_bitmap part_freed_bits [UDF_PARTITIONS];
316 1.1 reinoud
317 1.5 reinoud /* sparable */
318 1.11 reinoud uint32_t sparable_packet_size;
319 1.11 reinoud uint32_t packet_size;
320 1.1 reinoud struct udf_sparing_table*sparing_table;
321 1.1 reinoud
322 1.5 reinoud /* meta */
323 1.11 reinoud struct udf_node *metadata_node; /* system node */
324 1.11 reinoud struct udf_node *metadatamirror_node; /* system node */
325 1.11 reinoud struct udf_node *metadatabitmap_node; /* system node */
326 1.11 reinoud struct udf_bitmap metadata_bitmap; /* TODO : readin */
327 1.1 reinoud
328 1.11 reinoud /* hash table to lookup icb -> udf_node and sorted list for sync */
329 1.11 reinoud kmutex_t ihash_lock;
330 1.11 reinoud kmutex_t get_node_lock;
331 1.1 reinoud LIST_HEAD(, udf_node) udf_nodes[UDF_INODE_HASHSIZE];
332 1.11 reinoud LIST_HEAD(, udf_node) sorted_udf_nodes; /* sorted sync list */
333 1.1 reinoud
334 1.11 reinoud /* syncing */
335 1.11 reinoud int syncing; /* are we syncing? */
336 1.11 reinoud kcondvar_t dirtynodes_cv; /* sleeping on sync */
337 1.11 reinoud
338 1.11 reinoud /* late allocation */
339 1.11 reinoud uint32_t uncomitted_lb; /* for free space */
340 1.11 reinoud struct long_ad *la_node_ad_cpy; /* issue buf */
341 1.11 reinoud uint64_t *la_lmapping, *la_pmapping; /* issue buf */
342 1.1 reinoud
343 1.1 reinoud /* lists */
344 1.1 reinoud STAILQ_HEAD(udfmntpts, udf_mount) all_udf_mntpnts;
345 1.11 reinoud
346 1.11 reinoud /* device strategy */
347 1.11 reinoud struct udf_strategy *strategy;
348 1.11 reinoud void *strategy_private;
349 1.1 reinoud };
350 1.1 reinoud
351 1.11 reinoud /*
352 1.11 reinoud * UDF node describing a file/directory.
353 1.11 reinoud *
354 1.11 reinoud * BUGALERT claim node_mutex before reading/writing to prevent inconsistencies !
355 1.11 reinoud */
356 1.1 reinoud struct udf_node {
357 1.1 reinoud struct genfs_node i_gnode; /* has to be first */
358 1.1 reinoud struct vnode *vnode; /* vnode associated */
359 1.1 reinoud struct udf_mount *ump;
360 1.1 reinoud
361 1.11 reinoud kmutex_t node_mutex;
362 1.11 reinoud kcondvar_t node_lock; /* sleeping lock */
363 1.11 reinoud char const *lock_fname;
364 1.11 reinoud int lock_lineno;
365 1.11 reinoud
366 1.1 reinoud /* one of `fe' or `efe' can be set, not both (UDF file entry dscr.) */
367 1.1 reinoud struct file_entry *fe;
368 1.1 reinoud struct extfile_entry *efe;
369 1.11 reinoud struct alloc_ext_entry *ext[UDF_MAX_ALLOC_EXTENTS];
370 1.11 reinoud int num_extensions;
371 1.1 reinoud
372 1.11 reinoud /* location found, recording location & hints */
373 1.1 reinoud struct long_ad loc; /* FID/hash loc. */
374 1.11 reinoud struct long_ad write_loc; /* strat 4096 loc */
375 1.1 reinoud int needs_indirect; /* has missing indr. */
376 1.11 reinoud struct long_ad ext_loc[UDF_MAX_ALLOC_EXTENTS];
377 1.11 reinoud
378 1.7 reinoud uint64_t last_diroffset; /* speeding up lookup*/
379 1.1 reinoud
380 1.1 reinoud /* misc */
381 1.11 reinoud uint32_t i_flags; /* associated flags */
382 1.1 reinoud struct lockf *lockf; /* lock list */
383 1.11 reinoud uint32_t outstanding_bufs; /* file data */
384 1.11 reinoud uint32_t outstanding_nodedscr; /* node dscr */
385 1.1 reinoud
386 1.11 reinoud /* references to associated nodes */
387 1.1 reinoud struct udf_node *extattr;
388 1.1 reinoud struct udf_node *streamdir;
389 1.11 reinoud struct udf_node *my_parent; /* if extended attr. */
390 1.1 reinoud
391 1.11 reinoud LIST_ENTRY(udf_node) hashchain; /* inside hash line */
392 1.11 reinoud LIST_ENTRY(udf_node) sortchain; /* sorted udf nodes */
393 1.1 reinoud };
394 1.1 reinoud
395 1.11 reinoud
396 1.11 reinoud /* misc. flags stored in i_flags (XXX needs cleaning up) */
397 1.11 reinoud #define IN_ACCESS 0x0001 /* Inode access time update request. */
398 1.11 reinoud #define IN_CHANGE 0x0002 /* Inode change time update request. */
399 1.11 reinoud #define IN_UPDATE 0x0004 /* Inode was written to; update mtime*/
400 1.11 reinoud #define IN_MODIFY 0x0008 /* Modification time update request. */
401 1.11 reinoud #define IN_MODIFIED 0x0010 /* node has been modified. */
402 1.11 reinoud #define IN_ACCESSED 0x0020 /* node has been accessed. */
403 1.11 reinoud #define IN_RENAME 0x0040 /* node is being renamed. XXX ?? */
404 1.11 reinoud #define IN_DELETED 0x0080 /* node is unlinked, no FID reference */
405 1.11 reinoud #define IN_LOCKED 0x0100 /* node is locked by condvar */
406 1.11 reinoud #define IN_SYNCED 0x0200 /* node is being used by sync */
407 1.11 reinoud #define IN_CALLBACK_ULK 0x0400 /* node will be unlocked by callback */
408 1.11 reinoud
409 1.11 reinoud
410 1.11 reinoud #define IN_FLAGBITS \
411 1.11 reinoud "\10\1IN_ACCESS\2IN_CHANGE\3IN_UPDATE\4IN_MODIFY\5IN_MODIFIED" \
412 1.11 reinoud "\6IN_ACCESSED\7IN_RENAME\10IN_DELETED\11IN_LOCKED\12IN_SYNCED" \
413 1.11 reinoud "\13IN_CALLBACK_ULK"
414 1.11 reinoud
415 1.3 reinoud #endif /* !_FS_UDF_UDF_H_ */
416