aboutsummaryrefslogtreecommitdiff
path: root/mkfs
diff options
context:
space:
mode:
authorDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2019-06-22 20:02:10 +0200
committerDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2019-06-22 20:04:25 +0200
commit6cbc85c018187a2b28bf0607f52bc258cc273253 (patch)
tree1081a7da4afef0236e9ef963bf43cfd2f0d02fba /mkfs
parent8edee9c4967ed9f3ce53cdc752cd2c02ca585bfe (diff)
Cleanup: split fstree sort into 2 fstree independend functions
Make tree node list sort and recursive variant available and independend of the fstree_t. This is considered cleaner, since the fstree_t actually isn't needed for any of this and we can just call the recusvie sort on the root instead, and we can use the sort implementation directly for things like the upcoming unit test. Also this commit splits up the merge/sort implementation into a seperate split and merge functions to make the code somewhat more readable. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
Diffstat (limited to 'mkfs')
-rw-r--r--mkfs/mkfs.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/mkfs/mkfs.c b/mkfs/mkfs.c
index 08744f8..12b4de9 100644
--- a/mkfs/mkfs.c
+++ b/mkfs/mkfs.c
@@ -109,7 +109,7 @@ int main(int argc, char **argv)
goto out_fstree;
}
- fstree_sort(&fs);
+ tree_node_sort_recursive(fs.root);
if (fstree_gen_inode_table(&fs))
goto out_fstree;