]> git.ipfire.org Git - thirdparty/zstd.git/commit
projects / thirdparty / zstd.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: a1ac720) | patch
Hash Long One Position Ahead (+2.5% Speed)
authorW. Felix Handte <w@felixhandte.com>
Thu, 2 Sep 2021 16:25:08 +0000 (12:25 -0400)
committerW. Felix Handte <w@felixhandte.com>
Tue, 5 Oct 2021 18:54:37 +0000 (14:54 -0400)
commitdb4e1b5479c1df569732aa8f486633ed4098bd8c
tree6a5d45def9cb66af7ea4562b9e3f91c099ec7209tree | snapshot
parenta1ac7205d031a7f27ad1d5eae9deced4bba938f1commit | diff
Hash Long One Position Ahead (+2.5% Speed)

Aside from maybe a latency win in the loop, this means that when we find a
short match, we've already done the hash we need to check the next long match.
lib/compress/zstd_double_fast.c diff | blob | blame | history
Mirror of https://github.com/facebook/zstd.git