zstd/compress/zstd_opt.c

388     const BYTE* const base = ms->window.base;
426     const BYTE* const base = ms->window.base;
427     const BYTE* const dictBase = ms->window.dictBase;
428     const U32 dictLimit = ms->window.dictLimit;
438      * we only need positions that will be in the window at the end of the tree update.
535     const BYTE* const base = ms->window.base;
568     const BYTE* const base = ms->window.base;
579     const BYTE* const dictBase = ms->window.dictBase;
580     U32 const dictLimit = ms->window.dictLimit;
596     const BYTE* const dmsBase       = dictMode == ZSTD_dictMatchState ? dms->window.base : NULL;
597     const BYTE* const dmsEnd        = dictMode == ZSTD_dictMatchState ? dms->window.nextSrc : NULL;
599     U32         const dmsLowLimit   = dictMode == ZSTD_dictMatchState ? dms->window.lowLimit : 0;
809     if (ip < ms->window.base + ms->nextToUpdate)
1050     const BYTE* const base = ms->window.base;
1051     const BYTE* const prefixStart = base + ms->window.dictLimit;
1071                 (U32)(ip - base), ms->window.dictLimit, ms->nextToUpdate);
1366     assert(ms->window.dictLimit == ms->window.lowLimit);   /* no dictionary */
1367     assert(ms->window.dictLimit - ms->nextToUpdate <= 1);  /* no prefix (note: intentional overflow, defined as 2-complement) */
1373     ms->window.base -= srcSize;
1374     ms->window.dictLimit += (U32)srcSize;
1375     ms->window.lowLimit = ms->window.dictLimit;
1376     ms->nextToUpdate = ms->window.dictLimit;
1392     U32 const curr = (U32)((const BYTE*)src - ms->window.base);
1406       && (ms->window.dictLimit == ms->window.lowLimit)   /* no dictionary */
1407       && (curr == ms->window.dictLimit)   /* start of frame, nothing already loaded nor skipped */