mirror of https://git.tukaani.org/xz.git
liblzma: Use lzma_memcmplen() in fast mode of LZMA.
This commit is contained in:
parent
353212137e
commit
6bf5308e34
|
@ -10,6 +10,7 @@
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
///////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
#include "lzma_encoder_private.h"
|
#include "lzma_encoder_private.h"
|
||||||
|
#include "memcmplen.h"
|
||||||
|
|
||||||
|
|
||||||
#define change_pair(small_dist, big_dist) \
|
#define change_pair(small_dist, big_dist) \
|
||||||
|
@ -57,9 +58,8 @@ lzma_lzma_optimum_fast(lzma_coder *restrict coder, lzma_mf *restrict mf,
|
||||||
|
|
||||||
// The first two bytes matched.
|
// The first two bytes matched.
|
||||||
// Calculate the length of the match.
|
// Calculate the length of the match.
|
||||||
uint32_t len;
|
const uint32_t len = lzma_memcmplen(
|
||||||
for (len = 2; len < buf_avail
|
buf, buf_back, 2, buf_avail);
|
||||||
&& buf[len] == buf_back[len]; ++len) ;
|
|
||||||
|
|
||||||
// If we have found a repeated match that is at least
|
// If we have found a repeated match that is at least
|
||||||
// nice_len long, return it immediately.
|
// nice_len long, return it immediately.
|
||||||
|
|
Loading…
Reference in New Issue