Lines Matching defs:length
175 * pattern32 must be a sample of repetitive pattern of length 1, 2 or 4 (but not 3!) */
207 * pattern must be a sample of repetitive pattern of length 1, 2 or 4 (but not 3!)
388 U32 const newMatchIndex = matchCandidateIdx - (U32)backLength; /* farthest position in current segment, will find a match of length currentSegmentLength + maybe some back */
480 size_t length;
500 /* Encode Literal length */
501 length = (size_t)(ip - anchor);
504 if (limit && ((op + (length / 255) + length + (2 + 1 + LASTLITERALS)) > oend)) {
506 (int)length, (int)(oend - op));
509 if (length >= RUN_MASK) {
510 size_t len = length - RUN_MASK;
515 *token = (BYTE)(length << ML_BITS);
519 LZ4_wildCopy8(op, anchor, op + length);
520 op += length;
528 length = (size_t)matchLength - MINMATCH;
529 if (limit && (op + (length / 255) + (1 + LASTLITERALS) > oend)) {
530 DEBUGLOG(6, "Not enough room to write match length");
533 if (length >= ML_MASK) {
535 length -= ML_MASK;
536 for(; length >= 510 ; length -= 510) { *op++ = 255; *op++ = 255; }
537 if (length >= 255) { length -= 255; *op++ = 255; }
538 *op++ = (BYTE)length;
540 *token += (BYTE)(length);
776 /* ll validated; now adjust match length */
1451 /* only test matches of minimum length; slightly faster, but misses a few bytes */
1540 DEBUGLOG(7, "pos %i: sequence length %i", candidate_pos, selected_matchLength);
1613 /* ll validated; now adjust match length */