HomeSort by: relevance | last modified time | path
    Searched defs:prefixLowestIndex (Results 1 - 2 of 2) sorted by relevancy

  /src/external/bsd/zstd/dist/lib/compress/
zstd_double_fast.c 119 const U32 prefixLowestIndex = ZSTD_getLowestPrefixIndex(ms, endIndex, cParams->windowLog);
120 const BYTE* const prefixLowest = base + prefixLowestIndex;
199 /* idxl0 > prefixLowestIndex is a (somewhat) unpredictable branch.
201 * match is unlikely and we only *branch* on idxl0 > prefixLowestIndex
203 { const BYTE* const matchl0_safe = ZSTD_selectAddr(idxl0, prefixLowestIndex, matchl0, &dummy[0]);
217 matchs0_safe = ZSTD_selectAddr(idxs0, prefixLowestIndex, matchs0, &dummy[0]);
260 if ((idxl1 > prefixLowestIndex) && (MEM_read64(matchl1) == MEM_read64(ip1))) {
344 const U32 prefixLowestIndex = ZSTD_getLowestPrefixIndex(ms, endIndex, cParams->windowLog);
345 const BYTE* const prefixLowest = base + prefixLowestIndex;
358 const U32 dictIndexDelta = prefixLowestIndex - (U32)(dictEnd - dictBase)
    [all...]
zstd_lazy.c 1529 const U32 prefixLowestIndex = ms->window.dictLimit;
1530 const BYTE* const prefixLowest = base + prefixLowestIndex;
1546 prefixLowestIndex - (U32)(dictEnd - dictBase) :
1590 && repIndex < prefixLowestIndex) ?
1593 if ((ZSTD_index_overlap_check(prefixLowestIndex, repIndex))
1595 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
1642 const BYTE* repMatch = repIndex < prefixLowestIndex ?
1645 if ((ZSTD_index_overlap_check(prefixLowestIndex, repIndex))
1647 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
1678 const BYTE* repMatch = repIndex < prefixLowestIndex
    [all...]

Completed in 19 milliseconds