const void* const end,

                        ZSTD_dictTableLoadMethod_e dtlm)

        U32 const mls)

{

    const ZSTD_compressionParameters* const cParams = &ms->cParams;

    U32* const hashTable = ms->hashTable;

    U32 const hlog = cParams->hashLog;

    /* support stepSize of 0 */

    size_t const stepSize = cParams->targetLength + !(cParams->targetLength) + 1;

    const BYTE* const base = ms->window.base;

    const BYTE* const istart = (const BYTE*)src;

    /* We check ip0 (ip + 0) and ip1 (ip + 1) each loop */

    const BYTE* ip0 = istart;

    const BYTE* ip1;

    const BYTE* anchor = istart;

    const U32   endIndex = (U32)((size_t)(istart - base) + srcSize);

    const U32   maxDistance = 1U << cParams->windowLog;

    const U32   validStartIndex = ms->window.dictLimit;

    const U32   prefixStartIndex = (endIndex - validStartIndex > maxDistance) ? endIndex - maxDistance : validStartIndex;

    const BYTE* const prefixStart = base + prefixStartIndex;

    const BYTE* const iend = istart + srcSize;

    const BYTE* const ilimit = iend - HASH_READ_SIZE;

    U32 offset_1=rep[0], offset_2=rep[1];

    U32 offsetSaved = 0;

    /* init */

    DEBUGLOG(5, "ZSTD_compressBlock_fast_generic");

    ip0 += (ip0 == prefixStart);

    ip1 = ip0 + 1;

    {

        U32 const maxRep = (U32)(ip0 - prefixStart);

        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;

        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;

    }

    /* Main Search Loop */

    while (ip1 < ilimit) {   /* < instead of <=, because check at ip0+2 */

        size_t mLength;

        BYTE const* ip2 = ip0 + 2;

        size_t const h0 = ZSTD_hashPtr(ip0, hlog, mls);

        U32 const val0 = MEM_read32(ip0);

        size_t const h1 = ZSTD_hashPtr(ip1, hlog, mls);

        U32 const val1 = MEM_read32(ip1);

        U32 const current0 = (U32)(ip0-base);

        U32 const current1 = (U32)(ip1-base);

        U32 const matchIndex0 = hashTable[h0];

        U32 const matchIndex1 = hashTable[h1];

        BYTE const* repMatch = ip2-offset_1;

        const BYTE* match0 = base + matchIndex0;

        const BYTE* match1 = base + matchIndex1;

        U32 offcode;

        hashTable[h0] = current0;   /* update hash table */

        hashTable[h1] = current1;   /* update hash table */

        assert(ip0 + 1 == ip1);

        if ((offset_1 > 0) & (MEM_read32(repMatch) == MEM_read32(ip2))) {

            mLength = ip2[-1] == repMatch[-1] ? 1 : 0;

            ip0 = ip2 - mLength;

            match0 = repMatch - mLength;

            offcode = 0;

            goto _match;

        }

        if ((matchIndex0 > prefixStartIndex) && MEM_read32(match0) == val0) {

            /* found a regular match */

            goto _offset;

        }

        if ((matchIndex1 > prefixStartIndex) && MEM_read32(match1) == val1) {

            /* found a regular match after one literal */

            ip0 = ip1;

            match0 = match1;

            goto _offset;

        }

        {

            size_t const step = ((ip0-anchor) >> (kSearchStrength - 1)) + stepSize;

            assert(step >= 2);

            ip0 += step;

            ip1 += step;

            continue;

        }

_offset: /* Requires: ip0, match0 */

        /* Compute the offset code */

        offset_2 = offset_1;

        offset_1 = (U32)(ip0-match0);

        offcode = offset_1 + ZSTD_REP_MOVE;

        mLength = 0;

        /* Count the backwards match length */

        while (((ip0>anchor) & (match0>prefixStart))

             && (ip0[-1] == match0[-1])) { ip0--; match0--; mLength++; } /* catch up */

_match: /* Requires: ip0, match0, offcode */

        /* Count the forward length */

        mLength += ZSTD_count(ip0+mLength+4, match0+mLength+4, iend) + 4;

        ZSTD_storeSeq(seqStore, ip0-anchor, anchor, offcode, mLength-MINMATCH);

        /* match found */

        ip0 += mLength;

        anchor = ip0;

        ip1 = ip0 + 1;

        if (ip0 <= ilimit) {

            /* Fill Table */

            assert(base+current0+2 > istart);  /* check base overflow */

            hashTable[ZSTD_hashPtr(base+current0+2, hlog, mls)] = current0+2;  /* here because current+2 could be > iend-8 */

            hashTable[ZSTD_hashPtr(ip0-2, hlog, mls)] = (U32)(ip0-2-base);

            while ( (ip0 <= ilimit)

                 && ( (offset_2>0)

                    & (MEM_read32(ip0) == MEM_read32(ip0 - offset_2)) )) {

                /* store sequence */

                size_t const rLength = ZSTD_count(ip0+4, ip0+4-offset_2, iend) + 4;

                U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff;  /* swap offset_2 <=> offset_1 */

                hashTable[ZSTD_hashPtr(ip0, hlog, mls)] = (U32)(ip0-base);

                ip0 += rLength;

                ip1 = ip0 + 1;

                ZSTD_storeSeq(seqStore, 0, anchor, 0, rLength-MINMATCH);

                anchor = ip0;

                continue;   /* faster when present (confirmed on gcc-8) ... (?) */

            }

        }

    }

    /* save reps for next block */

    rep[0] = offset_1 ? offset_1 : offsetSaved;

    rep[1] = offset_2 ? offset_2 : offsetSaved;

    /* Return the last literals size */

    return (size_t)(iend - anchor);

}

size_t ZSTD_compressBlock_fast(

        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

        void const* src, size_t srcSize)

{

    ZSTD_compressionParameters const* cParams = &ms->cParams;

    U32 const mls = cParams->minMatch;

    assert(ms->dictMatchState == NULL);

    switch(mls)

    {

    default: /* includes case 3 */

    case 4 :

        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 4);

    case 5 :

        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 5);

    case 6 :

        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 6);

    case 7 :

        return ZSTD_compressBlock_fast_generic(ms, seqStore, rep, src, srcSize, 7);

    }

}

FORCE_INLINE_TEMPLATE

size_t ZSTD_compressBlock_fast_dictMatchState_generic(

        ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

        void const* src, size_t srcSize, U32 const mls)

    const ZSTD_compressionParameters* const dictCParams = &dms->cParams ;

    const U32* const dictHashTable = dms->hashTable;

    const U32 dictStartIndex       = dms->window.dictLimit;

    const BYTE* const dictBase     = dms->window.base;

    const BYTE* const dictStart    = dictBase + dictStartIndex;

    const BYTE* const dictEnd      = dms->window.nextSrc;

    const U32 dictIndexDelta       = prefixStartIndex - (U32)(dictEnd - dictBase);

    const U32 dictHLog             = dictCParams->hashLog;

    /* if a dictionary is still attached, it necessarily means that

     * it is within window size. So we just check it. */

    const U32 maxDistance = 1U << cParams->windowLog;

    const U32 endIndex = (U32)((size_t)(ip - base) + srcSize);

    assert(endIndex - prefixStartIndex <= maxDistance);

    (void)maxDistance; (void)endIndex;   /* these variables are not used when assert() is disabled */

    /* ensure there will be no no underflow

     * when translating a dict index into a local index */

    assert(prefixStartIndex >= (U32)(dictEnd - dictBase));

    DEBUGLOG(5, "ZSTD_compressBlock_fast_dictMatchState_generic");

    /* dictMatchState repCode checks don't currently handle repCode == 0

     * disabling. */

    assert(offset_1 <= dictAndPrefixLength);

    assert(offset_2 <= dictAndPrefixLength);

        const BYTE* repMatch = (repIndex < prefixStartIndex) ?

        if ( ((U32)((prefixStartIndex-1) - repIndex) >= 3) /* intentional underflow : ensure repIndex isn't overlapping dict + prefix */

            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, 0, mLength-MINMATCH);

            size_t const dictHash = ZSTD_hashPtr(ip, dictHLog, mls);

            U32 const dictMatchIndex = dictHashTable[dictHash];

            const BYTE* dictMatch = dictBase + dictMatchIndex;

            if (dictMatchIndex <= dictStartIndex ||

                MEM_read32(dictMatch) != MEM_read32(ip)) {

            } else {

                /* found a dict match */

                U32 const offset = (U32)(current-dictMatchIndex-dictIndexDelta);

                mLength = ZSTD_count_2segments(ip+4, dictMatch+4, iend, dictEnd, prefixStart) + 4;

                while (((ip>anchor) & (dictMatch>dictStart))

                     && (ip[-1] == dictMatch[-1])) {

                    ip--; dictMatch--; mLength++;

                } /* catch up */

                offset_2 = offset_1;

                offset_1 = offset;

                ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);

            ZSTD_storeSeq(seqStore, (size_t)(ip-anchor), anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);

            while (ip <= ilimit) {

                U32 const current2 = (U32)(ip-base);

                U32 const repIndex2 = current2 - offset_2;

                const BYTE* repMatch2 = repIndex2 < prefixStartIndex ?

                        dictBase - dictIndexDelta + repIndex2 :

                        base + repIndex2;

                if ( ((U32)((prefixStartIndex-1) - (U32)repIndex2) >= 3 /* intentional overflow */)

                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {

                    const BYTE* const repEnd2 = repIndex2 < prefixStartIndex ? dictEnd : iend;

                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, prefixStart) + 4;

                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */

                    ZSTD_storeSeq(seqStore, 0, anchor, 0, repLength2-MINMATCH);

                    hashTable[ZSTD_hashPtr(ip, hlog, mls)] = current2;

                    ip += repLength2;

                    anchor = ip;

                    continue;

                break;

        }

    }

    return (size_t)(iend - anchor);