struct wim_inode *d_inode;
/* Node for the parent's balanced binary search tree of child dentries
- * sorted by case sensitive long name (root i_children). */
+ * keyed by filename (root i_children). */
struct avl_tree_node d_index_node;
- /* Node for the parent's balanced binary search tree of child dentries,
- * sorted by case insensitive long name (root i_children_ci). */
- struct avl_tree_node d_index_node_ci;
-
- /* List of dentries in a directory that have different case sensitive
- * long names but share the same case insensitive long name. */
- struct list_head d_ci_conflict_list;
-
/* The parent of this directory entry. (The root is its own parent.) */
struct wim_dentry *d_parent;
return dentry->d_extraction_list_node.next != NULL;
}
-extern size_t
+size_t
dentry_out_total_length(const struct wim_dentry *dentry);
-extern int
+int
for_dentry_in_tree(struct wim_dentry *root,
int (*visitor)(struct wim_dentry *, void *), void *args);
-/* Iterate through each @child dentry of the @dir directory inode,
- * in sorted order by case sensitive name. */
+/* Iterate through each @child dentry of the @dir directory inode in
+ * collation order. */
#define for_inode_child(child, dir) \
avl_tree_for_each_in_order((child), (dir)->i_children, \
struct wim_dentry, d_index_node)
-/* Iterate through each @child dentry of the @parent dentry,
- * in sorted order by case sensitive name. */
+/* Iterate through each @child dentry of the @parent dentry in
+ * collation order. */
#define for_dentry_child(child, parent) \
for_inode_child((child), (parent)->d_inode)
-/* Iterate through each @child dentry of the @dir directory inode,
- * in sorted order by case insensitive name. */
-#define for_inode_child_case_insensitive(child, dir) \
- avl_tree_for_each_in_order((child), (dir)->i_children_ci, \
- struct wim_dentry, d_index_node_ci)
-
-/* Iterate through each @child dentry of the @parent dentry,
- * in sorted order by case insensitive name. */
-#define for_dentry_child_case_insensitive(child, parent) \
- for_inode_child_case_insensitive((child), (parent)->d_inode)
-
-/* Iterate through each @child dentry of the @dir directory inode,
- * in postorder (safe for freeing the child dentries). */
+/* Iterate through each @child dentry of the @dir directory inode in
+ * postorder (safe for freeing the child dentries). */
#define for_inode_child_postorder(child, dir) \
avl_tree_for_each_in_postorder((child), (dir)->i_children, \
struct wim_dentry, d_index_node)
-/* Iterate through each @child dentry of the @parent dentry,
- * in postorder (safe for freeing the child dentries). */
+/* Iterate through each @child dentry of the @parent dentry in
+ * postorder (safe for freeing the child dentries). */
#define for_dentry_child_postorder(child, parent) \
for_inode_child_postorder((child), (parent)->d_inode)
#define dentry_any_child(parent) \
inode_any_child((parent)->d_inode)
-extern void
+struct wim_dentry *
+dentry_get_first_ci_match(struct wim_dentry *dentry);
+
+struct wim_dentry *
+dentry_get_next_ci_match(struct wim_dentry *dentry,
+ struct wim_dentry *ci_match);
+
+/* Iterate through all other dentries which have the same case insensitive name
+ * as the one given. */
+#define dentry_for_each_ci_match(ci_match, dentry) \
+ for ((ci_match) = dentry_get_first_ci_match((dentry)); \
+ (ci_match); \
+ (ci_match) = dentry_get_next_ci_match((dentry), (ci_match)))
+
+void
calculate_subdir_offsets(struct wim_dentry *root, u64 *subdir_offset_p);
-extern int
+int
dentry_set_name(struct wim_dentry *dentry, const tchar *name);
-extern int
+int
dentry_set_name_utf16le(struct wim_dentry *dentry, const utf16lechar *name,
size_t name_nbytes);
-extern struct wim_dentry *
+struct wim_dentry *
get_dentry(WIMStruct *wim, const tchar *path, CASE_SENSITIVITY_TYPE case_type);
-extern struct wim_dentry *
+struct wim_dentry *
get_dentry_child_with_name(const struct wim_dentry *dentry, const tchar *name,
CASE_SENSITIVITY_TYPE case_type);
-extern struct wim_dentry *
+struct wim_dentry *
get_dentry_child_with_utf16le_name(const struct wim_dentry *dentry,
const utf16lechar *name,
size_t name_nbytes,
CASE_SENSITIVITY_TYPE case_type);
-extern struct wim_dentry *
+struct wim_dentry *
get_parent_dentry(WIMStruct *wim, const tchar *path,
CASE_SENSITIVITY_TYPE case_type);
-extern int
+int
calculate_dentry_full_path(struct wim_dentry *dentry);
-extern tchar *
+tchar *
dentry_full_path(struct wim_dentry *dentry);
-extern int
+int
new_dentry_with_new_inode(const tchar *name, bool set_timestamps,
struct wim_dentry **dentry_ret);
-extern int
+int
new_dentry_with_existing_inode(const tchar *name, struct wim_inode *inode,
struct wim_dentry **dentry_ret);
-extern int
+int
new_filler_directory(struct wim_dentry **dentry_ret);
-extern void
+void
free_dentry(struct wim_dentry *dentry);
-extern void
+void
free_dentry_tree(struct wim_dentry *root, struct blob_table *blob_table);
-extern void
+void
unlink_dentry(struct wim_dentry *dentry);
-extern struct wim_dentry *
+struct wim_dentry *
dentry_add_child(struct wim_dentry *parent, struct wim_dentry *child);
struct update_command_journal;
-extern int
+int
rename_wim_path(WIMStruct *wim, const tchar *from, const tchar *to,
- CASE_SENSITIVITY_TYPE case_type,
+ CASE_SENSITIVITY_TYPE case_type, bool noreplace,
struct update_command_journal *j);
-extern int
+int
read_dentry_tree(const u8 *buf, size_t buf_len,
u64 root_offset, struct wim_dentry **root_ret);
-extern u8 *
+u8 *
write_dentry_tree(struct wim_dentry *root, u8 *p);
static inline bool
git://wimlib.net / wimlib / blobdiff