Lines Matching defs:dictLimit
37 DEBUGLOG(7, "ZSTD_updateDUBT, from %u to %u (dictLimit:%u)",
38 idx, target, ms->window.dictLimit);
42 assert(idx >= ms->window.dictLimit); /* condition for valid base+idx */
76 const U32 dictLimit = ms->window.dictLimit;
77 const BYTE* const ip = (curr>=dictLimit) ? base + curr : dictBase + curr;
78 const BYTE* const iend = (curr>=dictLimit) ? inputEnd : dictBase + dictLimit;
79 const BYTE* const dictEnd = dictBase + dictLimit;
80 const BYTE* const prefixStart = base + dictLimit;
91 DEBUGLOG(8, "ZSTD_insertDUBT1(%u) (dictLimit=%u, lowLimit=%u)",
92 curr, dictLimit, windowLow);
105 || (matchIndex+matchLength >= dictLimit) /* both in current segment*/
106 || (curr < dictLimit) /* both in extDict */) {
108 || (matchIndex+matchLength >= dictLimit)) ?
110 assert( (matchIndex+matchLength >= dictLimit) /* might be wrong if extDict is incorrectly set to 0 */
111 || (curr < dictLimit) );
117 if (matchIndex+matchLength >= dictLimit)
170 const BYTE* const prefixStart = base + ms->window.dictLimit;
300 const U32 dictLimit = ms->window.dictLimit;
301 const BYTE* const dictEnd = dictBase + dictLimit;
302 const BYTE* const prefixStart = base + dictLimit;
317 if ((dictMode != ZSTD_extDict) || (matchIndex+matchLength >= dictLimit)) {
323 if (matchIndex+matchLength >= dictLimit)
520 const U32 dictLimit, const size_t ddsIdx) {
521 const U32 ddsLowestIndex = dms->window.dictLimit;
525 const U32 ddsIndexDelta = dictLimit - ddsSize;
557 /* assumption : matchIndex <= dictLimit-4 (by table construction) */
594 /* assumption : matchIndex <= dictLimit-4 (by table construction) */
660 const U32 dictLimit = ms->window.dictLimit;
661 const BYTE* const prefixStart = base + dictLimit;
662 const BYTE* const dictEnd = dictBase + dictLimit;
691 if ((dictMode != ZSTD_extDict) || matchIndex >= dictLimit) {
693 assert(matchIndex >= dictLimit); /* ensures this is true if dictMode != ZSTD_extDict */
699 if (MEM_read32(match) == MEM_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
717 ip, iLimit, prefixStart, curr, dictLimit, ddsIdx);
722 const U32 dmsLowestIndex = dms->window.dictLimit;
726 const U32 dmsIndexDelta = dictLimit - dmsSize;
735 if (MEM_read32(match) == MEM_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
1134 const U32 dictLimit = ms->window.dictLimit;
1135 const BYTE* const prefixStart = base + dictLimit;
1136 const BYTE* const dictEnd = dictBase + dictLimit;
1201 if ((dictMode != ZSTD_extDict) || matchIndex >= dictLimit) {
1224 if ((dictMode != ZSTD_extDict) || matchIndex >= dictLimit) {
1226 assert(matchIndex >= dictLimit); /* ensures this is true if dictMode != ZSTD_extDict */
1232 if (MEM_read32(match) == MEM_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
1248 ip, iLimit, prefixStart, curr, dictLimit, ddsIdx);
1251 const U32 dmsLowestIndex = dms->window.dictLimit;
1255 const U32 dmsIndexDelta = dictLimit - dmsSize;
1489 const U32 prefixLowestIndex = ms->window.dictLimit;
1500 const U32 dictLowestIndex = isDxS ? dms->window.dictLimit : 0;
1876 const U32 dictLimit = ms->window.dictLimit;
1877 const BYTE* const prefixStart = base + dictLimit;
1879 const BYTE* const dictEnd = dictBase + dictLimit;
1913 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1915 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow */
1919 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
1945 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1947 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow : do not test positions overlapping 2 memory segments */
1951 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
1977 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1979 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow : do not test positions overlapping 2 memory segments */
1983 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
2006 const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
2007 const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
2024 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
2026 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow : do not test positions overlapping 2 memory segments */
2030 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;