Lines Matching refs:BYTE
31 const BYTE* ip, const BYTE* iend, in ZSTD_updateDUBT()
42 const BYTE* const base = ms->window.base; in ZSTD_updateDUBT()
76 U32 curr, const BYTE* inputEnd, in ZSTD_insertDUBT1()
85 const BYTE* const base = ms->window.base; in ZSTD_insertDUBT1()
86 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_insertDUBT1()
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()
92 const BYTE* match; in ZSTD_insertDUBT1()
118 const BYTE* const mBase = ( (dictMode != ZSTD_extDict) in ZSTD_insertDUBT1()
167 const BYTE* const ip, const BYTE* const iend, in ZSTD_DUBT_findBetterDictMatch()
181 const BYTE* const base = ms->window.base; in ZSTD_DUBT_findBetterDictMatch()
182 const BYTE* const prefixStart = base + ms->window.dictLimit; in ZSTD_DUBT_findBetterDictMatch()
184 const BYTE* const dictBase = dms->window.base; in ZSTD_DUBT_findBetterDictMatch()
185 const BYTE* const dictEnd = dms->window.nextSrc; in ZSTD_DUBT_findBetterDictMatch()
203 const BYTE* match = dictBase + dictMatchIndex; in ZSTD_DUBT_findBetterDictMatch()
245 const BYTE* const ip, const BYTE* const iend, in ZSTD_DUBT_findBestMatch()
256 const BYTE* const base = ms->window.base; in ZSTD_DUBT_findBestMatch()
312 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_DUBT_findBestMatch()
314 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_DUBT_findBestMatch()
315 const BYTE* const prefixStart = base + dictLimit; in ZSTD_DUBT_findBestMatch()
328 const BYTE* match; in ZSTD_DUBT_findBestMatch()
397 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_BtFindBestMatch()
412 void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_MatchState_t* ms, const BYTE* const ip) in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
414 const BYTE* const base = ms->window.base; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
532 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_dedicatedDictSearch_lazy_search()
533 const BYTE* const prefixStart, const U32 curr, in ZSTD_dedicatedDictSearch_lazy_search()
536 const BYTE* const ddsBase = dms->window.base; in ZSTD_dedicatedDictSearch_lazy_search()
537 const BYTE* const ddsEnd = dms->window.nextSrc; in ZSTD_dedicatedDictSearch_lazy_search()
558 const BYTE* match; in ZSTD_dedicatedDictSearch_lazy_search()
600 const BYTE* match; in ZSTD_dedicatedDictSearch_lazy_search()
636 const BYTE* ip, U32 const mls, U32 const lazySkipping) in ZSTD_insertAndFindFirstIndex_internal()
642 const BYTE* const base = ms->window.base; in ZSTD_insertAndFindFirstIndex_internal()
660 U32 ZSTD_insertAndFindFirstIndex(ZSTD_MatchState_t* ms, const BYTE* ip) { in ZSTD_insertAndFindFirstIndex()
670 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_HcFindBestMatch()
678 const BYTE* const base = ms->window.base; in ZSTD_HcFindBestMatch()
679 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_HcFindBestMatch()
681 const BYTE* const prefixStart = base + dictLimit; in ZSTD_HcFindBestMatch()
682 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_HcFindBestMatch()
712 const BYTE* const match = base + matchIndex; in ZSTD_HcFindBestMatch()
718 const BYTE* const match = dictBase + matchIndex; in ZSTD_HcFindBestMatch()
744 const BYTE* const dmsBase = dms->window.base; in ZSTD_HcFindBestMatch()
745 const BYTE* const dmsEnd = dms->window.nextSrc; in ZSTD_HcFindBestMatch()
754 const BYTE* const match = dmsBase + matchIndex; in ZSTD_HcFindBestMatch()
799 FORCE_INLINE_TEMPLATE U32 ZSTD_row_nextIndex(BYTE* const tagRow, U32 const rowMask) { in ZSTD_row_nextIndex()
802 *tagRow = (BYTE)next; in ZSTD_row_nextIndex()
817 FORCE_INLINE_TEMPLATE void ZSTD_row_prefetch(U32 const* hashTable, BYTE const* tagTable, U32 const … in ZSTD_row_prefetch()
838 void ZSTD_row_fillHashCache(ZSTD_MatchState_t* ms, const BYTE* base, in ZSTD_row_fillHashCache()
840 U32 idx, const BYTE* const iLimit) in ZSTD_row_fillHashCache()
843 BYTE const* const tagTable = ms->tagTable; in ZSTD_row_fillHashCache()
867 BYTE const* tagTable, BYTE const* base, in ZSTD_row_nextCachedHash()
892 BYTE* const tagTable = ms->tagTable; in ZSTD_row_update_internalImpl()
894 const BYTE* const base = ms->window.base; in ZSTD_row_update_internalImpl()
902 BYTE* tagRow = tagTable + relRow; in ZSTD_row_update_internalImpl()
917 void ZSTD_row_update_internal(ZSTD_MatchState_t* ms, const BYTE* ip, in ZSTD_row_update_internal()
922 const BYTE* const base = ms->window.base; in ZSTD_row_update_internal()
950 void ZSTD_row_update(ZSTD_MatchState_t* const ms, const BYTE* ip) { in ZSTD_row_update()
989 ZSTD_row_getSSEMask(int nbChunks, const BYTE* const src, const BYTE tag, const U32 head) in ZSTD_row_getSSEMask()
1009 ZSTD_row_getNEONMask(const U32 rowEntries, const BYTE* const src, const BYTE tag, const U32 headGro… in ZSTD_row_getNEONMask()
1062 ZSTD_row_getMatchMask(const BYTE* const tagRow, const BYTE tag, const U32 headGrouped, const U32 ro… in ZSTD_row_getMatchMask()
1064 const BYTE* const src = tagRow; in ZSTD_row_getMatchMask()
1144 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_RowFindBestMatch()
1150 BYTE* const tagTable = ms->tagTable; in ZSTD_RowFindBestMatch()
1154 const BYTE* const base = ms->window.base; in ZSTD_RowFindBestMatch()
1155 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_RowFindBestMatch()
1157 const BYTE* const prefixStart = base + dictLimit; in ZSTD_RowFindBestMatch()
1158 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_RowFindBestMatch()
1182 BYTE* dmsTagRow = NULL; in ZSTD_RowFindBestMatch()
1196 BYTE* const dmsTagTable = dms->tagTable; in ZSTD_RowFindBestMatch()
1200 dmsTagRow = (BYTE*)(dmsTagTable + dmsRelRow); in ZSTD_RowFindBestMatch()
1222 BYTE* tagRow = (BYTE*)(tagTable + relRow); in ZSTD_RowFindBestMatch()
1227 ZSTD_VecMask matches = ZSTD_row_getMatchMask(tagRow, (BYTE)tag, headGrouped, rowEntries); in ZSTD_RowFindBestMatch()
1250 tagRow[pos] = (BYTE)tag; in ZSTD_RowFindBestMatch()
1262 const BYTE* const match = base + matchIndex; in ZSTD_RowFindBestMatch()
1268 const BYTE* const match = dictBase + matchIndex; in ZSTD_RowFindBestMatch()
1290 const BYTE* const dmsBase = dms->window.base; in ZSTD_RowFindBestMatch()
1291 const BYTE* const dmsEnd = dms->window.nextSrc; in ZSTD_RowFindBestMatch()
1299 … ZSTD_VecMask matches = ZSTD_row_getMatchMask(dmsTagRow, (BYTE)dmsTag, headGrouped, rowEntries); in ZSTD_RowFindBestMatch()
1319 { const BYTE* const match = dmsBase + matchIndex; in ZSTD_RowFindBestMatch()
1369 const BYTE* ip, const BYTE* const iLimit, \
1379 const BYTE* ip, const BYTE* const iLimit, \
1389 const BYTE* ip, const BYTE* const iLimit, \
1490 const BYTE* ip, in ZSTD_searchMax()
1491 const BYTE* iend, in ZSTD_searchMax()
1524 const BYTE* const istart = (const BYTE*)src; in ZSTD_compressBlock_lazy_generic()
1525 const BYTE* ip = istart; in ZSTD_compressBlock_lazy_generic()
1526 const BYTE* anchor = istart; in ZSTD_compressBlock_lazy_generic()
1527 const BYTE* const iend = istart + srcSize; in ZSTD_compressBlock_lazy_generic()
1528 …const BYTE* const ilimit = (searchMethod == search_rowHash) ? iend - 8 - ZSTD_ROW_HASH_CACHE_SIZE … in ZSTD_compressBlock_lazy_generic()
1529 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_lazy_generic()
1531 const BYTE* const prefixLowest = base + prefixLowestIndex; in ZSTD_compressBlock_lazy_generic()
1543 const BYTE* const dictBase = isDxS ? dms->window.base : NULL; in ZSTD_compressBlock_lazy_generic()
1544 const BYTE* const dictLowest = isDxS ? dictBase + dictLowestIndex : NULL; in ZSTD_compressBlock_lazy_generic()
1545 const BYTE* const dictEnd = isDxS ? dms->window.nextSrc : NULL; in ZSTD_compressBlock_lazy_generic()
1584 const BYTE* start=ip+1; in ZSTD_compressBlock_lazy_generic()
1590 … const BYTE* repMatch = ((dictMode == ZSTD_dictMatchState || dictMode == ZSTD_dedicatedDictSearch) in ZSTD_compressBlock_lazy_generic()
1596 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1643 const BYTE* repMatch = repIndex < prefixLowestIndex ? in ZSTD_compressBlock_lazy_generic()
1648 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1679 const BYTE* repMatch = repIndex < prefixLowestIndex ? in ZSTD_compressBlock_lazy_generic()
1684 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1716 …const BYTE* match = (matchIndex < prefixLowestIndex) ? dictBase + matchIndex - dictIndexDelta : ba… in ZSTD_compressBlock_lazy_generic()
1717 … const BYTE* const mStart = (matchIndex < prefixLowestIndex) ? dictLowest : prefixLowest; in ZSTD_compressBlock_lazy_generic()
1741 const BYTE* repMatch = repIndex < prefixLowestIndex ? in ZSTD_compressBlock_lazy_generic()
1746 const BYTE* const repEnd2 = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1944 const BYTE* const istart = (const BYTE*)src; in ZSTD_compressBlock_lazy_extDict_generic()
1945 const BYTE* ip = istart; in ZSTD_compressBlock_lazy_extDict_generic()
1946 const BYTE* anchor = istart; in ZSTD_compressBlock_lazy_extDict_generic()
1947 const BYTE* const iend = istart + srcSize; in ZSTD_compressBlock_lazy_extDict_generic()
1948 …const BYTE* const ilimit = searchMethod == search_rowHash ? iend - 8 - ZSTD_ROW_HASH_CACHE_SIZE : … in ZSTD_compressBlock_lazy_extDict_generic()
1949 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_lazy_extDict_generic()
1951 const BYTE* const prefixStart = base + dictLimit; in ZSTD_compressBlock_lazy_extDict_generic()
1952 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_compressBlock_lazy_extDict_generic()
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()
1982 const BYTE* start=ip+1; in ZSTD_compressBlock_lazy_extDict_generic()
1988 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
1989 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
1994 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()
2029 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
2030 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2035 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()
2061 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
2062 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2067 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()
2090 … const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2091 const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart; in ZSTD_compressBlock_lazy_extDict_generic()
2115 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
2116 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2121 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()