Lines Matching refs:dictMatchIndex

167     U32               dictMatchIndex = dictHashTable[h];  in ZSTD_DUBT_findBetterDictMatch()  local
188     while (nbCompares-- && (dictMatchIndex > dictLowLimit)) {  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 … (U32)matchLength, (U32)*offsetPtr, ZSTD_REP_MOVE + 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()
214             if (dictMatchIndex <= btLow) { break; }   /* beyond tree size, stop the search */  in ZSTD_DUBT_findBetterDictMatch()
216             dictMatchIndex = nextPtr[0];  in ZSTD_DUBT_findBetterDictMatch()