Lines Matching refs:ip
244 /* Update hashTable3 up to ip (excluded)
246 static U32 ZSTD_insertAndFindFirstIndexHash3 (ZSTD_matchState_t* ms, const BYTE* const ip)
252 U32 const target = ms->nextToUpdate3 = (U32)(ip - base);
253 size_t const hash3 = ZSTD_hash3Ptr(ip, hashLog3);
269 * ip : assumed <= iend-8 .
273 const BYTE* const ip, const BYTE* const iend,
278 size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
290 const U32 current = (U32)(ip-base);
308 assert(ip <= iend-8); /* required for h calculation */
340 matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
343 matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
354 if (ip+matchLength == iend) { /* equal : no way to know if inf or sup */
358 if (match[matchLength] < ip[matchLength]) { /* necessarily within buffer */
383 const BYTE* const ip, const BYTE* const iend,
387 U32 const target = (U32)(ip - base);
399 const BYTE* ip, const BYTE* iend)
401 ZSTD_updateTree_internal(ms, cParams, ip, iend, cParams->searchLength, 0 /*extDict*/);
407 const BYTE* const ip, const BYTE* const iLimit, int const extDict,
413 U32 const current = (U32)(ip-base);
417 size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
448 if (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repOffset, minMatch)) {
449 repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch;
457 && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) {
458 repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dictEnd, prefixStart) + minMatch;
469 | (ip+repLen == iLimit) ) { /* best possible */
475 U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3(ms, ip);
481 mlen = ZSTD_count(ip, match, iLimit);
484 mlen = ZSTD_count_2segments(ip, match, iLimit, dictEnd, prefixStart);
498 (ip+mlen == iLimit) ) { /* best possible length */
514 matchLength += ZSTD_count(ip+matchLength, match+matchLength, iLimit);
517 matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEnd, prefixStart);
533 if (ip+matchLength == iLimit) { /* equal : no way to know if inf or sup */
538 if (match[matchLength] < ip[matchLength]) {
563 const BYTE* ip, const BYTE* const iHighLimit, int const extDict,
569 if (ip < ms->window.base + ms->nextToUpdate) return 0; /* skipped area */
570 ZSTD_updateTree_internal(ms, cParams, ip, iHighLimit, matchLengthSearch, extDict);
573 case 3 : return ZSTD_insertBtAndGetAllMatches(ms, cParams, ip, iHighLimit, extDict, rep, ll0, matches, lengthToBeat, 3);
575 case 4 : return ZSTD_insertBtAndGetAllMatches(ms, cParams, ip, iHighLimit, extDict, rep, ll0, matches, lengthToBeat, 4);
576 case 5 : return ZSTD_insertBtAndGetAllMatches(ms, cParams, ip, iHighLimit, extDict, rep, ll0, matches, lengthToBeat, 5);
578 case 6 : return ZSTD_insertBtAndGetAllMatches(ms, cParams, ip, iHighLimit, extDict, rep, ll0, matches, lengthToBeat, 6);
674 const BYTE* ip = istart;
692 ip += (ip==prefixStart);
696 while (ip < ilimit) {
701 { U32 const litlen = (U32)(ip - anchor);
703 U32 const nbMatches = ZSTD_BtGetAllMatches(ms, cParams, ip, iend, extDict, rep, ll0, matches, minMatch);
704 if (!nbMatches) { ip++; continue; }
714 nbMatches, maxML, matches[nbMatches-1].off, (U32)(ip-prefixStart));
754 const BYTE* const inr = ip + cur;
863 U32 const llen = (U32)(ip - anchor);
866 if (mlen == 1) { ip++; pos++; continue; } /* literal position => move on */
867 pos += mlen; ip += mlen;
886 anchor = ip;
889 } /* while (ip < ilimit) */