Lines Matching defs:dictMatchIndex
167 U32 dictMatchIndex = dictHashTable[h];
188 for (; nbCompares && (dictMatchIndex > dictLowLimit); --nbCompares) {
189 U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask);
191 const BYTE* match = dictBase + dictMatchIndex;
193 if (dictMatchIndex+matchLength >= dictHighLimit)
194 match = base + dictMatchIndex + dictIndexDelta; /* to prepare for next usage of match[matchLength] */
197 U32 matchIndex = dictMatchIndex + dictIndexDelta;
199 DEBUGLOG(9, "ZSTD_DUBT_findBetterDictMatch(%u) : found better match length %u -> %u and offsetCode %u -> %u (dictMatchIndex %u, matchIndex %u)",
200 curr, (U32)bestLength, (U32)matchLength, (U32)*offsetPtr, STORE_OFFSET(curr - matchIndex), dictMatchIndex, matchIndex);
209 if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */
211 dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */
214 if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */
216 dictMatchIndex = nextPtr[0];