Lines Matching defs:match
144 * @return : negative value, nb of common bytes before ip/match */
146 int LZ4HC_countBack(const BYTE* const ip, const BYTE* const match,
150 int const min = (int)MAX(iMin - ip, mMin - match);
153 assert(match >= mMin); assert((size_t)(match - mMin) < (1U<<31));
155 && (ip[back-1] == match[back-1]) )
227 * Checks if the match is in the last 3 bytes of the dictionary, so reading the
229 * @returns true if the match index is okay.
275 DEBUGLOG(7, "First match at index %u / %u (lowestMatchIndex)",
317 if (chainSwap && matchLength==longest) { /* better match => select a better chain */
379 U32 const newMatchIndex = matchCandidateIdx + (U32)forwardPatternLength - (U32)srcPatternLength; /* best position, full pattern, might be followed by more match */
388 U32 const newMatchIndex = matchCandidateIdx - (U32)backLength; /* farthest position in current segment, will find a match of length currentSegmentLength + maybe some back */
458 /* note : LZ4HC_InsertAndGetWiderMatch() is able to modify the starting position of a match (*startpos),
472 const BYTE* const match,
493 DEBUGLOG(6, "pos:%7u -- literals:%4u, match:%4i, offset:%5u, cost:%4u + %5u",
495 (U32)(ip - anchor), matchLength, (U32)(ip-match),
523 assert( (ip - match) <= LZ4_DISTANCE_MAX ); /* note : consider providing offset as a value, rather than as a pointer difference */
524 LZ4_writeLE16(op, (U16)(ip - match)); op += 2;
530 DEBUGLOG(6, "Not enough room to write match length");
608 if (ml2 == ml) { /* No better match => encode ML1 */
614 if (start0 < ip) { /* first match was skipped at least once */
653 if (ml3 == ml2) { /* No better match => encode ML1 and ML2 */
669 if (start3 < ip+ml+3) { /* Not enough space for match 2 : remove it */
776 /* ll validated; now adjust match length */
1105 ctxPtr->nextToUpdate = ctxPtr->dictLimit; /* match referencing will resume from there */
1314 LZ4HC_match_t match = { 0 , 0 };
1316 /* note : LZ4HC_InsertAndGetWiderMatch() is able to modify the starting position of a match (*startpos),
1320 if (matchLength <= minLen) return match;
1324 match.len = matchLength;
1325 match.off = (int)(ip-matchPtr);
1326 return match;
1403 /* set prices using initial match */
1439 /* in some cases, next position has same cost, but cost rises sharply after, so a small match would still be beneficial */
1464 /* before match : set price with literals at beginning */
1479 /* set prices using match at position = cur */
1506 if ( (ml == matchML) /* last pos of last match */
1545 if (next_matchLength > candidate_pos) break; /* last match elected, first match to encode */
1613 /* ll validated; now adjust match length */