Home
last modified time | relevance | path

Searched refs:matchEndIdx (Results 1 – 2 of 2) sorted by relevance

/linux-5.19.10/lib/zstd/compress/
Dzstd_opt.c407 U32 matchEndIdx = curr+8+1; in ZSTD_insertBt1() local
462 if (matchLength > matchEndIdx - matchIndex) in ZSTD_insertBt1()
463 matchEndIdx = matchIndex + (U32)matchLength; in ZSTD_insertBt1()
489 assert(matchEndIdx > curr + 8); in ZSTD_insertBt1()
490 return MAX(positions, matchEndIdx - (curr + 8)); in ZSTD_insertBt1()
553 …U32 matchEndIdx = curr+8+1; /* farthest referenced position of any match => detects repetitive p… in ZSTD_insertBtAndGetAllMatches() local
676 assert(matchEndIdx > matchIndex); in ZSTD_insertBtAndGetAllMatches()
677 if (matchLength > matchEndIdx - matchIndex) in ZSTD_insertBtAndGetAllMatches()
678 matchEndIdx = matchIndex + (U32)matchLength; in ZSTD_insertBtAndGetAllMatches()
725 if (matchLength > matchEndIdx - matchIndex) in ZSTD_insertBtAndGetAllMatches()
[all …]
Dzstd_lazy.c305 U32 matchEndIdx = curr + 8 + 1; in ZSTD_DUBT_findBestMatch() local
328 if (matchLength > matchEndIdx - matchIndex) in ZSTD_DUBT_findBestMatch()
329 matchEndIdx = matchIndex + (U32)matchLength; in ZSTD_DUBT_findBestMatch()
368 assert(matchEndIdx > curr+8); /* ensure nextToUpdate is increased */ in ZSTD_DUBT_findBestMatch()
369 ms->nextToUpdate = matchEndIdx - 8; /* skip repetitive patterns */ in ZSTD_DUBT_findBestMatch()