return ret;
}
+#define DBRT_DEBUG 0
+
static int unpack_trees_rec(struct tree_entry_list **posns, int len,
const char *base, merge_fn_t fn, int *indpos)
{
}
}
+#if DBRT_DEBUG
if (first)
printf("index %s\n", first);
-
+#endif
for (i = 0; i < len; i++) {
if (!posns[i] || posns[i] == &df_conflict_list)
continue;
+#if DBRT_DEBUG
printf("%d %s\n", i + 1, posns[i]->name);
+#endif
if (!first || entcmp(first, firstdir,
posns[i]->name,
posns[i]->directory) > 0) {
if (merge) {
int ret;
+#if DBRT_DEBUG
printf("%s:\n", first);
for (i = 0; i < src_size; i++) {
printf(" %d ", i);
else
printf("\n");
}
-
+#endif
ret = fn(src);
+#if DBRT_DEBUG
printf("Added %d entries\n", ret);
-
+#endif
*indpos += ret;
} else {
for (i = 0; i < src_size; i++) {