Lines Matching refs:repIndex
1546 const U32 repIndex = (U32)(ip - base) + 1 - offset_1;
1548 && repIndex < prefixLowestIndex) ?
1549 dictBase + (repIndex - dictIndexDelta) :
1550 base + repIndex;
1551 if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
1553 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
1590 const U32 repIndex = (U32)(ip - base) - offset_1;
1591 const BYTE* repMatch = repIndex < prefixLowestIndex ?
1592 dictBase + (repIndex - dictIndexDelta) :
1593 base + repIndex;
1594 if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
1596 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
1626 const U32 repIndex = (U32)(ip - base) - offset_1;
1627 const BYTE* repMatch = repIndex < prefixLowestIndex ?
1628 dictBase + (repIndex - dictIndexDelta) :
1629 base + repIndex;
1630 if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
1632 const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
1681 U32 const repIndex = current2 - offset_2;
1682 const BYTE* repMatch = repIndex < prefixLowestIndex ?
1683 dictBase - dictIndexDelta + repIndex :
1684 base + repIndex;
1685 if ( ((U32)((prefixLowestIndex-1) - (U32)repIndex) >= 3 /* intentional overflow */)
1687 const BYTE* const repEnd2 = repIndex < prefixLowestIndex ? dictEnd : iend;
1912 const U32 repIndex = (U32)(curr+1 - offset_1);
1913 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1914 const BYTE* const repMatch = repBase + repIndex;
1915 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow */
1919 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
1944 const U32 repIndex = (U32)(curr - offset_1);
1945 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1946 const BYTE* const repMatch = repBase + repIndex;
1947 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow : do not test positions overlapping 2 memory segments */
1948 & (offset_1 <= curr - windowLow) ) /* equivalent to `curr > repIndex >= windowLow` */
1951 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
1976 const U32 repIndex = (U32)(curr - offset_1);
1977 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1978 const BYTE* const repMatch = repBase + repIndex;
1979 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow : do not test positions overlapping 2 memory segments */
1980 & (offset_1 <= curr - windowLow) ) /* equivalent to `curr > repIndex >= windowLow` */
1983 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
2023 const U32 repIndex = repCurrent - offset_2;
2024 const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
2025 const BYTE* const repMatch = repBase + repIndex;
2026 if ( ((U32)((dictLimit-1) - repIndex) >= 3) /* intentional overflow : do not test positions overlapping 2 memory segments */
2027 & (offset_2 <= repCurrent - windowLow) ) /* equivalent to `curr > repIndex >= windowLow` */
2030 const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;