H A D | zstd_lazy.c | 47 DEBUGLOG(7, "ZSTD_updateDUBT, from %u to %u (dictLimit:%u)", in ZSTD_updateDUBT() 48 idx, target, ms->window.dictLimit); in ZSTD_updateDUBT() 52 assert(idx >= ms->window.dictLimit); /* condition for valid base+idx */ in ZSTD_updateDUBT() 87 const U32 dictLimit = ms->window.dictLimit; in ZSTD_insertDUBT1() local 88 const BYTE* const ip = (curr>=dictLimit) ? base + curr : dictBase + curr; in ZSTD_insertDUBT1() 89 const BYTE* const iend = (curr>=dictLimit) ? inputEnd : dictBase + dictLimit; in ZSTD_insertDUBT1() 90 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_insertDUBT1() 91 const BYTE* const prefixStart = base + dictLimit; in ZSTD_insertDUBT1() 313 const U32 dictLimit = ms->window.dictLimit; ZSTD_DUBT_findBestMatch() local 534 ZSTD_dedicatedDictSearch_lazy_search(size_t * offsetPtr,size_t ml,U32 nbAttempts,const ZSTD_MatchState_t * const dms,const BYTE * const ip,const BYTE * const iLimit,const BYTE * const prefixStart,const U32 curr,const U32 dictLimit,const size_t ddsIdx) ZSTD_dedicatedDictSearch_lazy_search() argument 680 const U32 dictLimit = ms->window.dictLimit; ZSTD_HcFindBestMatch() local 1156 const U32 dictLimit = ms->window.dictLimit; ZSTD_RowFindBestMatch() local 1950 const U32 dictLimit = ms->window.dictLimit; ZSTD_compressBlock_lazy_extDict_generic() local [all...] |