Lines Matching defs:mls
22 U32 mls)
44 size_t const h = ZSTD_hashPtr(base + idx, hashLog, mls); /* assumption : ip + 8 <= iend */
159 U32 const mls,
166 size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
234 U32 const mls,
240 size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
365 mls, dictMode);
385 const U32 mls /* template */,
390 ZSTD_updateDUBT(ms, ip, iLimit, mls);
391 return ZSTD_DUBT_findBestMatch(ms, ip, iLimit, offsetPtr, mls, dictMode);
620 const BYTE* ip, U32 const mls)
631 size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
638 return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
652 const U32 mls, const ZSTD_dictMode_e dictMode)
677 ? ZSTD_hashPtr(ip, ddsHashLog, mls) << ZSTD_LAZY_DDSS_BUCKET_LOG : 0;
687 matchIndex = ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, mls);
729 matchIndex = dms->hashTable[ZSTD_hashPtr(ip, dms->cParams.hashLog, mls)];
863 U32 const rowLog, U32 const mls,
873 U32 const hash = (U32)ZSTD_hashPtr(base + idx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls);
891 U32 const rowLog, U32 const mls)
893 U32 const newHash = (U32)ZSTD_hashPtr(base+idx+ZSTD_ROW_HASH_CACHE_SIZE, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls);
907 U32 const mls, U32 const rowLog,
917 U32 const hash = useCache ? ZSTD_row_nextCachedHash(ms->hashCache, hashTable, tagTable, base, updateStartIdx, hashLog, rowLog, mls)
918 : (U32)ZSTD_hashPtr(base + updateStartIdx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls);
925 assert(hash == ZSTD_hashPtr(base + updateStartIdx, hashLog + ZSTD_ROW_HASH_TAG_BITS, mls));
936 U32 const mls, U32 const rowLog,
954 ZSTD_row_update_internalImpl(ms, idx, bound, mls, rowLog, rowMask, useCache);
956 ZSTD_row_fillHashCache(ms, base, rowLog, mls, idx, ip+1);
960 ZSTD_row_update_internalImpl(ms, idx, target, mls, rowLog, rowMask, useCache);
971 const U32 mls = MIN(ms->cParams.minMatch, 6 /* mls caps out at 6 */);
974 ZSTD_row_update_internal(ms, ip, mls, rowLog, rowMask, 0 /* dont use cache */);
1124 const U32 mls, const ZSTD_dictMode_e dictMode,
1162 ddsIdx = ZSTD_hashPtr(ip, ddsHashLog, mls) << ZSTD_LAZY_DDSS_BUCKET_LOG;
1172 U32 const dmsHash = (U32)ZSTD_hashPtr(ip, dms->rowHashLog + ZSTD_ROW_HASH_TAG_BITS, mls);
1181 ZSTD_row_update_internal(ms, ip, mls, rowLog, rowMask, 1 /* useCache */);
1183 U32 const hash = ZSTD_row_nextCachedHash(hashCache, hashTable, tagTable, base, curr, hashLog, rowLog, mls);
1299 * Generate search functions templated on (dictMode, mls, rowLog).
1320 #define ZSTD_BT_SEARCH_FN(dictMode, mls) ZSTD_BtFindBestMatch_##dictMode##_##mls
1321 #define ZSTD_HC_SEARCH_FN(dictMode, mls) ZSTD_HcFindBestMatch_##dictMode##_##mls
1322 #define ZSTD_ROW_SEARCH_FN(dictMode, mls, rowLog) ZSTD_RowFindBestMatch_##dictMode##_##mls##_##rowLog
1326 #define GEN_ZSTD_BT_SEARCH_FN(dictMode, mls) \
1327 ZSTD_SEARCH_FN_ATTRS size_t ZSTD_BT_SEARCH_FN(dictMode, mls)( \
1332 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1333 return ZSTD_BtFindBestMatch(ms, ip, iLimit, offBasePtr, mls, ZSTD_##dictMode); \
1336 #define GEN_ZSTD_HC_SEARCH_FN(dictMode, mls) \
1337 ZSTD_SEARCH_FN_ATTRS size_t ZSTD_HC_SEARCH_FN(dictMode, mls)( \
1342 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1343 return ZSTD_HcFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode); \
1346 #define GEN_ZSTD_ROW_SEARCH_FN(dictMode, mls, rowLog) \
1347 ZSTD_SEARCH_FN_ATTRS size_t ZSTD_ROW_SEARCH_FN(dictMode, mls, rowLog)( \
1352 assert(MAX(4, MIN(6, ms->cParams.minMatch)) == mls); \
1354 return ZSTD_RowFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode, rowLog); \
1357 #define ZSTD_FOR_EACH_ROWLOG(X, dictMode, mls) \
1358 X(dictMode, mls, 4) \
1359 X(dictMode, mls, 5) \
1360 X(dictMode, mls, 6)
1378 /* Generate row search fns for each combination of (dictMode, mls, rowLog) */
1380 /* Generate binary Tree search fns for each combination of (dictMode, mls) */
1382 /* Generate hash chain search fns for each combination of (dictMode, mls) */
1387 #define GEN_ZSTD_CALL_BT_SEARCH_FN(dictMode, mls) \
1388 case mls: \
1389 return ZSTD_BT_SEARCH_FN(dictMode, mls)(ms, ip, iend, offsetPtr);
1390 #define GEN_ZSTD_CALL_HC_SEARCH_FN(dictMode, mls) \
1391 case mls: \
1392 return ZSTD_HC_SEARCH_FN(dictMode, mls)(ms, ip, iend, offsetPtr);
1393 #define GEN_ZSTD_CALL_ROW_SEARCH_FN(dictMode, mls, rowLog) \
1395 return ZSTD_ROW_SEARCH_FN(dictMode, mls, rowLog)(ms, ip, iend, offsetPtr);
1398 switch (mls) { \
1402 #define ZSTD_SWITCH_ROWLOG(dictMode, mls) \
1403 case mls: \
1405 ZSTD_FOR_EACH_ROWLOG(GEN_ZSTD_CALL_ROW_SEARCH_FN, dictMode, mls) \
1427 * (searchMethod, dictMode, mls, rowLog). We use switch statements
1433 * statements should be optimized out. Only the mls & rowLog switches
1440 * @param mls The minimum search length, in the range [4, 6].
1445 * @returns The length of the longest match found, or < mls if no match is found.
1453 U32 const mls,
1491 const U32 mls = BOUNDED(4, ms->cParams.minMatch, 6);
1527 MIN(ms->cParams.minMatch, 6 /* mls caps out at 6 */),
1566 size_t const ml2 = ZSTD_searchMax(ms, ip, iend, &offsetFound, mls, rowLog, searchMethod, dictMode);
1605 size_t const ml2 = ZSTD_searchMax(ms, ip, iend, &offset2, mls, rowLog, searchMethod, dictMode);
1641 size_t const ml2 = ZSTD_searchMax(ms, ip, iend, &offset2, mls, rowLog, searchMethod, dictMode);
1882 const U32 mls = BOUNDED(4, ms->cParams.minMatch, 6);
1893 MIN(ms->cParams.minMatch, 6 /* mls caps out at 6 */),
1926 size_t const ml2 = ZSTD_searchMax(ms, ip, iend, &offsetFound, mls, rowLog, searchMethod, ZSTD_extDict);
1961 size_t const ml2 = ZSTD_searchMax(ms, ip, iend, &offset2, mls, rowLog, searchMethod, ZSTD_extDict);
1993 size_t const ml2 = ZSTD_searchMax(ms, ip, iend, &offset2, mls, rowLog, searchMethod, ZSTD_extDict);