diff options
| author | Eugene Kliuchnikov <eustas@google.com> | 2016-07-26 14:51:51 +0200 |
|---|---|---|
| committer | Eugene Kliuchnikov <eustas@google.com> | 2016-07-26 14:51:51 +0200 |
| commit | 058cd1ac7ac034cc8c90b3dbaab1c4aded100080 (patch) | |
| tree | c9a2a2c1d631e659e3a572f3f3764787f6154f92 | |
| parent | 2048189048f130b0e8fb60307277379743dc5a2d (diff) | |
| download | brotli-058cd1ac7ac034cc8c90b3dbaab1c4aded100080.zip brotli-058cd1ac7ac034cc8c90b3dbaab1c4aded100080.tar.gz brotli-058cd1ac7ac034cc8c90b3dbaab1c4aded100080.tar.bz2 | |
cleanup
| -rwxr-xr-x | enc/hash_forgetful_chain_inc.h | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/enc/hash_forgetful_chain_inc.h b/enc/hash_forgetful_chain_inc.h index 21b3367..49d537a 100755 --- a/enc/hash_forgetful_chain_inc.h +++ b/enc/hash_forgetful_chain_inc.h @@ -162,7 +162,6 @@ static BROTLI_INLINE BROTLI_BOOL FN(FindLongestMatch)( score_t best_score = out->score; size_t best_len = out->len; size_t i; - const uint32_t bytes = BROTLI_UNALIGNED_LOAD32(&data[cur_ix_masked]); const size_t key = FN(HashBytes)(&data[cur_ix_masked]); const uint8_t tiny_hash = (uint8_t)(key); out->len = 0; |