lowLimit 126 include/linux/lz4.h unsigned int lowLimit; lowLimit 190 lib/lz4/lz4_compress.c const BYTE *lowLimit; lowLimit 216 lib/lz4/lz4_compress.c lowLimit = (const BYTE *)source; lowLimit 220 lib/lz4/lz4_compress.c lowLimit = (const BYTE *)source - dictPtr->dictSize; lowLimit 224 lib/lz4/lz4_compress.c lowLimit = (const BYTE *)source; lowLimit 272 lib/lz4/lz4_compress.c lowLimit = dictionary; lowLimit 275 lib/lz4/lz4_compress.c lowLimit = (const BYTE *)source; lowLimit 294 lib/lz4/lz4_compress.c while (((ip > anchor) & (match + refDelta > lowLimit)) lowLimit 339 lib/lz4/lz4_compress.c && (lowLimit == dictionary)) { lowLimit 407 lib/lz4/lz4_compress.c lowLimit = dictionary; lowLimit 410 lib/lz4/lz4_compress.c lowLimit = (const BYTE *)source; lowLimit 532 lib/lz4/lz4_compress.c const BYTE *lowLimit = (const BYTE *) src; lowLimit 604 lib/lz4/lz4_compress.c && (match > lowLimit) lowLimit 70 lib/lz4/lz4hc_compress.c hc4->lowLimit = 64 * KB; lowLimit 111 lib/lz4/lz4hc_compress.c const U32 lowLimit = (hc4->lowLimit + 64 * KB > (U32)(ip - base)) lowLimit 112 lib/lz4/lz4hc_compress.c ? hc4->lowLimit lowLimit 122 lib/lz4/lz4hc_compress.c while ((matchIndex >= lowLimit) lowLimit 183 lib/lz4/lz4hc_compress.c const U32 lowLimit = (hc4->lowLimit + 64 * KB > (U32)(ip - base)) lowLimit 184 lib/lz4/lz4hc_compress.c ? hc4->lowLimit lowLimit 195 lib/lz4/lz4hc_compress.c while ((matchIndex >= lowLimit) lowLimit 242 lib/lz4/lz4hc_compress.c && (matchIndex + back > lowLimit) lowLimit 658 lib/lz4/lz4hc_compress.c ctxPtr->lowLimit = ctxPtr->dictLimit; lowLimit 698 lib/lz4/lz4hc_compress.c const BYTE * const dictBegin = ctxPtr->dictBase + ctxPtr->lowLimit; lowLimit 705 lib/lz4/lz4hc_compress.c ctxPtr->lowLimit = (U32)(sourceEnd - ctxPtr->dictBase); lowLimit 707 lib/lz4/lz4hc_compress.c if (ctxPtr->dictLimit - ctxPtr->lowLimit < 4) lowLimit 708 lib/lz4/lz4hc_compress.c ctxPtr->lowLimit = ctxPtr->dictLimit; lowLimit 758 lib/lz4/lz4hc_compress.c streamPtr->lowLimit = endIndex - dictSize; lowLimit 58 lib/zstd/compress.c U32 lowLimit; /* below that point, no more data */ lowLimit 222 lib/zstd/compress.c cctx->lowLimit = end; lowLimit 296 lib/zstd/compress.c zc->lowLimit = 0; lowLimit 376 lib/zstd/compress.c dstCCtx->lowLimit = srcCCtx->lowLimit; lowLimit 1126 lib/zstd/compress.c const U32 lowestIndex = ctx->lowLimit; lowLimit 1407 lib/zstd/compress.c const U32 lowestIndex = ctx->lowLimit; lowLimit 1582 lib/zstd/compress.c U32 const windowLow = zc->lowLimit; lowLimit 1661 lib/zstd/compress.c const U32 windowLow = zc->lowLimit; lowLimit 1831 lib/zstd/compress.c const U32 lowLimit = zc->lowLimit; lowLimit 1840 lib/zstd/compress.c for (; (matchIndex > lowLimit) & (nbAttempts > 0); nbAttempts--) { lowLimit 2068 lib/zstd/compress.c const U32 lowestIndex = ctx->lowLimit; lowLimit 2072 lib/zstd/compress.c const BYTE *const dictStart = dictBase + ctx->lowLimit; lowLimit 2335 lib/zstd/compress.c ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit); lowLimit 2377 lib/zstd/compress.c if (cctx->lowLimit > (3U << 29)) { lowLimit 2386 lib/zstd/compress.c cctx->lowLimit -= correction; lowLimit 2397 lib/zstd/compress.c if (cctx->lowLimit < newLowLimit) lowLimit 2398 lib/zstd/compress.c cctx->lowLimit = newLowLimit; lowLimit 2399 lib/zstd/compress.c if (cctx->dictLimit < cctx->lowLimit) lowLimit 2400 lib/zstd/compress.c cctx->dictLimit = cctx->lowLimit; lowLimit 2511 lib/zstd/compress.c cctx->lowLimit = cctx->dictLimit; lowLimit 2516 lib/zstd/compress.c if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE) lowLimit 2517 lib/zstd/compress.c cctx->lowLimit = cctx->dictLimit; /* too small extDict */ lowLimit 2521 lib/zstd/compress.c if ((ip + srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) { lowLimit 2524 lib/zstd/compress.c cctx->lowLimit = lowLimitMax; lowLimit 2563 lib/zstd/compress.c zc->lowLimit = zc->dictLimit; lowLimit 253 lib/zstd/zstd_opt.h const U32 windowLow = zc->lowLimit; lowLimit 709 lib/zstd/zstd_opt.h const U32 lowestIndex = ctx->lowLimit;