Lines Matching refs:BYTE
21 const BYTE* ip, const BYTE* iend, in ZSTD_updateDUBT()
32 const BYTE* const base = ms->window.base; in ZSTD_updateDUBT()
65 U32 curr, const BYTE* inputEnd, in ZSTD_insertDUBT1()
74 const BYTE* const base = ms->window.base; in ZSTD_insertDUBT1()
75 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_insertDUBT1()
77 const BYTE* const ip = (curr>=dictLimit) ? base + curr : dictBase + curr; in ZSTD_insertDUBT1()
78 const BYTE* const iend = (curr>=dictLimit) ? inputEnd : dictBase + dictLimit; in ZSTD_insertDUBT1()
79 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_insertDUBT1()
80 const BYTE* const prefixStart = base + dictLimit; in ZSTD_insertDUBT1()
81 const BYTE* match; in ZSTD_insertDUBT1()
107 const BYTE* const mBase = ( (dictMode != ZSTD_extDict) in ZSTD_insertDUBT1()
155 const BYTE* const ip, const BYTE* const iend, in ZSTD_DUBT_findBetterDictMatch()
169 const BYTE* const base = ms->window.base; in ZSTD_DUBT_findBetterDictMatch()
170 const BYTE* const prefixStart = base + ms->window.dictLimit; in ZSTD_DUBT_findBetterDictMatch()
172 const BYTE* const dictBase = dms->window.base; in ZSTD_DUBT_findBetterDictMatch()
173 const BYTE* const dictEnd = dms->window.nextSrc; in ZSTD_DUBT_findBetterDictMatch()
191 const BYTE* match = dictBase + dictMatchIndex; in ZSTD_DUBT_findBetterDictMatch()
232 const BYTE* const ip, const BYTE* const iend, in ZSTD_DUBT_findBestMatch()
243 const BYTE* const base = ms->window.base; in ZSTD_DUBT_findBestMatch()
299 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_DUBT_findBestMatch()
301 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_DUBT_findBestMatch()
302 const BYTE* const prefixStart = base + dictLimit; in ZSTD_DUBT_findBestMatch()
315 const BYTE* match; in ZSTD_DUBT_findBestMatch()
383 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_BtFindBestMatch()
398 void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_matchState_t* ms, const BYTE* const ip) in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
400 const BYTE* const base = ms->window.base; in ZSTD_dedicatedDictSearch_lazy_loadDictionary()
518 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_dedicatedDictSearch_lazy_search()
519 const BYTE* const prefixStart, const U32 curr, in ZSTD_dedicatedDictSearch_lazy_search()
522 const BYTE* const ddsBase = dms->window.base; in ZSTD_dedicatedDictSearch_lazy_search()
523 const BYTE* const ddsEnd = dms->window.nextSrc; in ZSTD_dedicatedDictSearch_lazy_search()
544 const BYTE* match; in ZSTD_dedicatedDictSearch_lazy_search()
586 const BYTE* match; in ZSTD_dedicatedDictSearch_lazy_search()
620 const BYTE* ip, U32 const mls) in ZSTD_insertAndFindFirstIndex_internal()
626 const BYTE* const base = ms->window.base; in ZSTD_insertAndFindFirstIndex_internal()
641 U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip) { in ZSTD_insertAndFindFirstIndex()
650 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_HcFindBestMatch()
658 const BYTE* const base = ms->window.base; in ZSTD_HcFindBestMatch()
659 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_HcFindBestMatch()
661 const BYTE* const prefixStart = base + dictLimit; in ZSTD_HcFindBestMatch()
662 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_HcFindBestMatch()
692 const BYTE* const match = base + matchIndex; in ZSTD_HcFindBestMatch()
697 const BYTE* const match = dictBase + matchIndex; in ZSTD_HcFindBestMatch()
723 const BYTE* const dmsBase = dms->window.base; in ZSTD_HcFindBestMatch()
724 const BYTE* const dmsEnd = dms->window.nextSrc; in ZSTD_HcFindBestMatch()
733 const BYTE* const match = dmsBase + matchIndex; in ZSTD_HcFindBestMatch()
826 FORCE_INLINE_TEMPLATE U32 ZSTD_row_nextIndex(BYTE* const tagRow, U32 const rowMask) { in ZSTD_row_nextIndex()
828 *tagRow = (BYTE)next; in ZSTD_row_nextIndex()
862 FORCE_INLINE_TEMPLATE void ZSTD_row_fillHashCache(ZSTD_matchState_t* ms, const BYTE* base, in ZSTD_row_fillHashCache()
864 U32 idx, const BYTE* const iLimit) in ZSTD_row_fillHashCache()
889 U16 const* tagTable, BYTE const* base, in ZSTD_row_nextCachedHash()
913 const BYTE* const base = ms->window.base; in ZSTD_row_update_internalImpl()
921 …BYTE* tagRow = (BYTE*)(tagTable + relRow); /* Though tagTable is laid out as a table of U16, each… in ZSTD_row_update_internalImpl()
926 ((BYTE*)tagRow)[pos + ZSTD_ROW_HASH_TAG_OFFSET] = hash & ZSTD_ROW_HASH_TAG_MASK; in ZSTD_row_update_internalImpl()
935 FORCE_INLINE_TEMPLATE void ZSTD_row_update_internal(ZSTD_matchState_t* ms, const BYTE* ip, in ZSTD_row_update_internal()
940 const BYTE* const base = ms->window.base; in ZSTD_row_update_internal()
968 void ZSTD_row_update(ZSTD_matchState_t* const ms, const BYTE* ip) { in ZSTD_row_update()
979 ZSTD_row_getSSEMask(int nbChunks, const BYTE* const src, const BYTE tag, const U32 head) in ZSTD_row_getSSEMask()
1002 ZSTD_row_getMatchMask(const BYTE* const tagRow, const BYTE tag, const U32 head, const U32 rowEntrie… in ZSTD_row_getMatchMask()
1004 const BYTE* const src = tagRow + ZSTD_ROW_HASH_TAG_OFFSET; in ZSTD_row_getMatchMask()
1122 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_RowFindBestMatch()
1132 const BYTE* const base = ms->window.base; in ZSTD_RowFindBestMatch()
1133 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_RowFindBestMatch()
1135 const BYTE* const prefixStart = base + dictLimit; in ZSTD_RowFindBestMatch()
1136 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_RowFindBestMatch()
1157 BYTE* dmsTagRow = NULL; in ZSTD_RowFindBestMatch()
1175 dmsTagRow = (BYTE*)(dmsTagTable + dmsRelRow); in ZSTD_RowFindBestMatch()
1187 BYTE* tagRow = (BYTE*)(tagTable + relRow); in ZSTD_RowFindBestMatch()
1192 ZSTD_VecMask matches = ZSTD_row_getMatchMask(tagRow, (BYTE)tag, head, rowEntries); in ZSTD_RowFindBestMatch()
1213 tagRow[pos + ZSTD_ROW_HASH_TAG_OFFSET] = (BYTE)tag; in ZSTD_RowFindBestMatch()
1225 const BYTE* const match = base + matchIndex; in ZSTD_RowFindBestMatch()
1230 const BYTE* const match = dictBase + matchIndex; in ZSTD_RowFindBestMatch()
1252 const BYTE* const dmsBase = dms->window.base; in ZSTD_RowFindBestMatch()
1253 const BYTE* const dmsEnd = dms->window.nextSrc; in ZSTD_RowFindBestMatch()
1261 ZSTD_VecMask matches = ZSTD_row_getMatchMask(dmsTagRow, (BYTE)dmsTag, head, rowEntries); in ZSTD_RowFindBestMatch()
1279 { const BYTE* const match = dmsBase + matchIndex; in ZSTD_RowFindBestMatch()
1329 const BYTE* ip, const BYTE* const iLimit, \
1339 const BYTE* ip, const BYTE* const iLimit, \
1349 const BYTE* ip, const BYTE* const iLimit, \
1450 const BYTE* ip, in ZSTD_searchMax()
1451 const BYTE* iend, in ZSTD_searchMax()
1483 const BYTE* const istart = (const BYTE*)src; in ZSTD_compressBlock_lazy_generic()
1484 const BYTE* ip = istart; in ZSTD_compressBlock_lazy_generic()
1485 const BYTE* anchor = istart; in ZSTD_compressBlock_lazy_generic()
1486 const BYTE* const iend = istart + srcSize; in ZSTD_compressBlock_lazy_generic()
1487 …const BYTE* const ilimit = (searchMethod == search_rowHash) ? iend - 8 - ZSTD_ROW_HASH_CACHE_SIZE … in ZSTD_compressBlock_lazy_generic()
1488 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_lazy_generic()
1490 const BYTE* const prefixLowest = base + prefixLowestIndex; in ZSTD_compressBlock_lazy_generic()
1501 const BYTE* const dictBase = isDxS ? dms->window.base : NULL; in ZSTD_compressBlock_lazy_generic()
1502 const BYTE* const dictLowest = isDxS ? dictBase + dictLowestIndex : NULL; in ZSTD_compressBlock_lazy_generic()
1503 const BYTE* const dictEnd = isDxS ? dms->window.nextSrc : NULL; in ZSTD_compressBlock_lazy_generic()
1541 const BYTE* start=ip+1; in ZSTD_compressBlock_lazy_generic()
1547 … const BYTE* repMatch = ((dictMode == ZSTD_dictMatchState || dictMode == ZSTD_dedicatedDictSearch) in ZSTD_compressBlock_lazy_generic()
1553 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1591 const BYTE* repMatch = repIndex < prefixLowestIndex ? in ZSTD_compressBlock_lazy_generic()
1596 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1627 const BYTE* repMatch = repIndex < prefixLowestIndex ? in ZSTD_compressBlock_lazy_generic()
1632 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1664 …const BYTE* match = (matchIndex < prefixLowestIndex) ? dictBase + matchIndex - dictIndexDelta : ba… in ZSTD_compressBlock_lazy_generic()
1665 … const BYTE* const mStart = (matchIndex < prefixLowestIndex) ? dictLowest : prefixLowest; in ZSTD_compressBlock_lazy_generic()
1682 const BYTE* repMatch = repIndex < prefixLowestIndex ? in ZSTD_compressBlock_lazy_generic()
1687 const BYTE* const repEnd2 = repIndex < prefixLowestIndex ? dictEnd : iend; in ZSTD_compressBlock_lazy_generic()
1870 const BYTE* const istart = (const BYTE*)src; in ZSTD_compressBlock_lazy_extDict_generic()
1871 const BYTE* ip = istart; in ZSTD_compressBlock_lazy_extDict_generic()
1872 const BYTE* anchor = istart; in ZSTD_compressBlock_lazy_extDict_generic()
1873 const BYTE* const iend = istart + srcSize; in ZSTD_compressBlock_lazy_extDict_generic()
1874 …const BYTE* const ilimit = searchMethod == search_rowHash ? iend - 8 - ZSTD_ROW_HASH_CACHE_SIZE : … in ZSTD_compressBlock_lazy_extDict_generic()
1875 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_lazy_extDict_generic()
1877 const BYTE* const prefixStart = base + dictLimit; in ZSTD_compressBlock_lazy_extDict_generic()
1878 const BYTE* const dictBase = ms->window.dictBase; in ZSTD_compressBlock_lazy_extDict_generic()
1879 const BYTE* const dictEnd = dictBase + dictLimit; in ZSTD_compressBlock_lazy_extDict_generic()
1880 const BYTE* const dictStart = dictBase + ms->window.lowLimit; in ZSTD_compressBlock_lazy_extDict_generic()
1907 const BYTE* start=ip+1; in ZSTD_compressBlock_lazy_extDict_generic()
1913 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
1914 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
1919 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()
1945 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
1946 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
1951 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()
1977 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
1978 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
1983 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()
2006 … const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2007 const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart; in ZSTD_compressBlock_lazy_extDict_generic()
2024 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_lazy_extDict_generic()
2025 const BYTE* const repMatch = repBase + repIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2030 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_lazy_extDict_generic()