1 files changed, 88 insertions, 0 deletions
diff --git a/lib/fstree/test/fstree_sort.c b/lib/fstree/test/fstree_sort.c
new file mode 100644
index 0000000..7df85f5
--- /dev/null
+++ b/lib/fstree/test/fstree_sort.c
@@ -0,0 +1,88 @@
+/* SPDX-License-Identifier: GPL-3.0-or-later */
+/*
+ * fstree_sort.c
+ *
+ * Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
+ */
+#include "config.h"
+
+#include "fstree.h"
+#include "util/test.h"
+
+int main(int argc, char **argv)
+{
+	tree_node_t *a, *b, *c, *d;
+	struct stat sb;
+	fstree_t fs;
+	int ret;
+	(void)argc; (void)argv;
+
+	memset(&sb, 0, sizeof(sb));
+	sb.st_mode = S_IFBLK | 0600;
+	sb.st_rdev = 1337;
+
+	/* in order */
+	ret = fstree_init(&fs, NULL);
+	TEST_EQUAL_I(ret, 0);
+
+	a = fstree_mknode(fs.root, "a", 1, NULL, &sb);
+	TEST_NOT_NULL(a);
+	TEST_ASSERT(fs.root->data.dir.children == a);
+	TEST_NULL(a->next);
+
+	b = fstree_mknode(fs.root, "b", 1, NULL, &sb);
+	TEST_NOT_NULL(a);
+	TEST_ASSERT(fs.root->data.dir.children == a);
+	TEST_ASSERT(a->next == b);
+	TEST_NULL(b->next);
+
+	c = fstree_mknode(fs.root, "c", 1, NULL, &sb);
+	TEST_NOT_NULL(c);
+	TEST_ASSERT(fs.root->data.dir.children == a);
+	TEST_ASSERT(a->next == b);
+	TEST_ASSERT(b->next == c);
+	TEST_NULL(c->next);
+
+	d = fstree_mknode(fs.root, "d", 1, NULL, &sb);
+	TEST_NOT_NULL(d);
+	TEST_ASSERT(fs.root->data.dir.children == a);
+	TEST_ASSERT(a->next == b);
+	TEST_ASSERT(b->next == c);
+	TEST_ASSERT(c->next == d);
+	TEST_NULL(d->next);
+
+	fstree_cleanup(&fs);
+
+	/* out-of-order */
+	ret = fstree_init(&fs, NULL);
+	TEST_EQUAL_I(ret, 0);
+
+	d = fstree_mknode(fs.root, "d", 1, NULL, &sb);
+	TEST_NOT_NULL(d);
+	TEST_ASSERT(fs.root->data.dir.children == d);
+	TEST_NULL(d->next);
+
+	c = fstree_mknode(fs.root, "c", 1, NULL, &sb);
+	TEST_NOT_NULL(c);
+	TEST_ASSERT(fs.root->data.dir.children == c);
+	TEST_ASSERT(c->next == d);
+	TEST_NULL(d->next);
+
+	b = fstree_mknode(fs.root, "b", 1, NULL, &sb);
+	TEST_NOT_NULL(b);
+	TEST_ASSERT(fs.root->data.dir.children == b);
+	TEST_ASSERT(b->next == c);
+	TEST_ASSERT(c->next == d);
+	TEST_NULL(d->next);
+
+	a = fstree_mknode(fs.root, "a", 1, NULL, &sb);
+	TEST_NOT_NULL(a);
+	TEST_ASSERT(fs.root->data.dir.children == a);
+	TEST_ASSERT(a->next == b);
+	TEST_ASSERT(b->next == c);
+	TEST_ASSERT(c->next == d);
+	TEST_NULL(d->next);
+
+	fstree_cleanup(&fs);
+	return EXIT_SUCCESS;
+}