Lines Matching defs:minMatch
331 U32 const mlBase = matchLength - MINMATCH;
332 assert(matchLength >= MINMATCH);
382 { U32 const mlBase = matchLength - MINMATCH;
584 ZSTD_updateTree_internal(ms, ip, iend, ms->cParams.minMatch, ZSTD_noDict);
606 U32 const minMatch = (mls==3) ? 3 : 4;
657 if ((repIndex >= windowLow) & (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repOffset, minMatch))) {
658 repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch;
668 && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) {
669 repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dictEnd, prefixStart) + minMatch;
674 && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) {
675 repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dmsEnd, prefixStart) + minMatch;
844 assert(BOUNDED(3, ms->cParams.minMatch, 6) == mls);
896 U32 const mls = BOUNDED(3, ms->cParams.minMatch, 6);
975 /* Matches may be < minMatch by this process. In that case, we will reject them
998 U32 minMatch)
1001 /* Note: ZSTD_match_t actually contains offBase and matchLength (before subtracting MINMATCH) */
1007 || candidateMatchLength < minMatch) {
1028 U32 minMatch)
1045 ZSTD_optLdm_maybeAddMatch(matches, nbMatches, optLdm, currPosInBlock, minMatch);
1097 U32 const minMatch = (cParams->minMatch == 3) ? 3 : 4;
1125 U32 nbMatches = getAllMatches(matches, ms, &nextToUpdate3, ip, iend, rep, ll0, minMatch);
1128 minMatch);
1175 for (pos = 1; pos < minMatch; pos++) {
1278 U32 nbMatches = getAllMatches(matches, ms, &nextToUpdate3, inr, iend, opt[cur].rep, ll0, minMatch);
1283 minMatch);
1308 U32 const startML = (matchNb>0) ? matches[matchNb-1].len+1 : minMatch;