Lines Matching refs:matchIndex
1039 U32 const matchIndex = hashTable[h]; in ZSTD_compressBlock_fast_generic() local
1040 const BYTE *match = base + matchIndex; in ZSTD_compressBlock_fast_generic()
1049 if ((matchIndex <= lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) { in ZSTD_compressBlock_fast_generic()
1138 const U32 matchIndex = hashTable[h]; in ZSTD_compressBlock_fast_extDict_generic() local
1139 const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_fast_extDict_generic()
1140 const BYTE *match = matchBase + matchIndex; in ZSTD_compressBlock_fast_extDict_generic()
1155 if ((matchIndex < lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) { in ZSTD_compressBlock_fast_extDict_generic()
1160 const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_fast_extDict_generic()
1161 const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr; in ZSTD_compressBlock_fast_extDict_generic()
1169 offset = curr - matchIndex; in ZSTD_compressBlock_fast_extDict_generic()
1419 const U32 matchIndex = hashSmall[hSmall]; in ZSTD_compressBlock_doubleFast_extDict_generic() local
1420 const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base; in ZSTD_compressBlock_doubleFast_extDict_generic()
1421 const BYTE *match = matchBase + matchIndex; in ZSTD_compressBlock_doubleFast_extDict_generic()
1457 } else if ((matchIndex > lowestIndex) && (ZSTD_read32(match) == ZSTD_read32(ip))) { in ZSTD_compressBlock_doubleFast_extDict_generic()
1476 const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend; in ZSTD_compressBlock_doubleFast_extDict_generic()
1477 const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr; in ZSTD_compressBlock_doubleFast_extDict_generic()
1479 offset = curr - matchIndex; in ZSTD_compressBlock_doubleFast_extDict_generic()
1569 U32 matchIndex = hashTable[h]; in ZSTD_insertBt1() local
1588 while (nbCompares-- && (matchIndex > windowLow)) { in ZSTD_insertBt1()
1589 U32 *const nextPtr = bt + 2 * (matchIndex & btMask); in ZSTD_insertBt1()
1592 if ((!extDict) || (matchIndex + matchLength >= dictLimit)) { in ZSTD_insertBt1()
1593 match = base + matchIndex; in ZSTD_insertBt1()
1597 match = dictBase + matchIndex; in ZSTD_insertBt1()
1599 if (matchIndex + matchLength >= dictLimit) in ZSTD_insertBt1()
1600 match = base + matchIndex; /* to prepare for next usage of match[matchLength] */ in ZSTD_insertBt1()
1605 if (matchLength > matchEndIdx - matchIndex) in ZSTD_insertBt1()
1606 matchEndIdx = matchIndex + (U32)matchLength; in ZSTD_insertBt1()
1614 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertBt1()
1616 if (matchIndex <= btLow) { in ZSTD_insertBt1()
1621 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curr) */ in ZSTD_insertBt1()
1624 *largerPtr = matchIndex; in ZSTD_insertBt1()
1626 if (matchIndex <= btLow) { in ZSTD_insertBt1()
1631 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
1652 U32 matchIndex = hashTable[h]; in ZSTD_insertBtAndFindBestMatch() local
1670 while (nbCompares-- && (matchIndex > windowLow)) { in ZSTD_insertBtAndFindBestMatch()
1671 U32 *const nextPtr = bt + 2 * (matchIndex & btMask); in ZSTD_insertBtAndFindBestMatch()
1675 if ((!extDict) || (matchIndex + matchLength >= dictLimit)) { in ZSTD_insertBtAndFindBestMatch()
1676 match = base + matchIndex; in ZSTD_insertBtAndFindBestMatch()
1680 match = dictBase + matchIndex; in ZSTD_insertBtAndFindBestMatch()
1682 if (matchIndex + matchLength >= dictLimit) in ZSTD_insertBtAndFindBestMatch()
1683 match = base + matchIndex; /* to prepare for next usage of match[matchLength] */ in ZSTD_insertBtAndFindBestMatch()
1687 if (matchLength > matchEndIdx - matchIndex) in ZSTD_insertBtAndFindBestMatch()
1688 matchEndIdx = matchIndex + (U32)matchLength; in ZSTD_insertBtAndFindBestMatch()
1689 …if ((4 * (int)(matchLength - bestLength)) > (int)(ZSTD_highbit32(curr - matchIndex + 1) - ZSTD_hig… in ZSTD_insertBtAndFindBestMatch()
1690 bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + curr - matchIndex; in ZSTD_insertBtAndFindBestMatch()
1697 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertBtAndFindBestMatch()
1699 if (matchIndex <= btLow) { in ZSTD_insertBtAndFindBestMatch()
1704 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to curr) */ in ZSTD_insertBtAndFindBestMatch()
1707 *largerPtr = matchIndex; in ZSTD_insertBtAndFindBestMatch()
1709 if (matchIndex <= btLow) { in ZSTD_insertBtAndFindBestMatch()
1714 matchIndex = nextPtr[0]; in ZSTD_insertBtAndFindBestMatch()
1838 U32 matchIndex = ZSTD_insertAndFindFirstIndex(zc, ip, mls); in ZSTD_HcFindBestMatch_generic() local
1840 for (; (matchIndex > lowLimit) & (nbAttempts > 0); nbAttempts--) { in ZSTD_HcFindBestMatch_generic()
1843 if ((!extDict) || matchIndex >= dictLimit) { in ZSTD_HcFindBestMatch_generic()
1844 match = base + matchIndex; in ZSTD_HcFindBestMatch_generic()
1848 match = dictBase + matchIndex; in ZSTD_HcFindBestMatch_generic()
1856 *offsetPtr = curr - matchIndex + ZSTD_REP_MOVE; in ZSTD_HcFindBestMatch_generic()
1861 if (matchIndex <= minChain) in ZSTD_HcFindBestMatch_generic()
1863 matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask); in ZSTD_HcFindBestMatch_generic()
2198 U32 const matchIndex = (U32)((start - base) - (offset - ZSTD_REP_MOVE)); in ZSTD_compressBlock_lazy_extDict_generic() local
2199 const BYTE *match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex; in ZSTD_compressBlock_lazy_extDict_generic()
2200 const BYTE *const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart; in ZSTD_compressBlock_lazy_extDict_generic()