Home
last modified time | relevance | path

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

/freebsd/sys/contrib/openzfs/module/zstd/lib/compress/
H A Dzstd_lazy.c168 U32 dictMatchIndex = dictHashTable[h]; in ZSTD_DUBT_findBetterDictMatch() local
189 while (nbCompares-- && (dictMatchIndex > dictLowLimit)) { in ZSTD_DUBT_findBetterDictMatch()
190 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); in ZSTD_DUBT_findBetterDictMatch()
192 const BYTE* match = dictBase + dictMatchIndex; in ZSTD_DUBT_findBetterDictMatch()
194 if (dictMatchIndex+matchLength >= dictHighLimit) in ZSTD_DUBT_findBetterDictMatch()
195 …match = base + dictMatchIndex + dictIndexDelta; /* to prepare for next usage of match[matchLengt… in ZSTD_DUBT_findBetterDictMatch()
198 U32 matchIndex = dictMatchIndex + dictIndexDelta; in ZSTD_DUBT_findBetterDictMatch()
201 …32)matchLength, (U32)*offsetPtr, ZSTD_REP_MOVE + current - matchIndex, dictMatchIndex, matchIndex); in ZSTD_DUBT_findBetterDictMatch()
210 if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */ in ZSTD_DUBT_findBetterDictMatch()
212 …dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_DUBT_findBetterDictMatch()
[all …]
H A Dzstd_opt.c698 U32 dictMatchIndex = dms->hashTable[dmsH]; in ZSTD_insertBtAndGetAllMatches() local
701 while (nbCompares-- && (dictMatchIndex > dmsLowLimit)) { in ZSTD_insertBtAndGetAllMatches()
702 const U32* const nextPtr = dmsBt + 2*(dictMatchIndex & dmsBtMask); in ZSTD_insertBtAndGetAllMatches()
704 const BYTE* match = dmsBase + dictMatchIndex; in ZSTD_insertBtAndGetAllMatches()
706 if (dictMatchIndex+matchLength >= dmsHighLimit) in ZSTD_insertBtAndGetAllMatches()
707 …match = base + dictMatchIndex + dmsIndexDelta; /* to prepare for next usage of match[matchLength… in ZSTD_insertBtAndGetAllMatches()
710 matchIndex = dictMatchIndex + dmsIndexDelta; in ZSTD_insertBtAndGetAllMatches()
725 if (dictMatchIndex <= dmsBtLow) { break; } /* beyond tree size, stop the search */ in ZSTD_insertBtAndGetAllMatches()
728 …dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_insertBtAndGetAllMatches()
732 dictMatchIndex = nextPtr[0]; in ZSTD_insertBtAndGetAllMatches()
H A Dzstd_fast.c279 U32 const dictMatchIndex = dictHashTable[dictHash]; in ZSTD_compressBlock_fast_dictMatchState_generic() local
280 const BYTE* dictMatch = dictBase + dictMatchIndex; in ZSTD_compressBlock_fast_dictMatchState_generic()
281 if (dictMatchIndex <= dictStartIndex || in ZSTD_compressBlock_fast_dictMatchState_generic()
288 U32 const offset = (U32)(current-dictMatchIndex-dictIndexDelta); in ZSTD_compressBlock_fast_dictMatchState_generic()
/freebsd/sys/contrib/zstd/lib/compress/
H A Dzstd_opt.c744 U32 dictMatchIndex = dms->hashTable[dmsH]; in ZSTD_insertBtAndGetAllMatches() local
747 for (; nbCompares && (dictMatchIndex > dmsLowLimit); --nbCompares) { in ZSTD_insertBtAndGetAllMatches()
748 const U32* const nextPtr = dmsBt + 2*(dictMatchIndex & dmsBtMask); in ZSTD_insertBtAndGetAllMatches()
750 const BYTE* match = dmsBase + dictMatchIndex; in ZSTD_insertBtAndGetAllMatches()
752 if (dictMatchIndex+matchLength >= dmsHighLimit) in ZSTD_insertBtAndGetAllMatches()
753 …match = base + dictMatchIndex + dmsIndexDelta; /* to prepare for next usage of match[matchLength… in ZSTD_insertBtAndGetAllMatches()
756 matchIndex = dictMatchIndex + dmsIndexDelta; in ZSTD_insertBtAndGetAllMatches()
770 if (dictMatchIndex <= dmsBtLow) { break; } /* beyond tree size, stop the search */ in ZSTD_insertBtAndGetAllMatches()
773 …dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_insertBtAndGetAllMatches()
777 dictMatchIndex = nextPtr[0]; in ZSTD_insertBtAndGetAllMatches()
H A Dzstd_fast.c445 U32 const dictMatchIndex = dictHashTable[dictHash]; in ZSTD_compressBlock_fast_dictMatchState_generic() local
446 const BYTE* dictMatch = dictBase + dictMatchIndex; in ZSTD_compressBlock_fast_dictMatchState_generic()
447 if (dictMatchIndex <= dictStartIndex || in ZSTD_compressBlock_fast_dictMatchState_generic()
454 U32 const offset = (U32)(curr-dictMatchIndex-dictIndexDelta); in ZSTD_compressBlock_fast_dictMatchState_generic()
H A Dzstd_lazy.c167 U32 dictMatchIndex = dictHashTable[h]; in ZSTD_DUBT_findBetterDictMatch() local
188 for (; nbCompares && (dictMatchIndex > dictLowLimit); --nbCompares) { in ZSTD_DUBT_findBetterDictMatch()
189 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask); in ZSTD_DUBT_findBetterDictMatch()
191 const BYTE* match = dictBase + dictMatchIndex; in ZSTD_DUBT_findBetterDictMatch()
193 if (dictMatchIndex+matchLength >= dictHighLimit) in ZSTD_DUBT_findBetterDictMatch()
194 …match = base + dictMatchIndex + dictIndexDelta; /* to prepare for next usage of match[matchLengt… in ZSTD_DUBT_findBetterDictMatch()
197 U32 matchIndex = dictMatchIndex + dictIndexDelta; in ZSTD_DUBT_findBetterDictMatch()
200 …h, (U32)matchLength, (U32)*offsetPtr, STORE_OFFSET(curr - matchIndex), dictMatchIndex, matchIndex); in ZSTD_DUBT_findBetterDictMatch()
209 if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */ in ZSTD_DUBT_findBetterDictMatch()
211 …dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curren… in ZSTD_DUBT_findBetterDictMatch()
[all …]