diff options
| author | David Oberhollenzer <david.oberhollenzer@sigma-star.at> | 2019-08-04 16:56:08 +0200 |
|---|---|---|
| committer | David Oberhollenzer <david.oberhollenzer@sigma-star.at> | 2019-08-04 17:01:14 +0200 |
| commit | 3a340b12eb9b7ed86a47391345cb836fa662b2d9 (patch) | |
| tree | cf645d3ccef3347f10985f415a0755a5b0de36b9 /include | |
| parent | bf1dd4f1ab8ef70f96704c4e2bd95968e1615b37 (diff) | |
Improve file unpacking order
This commit moves the file unpacking order & job scheduling to a libfstree
function. The ordering is improved by making sure fragment blocks are not
extracted more than once and files with data blocks are extracted in order.
This way, serial unpacking of a 2GiB Debian live image could be reduced
from ~5' on my test machine to ~3.5', whereas parallel unpacking stays
roughly the same (~3' for -j 4).
Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
Diffstat (limited to 'include')
| -rw-r--r-- | include/fstree.h | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/include/fstree.h b/include/fstree.h index 608ff97..dbc76db 100644 --- a/include/fstree.h +++ b/include/fstree.h @@ -323,4 +323,13 @@ file_info_t *fragment_by_chksum(file_info_t *fi, uint32_t chksum, uint64_t find_equal_blocks(file_info_t *file, file_info_t *list, size_t block_size); +/* + Optimize the order of the fstree file list for unpacking as to avoid + unpacking fragment blocks more than once and to improve locality when + fetching data from disk. The resulting list is returned in 'out'. + If num_jobs is > 1, the list is split up for parallel processing. + */ +void optimize_unpack_order(fstree_t *fs, size_t num_jobs, + file_info_t *out[num_jobs]); + #endif /* FSTREE_H */ |