4 * In the WIM file format, the dentries are stored in the "metadata resource"
5 * section right after the security data. Each image in the WIM file has its
6 * own metadata resource with its own security data and dentry tree. Dentries
7 * in different images may share file resources by referring to the same lookup
12 * Copyright (C) 2012, 2013, 2014 Eric Biggers
14 * This file is part of wimlib, a library for working with WIM files.
16 * wimlib is free software; you can redistribute it and/or modify it under the
17 * terms of the GNU General Public License as published by the Free Software
18 * Foundation; either version 3 of the License, or (at your option) any later
21 * wimlib is distributed in the hope that it will be useful, but WITHOUT ANY
22 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
23 * A PARTICULAR PURPOSE. See the GNU General Public License for more details.
25 * You should have received a copy of the GNU General Public License along with
26 * wimlib; if not, see http://www.gnu.org/licenses/.
34 #include "wimlib/case.h"
35 #include "wimlib/dentry.h"
36 #include "wimlib/encoding.h"
37 #include "wimlib/endianness.h"
38 #include "wimlib/error.h"
39 #include "wimlib/lookup_table.h"
40 #include "wimlib/metadata.h"
41 #include "wimlib/paths.h"
42 #include "wimlib/resource.h"
43 #include "wimlib/security.h"
44 #include "wimlib/sha1.h"
45 #include "wimlib/timestamp.h"
49 /* On-disk format of a WIM dentry (directory entry), located in the metadata
50 * resource for a WIM image. */
51 struct wim_dentry_on_disk {
53 /* Length of this directory entry in bytes, not including any alternate
54 * data stream entries. Should be a multiple of 8 so that the following
55 * dentry or alternate data stream entry is aligned on an 8-byte
56 * boundary. (If not, wimlib will round it up.) It must be at least as
57 * long as the fixed-length fields of the dentry (WIM_DENTRY_DISK_SIZE),
58 * plus the lengths of the file name and/or short name if present.
60 * It is also possible for this field to be 0. This situation, which is
61 * undocumented, indicates the end of a list of sibling nodes in a
62 * directory. It also means the real length is 8, because the dentry
63 * included only the length field, but that takes up 8 bytes. */
66 /* Attributes of the file or directory. This is a bitwise OR of the
67 * FILE_ATTRIBUTE_* constants and should correspond to the value
68 * retrieved by GetFileAttributes() on Windows. */
71 /* A value that specifies the security descriptor for this file or
72 * directory. If -1, the file or directory has no security descriptor.
73 * Otherwise, it is a 0-based index into the WIM image's table of
74 * security descriptors (see: `struct wim_security_data') */
77 /* Offset, in bytes, from the start of the uncompressed metadata
78 * resource of this directory's child directory entries, or 0 if this
79 * directory entry does not correspond to a directory or otherwise does
80 * not have any children. */
87 /* Creation time, last access time, and last write time, in
88 * 100-nanosecond intervals since 12:00 a.m UTC January 1, 1601. They
89 * should correspond to the times gotten by calling GetFileTime() on
92 le64 last_access_time;
95 /* Vaguely, the SHA-1 message digest ("hash") of the file's contents.
96 * More specifically, this is for the "unnamed data stream" rather than
97 * any "alternate data streams". This hash value is used to look up the
98 * corresponding entry in the WIM's stream lookup table to actually find
99 * the file contents within the WIM.
101 * If the file has no unnamed data stream (e.g. is a directory), then
102 * this field will be all zeroes. If the unnamed data stream is empty
103 * (i.e. an "empty file"), then this field is also expected to be all
104 * zeroes. (It will be if wimlib created the WIM image, at least;
105 * otherwise it can't be ruled out that the SHA-1 message digest of 0
106 * bytes of data is given explicitly.)
108 * If the file has reparse data, then this field will instead specify
109 * the SHA-1 message digest of the reparse data. If it is somehow
110 * possible for a file to have both an unnamed data stream and reparse
111 * data, then this is not handled by wimlib.
113 * As a further special case, if this field is all zeroes but there is
114 * an alternate data stream entry with no name and a nonzero SHA-1
115 * message digest field, then that hash must be used instead of this
116 * one. In fact, when named data streams are present, some versions of
117 * Windows PE contain a bug where they only look in the alternate data
118 * stream entries for the unnamed data stream, not here.
120 u8 unnamed_stream_hash[SHA1_HASH_SIZE];
122 /* The format of the following data is not yet completely known and they
123 * do not correspond to Microsoft's documentation.
125 * If this directory entry is for a reparse point (has
126 * FILE_ATTRIBUTE_REPARSE_POINT set in the attributes field), then the
127 * version of the following fields containing the reparse tag is valid.
128 * Furthermore, the field notated as not_rpfixed, as far as I can tell,
129 * is supposed to be set to 1 if reparse point fixups (a.k.a. fixing the
130 * targets of absolute symbolic links) were *not* done, and otherwise 0.
132 * If this directory entry is not for a reparse point, then the version
133 * of the following fields containing the hard_link_group_id is valid.
134 * All MS says about this field is that "If this file is part of a hard
135 * link set, all the directory entries in the set will share the same
136 * value in this field.". However, more specifically I have observed
138 * - If the file is part of a hard link set of size 1, then the
139 * hard_link_group_id should be set to either 0, which is treated
140 * specially as indicating "not hardlinked", or any unique value.
141 * - The specific nonzero values used to identity hard link sets do
142 * not matter, as long as they are unique.
143 * - However, due to bugs in Microsoft's software, it is actually NOT
144 * guaranteed that directory entries that share the same hard link
145 * group ID are actually hard linked to each either. We have to
146 * handle this by using special code to use distinguishing features
147 * (which is possible because some information about the underlying
148 * inode is repeated in each dentry) to split up these fake hard link
149 * groups into what they actually are supposed to be.
157 } _packed_attribute reparse;
160 le64 hard_link_group_id;
161 } _packed_attribute nonreparse;
164 /* Number of alternate data stream entries that directly follow this
166 le16 num_alternate_data_streams;
168 /* Length of this file's UTF-16LE encoded short name (8.3 DOS-compatible
169 * name), if present, in bytes, excluding the null terminator. If this
170 * file has no short name, then this field should be 0. */
171 le16 short_name_nbytes;
173 /* Length of this file's UTF-16LE encoded "long" name, excluding the
174 * null terminator. If this file has no short name, then this field
175 * should be 0. It's expected that only the root dentry has this field
177 le16 file_name_nbytes;
179 /* Followed by variable length file name, in UTF16-LE, if
180 * file_name_nbytes != 0. Includes null terminator. */
181 /*utf16lechar file_name[];*/
183 /* Followed by variable length short name, in UTF16-LE, if
184 * short_name_nbytes != 0. Includes null terminator. */
185 /*utf16lechar short_name[];*/
187 /* And optionally followed by a variable-length series of tagged items;
188 * see tagged_items.c. */
191 /* Calculates the unaligned length, in bytes, of an on-disk WIM dentry that has
192 * a file name and short name that take the specified numbers of bytes. This
193 * excludes tagged items as well as any alternate data stream entries that may
194 * follow the dentry. */
196 dentry_min_len_with_names(u16 file_name_nbytes, u16 short_name_nbytes)
198 u64 length = sizeof(struct wim_dentry_on_disk);
199 if (file_name_nbytes)
200 length += (u32)file_name_nbytes + 2;
201 if (short_name_nbytes)
202 length += (u32)short_name_nbytes + 2;
207 do_dentry_set_name(struct wim_dentry *dentry, utf16lechar *file_name,
208 size_t file_name_nbytes)
210 FREE(dentry->file_name);
211 dentry->file_name = file_name;
212 dentry->file_name_nbytes = file_name_nbytes;
214 if (dentry_has_short_name(dentry)) {
215 FREE(dentry->short_name);
216 dentry->short_name = NULL;
217 dentry->short_name_nbytes = 0;
221 /* Sets the name of a WIM dentry from a UTF-16LE string.
222 * Only use this on dentries not inserted into the tree. Use rename_wim_path()
223 * to do a real rename. */
225 dentry_set_name_utf16le(struct wim_dentry *dentry, const utf16lechar *name,
228 utf16lechar *dup = NULL;
231 dup = utf16le_dupz(name, name_nbytes);
233 return WIMLIB_ERR_NOMEM;
235 do_dentry_set_name(dentry, dup, name_nbytes);
240 /* Sets the name of a WIM dentry from a multibyte string.
241 * Only use this on dentries not inserted into the tree. Use rename_wim_path()
242 * to do a real rename. */
244 dentry_set_name(struct wim_dentry *dentry, const tchar *name)
246 utf16lechar *name_utf16le = NULL;
247 size_t name_utf16le_nbytes = 0;
251 ret = tstr_to_utf16le(name, tstrlen(name) * sizeof(tchar),
252 &name_utf16le, &name_utf16le_nbytes);
257 do_dentry_set_name(dentry, name_utf16le, name_utf16le_nbytes);
261 /* Returns the total length of a WIM alternate data stream entry on-disk,
262 * including the stream name, the null terminator, AND the padding after the
263 * entry to align the next ADS entry or dentry on an 8-byte boundary. */
265 ads_entry_total_length(const struct wim_ads_entry *entry)
267 u64 len = sizeof(struct wim_ads_entry_on_disk);
268 if (entry->stream_name_nbytes)
269 len += (u32)entry->stream_name_nbytes + 2;
270 return (len + 7) & ~7;
274 * Determine whether to include a "dummy" stream when writing a WIM dentry:
276 * Some versions of Microsoft's WIM software (the boot driver(s) in WinPE 3.0,
277 * for example) contain a bug where they assume the first alternate data stream
278 * (ADS) entry of a dentry with a nonzero ADS count specifies the unnamed
279 * stream, even if it has a name and the unnamed stream is already specified in
280 * the hash field of the dentry itself.
282 * wimlib has to work around this behavior by carefully emulating the behavior
283 * of (most versions of) ImageX/WIMGAPI, which move the unnamed stream reference
284 * into the alternate stream entries whenever there are named data streams, even
285 * though there is already a field in the dentry itself for the unnamed stream
286 * reference, which then goes to waste.
289 inode_needs_dummy_stream(const struct wim_inode *inode)
291 return (inode->i_num_ads > 0 &&
292 inode->i_num_ads < 0xffff && /* overflow check */
293 inode->i_canonical_streams); /* assume the dentry is okay if it
294 already had an unnamed ADS entry
295 when it was read in */
298 /* Calculate the total number of bytes that will be consumed when a WIM dentry
299 * is written. This includes the base dentry, the name fields, any tagged items,
300 * and any alternate data stream entries. Also includes all alignment bytes
301 * between these parts. */
303 dentry_out_total_length(const struct wim_dentry *dentry)
305 const struct wim_inode *inode = dentry->d_inode;
308 len = dentry_min_len_with_names(dentry->file_name_nbytes,
309 dentry->short_name_nbytes);
310 len = (len + 7) & ~7;
312 if (inode->i_extra_size) {
313 len += inode->i_extra_size;
314 len = (len + 7) & ~7;
317 if (unlikely(inode->i_num_ads)) {
318 if (inode_needs_dummy_stream(inode))
319 len += ads_entry_total_length(&(struct wim_ads_entry){});
321 for (u16 i = 0; i < inode->i_num_ads; i++)
322 len += ads_entry_total_length(&inode->i_ads_entries[i]);
329 do_for_dentry_in_tree(struct wim_dentry *dentry,
330 int (*visitor)(struct wim_dentry *, void *), void *arg)
333 struct wim_dentry *child;
335 ret = (*visitor)(dentry, arg);
339 for_dentry_child(child, dentry) {
340 ret = do_for_dentry_in_tree(child, visitor, arg);
349 do_for_dentry_in_tree_depth(struct wim_dentry *dentry,
350 int (*visitor)(struct wim_dentry *, void *), void *arg)
353 struct wim_dentry *child;
355 for_dentry_child_postorder(child, dentry) {
356 ret = do_for_dentry_in_tree_depth(child, visitor, arg);
360 return unlikely((*visitor)(dentry, arg));
363 /* Calls a function on all directory entries in a WIM dentry tree. Logically,
364 * this is a pre-order traversal (the function is called on a parent dentry
365 * before its children), but sibling dentries will be visited in order as well.
368 for_dentry_in_tree(struct wim_dentry *root,
369 int (*visitor)(struct wim_dentry *, void *), void *arg)
373 return do_for_dentry_in_tree(root, visitor, arg);
376 /* Like for_dentry_in_tree(), but the visitor function is always called on a
377 * dentry's children before on itself. */
379 for_dentry_in_tree_depth(struct wim_dentry *root,
380 int (*visitor)(struct wim_dentry *, void *), void *arg)
384 return do_for_dentry_in_tree_depth(root, visitor, arg);
387 /* Calculate the full path of @dentry. */
389 calculate_dentry_full_path(struct wim_dentry *dentry)
393 const struct wim_dentry *d;
395 if (dentry->_full_path)
401 ulen += d->file_name_nbytes / sizeof(utf16lechar);
403 d = d->d_parent; /* assumes d == d->d_parent for root */
404 } while (!dentry_is_root(d));
406 utf16lechar ubuf[ulen];
407 utf16lechar *p = &ubuf[ulen];
411 p -= d->file_name_nbytes / sizeof(utf16lechar);
412 memcpy(p, d->file_name, d->file_name_nbytes);
413 *--p = cpu_to_le16(WIM_PATH_SEPARATOR);
414 d = d->d_parent; /* assumes d == d->d_parent for root */
415 } while (!dentry_is_root(d));
417 wimlib_assert(p == ubuf);
419 return utf16le_to_tstr(ubuf, ulen * sizeof(utf16lechar),
420 &dentry->_full_path, &dummy);
424 dentry_full_path(struct wim_dentry *dentry)
426 calculate_dentry_full_path(dentry);
427 return dentry->_full_path;
431 dentry_calculate_subdir_offset(struct wim_dentry *dentry, void *_subdir_offset_p)
433 if (dentry_is_directory(dentry)) {
434 u64 *subdir_offset_p = _subdir_offset_p;
435 struct wim_dentry *child;
437 /* Set offset of directory's child dentries */
438 dentry->subdir_offset = *subdir_offset_p;
440 /* Account for child dentries */
441 for_dentry_child(child, dentry)
442 *subdir_offset_p += dentry_out_total_length(child);
444 /* Account for end-of-directory entry */
445 *subdir_offset_p += 8;
447 /* Not a directory; set subdir_offset to 0 */
448 dentry->subdir_offset = 0;
454 * Calculates the subdir offsets for a directory tree.
457 calculate_subdir_offsets(struct wim_dentry *root, u64 *subdir_offset_p)
459 for_dentry_in_tree(root, dentry_calculate_subdir_offset, subdir_offset_p);
462 /* Compare the UTF-16LE long filenames of two dentries case insensitively. */
464 dentry_compare_names_case_insensitive(const struct wim_dentry *d1,
465 const struct wim_dentry *d2)
467 return cmp_utf16le_strings(d1->file_name,
468 d1->file_name_nbytes / 2,
470 d2->file_name_nbytes / 2,
474 /* Compare the UTF-16LE long filenames of two dentries case sensitively. */
476 dentry_compare_names_case_sensitive(const struct wim_dentry *d1,
477 const struct wim_dentry *d2)
479 return cmp_utf16le_strings(d1->file_name,
480 d1->file_name_nbytes / 2,
482 d2->file_name_nbytes / 2,
487 _avl_dentry_compare_names_ci(const struct avl_tree_node *n1,
488 const struct avl_tree_node *n2)
490 const struct wim_dentry *d1, *d2;
492 d1 = avl_tree_entry(n1, struct wim_dentry, d_index_node_ci);
493 d2 = avl_tree_entry(n2, struct wim_dentry, d_index_node_ci);
494 return dentry_compare_names_case_insensitive(d1, d2);
498 _avl_dentry_compare_names(const struct avl_tree_node *n1,
499 const struct avl_tree_node *n2)
501 const struct wim_dentry *d1, *d2;
503 d1 = avl_tree_entry(n1, struct wim_dentry, d_index_node);
504 d2 = avl_tree_entry(n2, struct wim_dentry, d_index_node);
505 return dentry_compare_names_case_sensitive(d1, d2);
508 /* Default case sensitivity behavior for searches with
509 * WIMLIB_CASE_PLATFORM_DEFAULT specified. This can be modified by
510 * wimlib_global_init(). */
511 bool default_ignore_case =
519 /* Case-sensitive dentry lookup. Only @file_name and @file_name_nbytes of
520 * @dummy must be valid. */
521 static struct wim_dentry *
522 dir_lookup(const struct wim_inode *dir, const struct wim_dentry *dummy)
524 struct avl_tree_node *node;
526 node = avl_tree_lookup_node(dir->i_children,
527 &dummy->d_index_node,
528 _avl_dentry_compare_names);
531 return avl_tree_entry(node, struct wim_dentry, d_index_node);
534 /* Case-insensitive dentry lookup. Only @file_name and @file_name_nbytes of
535 * @dummy must be valid. */
536 static struct wim_dentry *
537 dir_lookup_ci(const struct wim_inode *dir, const struct wim_dentry *dummy)
539 struct avl_tree_node *node;
541 node = avl_tree_lookup_node(dir->i_children_ci,
542 &dummy->d_index_node_ci,
543 _avl_dentry_compare_names_ci);
546 return avl_tree_entry(node, struct wim_dentry, d_index_node_ci);
549 /* Given a UTF-16LE filename and a directory, look up the dentry for the file.
550 * Return it if found, otherwise NULL. This has configurable case sensitivity,
551 * and @name need not be null-terminated. */
553 get_dentry_child_with_utf16le_name(const struct wim_dentry *dentry,
554 const utf16lechar *name,
556 CASE_SENSITIVITY_TYPE case_ctype)
558 const struct wim_inode *dir = dentry->d_inode;
559 bool ignore_case = will_ignore_case(case_ctype);
560 struct wim_dentry dummy;
561 struct wim_dentry *child;
563 dummy.file_name = (utf16lechar*)name;
564 dummy.file_name_nbytes = name_nbytes;
567 /* Case-sensitive lookup. */
568 return dir_lookup(dir, &dummy);
570 /* Case-insensitive lookup. */
572 child = dir_lookup_ci(dir, &dummy);
576 if (likely(list_empty(&child->d_ci_conflict_list)))
577 /* Only one dentry has this case-insensitive name; return it */
580 /* Multiple dentries have the same case-insensitive name. Choose the
581 * dentry with the same case-sensitive name, if one exists; otherwise
582 * print a warning and choose one of the possible dentries arbitrarily.
584 struct wim_dentry *alt = child;
589 if (!dentry_compare_names_case_sensitive(&dummy, alt))
591 alt = list_entry(alt->d_ci_conflict_list.next,
592 struct wim_dentry, d_ci_conflict_list);
593 } while (alt != child);
595 WARNING("Result of case-insensitive lookup is ambiguous\n"
596 " (returning \"%"TS"\" of %zu "
597 "possible files, including \"%"TS"\")",
598 dentry_full_path(child),
600 dentry_full_path(list_entry(child->d_ci_conflict_list.next,
602 d_ci_conflict_list)));
606 /* Returns the child of @dentry that has the file name @name. Returns NULL if
607 * no child has the name. */
609 get_dentry_child_with_name(const struct wim_dentry *dentry, const tchar *name,
610 CASE_SENSITIVITY_TYPE case_type)
613 const utf16lechar *name_utf16le;
614 size_t name_utf16le_nbytes;
615 struct wim_dentry *child;
617 ret = tstr_get_utf16le_and_len(name, &name_utf16le,
618 &name_utf16le_nbytes);
622 child = get_dentry_child_with_utf16le_name(dentry,
626 tstr_put_utf16le(name_utf16le);
630 static struct wim_dentry *
631 get_dentry_utf16le(WIMStruct *wim, const utf16lechar *path,
632 CASE_SENSITIVITY_TYPE case_type)
634 struct wim_dentry *cur_dentry;
635 const utf16lechar *name_start, *name_end;
637 /* Start with the root directory of the image. Note: this will be NULL
638 * if an image has been added directly with wimlib_add_empty_image() but
639 * no files have been added yet; in that case we fail with ENOENT. */
640 cur_dentry = wim_get_current_root_dentry(wim);
644 if (cur_dentry == NULL) {
649 if (*name_start && !dentry_is_directory(cur_dentry)) {
654 while (*name_start == cpu_to_le16(WIM_PATH_SEPARATOR))
660 name_end = name_start;
663 } while (*name_end != cpu_to_le16(WIM_PATH_SEPARATOR) && *name_end);
665 cur_dentry = get_dentry_child_with_utf16le_name(cur_dentry,
667 (u8*)name_end - (u8*)name_start,
669 name_start = name_end;
674 * WIM path lookup: translate a path in the currently selected WIM image to the
675 * corresponding dentry, if it exists.
678 * The WIMStruct for the WIM. The search takes place in the currently
682 * The path to look up, given relative to the root of the WIM image.
683 * Characters with value WIM_PATH_SEPARATOR are taken to be path
684 * separators. Leading path separators are ignored, whereas one or more
685 * trailing path separators cause the path to only match a directory.
688 * The case-sensitivity behavior of this function, as one of the following
691 * - WIMLIB_CASE_SENSITIVE: Perform the search case sensitively. This means
692 * that names must match exactly.
694 * - WIMLIB_CASE_INSENSITIVE: Perform the search case insensitively. This
695 * means that names are considered to match if they are equal when
696 * transformed to upper case. If a path component matches multiple names
697 * case-insensitively, the name that matches the path component
698 * case-sensitively is chosen, if existent; otherwise one
699 * case-insensitively matching name is chosen arbitrarily.
701 * - WIMLIB_CASE_PLATFORM_DEFAULT: Perform either case-sensitive or
702 * case-insensitive search, depending on the value of the global variable
703 * default_ignore_case.
705 * In any case, no Unicode normalization is done before comparing strings.
707 * Returns a pointer to the dentry that is the result of the lookup, or NULL if
708 * no such dentry exists. If NULL is returned, errno is set to one of the
711 * ENOTDIR if one of the path components used as a directory existed but
712 * was not, in fact, a directory.
718 * - This function does not consider a reparse point to be a directory, even
719 * if it has FILE_ATTRIBUTE_DIRECTORY set.
721 * - This function does not dereference symbolic links or junction points
722 * when performing the search.
724 * - Since this function ignores leading slashes, the empty path is valid and
725 * names the root directory of the WIM image.
727 * - An image added with wimlib_add_empty_image() does not have a root
728 * directory yet, and this function will fail with ENOENT for any path on
732 get_dentry(WIMStruct *wim, const tchar *path, CASE_SENSITIVITY_TYPE case_type)
735 const utf16lechar *path_utf16le;
736 struct wim_dentry *dentry;
738 ret = tstr_get_utf16le(path, &path_utf16le);
741 dentry = get_dentry_utf16le(wim, path_utf16le, case_type);
742 tstr_put_utf16le(path_utf16le);
746 /* Takes in a path of length @len in @buf, and transforms it into a string for
747 * the path of its parent directory. */
749 to_parent_name(tchar *buf, size_t len)
751 ssize_t i = (ssize_t)len - 1;
752 while (i >= 0 && buf[i] == WIM_PATH_SEPARATOR)
754 while (i >= 0 && buf[i] != WIM_PATH_SEPARATOR)
756 while (i >= 0 && buf[i] == WIM_PATH_SEPARATOR)
758 buf[i + 1] = T('\0');
761 /* Similar to get_dentry(), but returns the dentry named by @path with the last
762 * component stripped off.
764 * Note: The returned dentry is NOT guaranteed to be a directory. */
766 get_parent_dentry(WIMStruct *wim, const tchar *path,
767 CASE_SENSITIVITY_TYPE case_type)
769 size_t path_len = tstrlen(path);
770 tchar buf[path_len + 1];
772 tmemcpy(buf, path, path_len + 1);
773 to_parent_name(buf, path_len);
774 return get_dentry(wim, buf, case_type);
777 /* Creates an unlinked directory entry. */
779 new_dentry(const tchar *name, struct wim_dentry **dentry_ret)
781 struct wim_dentry *dentry;
784 dentry = CALLOC(1, sizeof(struct wim_dentry));
786 return WIMLIB_ERR_NOMEM;
789 ret = dentry_set_name(dentry, name);
792 ERROR("Failed to set name on new dentry with name \"%"TS"\"",
797 dentry->d_parent = dentry;
798 *dentry_ret = dentry;
803 _new_dentry_with_inode(const tchar *name, struct wim_dentry **dentry_ret,
806 struct wim_dentry *dentry;
809 ret = new_dentry(name, &dentry);
814 dentry->d_inode = new_timeless_inode();
816 dentry->d_inode = new_inode();
817 if (dentry->d_inode == NULL) {
819 return WIMLIB_ERR_NOMEM;
822 inode_add_dentry(dentry, dentry->d_inode);
823 *dentry_ret = dentry;
828 new_dentry_with_timeless_inode(const tchar *name, struct wim_dentry **dentry_ret)
830 return _new_dentry_with_inode(name, dentry_ret, true);
834 new_dentry_with_inode(const tchar *name, struct wim_dentry **dentry_ret)
836 return _new_dentry_with_inode(name, dentry_ret, false);
840 new_filler_directory(struct wim_dentry **dentry_ret)
843 struct wim_dentry *dentry;
845 ret = new_dentry_with_inode(T(""), &dentry);
848 /* Leave the inode number as 0; this is allowed for non
849 * hard-linked files. */
850 dentry->d_inode->i_resolved = 1;
851 dentry->d_inode->i_attributes = FILE_ATTRIBUTE_DIRECTORY;
852 *dentry_ret = dentry;
857 dentry_clear_inode_visited(struct wim_dentry *dentry, void *_ignore)
859 dentry->d_inode->i_visited = 0;
864 dentry_tree_clear_inode_visited(struct wim_dentry *root)
866 for_dentry_in_tree(root, dentry_clear_inode_visited, NULL);
872 * In addition to freeing the dentry itself, this decrements the link count of
873 * the corresponding inode (if any). If the inode's link count reaches 0, the
874 * inode is freed as well.
877 free_dentry(struct wim_dentry *dentry)
880 FREE(dentry->file_name);
881 FREE(dentry->short_name);
882 FREE(dentry->_full_path);
884 put_inode(dentry->d_inode);
890 do_free_dentry(struct wim_dentry *dentry, void *_ignore)
897 do_free_dentry_and_unref_streams(struct wim_dentry *dentry, void *lookup_table)
899 inode_unref_streams(dentry->d_inode, lookup_table);
905 * Recursively frees all directory entries in the specified tree.
908 * The root of the tree.
911 * The lookup table for dentries. If non-NULL, the reference counts in the
912 * lookup table for the lookup table entries corresponding to the dentries
913 * will be decremented.
915 * This also puts references to the corresponding inodes.
917 * This does *not* unlink @root from its parent directory (if it has one).
920 free_dentry_tree(struct wim_dentry *root, struct wim_lookup_table *lookup_table)
922 int (*f)(struct wim_dentry *, void *);
925 f = do_free_dentry_and_unref_streams;
929 for_dentry_in_tree_depth(root, f, lookup_table);
932 /* Insert the @child dentry into the case sensitive index of the @dir directory.
933 * Return NULL if successfully inserted, otherwise a pointer to the
934 * already-inserted duplicate. */
935 static struct wim_dentry *
936 dir_index_child(struct wim_inode *dir, struct wim_dentry *child)
938 struct avl_tree_node *duplicate;
940 duplicate = avl_tree_insert(&dir->i_children,
941 &child->d_index_node,
942 _avl_dentry_compare_names);
945 return avl_tree_entry(duplicate, struct wim_dentry, d_index_node);
948 /* Insert the @child dentry into the case insensitive index of the @dir
949 * directory. Return NULL if successfully inserted, otherwise a pointer to the
950 * already-inserted duplicate. */
951 static struct wim_dentry *
952 dir_index_child_ci(struct wim_inode *dir, struct wim_dentry *child)
954 struct avl_tree_node *duplicate;
956 duplicate = avl_tree_insert(&dir->i_children_ci,
957 &child->d_index_node_ci,
958 _avl_dentry_compare_names_ci);
961 return avl_tree_entry(duplicate, struct wim_dentry, d_index_node_ci);
964 /* Removes the specified dentry from its directory's case-sensitive index. */
966 dir_unindex_child(struct wim_inode *dir, struct wim_dentry *child)
968 avl_tree_remove(&dir->i_children, &child->d_index_node);
971 /* Removes the specified dentry from its directory's case-insensitive index. */
973 dir_unindex_child_ci(struct wim_inode *dir, struct wim_dentry *child)
975 avl_tree_remove(&dir->i_children_ci, &child->d_index_node_ci);
978 /* Returns true iff the specified dentry is in its parent directory's
979 * case-insensitive index. */
981 dentry_in_ci_index(const struct wim_dentry *dentry)
983 return !avl_tree_node_is_unlinked(&dentry->d_index_node_ci);
987 * Links a dentry into the directory tree.
989 * @parent: The dentry that will be the parent of @child.
990 * @child: The dentry to link.
992 * Returns NULL if successful. If @parent already contains a dentry with the
993 * same case-sensitive name as @child, returns a pointer to this duplicate
997 dentry_add_child(struct wim_dentry *parent, struct wim_dentry *child)
999 struct wim_dentry *duplicate;
1000 struct wim_inode *dir;
1002 wimlib_assert(parent != child);
1004 dir = parent->d_inode;
1006 wimlib_assert(inode_is_directory(dir));
1008 duplicate = dir_index_child(dir, child);
1012 duplicate = dir_index_child_ci(dir, child);
1014 list_add(&child->d_ci_conflict_list, &duplicate->d_ci_conflict_list);
1015 avl_tree_node_set_unlinked(&child->d_index_node_ci);
1017 INIT_LIST_HEAD(&child->d_ci_conflict_list);
1019 child->d_parent = parent;
1023 /* Unlink a WIM dentry from the directory entry tree. */
1025 unlink_dentry(struct wim_dentry *dentry)
1027 struct wim_inode *dir;
1029 if (dentry_is_root(dentry))
1032 dir = dentry->d_parent->d_inode;
1034 dir_unindex_child(dir, dentry);
1036 if (dentry_in_ci_index(dentry)) {
1038 dir_unindex_child_ci(dir, dentry);
1040 if (!list_empty(&dentry->d_ci_conflict_list)) {
1041 /* Make a different case-insensitively-the-same dentry
1042 * be the "representative" in the search index. */
1043 struct list_head *next;
1044 struct wim_dentry *other;
1045 struct wim_dentry *existing;
1047 next = dentry->d_ci_conflict_list.next;
1048 other = list_entry(next, struct wim_dentry, d_ci_conflict_list);
1049 existing = dir_index_child_ci(dir, other);
1050 wimlib_assert(existing == NULL);
1053 list_del(&dentry->d_ci_conflict_list);
1057 read_extra_data(const u8 *p, const u8 *end, struct wim_inode *inode)
1059 while (((uintptr_t)p & 7) && p < end)
1062 if (unlikely(p < end)) {
1063 inode->i_extra = memdup(p, end - p);
1064 if (!inode->i_extra)
1065 return WIMLIB_ERR_NOMEM;
1066 inode->i_extra_size = end - p;
1071 /* Reads a WIM directory entry, including all alternate data stream entries that
1072 * follow it, from the WIM image's metadata resource. */
1074 read_dentry(const u8 * restrict buf, size_t buf_len,
1075 u64 *offset_p, struct wim_dentry **dentry_ret)
1077 u64 offset = *offset_p;
1080 const struct wim_dentry_on_disk *disk_dentry;
1081 struct wim_dentry *dentry;
1082 struct wim_inode *inode;
1083 u16 short_name_nbytes;
1084 u16 file_name_nbytes;
1085 u64 calculated_size;
1088 BUILD_BUG_ON(sizeof(struct wim_dentry_on_disk) != WIM_DENTRY_DISK_SIZE);
1090 /* Before reading the whole dentry, we need to read just the length.
1091 * This is because a dentry of length 8 (that is, just the length field)
1092 * terminates the list of sibling directory entries. */
1094 /* Check for buffer overrun. */
1095 if (unlikely(offset + sizeof(u64) > buf_len ||
1096 offset + sizeof(u64) < offset))
1098 ERROR("Directory entry starting at %"PRIu64" ends past the "
1099 "end of the metadata resource (size %zu)",
1101 return WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1104 /* Get pointer to the dentry data. */
1106 disk_dentry = (const struct wim_dentry_on_disk*)p;
1108 /* Get dentry length. */
1109 length = le64_to_cpu(disk_dentry->length);
1111 /* Check for end-of-directory. */
1117 /* Validate dentry length. */
1118 if (unlikely(length < sizeof(struct wim_dentry_on_disk))) {
1119 ERROR("Directory entry has invalid length of %"PRIu64" bytes",
1121 return WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1124 /* Check for buffer overrun. */
1125 if (unlikely(offset + length > buf_len ||
1126 offset + length < offset))
1128 ERROR("Directory entry at offset %"PRIu64" and with size "
1129 "%"PRIu64" ends past the end of the metadata resource "
1130 "(size %zu)", offset, length, buf_len);
1131 return WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1134 /* Allocate new dentry structure, along with a preliminary inode. */
1135 ret = new_dentry_with_timeless_inode(T(""), &dentry);
1139 inode = dentry->d_inode;
1141 /* Read more fields: some into the dentry, and some into the inode. */
1142 inode->i_attributes = le32_to_cpu(disk_dentry->attributes);
1143 inode->i_security_id = le32_to_cpu(disk_dentry->security_id);
1144 dentry->subdir_offset = le64_to_cpu(disk_dentry->subdir_offset);
1145 inode->i_creation_time = le64_to_cpu(disk_dentry->creation_time);
1146 inode->i_last_access_time = le64_to_cpu(disk_dentry->last_access_time);
1147 inode->i_last_write_time = le64_to_cpu(disk_dentry->last_write_time);
1148 copy_hash(inode->i_hash, disk_dentry->unnamed_stream_hash);
1150 /* I don't know what's going on here. It seems like M$ screwed up the
1151 * reparse points, then put the fields in the same place and didn't
1152 * document it. So we have some fields we read for reparse points, and
1153 * some fields in the same place for non-reparse-points. */
1154 if (inode->i_attributes & FILE_ATTRIBUTE_REPARSE_POINT) {
1155 inode->i_rp_unknown_1 = le32_to_cpu(disk_dentry->reparse.rp_unknown_1);
1156 inode->i_reparse_tag = le32_to_cpu(disk_dentry->reparse.reparse_tag);
1157 inode->i_rp_unknown_2 = le16_to_cpu(disk_dentry->reparse.rp_unknown_2);
1158 inode->i_not_rpfixed = le16_to_cpu(disk_dentry->reparse.not_rpfixed);
1159 /* Leave inode->i_ino at 0. Note that this means the WIM file
1160 * cannot archive hard-linked reparse points. Such a thing
1161 * doesn't really make sense anyway, although I believe it's
1162 * theoretically possible to have them on NTFS. */
1164 inode->i_rp_unknown_1 = le32_to_cpu(disk_dentry->nonreparse.rp_unknown_1);
1165 inode->i_ino = le64_to_cpu(disk_dentry->nonreparse.hard_link_group_id);
1167 inode->i_num_ads = le16_to_cpu(disk_dentry->num_alternate_data_streams);
1169 /* Now onto reading the names. There are two of them: the (long) file
1170 * name, and the short name. */
1172 short_name_nbytes = le16_to_cpu(disk_dentry->short_name_nbytes);
1173 file_name_nbytes = le16_to_cpu(disk_dentry->file_name_nbytes);
1175 if (unlikely((short_name_nbytes & 1) | (file_name_nbytes & 1))) {
1176 ERROR("Dentry name is not valid UTF-16 (odd number of bytes)!");
1177 ret = WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1178 goto err_free_dentry;
1181 /* We now know the length of the file name and short name. Make sure
1182 * the length of the dentry is large enough to actually hold them.
1184 * The calculated length here is unaligned to allow for the possibility
1185 * that the dentry's length is unaligned, although this would be
1187 calculated_size = dentry_min_len_with_names(file_name_nbytes,
1190 if (unlikely(length < calculated_size)) {
1191 ERROR("Unexpected end of directory entry! (Expected "
1192 "at least %"PRIu64" bytes, got %"PRIu64" bytes.)",
1193 calculated_size, length);
1194 ret = WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1195 goto err_free_dentry;
1198 /* Advance p to point past the base dentry, to the first name. */
1199 p += sizeof(struct wim_dentry_on_disk);
1201 /* Read the filename if present. Note: if the filename is empty, there
1202 * is no null terminator following it. */
1203 if (file_name_nbytes) {
1204 dentry->file_name = utf16le_dupz((const utf16lechar *)p,
1206 if (dentry->file_name == NULL) {
1207 ret = WIMLIB_ERR_NOMEM;
1208 goto err_free_dentry;
1210 dentry->file_name_nbytes = file_name_nbytes;
1211 p += (u32)file_name_nbytes + 2;
1214 /* Read the short filename if present. Note: if there is no short
1215 * filename, there is no null terminator following it. */
1216 if (short_name_nbytes) {
1217 dentry->short_name = utf16le_dupz((const utf16lechar *)p,
1219 if (dentry->short_name == NULL) {
1220 ret = WIMLIB_ERR_NOMEM;
1221 goto err_free_dentry;
1223 dentry->short_name_nbytes = short_name_nbytes;
1224 p += (u32)short_name_nbytes + 2;
1227 /* Read extra data at end of dentry (but before alternate data stream
1228 * entries). This may contain tagged items. */
1229 ret = read_extra_data(p, &buf[offset + length], inode);
1231 goto err_free_dentry;
1233 /* Align the dentry length. */
1234 length = (length + 7) & ~7;
1238 /* Read the alternate data streams, if present. inode->i_num_ads tells
1239 * us how many they are, and they will directly follow the dentry in the
1240 * metadata resource buffer.
1242 * Note that each alternate data stream entry begins on an 8-byte
1243 * aligned boundary, and the alternate data stream entries seem to NOT
1244 * be included in the dentry->length field for some reason. */
1245 if (unlikely(inode->i_num_ads != 0)) {
1246 size_t orig_bytes_remaining;
1247 size_t bytes_remaining;
1249 if (offset > buf_len) {
1250 ret = WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1251 goto err_free_dentry;
1253 bytes_remaining = buf_len - offset;
1254 orig_bytes_remaining = bytes_remaining;
1255 ret = read_ads_entries(&buf[offset], inode, &bytes_remaining);
1257 goto err_free_dentry;
1258 offset += (orig_bytes_remaining - bytes_remaining);
1261 *offset_p = offset; /* Sets offset of next dentry in directory */
1262 *dentry_ret = dentry;
1266 free_dentry(dentry);
1271 dentry_is_dot_or_dotdot(const struct wim_dentry *dentry)
1273 if (dentry->file_name_nbytes <= 4) {
1274 if (dentry->file_name_nbytes == 4) {
1275 if (dentry->file_name[0] == cpu_to_le16('.') &&
1276 dentry->file_name[1] == cpu_to_le16('.'))
1278 } else if (dentry->file_name_nbytes == 2) {
1279 if (dentry->file_name[0] == cpu_to_le16('.'))
1287 read_dentry_tree_recursive(const u8 * restrict buf, size_t buf_len,
1288 struct wim_dentry * restrict dir)
1290 u64 cur_offset = dir->subdir_offset;
1292 /* Check for cyclic directory structure, which would cause infinite
1293 * recursion if not handled. */
1294 for (struct wim_dentry *d = dir->d_parent;
1295 !dentry_is_root(d); d = d->d_parent)
1297 if (unlikely(d->subdir_offset == cur_offset)) {
1298 ERROR("Cyclic directory structure detected: children "
1299 "of \"%"TS"\" coincide with children of \"%"TS"\"",
1300 dentry_full_path(dir), dentry_full_path(d));
1301 return WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1306 struct wim_dentry *child;
1307 struct wim_dentry *duplicate;
1310 /* Read next child of @dir. */
1311 ret = read_dentry(buf, buf_len, &cur_offset, &child);
1315 /* Check for end of directory. */
1319 /* All dentries except the root should be named. */
1320 if (unlikely(!dentry_has_long_name(child))) {
1321 WARNING("Ignoring unnamed dentry in "
1322 "directory \"%"TS"\"", dentry_full_path(dir));
1327 /* Don't allow files named "." or "..". */
1328 if (unlikely(dentry_is_dot_or_dotdot(child))) {
1329 WARNING("Ignoring file named \".\" or \"..\"; "
1330 "potentially malicious archive!!!");
1335 /* Link the child into the directory. */
1336 duplicate = dentry_add_child(dir, child);
1337 if (unlikely(duplicate)) {
1338 /* We already found a dentry with this same
1339 * case-sensitive long name. Only keep the first one.
1341 WARNING("Ignoring duplicate file \"%"TS"\" "
1342 "(the WIM image already contains a file "
1343 "at that path with the exact same name)",
1344 dentry_full_path(duplicate));
1349 /* If this child is a directory that itself has children, call
1350 * this procedure recursively. */
1351 if (child->subdir_offset != 0) {
1352 if (likely(dentry_is_directory(child))) {
1353 ret = read_dentry_tree_recursive(buf,
1359 WARNING("Ignoring children of "
1360 "non-directory file \"%"TS"\"",
1361 dentry_full_path(child));
1368 * Read a tree of dentries (directory entries) from a WIM metadata resource.
1371 * Buffer containing an uncompressed WIM metadata resource.
1374 * Length of the uncompressed metadata resource, in bytes.
1377 * Offset in the metadata resource of the root of the dentry tree.
1380 * On success, either NULL or a pointer to the root dentry is written to
1381 * this location. The former case only occurs in the unexpected case that
1382 * the tree began with an end-of-directory entry.
1385 * WIMLIB_ERR_SUCCESS (0)
1386 * WIMLIB_ERR_INVALID_METADATA_RESOURCE
1390 read_dentry_tree(const u8 *buf, size_t buf_len,
1391 u64 root_offset, struct wim_dentry **root_ret)
1394 struct wim_dentry *root;
1396 DEBUG("Reading dentry tree (root_offset=%"PRIu64")", root_offset);
1398 ret = read_dentry(buf, buf_len, &root_offset, &root);
1402 if (likely(root != NULL)) {
1403 if (unlikely(dentry_has_long_name(root) ||
1404 dentry_has_short_name(root)))
1406 WARNING("The root directory has a nonempty name; "
1408 dentry_set_name(root, NULL);
1411 if (unlikely(!dentry_is_directory(root))) {
1412 ERROR("The root of the WIM image is not a directory!");
1413 ret = WIMLIB_ERR_INVALID_METADATA_RESOURCE;
1414 goto err_free_dentry_tree;
1417 if (likely(root->subdir_offset != 0)) {
1418 ret = read_dentry_tree_recursive(buf, buf_len, root);
1420 goto err_free_dentry_tree;
1423 WARNING("The metadata resource has no directory entries; "
1424 "treating as an empty image.");
1429 err_free_dentry_tree:
1430 free_dentry_tree(root, NULL);
1435 * Writes a WIM alternate data stream (ADS) entry to an output buffer.
1437 * @ads_entry: The ADS entry structure.
1438 * @hash: The hash field to use (instead of the one in the ADS entry).
1439 * @p: The memory location to write the data to.
1441 * Returns a pointer to the byte after the last byte written.
1444 write_ads_entry(const struct wim_ads_entry *ads_entry,
1445 const u8 *hash, u8 * restrict p)
1447 struct wim_ads_entry_on_disk *disk_ads_entry =
1448 (struct wim_ads_entry_on_disk*)p;
1451 disk_ads_entry->reserved = cpu_to_le64(ads_entry->reserved);
1452 copy_hash(disk_ads_entry->hash, hash);
1453 disk_ads_entry->stream_name_nbytes = cpu_to_le16(ads_entry->stream_name_nbytes);
1454 p += sizeof(struct wim_ads_entry_on_disk);
1455 if (ads_entry->stream_name_nbytes) {
1456 p = mempcpy(p, ads_entry->stream_name,
1457 (u32)ads_entry->stream_name_nbytes + 2);
1459 /* Align to 8-byte boundary */
1460 while ((uintptr_t)p & 7)
1462 disk_ads_entry->length = cpu_to_le64(p - orig_p);
1467 * Writes a WIM dentry to an output buffer.
1469 * @dentry: The dentry structure.
1470 * @p: The memory location to write the data to.
1472 * Returns the pointer to the byte after the last byte we wrote as part of the
1473 * dentry, including any alternate data stream entries.
1476 write_dentry(const struct wim_dentry * restrict dentry, u8 * restrict p)
1478 const struct wim_inode *inode;
1479 struct wim_dentry_on_disk *disk_dentry;
1482 bool use_dummy_stream;
1485 wimlib_assert(((uintptr_t)p & 7) == 0); /* 8 byte aligned */
1488 inode = dentry->d_inode;
1489 use_dummy_stream = inode_needs_dummy_stream(inode);
1490 disk_dentry = (struct wim_dentry_on_disk*)p;
1492 disk_dentry->attributes = cpu_to_le32(inode->i_attributes);
1493 disk_dentry->security_id = cpu_to_le32(inode->i_security_id);
1494 disk_dentry->subdir_offset = cpu_to_le64(dentry->subdir_offset);
1496 /* UNIX data uses the two 8-byte reserved fields. So if no UNIX data
1497 * exists, they get set to 0, just as we would do anyway. */
1498 disk_dentry->unused_1 = cpu_to_le64(0);
1499 disk_dentry->unused_2 = cpu_to_le64(0);
1501 disk_dentry->creation_time = cpu_to_le64(inode->i_creation_time);
1502 disk_dentry->last_access_time = cpu_to_le64(inode->i_last_access_time);
1503 disk_dentry->last_write_time = cpu_to_le64(inode->i_last_write_time);
1504 if (use_dummy_stream)
1507 hash = inode_stream_hash(inode, 0);
1508 copy_hash(disk_dentry->unnamed_stream_hash, hash);
1509 if (inode->i_attributes & FILE_ATTRIBUTE_REPARSE_POINT) {
1510 disk_dentry->reparse.rp_unknown_1 = cpu_to_le32(inode->i_rp_unknown_1);
1511 disk_dentry->reparse.reparse_tag = cpu_to_le32(inode->i_reparse_tag);
1512 disk_dentry->reparse.rp_unknown_2 = cpu_to_le16(inode->i_rp_unknown_2);
1513 disk_dentry->reparse.not_rpfixed = cpu_to_le16(inode->i_not_rpfixed);
1515 disk_dentry->nonreparse.rp_unknown_1 = cpu_to_le32(inode->i_rp_unknown_1);
1516 disk_dentry->nonreparse.hard_link_group_id =
1517 cpu_to_le64((inode->i_nlink == 1) ? 0 : inode->i_ino);
1519 num_ads = inode->i_num_ads;
1520 if (use_dummy_stream)
1522 disk_dentry->num_alternate_data_streams = cpu_to_le16(num_ads);
1523 disk_dentry->short_name_nbytes = cpu_to_le16(dentry->short_name_nbytes);
1524 disk_dentry->file_name_nbytes = cpu_to_le16(dentry->file_name_nbytes);
1525 p += sizeof(struct wim_dentry_on_disk);
1527 wimlib_assert(dentry_is_root(dentry) != dentry_has_long_name(dentry));
1529 if (dentry_has_long_name(dentry))
1530 p = mempcpy(p, dentry->file_name, (u32)dentry->file_name_nbytes + 2);
1532 if (dentry_has_short_name(dentry))
1533 p = mempcpy(p, dentry->short_name, (u32)dentry->short_name_nbytes + 2);
1535 /* Align to 8-byte boundary */
1536 while ((uintptr_t)p & 7)
1539 if (inode->i_extra_size) {
1540 /* Extra tagged items --- not usually present. */
1541 p = mempcpy(p, inode->i_extra, inode->i_extra_size);
1542 while ((uintptr_t)p & 7)
1546 disk_dentry->length = cpu_to_le64(p - orig_p);
1548 if (use_dummy_stream) {
1549 hash = inode_unnamed_stream_hash(inode);
1550 p = write_ads_entry(&(struct wim_ads_entry){}, hash, p);
1553 /* Write the alternate data streams entries, if any. */
1554 for (u16 i = 0; i < inode->i_num_ads; i++) {
1555 hash = inode_stream_hash(inode, i + 1);
1556 p = write_ads_entry(&inode->i_ads_entries[i], hash, p);
1563 write_dir_dentries(struct wim_dentry *dir, void *_pp)
1565 if (dir->subdir_offset != 0) {
1568 struct wim_dentry *child;
1570 /* write child dentries */
1571 for_dentry_child(child, dir)
1572 p = write_dentry(child, p);
1574 /* write end of directory entry */
1582 /* Writes a directory tree to the metadata resource.
1584 * @root: Root of the dentry tree.
1585 * @p: Pointer to a buffer with enough space for the dentry tree.
1587 * Returns pointer to the byte after the last byte we wrote.
1590 write_dentry_tree(struct wim_dentry *root, u8 *p)
1592 DEBUG("Writing dentry tree.");
1593 wimlib_assert(dentry_is_root(root));
1595 /* write root dentry and end-of-directory entry following it */
1596 p = write_dentry(root, p);
1600 /* write the rest of the dentry tree */
1601 for_dentry_in_tree(root, write_dir_dentries, &p);