diff options
| author | David Oberhollenzer <david.oberhollenzer@sigma-star.at> | 2019-09-27 16:43:11 +0200 |
|---|---|---|
| committer | David Oberhollenzer <david.oberhollenzer@sigma-star.at> | 2019-09-27 16:43:11 +0200 |
| commit | 625368eb5bcb9954ad190af50962e6b7c2fd9c4c (patch) | |
| tree | 48779d7e54b4fa3df83df39fff76b54d93aacedf /lib/fstree/fstree_sort.c | |
| parent | 720023d968b24fe358fd4cfb002d8572f6cc96e7 (diff) | |
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>
Diffstat (limited to 'lib/fstree/fstree_sort.c')
| -rw-r--r-- | lib/fstree/fstree_sort.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/fstree/fstree_sort.c b/lib/fstree/fstree_sort.c index 53fb58a..9cb177b 100644 --- a/lib/fstree/fstree_sort.c +++ b/lib/fstree/fstree_sort.c @@ -63,9 +63,9 @@ tree_node_t *tree_node_list_sort(tree_node_t *head) void tree_node_sort_recursive(tree_node_t *n) { - n->data.dir->children = tree_node_list_sort(n->data.dir->children); + n->data.dir.children = tree_node_list_sort(n->data.dir.children); - for (n = n->data.dir->children; n != NULL; n = n->next) { + for (n = n->data.dir.children; n != NULL; n = n->next) { if (S_ISDIR(n->mode)) tree_node_sort_recursive(n); } |