aboutsummaryrefslogtreecommitdiff
path: root/tests/gen_inode_table.c
diff options
context:
space:
mode:
authorDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2019-12-15 19:29:34 +0100
committerDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2019-12-16 14:46:24 +0100
commitcaf350448c0020f95b9bfdd65770d86faf548549 (patch)
treeba71630dbf0c7b2c2395c23f494d6d1b3c3002f3 /tests/gen_inode_table.c
parent5aa1bab7fabc55a6f2a2ff2f7d8e2c49421cb215 (diff)
Remove fstree inode table
Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
Diffstat (limited to 'tests/gen_inode_table.c')
-rw-r--r--tests/gen_inode_table.c99
1 files changed, 0 insertions, 99 deletions
diff --git a/tests/gen_inode_table.c b/tests/gen_inode_table.c
deleted file mode 100644
index d70f463..0000000
--- a/tests/gen_inode_table.c
+++ /dev/null
@@ -1,99 +0,0 @@
-/* SPDX-License-Identifier: GPL-3.0-or-later */
-/*
- * gen_inode_table.c
- *
- * Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
- */
-#include "config.h"
-
-#include "fstree.h"
-
-#include <stdlib.h>
-#include <assert.h>
-#include <string.h>
-
-static tree_node_t *gen_node(tree_node_t *parent, const char *name)
-{
- struct stat sb;
-
- memset(&sb, 0, sizeof(sb));
- sb.st_mode = S_IFDIR | 0755;
-
- return fstree_mknode(parent, name, strlen(name), NULL, &sb);
-}
-
-static void check_children_before_root(tree_node_t *root)
-{
- tree_node_t *n;
-
- for (n = root->data.dir.children; n != NULL; n = n->next)
- assert(n->inode_num < root->inode_num);
-
- for (n = root->data.dir.children; n != NULL; n = n->next)
- check_children_before_root(n);
-}
-
-static void check_children_continuous(tree_node_t *root)
-{
- tree_node_t *n;
-
- for (n = root->data.dir.children; n != NULL; n = n->next) {
- if (n->next != NULL) {
- assert(n->next->inode_num == (n->inode_num + 1));
- }
- }
-
- for (n = root->data.dir.children; n != NULL; n = n->next)
- check_children_continuous(n);
-}
-
-int main(void)
-{
- tree_node_t *a, *b, *c;
- unsigned int i;
- fstree_t fs;
-
- // inode table for the empty tree
- assert(fstree_init(&fs, NULL) == 0);
- assert(fstree_gen_inode_table(&fs) == 0);
- assert(fs.inode_tbl_size == 1);
- assert(fs.root->inode_num == 1);
- assert(fs.inode_table[0] == fs.root);
- fstree_cleanup(&fs);
-
- // tree with 2 levels under root, fan out 3
- assert(fstree_init(&fs, NULL) == 0);
-
- a = gen_node(fs.root, "a");
- b = gen_node(fs.root, "b");
- c = gen_node(fs.root, "c");
- assert(a != NULL);
- assert(b != NULL);
- assert(c != NULL);
-
- assert(gen_node(a, "a_a") != NULL);
- assert(gen_node(a, "a_b") != NULL);
- assert(gen_node(a, "a_c") != NULL);
-
- assert(gen_node(b, "b_a") != NULL);
- assert(gen_node(b, "b_b") != NULL);
- assert(gen_node(b, "b_c") != NULL);
-
- assert(gen_node(c, "c_a") != NULL);
- assert(gen_node(c, "c_b") != NULL);
- assert(gen_node(c, "c_c") != NULL);
-
- assert(fstree_gen_inode_table(&fs) == 0);
- assert(fs.inode_tbl_size == 13);
-
- for (i = 0; i < 13; ++i) {
- assert(fs.inode_table[i] != NULL);
- assert(fs.inode_table[i]->inode_num == i + 1);
- }
-
- check_children_before_root(fs.root);
- check_children_continuous(fs.root);
-
- fstree_cleanup(&fs);
- return EXIT_SUCCESS;
-}