86     const BYTE* const dictBase = ms->window.dictBase;  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()
120                                         base : dictBase;  in ZSTD_insertDUBT1()
126             match = dictBase + matchIndex;  in ZSTD_insertDUBT1()
184     const BYTE* const dictBase = dms->window.base;  in ZSTD_DUBT_findBetterDictMatch()  local
203         const BYTE* match = dictBase + dictMatchIndex;  in ZSTD_DUBT_findBetterDictMatch()
312         const BYTE* const dictBase = ms->window.dictBase;  in ZSTD_DUBT_findBestMatch()  local
314         const BYTE* const dictEnd = dictBase + dictLimit;  in ZSTD_DUBT_findBestMatch()
334                 match = dictBase + matchIndex;  in ZSTD_DUBT_findBestMatch()
679     const BYTE* const dictBase = ms->window.dictBase;  in ZSTD_HcFindBestMatch()  local
682     const BYTE* const dictEnd = dictBase + dictLimit;  in ZSTD_HcFindBestMatch()
718             const BYTE* const match = dictBase + matchIndex;  in ZSTD_HcFindBestMatch()
1155     const BYTE* const dictBase = ms->window.dictBase;  in ZSTD_RowFindBestMatch()  local
1158     const BYTE* const dictEnd = dictBase + dictLimit;  in ZSTD_RowFindBestMatch()
1240                 PREFETCH_L1(dictBase + matchIndex);  in ZSTD_RowFindBestMatch()
1268                 const BYTE* const match = dictBase + matchIndex;  in ZSTD_RowFindBestMatch()
1543     const BYTE* const dictBase     = isDxS ? dms->window.base : NULL;  in ZSTD_compressBlock_lazy_generic()  local
1544     const BYTE* const dictLowest   = isDxS ? dictBase + dictLowestIndex : NULL;  in ZSTD_compressBlock_lazy_generic()
1547                                      prefixLowestIndex - (U32)(dictEnd - dictBase) :  in ZSTD_compressBlock_lazy_generic()
1592                                    dictBase + (repIndex - dictIndexDelta) :  in ZSTD_compressBlock_lazy_generic()
1644                                dictBase + (repIndex - dictIndexDelta) :  in ZSTD_compressBlock_lazy_generic()
1680                                    dictBase + (repIndex - dictIndexDelta) :  in ZSTD_compressBlock_lazy_generic()
1716 …const BYTE* match = (matchIndex < prefixLowestIndex) ? dictBase + matchIndex - dictIndexDelta : ba…  in ZSTD_compressBlock_lazy_generic()
1742                         dictBase - dictIndexDelta + repIndex :  in ZSTD_compressBlock_lazy_generic()
1952     const BYTE* const dictBase = ms->window.dictBase;  in ZSTD_compressBlock_lazy_extDict_generic()  local
1953     const BYTE* const dictEnd  = dictBase + dictLimit;  in ZSTD_compressBlock_lazy_extDict_generic()
1954     const BYTE* const dictStart  = dictBase + ms->window.lowLimit;  in ZSTD_compressBlock_lazy_extDict_generic()
1988             const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;  in ZSTD_compressBlock_lazy_extDict_generic()
2029                 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;  in ZSTD_compressBlock_lazy_extDict_generic()
2061                     const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;  in ZSTD_compressBlock_lazy_extDict_generic()
2090 …          const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;  in ZSTD_compressBlock_lazy_extDict_generic()
2115             const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;  in ZSTD_compressBlock_lazy_extDict_generic()