Cleanup: remove most of the payload pointer magic from libfstree

Now that dir_info_t and file_info_t have reasonably small, use them in
tree_node_t directly instead of doing pointer arithmetic magic on the
payload area.

Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>

1 files changed, 4 insertions, 4 deletions

diff --git a/tests/gen_inode_table.c b/tests/gen_inode_table.c
index 190f393..cf140c8 100644
--- a/tests/gen_inode_table.c
+++ b/tests/gen_inode_table.c
@@ -26,10 +26,10 @@ 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)
+	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)
+	for (n = root->data.dir.children; n != NULL; n = n->next)
 		check_children_before_root(n);
 }
 
@@ -37,13 +37,13 @@ static void check_children_continuous(tree_node_t *root)
 {
 	tree_node_t *n;
 
-	for (n = root->data.dir->children; n != NULL; n = n->next) {
+	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)
+	for (n = root->data.dir.children; n != NULL; n = n->next)
 		check_children_continuous(n);
 }