aboutsummaryrefslogtreecommitdiff
path: root/unpack
diff options
context:
space:
mode:
authorDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2020-02-12 18:58:45 +0100
committerDavid Oberhollenzer <david.oberhollenzer@sigma-star.at>2020-02-12 18:58:45 +0100
commit6546c3f4a1d140024cb2ab2c90fbf192749a1bf7 (patch)
tree453faf64d09638313820414116a8012d54ede18b /unpack
parent84c9566aaf2dd456992b9b37a6324c09af055afb (diff)
Use a hash table for fragment lookup instead of linear search
Profiling on a sample filesystem determined that fragment deduplication lookups rank third place directly after crc32 and the actual compression. By using a hash table instead of linear search, this time can be reduced drastically. Signed-off-by: David Oberhollenzer <david.oberhollenzer@sigma-star.at>
Diffstat (limited to 'unpack')
0 files changed, 0 insertions, 0 deletions