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