matchLength       641 lib/lz4/lz4_compress.c 			size_t matchLength = LZ4_count(ip + MINMATCH,
matchLength       644 lib/lz4/lz4_compress.c 			if (op + ((matchLength + 240)/255) > oMaxMatch) {
matchLength       646 lib/lz4/lz4_compress.c 				matchLength = (15 - 1) + (oMaxMatch - op) * 255;
matchLength       648 lib/lz4/lz4_compress.c 			ip += MINMATCH + matchLength;
matchLength       650 lib/lz4/lz4_compress.c 			if (matchLength >= ML_MASK) {
matchLength       652 lib/lz4/lz4_compress.c 				matchLength -= ML_MASK;
matchLength       653 lib/lz4/lz4_compress.c 				while (matchLength >= 255) {
matchLength       654 lib/lz4/lz4_compress.c 					matchLength -= 255;
matchLength       657 lib/lz4/lz4_compress.c 				*op++ = (BYTE)matchLength;
matchLength       659 lib/lz4/lz4_compress.c 				*token += (BYTE)(matchLength);
matchLength       266 lib/lz4/lz4hc_compress.c 	int matchLength,
matchLength       304 lib/lz4/lz4hc_compress.c 	length = (int)(matchLength - MINMATCH);
matchLength       332 lib/lz4/lz4hc_compress.c 	*ip += matchLength;
matchLength       575 lib/zstd/compress.c 		U32 const mlv = sequences[u].matchLength;
matchLength       765 lib/zstd/compress.c 		BIT_addBits(&blockStream, sequences[nbSeq - 1].matchLength, ML_bits[mlCodeTable[nbSeq - 1]]);
matchLength       801 lib/zstd/compress.c 				BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
matchLength       882 lib/zstd/compress.c 	seqStorePtr->sequences[0].matchLength = (U16)matchCode;
matchLength       943 lib/zstd/compress.c 	size_t const matchLength = ZSTD_count(ip, match, vEnd);
matchLength       944 lib/zstd/compress.c 	if (match + matchLength != mEnd)
matchLength       945 lib/zstd/compress.c 		return matchLength;
matchLength       946 lib/zstd/compress.c 	return matchLength + ZSTD_count(ip + matchLength, iStart, iEnd);
matchLength      1590 lib/zstd/compress.c 		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
matchLength      1592 lib/zstd/compress.c 		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
matchLength      1594 lib/zstd/compress.c 			if (match[matchLength] == ip[matchLength])
matchLength      1595 lib/zstd/compress.c 				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iend) + 1;
matchLength      1598 lib/zstd/compress.c 			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iend, dictEnd, prefixStart);
matchLength      1599 lib/zstd/compress.c 			if (matchIndex + matchLength >= dictLimit)
matchLength      1603 lib/zstd/compress.c 		if (matchLength > bestLength) {
matchLength      1604 lib/zstd/compress.c 			bestLength = matchLength;
matchLength      1605 lib/zstd/compress.c 			if (matchLength > matchEndIdx - matchIndex)
matchLength      1606 lib/zstd/compress.c 				matchEndIdx = matchIndex + (U32)matchLength;
matchLength      1609 lib/zstd/compress.c 		if (ip + matchLength == iend) /* equal : no way to know if inf or sup */
matchLength      1612 lib/zstd/compress.c 		if (match[matchLength] < ip[matchLength]) { /* necessarily within correct buffer */
matchLength      1615 lib/zstd/compress.c 			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
matchLength      1625 lib/zstd/compress.c 			commonLengthLarger = matchLength;
matchLength      1672 lib/zstd/compress.c 		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
matchLength      1675 lib/zstd/compress.c 		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
matchLength      1677 lib/zstd/compress.c 			if (match[matchLength] == ip[matchLength])
matchLength      1678 lib/zstd/compress.c 				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iend) + 1;
matchLength      1681 lib/zstd/compress.c 			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iend, dictEnd, prefixStart);
matchLength      1682 lib/zstd/compress.c 			if (matchIndex + matchLength >= dictLimit)
matchLength      1686 lib/zstd/compress.c 		if (matchLength > bestLength) {
matchLength      1687 lib/zstd/compress.c 			if (matchLength > matchEndIdx - matchIndex)
matchLength      1688 lib/zstd/compress.c 				matchEndIdx = matchIndex + (U32)matchLength;
matchLength      1689 lib/zstd/compress.c 			if ((4 * (int)(matchLength - bestLength)) > (int)(ZSTD_highbit32(curr - matchIndex + 1) - ZSTD_highbit32((U32)offsetPtr[0] + 1)))
matchLength      1690 lib/zstd/compress.c 				bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + curr - matchIndex;
matchLength      1691 lib/zstd/compress.c 			if (ip + matchLength == iend) /* equal : no way to know if inf or sup */
matchLength      1695 lib/zstd/compress.c 		if (match[matchLength] < ip[matchLength]) {
matchLength      1698 lib/zstd/compress.c 			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
matchLength      1708 lib/zstd/compress.c 			commonLengthLarger = matchLength;
matchLength      1927 lib/zstd/compress.c 		size_t matchLength = 0;
matchLength      1934 lib/zstd/compress.c 			matchLength = ZSTD_count(ip + 1 + EQUAL_READ32, ip + 1 + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
matchLength      1943 lib/zstd/compress.c 			if (ml2 > matchLength)
matchLength      1944 lib/zstd/compress.c 				matchLength = ml2, start = ip, offset = offsetFound;
matchLength      1947 lib/zstd/compress.c 		if (matchLength < EQUAL_READ32) {
matchLength      1959 lib/zstd/compress.c 					int const gain1 = (int)(matchLength * 3 - ZSTD_highbit32((U32)offset + 1) + 1);
matchLength      1961 lib/zstd/compress.c 						matchLength = mlRep, offset = 0, start = ip;
matchLength      1967 lib/zstd/compress.c 					int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 4);
matchLength      1969 lib/zstd/compress.c 						matchLength = ml2, offset = offset2, start = ip;
matchLength      1980 lib/zstd/compress.c 						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 1);
matchLength      1982 lib/zstd/compress.c 							matchLength = ml2, offset = 0, start = ip;
matchLength      1988 lib/zstd/compress.c 						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 7);
matchLength      1990 lib/zstd/compress.c 							matchLength = ml2, offset = offset2, start = ip;
matchLength      2009 lib/zstd/compress.c 				matchLength++;
matchLength      2019 lib/zstd/compress.c 			ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength - MINMATCH);
matchLength      2020 lib/zstd/compress.c 			anchor = ip = start + matchLength;
matchLength      2026 lib/zstd/compress.c 			matchLength = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_2, iend) + EQUAL_READ32;
matchLength      2030 lib/zstd/compress.c 			ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength - MINMATCH);
matchLength      2031 lib/zstd/compress.c 			ip += matchLength;
matchLength      2088 lib/zstd/compress.c 		size_t matchLength = 0;
matchLength      2102 lib/zstd/compress.c 					matchLength =
matchLength      2113 lib/zstd/compress.c 			if (ml2 > matchLength)
matchLength      2114 lib/zstd/compress.c 				matchLength = ml2, start = ip, offset = offsetFound;
matchLength      2117 lib/zstd/compress.c 		if (matchLength < EQUAL_READ32) {
matchLength      2140 lib/zstd/compress.c 							int const gain1 = (int)(matchLength * 3 - ZSTD_highbit32((U32)offset + 1) + 1);
matchLength      2142 lib/zstd/compress.c 								matchLength = repLength, offset = 0, start = ip;
matchLength      2151 lib/zstd/compress.c 					int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 4);
matchLength      2153 lib/zstd/compress.c 						matchLength = ml2, offset = offset2, start = ip;
matchLength      2175 lib/zstd/compress.c 								int gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 1);
matchLength      2177 lib/zstd/compress.c 									matchLength = repLength, offset = 0, start = ip;
matchLength      2186 lib/zstd/compress.c 						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 7);
matchLength      2188 lib/zstd/compress.c 							matchLength = ml2, offset = offset2, start = ip;
matchLength      2204 lib/zstd/compress.c 				matchLength++;
matchLength      2213 lib/zstd/compress.c 		ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength - MINMATCH);
matchLength      2214 lib/zstd/compress.c 		anchor = ip = start + matchLength;
matchLength      2226 lib/zstd/compress.c 					matchLength =
matchLength      2231 lib/zstd/compress.c 					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength - MINMATCH);
matchLength      2232 lib/zstd/compress.c 					ip += matchLength;
matchLength       863 lib/zstd/decompress.c 	size_t matchLength;
matchLength       884 lib/zstd/decompress.c 	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
matchLength       913 lib/zstd/decompress.c 		if (match + sequence.matchLength <= dictEnd) {
matchLength       914 lib/zstd/decompress.c 			memmove(oLitEnd, match, sequence.matchLength);
matchLength       922 lib/zstd/decompress.c 			sequence.matchLength -= length1;
matchLength       986 lib/zstd/decompress.c 	seq.matchLength = ML_base[mlCode] + ((mlCode > 31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0); /* <=  16 bits */
matchLength      1011 lib/zstd/decompress.c 	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
matchLength      1039 lib/zstd/decompress.c 		if (match + sequence.matchLength <= dictEnd) {
matchLength      1040 lib/zstd/decompress.c 			memmove(oLitEnd, match, sequence.matchLength);
matchLength      1048 lib/zstd/decompress.c 			sequence.matchLength -= length1;
matchLength      1050 lib/zstd/decompress.c 			if (op > oend_w || sequence.matchLength < MINMATCH) {
matchLength      1052 lib/zstd/decompress.c 				for (i = 0; i < sequence.matchLength; ++i)
matchLength      1088 lib/zstd/decompress.c 		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength - 8); /* works even if matchLength < 8 */
matchLength      1227 lib/zstd/decompress.c 	seq.matchLength = ML_base[mlCode] + ((mlCode > 31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0); /* <=  16 bits */
matchLength      1240 lib/zstd/decompress.c 		seqState->pos = pos + seq.matchLength;
matchLength      1267 lib/zstd/decompress.c 	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
matchLength      1294 lib/zstd/decompress.c 		if (match + sequence.matchLength <= dictEnd) {
matchLength      1295 lib/zstd/decompress.c 			memmove(oLitEnd, match, sequence.matchLength);
matchLength      1303 lib/zstd/decompress.c 			sequence.matchLength -= length1;
matchLength      1305 lib/zstd/decompress.c 			if (op > oend_w || sequence.matchLength < MINMATCH) {
matchLength      1307 lib/zstd/decompress.c 				for (i = 0; i < sequence.matchLength; ++i)
matchLength      1343 lib/zstd/decompress.c 		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength - 8); /* works even if matchLength < 8 */
matchLength       175 lib/zstd/zstd_internal.h 	U16 matchLength;
matchLength       142 lib/zstd/zstd_opt.h FORCE_INLINE U32 ZSTD_getPrice(seqStore_t *seqStorePtr, U32 litLength, const BYTE *literals, U32 offset, U32 matchLength, const int ultra)
matchLength       149 lib/zstd/zstd_opt.h 		return ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + ZSTD_highbit32((U32)matchLength + 1) + 16 + offCode;
matchLength       158 lib/zstd/zstd_opt.h 		const BYTE mlCode = (matchLength > 127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
matchLength       165 lib/zstd/zstd_opt.h ZSTD_STATIC void ZSTD_updatePrice(seqStore_t *seqStorePtr, U32 litLength, const BYTE *literals, U32 offset, U32 matchLength)
matchLength       192 lib/zstd/zstd_opt.h 		const BYTE mlCode = (matchLength > 127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
matchLength       297 lib/zstd/zstd_opt.h 		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
matchLength       300 lib/zstd/zstd_opt.h 		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
matchLength       302 lib/zstd/zstd_opt.h 			if (match[matchLength] == ip[matchLength]) {
matchLength       303 lib/zstd/zstd_opt.h 				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iLimit) + 1;
matchLength       307 lib/zstd/zstd_opt.h 			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iLimit, dictEnd, prefixStart);
matchLength       308 lib/zstd/zstd_opt.h 			if (matchIndex + matchLength >= dictLimit)
matchLength       312 lib/zstd/zstd_opt.h 		if (matchLength > bestLength) {
matchLength       313 lib/zstd/zstd_opt.h 			if (matchLength > matchEndIdx - matchIndex)
matchLength       314 lib/zstd/zstd_opt.h 				matchEndIdx = matchIndex + (U32)matchLength;
matchLength       315 lib/zstd/zstd_opt.h 			bestLength = matchLength;
matchLength       317 lib/zstd/zstd_opt.h 			matches[mnum].len = (U32)matchLength;
matchLength       319 lib/zstd/zstd_opt.h 			if (matchLength > ZSTD_OPT_NUM)
matchLength       321 lib/zstd/zstd_opt.h 			if (ip + matchLength == iLimit) /* equal : no way to know if inf or sup */
matchLength       325 lib/zstd/zstd_opt.h 		if (match[matchLength] < ip[matchLength]) {
matchLength       328 lib/zstd/zstd_opt.h 			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
matchLength       338 lib/zstd/zstd_opt.h 			commonLengthLarger = matchLength;