1 #ifndef _WIMLIB_DENTRY_H
2 #define _WIMLIB_DENTRY_H
12 typedef struct WIMStruct WIMStruct;
14 /* Size of the struct dentry up to and including the file_name_len. */
15 #define WIM_DENTRY_DISK_SIZE 102
17 #define WIM_ADS_ENTRY_DISK_SIZE 38
20 #define WIM_HASH_SIZE 20
24 * Reparse tags documented at
25 * http://msdn.microsoft.com/en-us/library/dd541667(v=prot.10).aspx
27 #define WIM_IO_REPARSE_TAG_RESERVED_ZERO 0x00000000
28 #define WIM_IO_REPARSE_TAG_RESERVED_ONE 0x00000001
29 #define WIM_IO_REPARSE_TAG_MOUNT_POINT 0xA0000003
30 #define WIM_IO_REPARSE_TAG_HSM 0xC0000004
31 #define WIM_IO_REPARSE_TAG_HSM2 0x80000006
32 #define WIM_IO_REPARSE_TAG_DRIVER_EXTENDER 0x80000005
33 #define WIM_IO_REPARSE_TAG_SIS 0x80000007
34 #define WIM_IO_REPARSE_TAG_DFS 0x8000000A
35 #define WIM_IO_REPARSE_TAG_DFSR 0x80000012
36 #define WIM_IO_REPARSE_TAG_FILTER_MANAGER 0x8000000B
37 #define WIM_IO_REPARSE_TAG_SYMLINK 0xA000000C
39 #define FILE_ATTRIBUTE_READONLY 0x00000001
40 #define FILE_ATTRIBUTE_HIDDEN 0x00000002
41 #define FILE_ATTRIBUTE_SYSTEM 0x00000004
42 #define FILE_ATTRIBUTE_DIRECTORY 0x00000010
43 #define FILE_ATTRIBUTE_ARCHIVE 0x00000020
44 #define FILE_ATTRIBUTE_DEVICE 0x00000040
45 #define FILE_ATTRIBUTE_NORMAL 0x00000080
46 #define FILE_ATTRIBUTE_TEMPORARY 0x00000100
47 #define FILE_ATTRIBUTE_SPARSE_FILE 0x00000200
48 #define FILE_ATTRIBUTE_REPARSE_POINT 0x00000400
49 #define FILE_ATTRIBUTE_COMPRESSED 0x00000800
50 #define FILE_ATTRIBUTE_OFFLINE 0x00001000
51 #define FILE_ATTRIBUTE_NOT_CONTENT_INDEXED 0x00002000
52 #define FILE_ATTRIBUTE_ENCRYPTED 0x00004000
53 #define FILE_ATTRIBUTE_VIRTUAL 0x00010000
55 /* Alternate data stream entry */
57 /* SHA-1 message digest of stream contents */
58 u8 hash[WIM_HASH_SIZE];
60 /* Length of stream name (UTF-16) */
63 /* Length of stream name (UTF-8) */
64 u16 stream_name_utf8_len;
66 /* Stream name (UTF-16) */
69 /* Stream name (UTF-8) */
70 char *stream_name_utf8;
73 static inline u64 ads_entry_length(const struct ads_entry *entry)
75 u64 len = WIM_ADS_ENTRY_DISK_SIZE + entry->stream_name_len + 2;
76 return (len + 7) & ~7;
79 static inline void destroy_ads_entry(struct ads_entry *entry)
81 FREE(entry->stream_name);
82 FREE(entry->stream_name_utf8);
83 memset(entry, 0, sizeof(entry));
86 static inline bool ads_entry_has_name(const struct ads_entry *entry,
87 const char *name, size_t name_len)
89 if (entry->stream_name_utf8_len != name_len)
91 return memcmp(entry->stream_name_utf8, name, name_len) == 0;
95 /* In-memory structure for a directory entry. There is a directory tree for
96 * each image in the WIM. */
98 /* The parent of this directory entry. */
99 struct dentry *parent;
101 /* Linked list of sibling directory entries. */
106 /* Pointer to a child of this directory entry. */
107 struct dentry *children;
109 /* Size of directory entry, in bytes. Typical size is around 104 to 120
111 /* It is possible for the length field to be 0. This situation, which
112 * is undocumented, indicates the end of a list of sibling nodes in a
113 * directory. It also means the real length is 8, because the dentry
114 * included only the length field, but that takes up 8 bytes. */
118 /* The file attributes associated with this file. */
121 /* The index of the node in the security table that contains this file's
122 * security information. If -1, no security information exists for this
126 /* The offset, from the start of the metadata section, of this directory
127 * entry's child files. 0 if the directory entry has no children. */
130 /* Reserved for future disuse. Currently ignoring these fields. */
134 /* Timestamps for the entry. The timestamps are the number of
135 * 100-nanosecond intervals that have elapsed since 12:00 A.M., January
138 u64 last_access_time;
141 /* A hash of the file's contents. */
142 u8 hash[WIM_HASH_SIZE];
144 /* Identity of a reparse point. See
145 * http://msdn.microsoft.com/en-us/library/windows/desktop/aa365503(v=vs.85).aspx
146 * for what a reparse point is. */
149 /* Although M$'s documentation does not tell you this, it seems that the
150 * reparse_reserved field does not actually exist. So the hard_link
151 * field directly follows the reparse_tag on disk. EXCEPT when the
152 * dentry is actually a reparse point... well, just take a look at the
153 * read_dentry() function. */
154 //u32 reparse_reserved;
156 /* If the reparse_reserved field existed, there would be a 4-byte gap
157 * here to align hard_link on an 8-byte field. However,
158 * reparse_reserved does not actually exist, so there is no gap here. */
160 /* If the file is part of a hard link set, all the directory entries in
161 * the set will share the same value for this field. */
164 /* Number of alternate data streams associated with this file. */
167 /* Length of short filename, in bytes, not including the terminating
168 * zero wide-character. */
171 /* Length of file name, in bytes, not including the terminating zero
175 /* Length of the filename converted into UTF-8, in bytes, not including
176 * the terminating zero byte. */
177 u16 file_name_utf8_len;
179 /* Pointer to the short filename */
182 /* Pointer to the filename. */
185 /* Pointer to the filename converted to UTF-8. */
186 char *file_name_utf8;
188 /* Full path to this dentry. */
189 char *full_path_utf8;
190 u32 full_path_utf8_len;
192 /* Alternate stream entries for this dentry. */
193 struct ads_entry *ads_entries;
195 /* Number of references to the dentry tree itself, as in multiple
199 /* List of dentries in the hard link set */
200 struct list_head link_group_list;
203 /* Return hash of the "unnamed" (default) data stream. */
204 static inline const u8 *dentry_hash(const struct dentry *dentry)
206 /* If there are alternate data streams, the dentry hash field is zeroed
207 * out, and we need to find the hash in the un-named data stream (should
208 * be the first one, but check them in order just in case, and fall back
209 * to the dentry hash field if we can't find an unnamed data stream). */
210 for (u16 i = 0; i < dentry->num_ads; i++)
211 if (dentry->ads_entries[i].stream_name_len == 0)
212 return dentry->ads_entries[i].hash;
216 static inline size_t dentry_link_group_size(struct dentry *dentry)
219 struct list_head *list;
220 list_for_each(list, &dentry->link_group_list)
225 extern struct ads_entry *dentry_get_ads_entry(struct dentry *dentry,
226 const char *stream_name);
228 extern struct ads_entry *dentry_add_ads(struct dentry *dentry,
229 const char *stream_name);
231 extern void dentry_remove_ads(struct dentry *dentry, struct ads_entry *entry);
233 extern const char *path_stream_name(const char *path);
235 extern u64 dentry_total_length(const struct dentry *dentry);
237 extern void stbuf_to_dentry(const struct stat *stbuf, struct dentry *dentry);
239 extern void dentry_to_stbuf(const struct dentry *dentry, struct stat *stbuf,
240 const struct lookup_table *table);
242 extern int for_dentry_in_tree(struct dentry *root,
243 int (*visitor)(struct dentry*, void*),
246 extern int for_dentry_in_tree_depth(struct dentry *root,
247 int (*visitor)(struct dentry*, void*),
250 extern int calculate_dentry_full_path(struct dentry *dentry, void *ignore);
251 extern void calculate_subdir_offsets(struct dentry *dentry, u64 *subdir_offset_p);
252 extern int change_dentry_name(struct dentry *dentry, const char *new_name);
253 extern int change_ads_name(struct ads_entry *entry, const char *new_name);
255 extern void unlink_dentry(struct dentry *dentry);
256 extern void link_dentry(struct dentry *dentry, struct dentry *parent);
258 extern int print_dentry(struct dentry *dentry, void *lookup_table);
259 extern int print_dentry_full_path(struct dentry *entry, void *ignore);
261 extern struct dentry *get_dentry(WIMStruct *w, const char *path);
262 extern struct dentry *get_parent_dentry(WIMStruct *w, const char *path);
263 extern struct dentry *get_dentry_child_with_name(const struct dentry *dentry,
265 extern void dentry_update_all_timestamps(struct dentry *dentry);
266 extern void init_dentry(struct dentry *dentry, const char *name);
267 extern struct dentry *new_dentry(const char *name);
269 extern void free_dentry(struct dentry *dentry);
270 extern void free_dentry_tree(struct dentry *root,
271 struct lookup_table *lookup_table,
272 bool lt_decrement_refcnt);
273 extern int increment_dentry_refcnt(struct dentry *dentry, void *ignore);
274 extern int decrement_dentry_refcnt(struct dentry *dentry, void *ignore);
276 extern void calculate_dir_tree_statistics(struct dentry *root,
277 struct lookup_table *table,
280 u64 *total_bytes_ret,
281 u64 *hard_link_bytes_ret);
283 extern int read_dentry(const u8 metadata_resource[], u64 metadata_resource_len,
284 u64 offset, struct dentry *dentry);
286 extern int read_dentry_tree(const u8 metadata_resource[],
287 u64 metadata_resource_len, struct dentry *dentry);
289 extern u8 *write_dentry_tree(const struct dentry *tree, u8 *p);
291 extern int dentry_set_symlink_buf(struct dentry *dentry,
292 const u8 symlink_buf_hash[]);
294 /* Inline utility functions for WIMDentries */
297 static inline bool dentry_is_root(const struct dentry *dentry)
299 return dentry->parent == dentry;
302 static inline bool dentry_is_first_sibling(const struct dentry *dentry)
304 return dentry_is_root(dentry) || dentry->parent->children == dentry;
307 static inline bool dentry_is_only_child(const struct dentry *dentry)
309 return dentry->next == dentry;
312 static inline bool dentry_is_directory(const struct dentry *dentry)
314 return (dentry->attributes & FILE_ATTRIBUTE_DIRECTORY)
315 && !(dentry->attributes & FILE_ATTRIBUTE_REPARSE_POINT);
318 /* For our purposes, we consider "real" symlinks and "junction points" to both
320 static inline bool dentry_is_symlink(const struct dentry *dentry)
322 return (dentry->attributes & FILE_ATTRIBUTE_REPARSE_POINT)
323 && ((dentry->reparse_tag == WIM_IO_REPARSE_TAG_SYMLINK) ||
324 dentry->reparse_tag == WIM_IO_REPARSE_TAG_MOUNT_POINT);
327 static inline bool dentry_is_regular_file(const struct dentry *dentry)
329 return !dentry_is_directory(dentry) && !dentry_is_symlink(dentry);
332 static inline bool dentry_is_empty_directory(const struct dentry *dentry)
334 return dentry_is_directory(dentry) && dentry->children == NULL;