447                 U32 const mls, const int extDict)  in ZSTD_insertBt1()  argument
452     size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);  in ZSTD_insertBt1()
566                 const U32 mls, const ZSTD_dictMode_e dictMode)  in ZSTD_updateTree_internal()  argument
575 …     U32 const forward = ZSTD_insertBt1(ms, base+idx, iend, target, mls, dictMode == ZSTD_extDict);  in ZSTD_updateTree_internal()
600                 const U32 mls /* template */)  in ZSTD_insertBtAndGetAllMatches()  argument
607     U32 const minMatch = (mls==3) ? 3 : 4;  in ZSTD_insertBtAndGetAllMatches()
609     size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);  in ZSTD_insertBtAndGetAllMatches()
692     if ((mls == 3) /*static*/ && (bestLength < mls)) {  in ZSTD_insertBtAndGetAllMatches()
706             if (mlen >= mls /* == 3 > bestLength */) {  in ZSTD_insertBtAndGetAllMatches()
779         size_t const dmsH = ZSTD_hashPtr(ip, dmsHashLog, mls);  in ZSTD_insertBtAndGetAllMatches()
843         const U32 mls)  in ZSTD_btGetAllMatches_internal()  argument
845     assert(BOUNDED(3, ms->cParams.minMatch, 6) == mls);  in ZSTD_btGetAllMatches_internal()
846     DEBUGLOG(8, "ZSTD_BtGetAllMatches(dictMode=%d, mls=%u)", (int)dictMode, mls);  in ZSTD_btGetAllMatches_internal()
849     ZSTD_updateTree_internal(ms, ip, iHighLimit, mls, dictMode);  in ZSTD_btGetAllMatches_internal()
850 …ndGetAllMatches(matches, ms, nextToUpdate3, ip, iHighLimit, dictMode, rep, ll0, lengthToBeat, mls);  in ZSTD_btGetAllMatches_internal()
853 #define ZSTD_BT_GET_ALL_MATCHES_FN(dictMode, mls) ZSTD_btGetAllMatches_##dictMode##_##mls  argument
855 #define GEN_ZSTD_BT_GET_ALL_MATCHES_(dictMode, mls)            \  argument
856     static U32 ZSTD_BT_GET_ALL_MATCHES_FN(dictMode, mls)(      \
868                 rep, ll0, lengthToBeat, ZSTD_##dictMode, mls); \
897     U32 const mls = BOUNDED(3, ms->cParams.minMatch, 6);  local
899     assert(mls - 3 < 4);
900     return getAllMatchesFns[(int)dictMode][mls - 3];