1 files changed, 101 insertions, 0 deletions
diff --git a/lib/fstree/src/mknode.c b/lib/fstree/src/mknode.c
new file mode 100644
index 0000000..2faf901
--- /dev/null
+++ b/lib/fstree/src/mknode.c
@@ -0,0 +1,101 @@
+/* SPDX-License-Identifier: GPL-3.0-or-later */
+/*
+ * mknode.c
+ *
+ * Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
+ */
+#include "config.h"
+#include "fstree.h"
+
+#include <string.h>
+#include <stdlib.h>
+#include <errno.h>
+
+void fstree_insert_sorted(tree_node_t *root, tree_node_t *n)
+{
+	tree_node_t *it = root->data.dir.children, *prev = NULL;
+
+	while (it != NULL && strcmp(it->name, n->name) < 0) {
+		prev = it;
+		it = it->next;
+	}
+
+	n->parent = root;
+	n->next = it;
+
+	if (prev == NULL) {
+		root->data.dir.children = n;
+	} else {
+		prev->next = n;
+	}
+}
+
+tree_node_t *fstree_mknode(tree_node_t *parent, const char *name,
+			   size_t name_len, const char *extra,
+			   const struct stat *sb)
+{
+	tree_node_t *n;
+	size_t size;
+	char *ptr;
+
+	if (S_ISLNK(sb->st_mode) && extra == NULL) {
+		errno = EINVAL;
+		return NULL;
+	}
+
+	size = sizeof(tree_node_t) + name_len + 1;
+	if (extra != NULL)
+		size += strlen(extra) + 1;
+
+	n = calloc(1, size);
+	if (n == NULL)
+		return NULL;
+
+	n->xattr_idx = 0xFFFFFFFF;
+	n->uid = sb->st_uid;
+	n->gid = sb->st_gid;
+	n->mode = sb->st_mode;
+	n->mod_time = sb->st_mtime;
+	n->link_count = 1;
+	n->name = (char *)n->payload;
+	memcpy(n->name, name, name_len);
+
+	if (extra != NULL) {
+		ptr = n->name + name_len + 1;
+		strcpy(ptr, extra);
+	} else {
+		ptr = NULL;
+	}
+
+	switch (sb->st_mode & S_IFMT) {
+	case S_IFREG:
+		n->data.file.input_file = ptr;
+		break;
+	case S_IFLNK:
+		n->mode = S_IFLNK | 0777;
+		n->data.target = ptr;
+		break;
+	case S_IFBLK:
+	case S_IFCHR:
+		n->data.devno = sb->st_rdev;
+		break;
+	case S_IFDIR:
+		n->link_count = 2;
+		break;
+	default:
+		break;
+	}
+
+	if (parent != NULL) {
+		if (parent->link_count == 0xFFFFFFFF) {
+			free(n);
+			errno = EMLINK;
+			return NULL;
+		}
+
+		fstree_insert_sorted(parent, n);
+		parent->link_count++;
+	}
+
+	return n;
+}