+ for (size_t i = 0; i < table->capacity; i++)
+ id = assign_link_group_ids_to_list(table->array[i], id);
+
+ /* Assign link group IDs to the "extra" link groups and insert them into
+ * the hash table */
+ id = assign_link_group_ids_to_list(table->extra_groups, id);
+ insert_extra_groups(table);
+ return id;
+}
+
+
+
+static void inconsistent_link_group(const struct dentry *first_dentry)
+{
+ const struct dentry *dentry = first_dentry;
+
+ ERROR("An inconsistent hard link group that we cannot correct has been "
+ "detected");
+ ERROR("The dentries are located at the following paths:");
+ do {
+ ERROR("`%s'", dentry->full_path_utf8);
+ } while ((dentry = container_of(dentry->link_group_list.next,
+ struct dentry,
+ link_group_list)) != first_dentry);
+}
+
+static bool ref_dentries_consistent(const struct dentry * restrict ref_dentry_1,
+ const struct dentry * restrict ref_dentry_2)
+{
+ wimlib_assert(ref_dentry_1 != ref_dentry_2);
+
+ if (ref_dentry_1->num_ads != ref_dentry_2->num_ads)
+ return false;
+ if (ref_dentry_1->security_id != ref_dentry_2->security_id
+ || ref_dentry_1->attributes != ref_dentry_2->attributes)
+ return false;
+ for (unsigned i = 0; i <= ref_dentry_1->num_ads; i++) {
+ const u8 *ref_1_hash, *ref_2_hash;
+ ref_1_hash = dentry_stream_hash_unresolved(ref_dentry_1, i);
+ ref_2_hash = dentry_stream_hash_unresolved(ref_dentry_2, i);
+ if (!hashes_equal(ref_1_hash, ref_2_hash))
+ return false;
+ if (i && !ads_entries_have_same_name(&ref_dentry_1->ads_entries[i - 1],
+ &ref_dentry_2->ads_entries[i - 1]))
+ return false;
+
+ }
+ return true;
+}
+
+static bool dentries_consistent(const struct dentry * restrict ref_dentry,
+ const struct dentry * restrict dentry)
+{
+ wimlib_assert(ref_dentry != dentry);
+
+ if (ref_dentry->num_ads != dentry->num_ads && dentry->num_ads != 0)
+ return false;
+ if (ref_dentry->security_id != dentry->security_id
+ || ref_dentry->attributes != dentry->attributes)
+ return false;
+ for (unsigned i = 0; i <= min(ref_dentry->num_ads, dentry->num_ads); i++) {
+ const u8 *ref_hash, *hash;
+ ref_hash = dentry_stream_hash_unresolved(ref_dentry, i);
+ hash = dentry_stream_hash_unresolved(dentry, i);
+ if (!hashes_equal(ref_hash, hash) && !is_zero_hash(hash))
+ return false;
+ if (i && !ads_entries_have_same_name(&ref_dentry->ads_entries[i - 1],
+ &dentry->ads_entries[i - 1]))
+ return false;
+ }
+ return true;
+}
+
+static int
+fix_true_link_group(struct dentry *first_dentry)
+{
+ struct dentry *dentry;
+ struct dentry *ref_dentry = NULL;
+ u64 last_ctime = 0;
+ u64 last_mtime = 0;
+ u64 last_atime = 0;
+
+ dentry = first_dentry;
+ do {
+ if (!ref_dentry || ref_dentry->num_ads == 0)
+ ref_dentry = dentry;
+ if (dentry->creation_time > last_ctime)
+ last_ctime = dentry->creation_time;
+ if (dentry->last_write_time > last_mtime)
+ last_mtime = dentry->last_write_time;
+ if (dentry->last_access_time > last_atime)
+ last_atime = dentry->last_access_time;
+ } while ((dentry = container_of(dentry->link_group_list.next,
+ struct dentry,
+ link_group_list)) != first_dentry);
+
+
+ ref_dentry->ads_entries_status = ADS_ENTRIES_OWNER;
+ dentry = first_dentry;
+ do {
+ if (dentry != ref_dentry) {
+ if (!dentries_consistent(ref_dentry, dentry)) {
+ inconsistent_link_group(first_dentry);
+ return WIMLIB_ERR_INVALID_DENTRY;
+ }
+ copy_hash(dentry->hash, ref_dentry->hash);
+ dentry_free_ads_entries(dentry);
+ dentry->num_ads = ref_dentry->num_ads;
+ dentry->ads_entries = ref_dentry->ads_entries;
+ dentry->ads_entries_status = ADS_ENTRIES_USER;
+ }
+ dentry->creation_time = last_ctime;
+ dentry->last_write_time = last_mtime;
+ dentry->last_access_time = last_atime;
+ } while ((dentry = container_of(dentry->link_group_list.next,
+ struct dentry,
+ link_group_list)) != first_dentry);
+ return 0;
+}
+
+static int
+fix_nominal_link_group(struct link_group *group,
+ struct link_group **new_groups)
+{
+ struct dentry *tmp, *dentry, *ref_dentry;
+ int ret;
+ size_t num_true_link_groups;
+ struct list_head *head;
+ u64 link_group_id;
+
+ LIST_HEAD(dentries_with_data_streams);
+ LIST_HEAD(dentries_with_no_data_streams);
+ LIST_HEAD(true_link_groups);
+
+ /* Create the lists @dentries_with_data_streams and
+ * @dentries_with_no_data_streams. */
+ dentry = container_of(group->dentry_list, struct dentry,
+ link_group_list);
+ do {
+ for (unsigned i = 0; i <= dentry->num_ads; i++) {
+ const u8 *hash;
+ hash = dentry_stream_hash_unresolved(dentry, i);
+ if (!is_zero_hash(hash)) {
+ list_add(&dentry->tmp_list,
+ &dentries_with_data_streams);
+ goto next_dentry;
+ }
+ }
+ list_add(&dentry->tmp_list,
+ &dentries_with_no_data_streams);
+ next_dentry:
+ dentry = container_of(dentry->link_group_list.next,
+ struct dentry,
+ link_group_list);
+ } while (&dentry->link_group_list != group->dentry_list);
+
+ /* If there are no dentries with data streams, we require the nominal
+ * link group to be a true link group */
+ if (list_empty(&dentries_with_data_streams))
+ return fix_true_link_group(container_of(group->dentry_list,
+ struct dentry,
+ link_group_list));
+
+ /* One or more dentries had data streams. We check each of these
+ * dentries for consistency with the others to form a set of true link
+ * groups. */
+ num_true_link_groups = 0;
+ list_for_each_entry_safe(dentry, tmp, &dentries_with_data_streams,
+ tmp_list)
+ {
+ list_del(&dentry->tmp_list);
+
+ /* Look for a true link group that is consistent with
+ * this dentry and add this dentry to it. Or, if none
+ * of the true link groups are consistent with this
+ * dentry, make a new one. */
+ list_for_each_entry(ref_dentry, &true_link_groups, tmp_list) {
+ if (ref_dentries_consistent(ref_dentry, dentry)) {
+ list_add(&dentry->link_group_list,
+ &ref_dentry->link_group_list);
+ goto next_dentry_2;
+ }
+ }
+ num_true_link_groups++;
+ list_add(&dentry->tmp_list, &true_link_groups);
+ INIT_LIST_HEAD(&dentry->link_group_list);
+next_dentry_2:
+ ;
+ }
+
+ wimlib_assert(num_true_link_groups != 0);
+
+ /* If there were dentries with no data streams, we require there to only
+ * be one true link group so that we know which link group to assign the
+ *
+ * streamless dentries to. */
+ if (!list_empty(&dentries_with_no_data_streams)) {
+ if (num_true_link_groups != 1) {
+ ERROR("Hard link group ambiguity detected!");
+ ERROR("We split up hard link group 0x%"PRIx64" due to "
+ "inconsistencies,");
+ ERROR("but dentries with no stream information remained. "
+ "We don't know which true hard link");
+ ERROR("group to assign them to.");
+ return WIMLIB_ERR_INVALID_DENTRY;
+ }
+ ref_dentry = container_of(true_link_groups.next,
+ struct dentry,
+ tmp_list);
+ list_for_each_entry(dentry, &dentries_with_no_data_streams,
+ tmp_list)
+ {
+ list_add(&dentry->link_group_list,
+ &ref_dentry->link_group_list);
+ }
+ }
+
+ list_for_each_entry(dentry, &true_link_groups, tmp_list) {
+ ret = fix_true_link_group(dentry);
+ if (ret != 0)
+ return ret;
+ }
+
+ /* Make new `struct link_group's for the new link groups */
+ for (head = true_link_groups.next->next;
+ head != &true_link_groups;
+ head = head->next)
+ {
+ dentry = container_of(head, struct dentry, tmp_list);
+ group = MALLOC(sizeof(*group));
+ if (!group) {
+ ERROR("Out of memory");
+ return WIMLIB_ERR_NOMEM;
+ }
+ group->link_group_id = link_group_id;
+ group->dentry_list = &dentry->link_group_list;
+ group->next = *new_groups;
+ *new_groups = group;
+ } while ((head = head->next) != &true_link_groups);
+ return 0;
+}
+
+/*
+ * Goes through each link group and shares the ads_entries (Alternate Data
+ * Stream entries) field of each dentry between members of a hard link group.
+ *
+ * In the process, the dentries in each link group are checked for consistency.
+ * If they contain data features that indicate they cannot really be in the same
+ * hard link group, this should be an error, but in reality this case needs to
+ * be handled, so we split the dentries into different hard link groups.
+ *
+ * One of the dentries in the group is arbitrarily assigned the role of "owner"
+ * (ADS_ENTRIES_OWNER), while the others are "users" (ADS_ENTRIES_USER).
+ */
+int fix_link_groups(struct link_group_table *table)
+{