dictLimit         124 include/linux/lz4.h 	unsigned int	 dictLimit;
dictLimit          69 lib/lz4/lz4hc_compress.c 	hc4->dictLimit = 64 * KB;
dictLimit         110 lib/lz4/lz4hc_compress.c 	const U32 dictLimit = hc4->dictLimit;
dictLimit         125 lib/lz4/lz4hc_compress.c 		if (matchIndex >= dictLimit) {
dictLimit         144 lib/lz4/lz4hc_compress.c 					+ (dictLimit - matchIndex);
dictLimit         153 lib/lz4/lz4hc_compress.c 						base + dictLimit,
dictLimit         181 lib/lz4/lz4hc_compress.c 	const U32 dictLimit = hc4->dictLimit;
dictLimit         182 lib/lz4/lz4hc_compress.c 	const BYTE * const lowPrefixPtr = base + dictLimit;
dictLimit         198 lib/lz4/lz4hc_compress.c 		if (matchIndex >= dictLimit) {
dictLimit         230 lib/lz4/lz4hc_compress.c 				const BYTE *vLimit = ip + (dictLimit - matchIndex);
dictLimit         239 lib/lz4/lz4hc_compress.c 					mlt += LZ4_count(ip + mlt, base + dictLimit,
dictLimit         658 lib/lz4/lz4hc_compress.c 	ctxPtr->lowLimit	= ctxPtr->dictLimit;
dictLimit         659 lib/lz4/lz4hc_compress.c 	ctxPtr->dictLimit = (U32)(ctxPtr->end - ctxPtr->base);
dictLimit         661 lib/lz4/lz4hc_compress.c 	ctxPtr->base = newBlock - ctxPtr->dictLimit;
dictLimit         664 lib/lz4/lz4hc_compress.c 	ctxPtr->nextToUpdate = ctxPtr->dictLimit;
dictLimit         684 lib/lz4/lz4hc_compress.c 			- ctxPtr->dictLimit;
dictLimit         699 lib/lz4/lz4hc_compress.c 		const BYTE * const dictEnd = ctxPtr->dictBase + ctxPtr->dictLimit;
dictLimit         707 lib/lz4/lz4hc_compress.c 			if (ctxPtr->dictLimit - ctxPtr->lowLimit < 4)
dictLimit         708 lib/lz4/lz4hc_compress.c 				ctxPtr->lowLimit = ctxPtr->dictLimit;
dictLimit         741 lib/lz4/lz4hc_compress.c 		- (streamPtr->base + streamPtr->dictLimit));
dictLimit         757 lib/lz4/lz4hc_compress.c 		streamPtr->dictLimit = endIndex - dictSize;
dictLimit         760 lib/lz4/lz4hc_compress.c 		if (streamPtr->nextToUpdate < streamPtr->dictLimit)
dictLimit         761 lib/lz4/lz4hc_compress.c 			streamPtr->nextToUpdate = streamPtr->dictLimit;
dictLimit          57 lib/zstd/compress.c 	U32 dictLimit;	/* below that point, need extDict */
dictLimit         223 lib/zstd/compress.c 	cctx->dictLimit = end;
dictLimit         295 lib/zstd/compress.c 		zc->dictLimit = 0;
dictLimit         375 lib/zstd/compress.c 	dstCCtx->dictLimit = srcCCtx->dictLimit;
dictLimit        1017 lib/zstd/compress.c 	const U32 lowestIndex = cctx->dictLimit;
dictLimit        1128 lib/zstd/compress.c 	const U32 dictLimit = ctx->dictLimit;
dictLimit        1129 lib/zstd/compress.c 	const BYTE *const lowPrefixPtr = base + dictLimit;
dictLimit        1130 lib/zstd/compress.c 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit        1139 lib/zstd/compress.c 		const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base;
dictLimit        1143 lib/zstd/compress.c 		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
dictLimit        1148 lib/zstd/compress.c 		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
dictLimit        1150 lib/zstd/compress.c 			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit        1160 lib/zstd/compress.c 				const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend;
dictLimit        1161 lib/zstd/compress.c 				const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
dictLimit        1188 lib/zstd/compress.c 				const BYTE *repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
dictLimit        1189 lib/zstd/compress.c 				if ((((U32)((dictLimit - 1) - repIndex2) >= 3) & (repIndex2 > lowestIndex)) /* intentional overflow */
dictLimit        1191 lib/zstd/compress.c 					const BYTE *const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
dictLimit        1265 lib/zstd/compress.c 	const U32 lowestIndex = cctx->dictLimit;
dictLimit        1409 lib/zstd/compress.c 	const U32 dictLimit = ctx->dictLimit;
dictLimit        1410 lib/zstd/compress.c 	const BYTE *const lowPrefixPtr = base + dictLimit;
dictLimit        1411 lib/zstd/compress.c 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit        1420 lib/zstd/compress.c 		const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base;
dictLimit        1425 lib/zstd/compress.c 		const BYTE *matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
dictLimit        1430 lib/zstd/compress.c 		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
dictLimit        1435 lib/zstd/compress.c 		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
dictLimit        1437 lib/zstd/compress.c 			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit        1443 lib/zstd/compress.c 				const BYTE *matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
dictLimit        1444 lib/zstd/compress.c 				const BYTE *lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
dictLimit        1460 lib/zstd/compress.c 				const BYTE *const match3Base = matchIndex3 < dictLimit ? dictBase : base;
dictLimit        1465 lib/zstd/compress.c 					const BYTE *matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
dictLimit        1466 lib/zstd/compress.c 					const BYTE *lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
dictLimit        1476 lib/zstd/compress.c 					const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend;
dictLimit        1477 lib/zstd/compress.c 					const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
dictLimit        1510 lib/zstd/compress.c 				const BYTE *repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
dictLimit        1511 lib/zstd/compress.c 				if ((((U32)((dictLimit - 1) - repIndex2) >= 3) & (repIndex2 > lowestIndex)) /* intentional overflow */
dictLimit        1513 lib/zstd/compress.c 					const BYTE *const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
dictLimit        1573 lib/zstd/compress.c 	const U32 dictLimit = zc->dictLimit;
dictLimit        1574 lib/zstd/compress.c 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit        1575 lib/zstd/compress.c 	const BYTE *const prefixStart = base + dictLimit;
dictLimit        1592 lib/zstd/compress.c 		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
dictLimit        1599 lib/zstd/compress.c 			if (matchIndex + matchLength >= dictLimit)
dictLimit        1656 lib/zstd/compress.c 	const U32 dictLimit = zc->dictLimit;
dictLimit        1657 lib/zstd/compress.c 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit        1658 lib/zstd/compress.c 	const BYTE *const prefixStart = base + dictLimit;
dictLimit        1675 lib/zstd/compress.c 		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
dictLimit        1682 lib/zstd/compress.c 			if (matchIndex + matchLength >= dictLimit)
dictLimit        1828 lib/zstd/compress.c 	const U32 dictLimit = zc->dictLimit;
dictLimit        1829 lib/zstd/compress.c 	const BYTE *const prefixStart = base + dictLimit;
dictLimit        1830 lib/zstd/compress.c 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit        1843 lib/zstd/compress.c 		if ((!extDict) || matchIndex >= dictLimit) {
dictLimit        1905 lib/zstd/compress.c 	const BYTE *const base = ctx->base + ctx->dictLimit;
dictLimit        2067 lib/zstd/compress.c 	const U32 dictLimit = ctx->dictLimit;
dictLimit        2069 lib/zstd/compress.c 	const BYTE *const prefixStart = base + dictLimit;
dictLimit        2071 lib/zstd/compress.c 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit        2096 lib/zstd/compress.c 			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
dictLimit        2098 lib/zstd/compress.c 			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
dictLimit        2101 lib/zstd/compress.c 					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit        2130 lib/zstd/compress.c 					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
dictLimit        2132 lib/zstd/compress.c 					if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
dictLimit        2135 lib/zstd/compress.c 							const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit        2165 lib/zstd/compress.c 						const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
dictLimit        2167 lib/zstd/compress.c 						if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
dictLimit        2170 lib/zstd/compress.c 								const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit        2199 lib/zstd/compress.c 			const BYTE *match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
dictLimit        2200 lib/zstd/compress.c 			const BYTE *const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
dictLimit        2220 lib/zstd/compress.c 			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
dictLimit        2222 lib/zstd/compress.c 			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
dictLimit        2225 lib/zstd/compress.c 					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit        2335 lib/zstd/compress.c 	ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit);
dictLimit        2387 lib/zstd/compress.c 			cctx->dictLimit -= correction;
dictLimit        2399 lib/zstd/compress.c 			if (cctx->dictLimit < cctx->lowLimit)
dictLimit        2400 lib/zstd/compress.c 				cctx->dictLimit = cctx->lowLimit;
dictLimit        2511 lib/zstd/compress.c 		cctx->lowLimit = cctx->dictLimit;
dictLimit        2512 lib/zstd/compress.c 		cctx->dictLimit = (U32)(cctx->nextSrc - cctx->base);
dictLimit        2515 lib/zstd/compress.c 		cctx->nextToUpdate = cctx->dictLimit;
dictLimit        2516 lib/zstd/compress.c 		if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE)
dictLimit        2517 lib/zstd/compress.c 			cctx->lowLimit = cctx->dictLimit; /* too small extDict */
dictLimit        2521 lib/zstd/compress.c 	if ((ip + srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
dictLimit        2523 lib/zstd/compress.c 		U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
dictLimit        2563 lib/zstd/compress.c 	zc->lowLimit = zc->dictLimit;
dictLimit        2564 lib/zstd/compress.c 	zc->dictLimit = (U32)(zc->nextSrc - zc->base);
dictLimit        2567 lib/zstd/compress.c 	zc->nextToUpdate = zc->dictLimit;
dictLimit         249 lib/zstd/zstd_opt.h 	const U32 dictLimit = zc->dictLimit;
dictLimit         250 lib/zstd/zstd_opt.h 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit         251 lib/zstd/zstd_opt.h 	const BYTE *const prefixStart = base + dictLimit;
dictLimit         268 lib/zstd/zstd_opt.h 			if ((!extDict) || matchIndex3 >= dictLimit) {
dictLimit         300 lib/zstd/zstd_opt.h 		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
dictLimit         308 lib/zstd/zstd_opt.h 			if (matchIndex + matchLength >= dictLimit)
dictLimit         416 lib/zstd/zstd_opt.h 	const BYTE *const prefixStart = base + ctx->dictLimit;
dictLimit         710 lib/zstd/zstd_opt.h 	const U32 dictLimit = ctx->dictLimit;
dictLimit         711 lib/zstd/zstd_opt.h 	const BYTE *const prefixStart = base + dictLimit;
dictLimit         713 lib/zstd/zstd_opt.h 	const BYTE *const dictEnd = dictBase + dictLimit;
dictLimit         751 lib/zstd/zstd_opt.h 				const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
dictLimit         754 lib/zstd/zstd_opt.h 				    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
dictLimit         757 lib/zstd/zstd_opt.h 					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
dictLimit         864 lib/zstd/zstd_opt.h 					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
dictLimit         867 lib/zstd/zstd_opt.h 					    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
dictLimit         870 lib/zstd/zstd_opt.h 						const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;