diff options
| -rw-r--r-- | tests/Makemodule.am | 7 | ||||
| -rw-r--r-- | tests/gen_inode_table.c | 98 |
2 files changed, 103 insertions, 2 deletions
diff --git a/tests/Makemodule.am b/tests/Makemodule.am index d7d0b70..8ec9592 100644 --- a/tests/Makemodule.am +++ b/tests/Makemodule.am @@ -13,8 +13,11 @@ test_mknode_reg_LDADD = libfstree.a test_mknode_dir_SOURCES = tests/mknode_dir.c test_mknode_dir_LDADD = libfstree.a +test_gen_inode_table_SOURCES = tests/gen_inode_table.c +test_gen_inode_table_LDADD = libfstree.a libutil.a + check_PROGRAMS += test_canonicalize_name test_mknode_simple test_mknode_slink -check_PROGRAMS += test_mknode_reg test_mknode_dir +check_PROGRAMS += test_mknode_reg test_mknode_dir test_gen_inode_table TESTS += test_canonicalize_name test_mknode_simple test_mknode_slink -TESTS += test_mknode_reg test_mknode_dir +TESTS += test_mknode_reg test_mknode_dir test_gen_inode_table diff --git a/tests/gen_inode_table.c b/tests/gen_inode_table.c new file mode 100644 index 0000000..12b3bb5 --- /dev/null +++ b/tests/gen_inode_table.c @@ -0,0 +1,98 @@ +/* SPDX-License-Identifier: GPL-3.0-or-later */ +#include "fstree.h" + +#include <stdlib.h> +#include <assert.h> +#include <string.h> + +static tree_node_t *gen_node(fstree_t *fs, tree_node_t *parent, + const char *name) +{ + struct stat sb; + + memset(&sb, 0, sizeof(sb)); + sb.st_mode = S_IFDIR | 0755; + + return fstree_mknode(fs, 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, 0, 0, 0, 0, 0) == 0); + assert(fstree_gen_inode_table(&fs) == 0); + assert(fs.inode_tbl_size == 3); + assert(fs.root->inode_num == 2); + assert(fs.inode_table[0] == NULL); + assert(fs.inode_table[1] == NULL); + assert(fs.inode_table[2] == fs.root); + fstree_cleanup(&fs); + + // tree with 2 levels under root, fan out 3 + assert(fstree_init(&fs, 0, 0, 0, 0, 0) == 0); + + a = gen_node(&fs, fs.root, "a"); + b = gen_node(&fs, fs.root, "b"); + c = gen_node(&fs, fs.root, "c"); + assert(a != NULL); + assert(b != NULL); + assert(c != NULL); + + assert(gen_node(&fs, a, "a_a") != NULL); + assert(gen_node(&fs, a, "a_b") != NULL); + assert(gen_node(&fs, a, "a_c") != NULL); + + assert(gen_node(&fs, b, "b_a") != NULL); + assert(gen_node(&fs, b, "b_b") != NULL); + assert(gen_node(&fs, b, "b_c") != NULL); + + assert(gen_node(&fs, c, "c_a") != NULL); + assert(gen_node(&fs, c, "c_b") != NULL); + assert(gen_node(&fs, c, "c_c") != NULL); + + assert(fstree_gen_inode_table(&fs) == 0); + + assert(fs.inode_tbl_size == (13 + 2)); + assert(fs.inode_table[0] == NULL); + assert(fs.inode_table[1] == NULL); + + for (i = 2; i < (13 + 2); ++i) { + assert(fs.inode_table[i] != NULL); + assert(fs.inode_table[i]->inode_num == i); + } + + check_children_before_root(fs.root); + check_children_continuous(fs.root); + + fstree_cleanup(&fs); + return EXIT_SUCCESS; +} |