aboutsummaryrefslogtreecommitdiff
path: root/lib/common/src/hardlink.c
diff options
context:
space:
mode:
authorDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2023-01-31 11:21:30 +0100
committerDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2023-01-31 13:51:49 +0100
commitcdccc69c62579b0c13b35fad0728079652b8f3c9 (patch)
tree9fa54c710f73c5e08a9c8466e7a712eb63ee07ac /lib/common/src/hardlink.c
parent2182129c8f359c4fa1390eaba7a65b595ccd4182 (diff)
Move library source into src sub-directory
Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
Diffstat (limited to 'lib/common/src/hardlink.c')
-rw-r--r--lib/common/src/hardlink.c101
1 files changed, 101 insertions, 0 deletions
diff --git a/lib/common/src/hardlink.c b/lib/common/src/hardlink.c
new file mode 100644
index 0000000..e43df33
--- /dev/null
+++ b/lib/common/src/hardlink.c
@@ -0,0 +1,101 @@
+/* SPDX-License-Identifier: GPL-3.0-or-later */
+/*
+ * hardlink.c
+ *
+ * Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
+ */
+#include "common.h"
+#include "util/rbtree.h"
+#include "util/util.h"
+
+#include <stdlib.h>
+#include <assert.h>
+#include <stdio.h>
+
+static int map_nodes(rbtree_t *inumtree, sqfs_hard_link_t **out,
+ const sqfs_tree_node_t *n)
+{
+ const sqfs_tree_node_t *target;
+ sqfs_hard_link_t *lnk;
+ rbtree_node_t *tn;
+ sqfs_u32 idx;
+ int ret;
+
+ /* XXX: refuse to generate hard links to directories */
+ if (n->children != NULL) {
+ for (n = n->children; n != NULL; n = n->next) {
+ ret = map_nodes(inumtree, out, n);
+ if (ret != 0)
+ return ret;
+ }
+ return 0;
+ }
+
+ if (!is_filename_sane((const char *)n->name, false))
+ return SQFS_ERROR_CORRUPTED;
+
+ idx = n->inode->base.inode_number;
+ tn = rbtree_lookup(inumtree, &idx);
+
+ if (tn == NULL)
+ return rbtree_insert(inumtree, &idx, &n);
+
+ target = *((const sqfs_tree_node_t **)rbtree_node_value(tn));
+
+ lnk = calloc(1, sizeof(*lnk));
+ if (lnk == NULL)
+ return SQFS_ERROR_ALLOC;
+
+ lnk->inode_number = idx;
+ ret = sqfs_tree_node_get_path(target, &lnk->target);
+ if (ret != 0) {
+ free(lnk);
+ return ret;
+ }
+
+ if (canonicalize_name(lnk->target) != 0) {
+ sqfs_free(lnk->target);
+ free(lnk);
+ return SQFS_ERROR_CORRUPTED;
+ }
+
+ lnk->next = (*out);
+ (*out) = lnk;
+ return 0;
+}
+
+static int compare_inum(const void *ctx, const void *lhs, const void *rhs)
+{
+ sqfs_u32 l = *((const sqfs_u32 *)lhs), r = *((const sqfs_u32 *)rhs);
+ (void)ctx;
+
+ return l < r ? -1 : (l > r ? 1 : 0);
+}
+
+int sqfs_tree_find_hard_links(const sqfs_tree_node_t *root,
+ sqfs_hard_link_t **out)
+{
+ sqfs_hard_link_t *lnk = NULL;
+ rbtree_t inumtree;
+ int ret;
+
+ ret = rbtree_init(&inumtree, sizeof(sqfs_u32),
+ sizeof(sqfs_tree_node_t *),
+ compare_inum);
+ if (ret != 0)
+ return ret;
+
+ ret = map_nodes(&inumtree, out, root);
+ rbtree_cleanup(&inumtree);
+
+ if (ret != 0) {
+ while ((*out) != NULL) {
+ lnk = (*out);
+ (*out) = lnk->next;
+ free(lnk->target);
+ free(lnk);
+ }
+ }
+
+ return ret;
+}