Home
last modified time | relevance | path

Searched refs:dictMatchIndex (Results 1 – 3 of 3) sorted by relevance

/linux/lib/zstd/compress/
H A Dzstd_opt.c780 U32 dictMatchIndex = dms->hashTable[dmsH]; in ZSTD_insertBtAndGetAllMatches() local
783 for (; nbCompares && (dictMatchIndex > dmsLowLimit); --nbCompares) { in ZSTD_insertBtAndGetAllMatches()
784 const U32* const nextPtr = dmsBt + 2*(dictMatchIndex & dmsBtMask); in ZSTD_insertBtAndGetAllMatches()
786 const BYTE* match = dmsBase + dictMatchIndex; in ZSTD_insertBtAndGetAllMatches()
788 if (dictMatchIndex+matchLength >= dmsHighLimit) in ZSTD_insertBtAndGetAllMatches()
789 …match = base + dictMatchIndex + dmsIndexDelta; /* to prepare for next usage of match[matchLength… in ZSTD_insertBtAndGetAllMatches()
792 matchIndex = dictMatchIndex + dmsIndexDelta; in ZSTD_insertBtAndGetAllMatches()
806 if (dictMatchIndex <= dmsBtLow) { break; } /* beyond tree size, stop the search */ in ZSTD_insertBtAndGetAllMatches()
809dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_insertBtAndGetAllMatches()
813 dictMatchIndex = nextPtr[0]; in ZSTD_insertBtAndGetAllMatches()
H A Dzstd_lazy.c179 U32 dictMatchIndex = dictHashTable[h]; in ZSTD_DUBT_findBetterDictMatch() local
200 for (; nbCompares && (dictMatchIndex > dictLowLimit); --nbCompares) { in ZSTD_DUBT_findBetterDictMatch()
201 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); in ZSTD_DUBT_findBetterDictMatch()
203 const BYTE* match = dictBase + dictMatchIndex; in ZSTD_DUBT_findBetterDictMatch()
205 if (dictMatchIndex+matchLength >= dictHighLimit) in ZSTD_DUBT_findBetterDictMatch()
206 …match = base + dictMatchIndex + dictIndexDelta; /* to prepare for next usage of match[matchLengt… in ZSTD_DUBT_findBetterDictMatch()
209 U32 matchIndex = dictMatchIndex + dictIndexDelta; in ZSTD_DUBT_findBetterDictMatch()
212 …32)matchLength, (U32)*offsetPtr, OFFSET_TO_OFFBASE(curr - matchIndex), dictMatchIndex, matchIndex); in ZSTD_DUBT_findBetterDictMatch()
221 if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */ in ZSTD_DUBT_findBetterDictMatch()
223dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_DUBT_findBetterDictMatch()
[all …]
H A Dzstd_fast.c577 const U32 dictMatchIndex = dictMatchIndexAndTag >> ZSTD_SHORT_CACHE_TAG_BITS; in ZSTD_compressBlock_fast_dictMatchState_generic() local
578 const BYTE* dictMatch = dictBase + dictMatchIndex; in ZSTD_compressBlock_fast_dictMatchState_generic()
579 if (dictMatchIndex > dictStartIndex && in ZSTD_compressBlock_fast_dictMatchState_generic()
583 U32 const offset = (U32) (curr - dictMatchIndex - dictIndexDelta); in ZSTD_compressBlock_fast_dictMatchState_generic()