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>

0 files changed, 0 insertions, 0 deletions