1 #ifndef _WIMLIB_DENTRY_H
2 #define _WIMLIB_DENTRY_H
10 typedef struct WIMStruct WIMStruct;
12 /* Size of the struct dentry up to and including the file_name_len. */
13 #define WIM_DENTRY_DISK_SIZE 102
15 #define WIM_ADS_ENTRY_DISK_SIZE 38
18 #define WIM_HASH_SIZE 20
22 * Reparse tags documented at
23 * http://msdn.microsoft.com/en-us/library/dd541667(v=prot.10).aspx
25 #define WIM_IO_REPARSE_TAG_RESERVED_ZERO 0x00000000
26 #define WIM_IO_REPARSE_TAG_RESERVED_ONE 0x00000001
27 #define WIM_IO_REPARSE_TAG_MOUNT_POINT 0xA0000003
28 #define WIM_IO_REPARSE_TAG_HSM 0xC0000004
29 #define WIM_IO_REPARSE_TAG_HSM2 0x80000006
30 #define WIM_IO_REPARSE_TAG_DRIVER_EXTENDER 0x80000005
31 #define WIM_IO_REPARSE_TAG_SIS 0x80000007
32 #define WIM_IO_REPARSE_TAG_DFS 0x8000000A
33 #define WIM_IO_REPARSE_TAG_DFSR 0x80000012
34 #define WIM_IO_REPARSE_TAG_FILTER_MANAGER 0x8000000B
35 #define WIM_IO_REPARSE_TAG_SYMLINK 0xA000000C
37 #define FILE_ATTRIBUTE_READONLY 0x00000001
38 #define FILE_ATTRIBUTE_HIDDEN 0x00000002
39 #define FILE_ATTRIBUTE_SYSTEM 0x00000004
40 #define FILE_ATTRIBUTE_DIRECTORY 0x00000010
41 #define FILE_ATTRIBUTE_ARCHIVE 0x00000020
42 #define FILE_ATTRIBUTE_DEVICE 0x00000040
43 #define FILE_ATTRIBUTE_NORMAL 0x00000080
44 #define FILE_ATTRIBUTE_TEMPORARY 0x00000100
45 #define FILE_ATTRIBUTE_SPARSE_FILE 0x00000200
46 #define FILE_ATTRIBUTE_REPARSE_POINT 0x00000400
47 #define FILE_ATTRIBUTE_COMPRESSED 0x00000800
48 #define FILE_ATTRIBUTE_OFFLINE 0x00001000
49 #define FILE_ATTRIBUTE_NOT_CONTENT_INDEXED 0x00002000
50 #define FILE_ATTRIBUTE_ENCRYPTED 0x00004000
51 #define FILE_ATTRIBUTE_VIRTUAL 0x00010000
53 /* Alternate data stream entry */
55 /* SHA-1 message digest of stream contents */
56 u8 hash[WIM_HASH_SIZE];
58 /* Length of stream name (UTF-16) */
61 /* Length of stream name (UTF-8) */
62 u16 stream_name_utf8_len;
64 /* Stream name (UTF-16) */
67 /* Stream name (UTF-8) */
68 char *stream_name_utf8;
71 static inline u64 ads_entry_length(const struct ads_entry *entry)
73 u64 len = WIM_ADS_ENTRY_DISK_SIZE + entry->stream_name_len + 2;
74 return (len + 7) & ~7;
77 static inline void destroy_ads_entry(struct ads_entry *entry)
79 FREE(entry->stream_name);
80 FREE(entry->stream_name_utf8);
81 memset(entry, 0, sizeof(entry));
85 /* In-memory structure for a directory entry. There is a directory tree for
86 * each image in the WIM. */
88 /* The parent of this directory entry. */
89 struct dentry *parent;
91 /* Linked list of sibling directory entries. */
96 /* Pointer to a child of this directory entry. */
97 struct dentry *children;
99 /* Size of directory entry, in bytes. Typical size is around 104 to 120
101 /* It is possible for the length field to be 0. This situation, which
102 * is undocumented, indicates the end of a list of sibling nodes in a
103 * directory. It also means the real length is 8, because the dentry
104 * included only the length field, but that takes up 8 bytes. */
108 /* The file attributes associated with this file. */
111 /* The index of the node in the security table that contains this file's
112 * security information. If -1, no security information exists for this
116 /* The offset, from the start of the metadata section, of this directory
117 * entry's child files. 0 if the directory entry has no children. */
120 /* Reserved for future disuse. Currently ignoring these fields. */
124 /* Timestamps for the entry. The timestamps are the number of
125 * 100-nanosecond intervals that have elapsed since 12:00 A.M., January
128 u64 last_access_time;
131 /* A hash of the file's contents. */
132 u8 hash[WIM_HASH_SIZE];
134 /* Identity of a reparse point. See
135 * http://msdn.microsoft.com/en-us/library/windows/desktop/aa365503(v=vs.85).aspx
136 * for what a reparse point is. */
139 /* Although M$'s documentation does not tell you this, it seems that the
140 * reparse_reserved field does not actually exist. So the hard_link
141 * field directly follows the reparse_tag on disk. EXCEPT when the
142 * dentry is actually a reparse point... well, just take a look at the
143 * read_dentry() function. */
144 //u32 reparse_reserved;
146 /* If the reparse_reserved field existed, there would be a 4-byte gap
147 * here to align hard_link on an 8-byte field. However,
148 * reparse_reserved does not actually exist, so there is no gap here. */
150 /* If the file is part of a hard link set, all the directory entries in
151 * the set will share the same value for this field. */
154 /* Number of alternate data streams associated with this file. */
157 /* Length of short filename, in bytes, not including the terminating
158 * zero wide-character. */
161 /* Length of file name, in bytes, not including the terminating zero
165 /* Length of the filename converted into UTF-8, in bytes, not including
166 * the terminating zero byte. */
167 u16 file_name_utf8_len;
169 /* Pointer to the short filename */
172 /* Pointer to the filename. */
175 /* Pointer to the filename converted to UTF-8. */
176 char *file_name_utf8;
178 /* Full path to this dentry. */
179 char *full_path_utf8;
180 u32 full_path_utf8_len;
182 /* Alternate stream entries for this dentry. */
183 struct ads_entry *ads_entries;
185 /* Number of references to the dentry tree itself, as in multiple
189 /* Next dentry in the hard link set */
190 //struct dentry *next_dentry_in_link_set;
191 /* Next hard link that has a lookup table entry */
192 //struct dentry *next_link_set;
195 /* Return hash of the "unnamed" (default) data stream. */
196 static inline const u8 *dentry_hash(const struct dentry *dentry)
198 /* If there are alternate data streams, the dentry hash field is zeroed
199 * out, and we need to find the hash in the un-named data stream (should
200 * be the first one, but check them in order just in case, and fall back
201 * to the dentry hash field if we can't find an unnamed data stream). */
202 for (u16 i = 0; i < dentry->num_ads; i++)
203 if (dentry->ads_entries[i].stream_name_len == 0)
204 return dentry->ads_entries[i].hash;
209 extern struct ads_entry *dentry_get_ads_entry(struct dentry *dentry,
210 const char *stream_name);
212 extern struct ads_entry *dentry_add_ads(struct dentry *dentry,
213 const char *stream_name);
215 extern void dentry_remove_ads(struct dentry *dentry, struct ads_entry *entry);
217 extern const char *path_stream_name(const char *path);
219 extern u64 dentry_total_length(const struct dentry *dentry);
221 extern void stbuf_to_dentry(const struct stat *stbuf, struct dentry *dentry);
223 extern void dentry_to_stbuf(const struct dentry *dentry, struct stat *stbuf,
224 const struct lookup_table *table);
226 extern int for_dentry_in_tree(struct dentry *root,
227 int (*visitor)(struct dentry*, void*),
230 extern int for_dentry_in_tree_depth(struct dentry *root,
231 int (*visitor)(struct dentry*, void*),
234 extern int calculate_dentry_full_path(struct dentry *dentry, void *ignore);
235 extern void calculate_subdir_offsets(struct dentry *dentry, u64 *subdir_offset_p);
236 extern int change_dentry_name(struct dentry *dentry, const char *new_name);
237 extern int change_ads_name(struct ads_entry *entry, const char *new_name);
239 extern void unlink_dentry(struct dentry *dentry);
240 extern void link_dentry(struct dentry *dentry, struct dentry *parent);
242 extern int print_dentry(struct dentry *dentry, void *lookup_table);
243 extern int print_dentry_full_path(struct dentry *entry, void *ignore);
245 extern struct dentry *get_dentry(WIMStruct *w, const char *path);
246 extern struct dentry *get_parent_dentry(WIMStruct *w, const char *path);
247 extern struct dentry *get_dentry_child_with_name(const struct dentry *dentry,
249 extern void dentry_update_all_timestamps(struct dentry *dentry);
250 extern void init_dentry(struct dentry *dentry, const char *name);
251 extern struct dentry *new_dentry(const char *name);
253 extern void free_dentry(struct dentry *dentry);
254 extern void free_dentry_tree(struct dentry *root,
255 struct lookup_table *lookup_table,
256 bool lt_decrement_refcnt);
257 extern int increment_dentry_refcnt(struct dentry *dentry, void *ignore);
258 extern int decrement_dentry_refcnt(struct dentry *dentry, void *ignore);
260 extern void calculate_dir_tree_statistics(struct dentry *root,
261 struct lookup_table *table,
264 u64 *total_bytes_ret,
265 u64 *hard_link_bytes_ret);
267 extern int read_dentry(const u8 metadata_resource[], u64 metadata_resource_len,
268 u64 offset, struct dentry *dentry);
270 extern int read_dentry_tree(const u8 metadata_resource[],
271 u64 metadata_resource_len, struct dentry *dentry);
273 extern u8 *write_dentry_tree(const struct dentry *tree, u8 *p);
275 extern int dentry_set_symlink_buf(struct dentry *dentry,
276 const u8 symlink_buf_hash[]);
278 /* Inline utility functions for WIMDentries */
281 static inline bool dentry_is_root(const struct dentry *dentry)
283 return dentry->parent == dentry;
286 static inline bool dentry_is_first_sibling(const struct dentry *dentry)
288 return dentry_is_root(dentry) || dentry->parent->children == dentry;
291 static inline bool dentry_is_only_child(const struct dentry *dentry)
293 return dentry->next == dentry;
296 static inline bool dentry_is_directory(const struct dentry *dentry)
298 return (dentry->attributes & FILE_ATTRIBUTE_DIRECTORY)
299 && !(dentry->attributes & FILE_ATTRIBUTE_REPARSE_POINT);
302 /* For our purposes, we consider "real" symlinks and "junction points" to both
304 static inline bool dentry_is_symlink(const struct dentry *dentry)
306 return (dentry->attributes & FILE_ATTRIBUTE_REPARSE_POINT)
307 && ((dentry->reparse_tag == WIM_IO_REPARSE_TAG_SYMLINK) ||
308 dentry->reparse_tag == WIM_IO_REPARSE_TAG_MOUNT_POINT);
311 static inline bool dentry_is_regular_file(const struct dentry *dentry)
313 return !dentry_is_directory(dentry) && !dentry_is_symlink(dentry);
316 static inline bool dentry_is_empty_directory(const struct dentry *dentry)
318 return dentry_is_directory(dentry) && dentry->children == NULL;