Lines Matching refs:match
78 /* the position at which to increment the step size if no match is found */
85 U32 idxl0; /* the long match index for ip */
86 U32 idxl1; /* the long match index for ip1 */
88 const BYTE* matchl0; /* the long match for ip */
89 const BYTE* matchs0; /* the short match for ip */
90 const BYTE* matchl1; /* the long match for ip1 */
107 /* Outer Loop: one iteration per match found and stored */
141 /* check prefix long match */
154 /* check prefix short match */
187 /* check prefix long +1 match */
198 /* if no long +1 match, explore the short match we found */
212 * processing this match. Rather than perform that test directly
214 * more predictable test. The minmatch even if we take a short match is
223 /* match found */
318 const BYTE* match = base + matchIndexS;
336 /* check prefix long match */
344 /* check dictMatchState long match */
357 /* check prefix short match */
358 if (MEM_read32(match) == MEM_read32(ip)) {
362 /* check dictMatchState short match */
364 match = dictBase + dictMatchIndexS;
367 if (match > dictStart && MEM_read32(match) == MEM_read32(ip)) {
385 /* check prefix long +1 match */
395 /* check dict long +1 match */
407 /* if no long +1 match, explore the short match we found */
409 mLength = ZSTD_count_2segments(ip+4, match+4, iend, dictEnd, prefixLowest) + 4;
411 while (((ip>anchor) & (match>dictStart)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
413 mLength = ZSTD_count(ip+4, match+4, iend) + 4;
414 offset = (U32)(ip - match);
415 while (((ip>anchor) & (match>prefixLowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
425 /* match found */
568 const BYTE* match = matchBase + matchIndex;
601 } else if ((matchIndex > dictStartIndex) && (MEM_read32(match) == MEM_read32(ip))) {
618 mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, prefixStart) + 4;
620 while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */