397                 const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_BtFindBestMatch()  argument
404     ZSTD_updateDUBT(ms, ip, iLimit, mls);  in ZSTD_BtFindBestMatch()
405     return ZSTD_DUBT_findBestMatch(ms, ip, iLimit, offBasePtr, mls, dictMode);  in ZSTD_BtFindBestMatch()
532                                             const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_dedicatedDictSearch_lazy_search()  argument
572             currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, ddsEnd, prefixStart) + 4;  in ZSTD_dedicatedDictSearch_lazy_search()
579             if (ip+currentMl == iLimit) {  in ZSTD_dedicatedDictSearch_lazy_search()
609                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, ddsEnd, prefixStart) + 4;  in ZSTD_dedicatedDictSearch_lazy_search()
616 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_dedicatedDictSearch_lazy_search()
670                         const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_HcFindBestMatch()  argument
716                 currentMl = ZSTD_count(ip, match, iLimit);  in ZSTD_HcFindBestMatch()
721                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;  in ZSTD_HcFindBestMatch()
728 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_HcFindBestMatch()
738                                                   ip, iLimit, prefixStart, curr, dictLimit, ddsIdx);  in ZSTD_HcFindBestMatch()
757                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dmsEnd, prefixStart) + 4;  in ZSTD_HcFindBestMatch()
764 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_HcFindBestMatch()
840                                    U32 idx, const BYTE* const iLimit)  in ZSTD_row_fillHashCache()  argument
845     U32 const maxElemsToPrefetch = (base + idx) > iLimit ? 0 : (U32)(iLimit - (base + idx) + 1);  in ZSTD_row_fillHashCache()
1144                         const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_RowFindBestMatch()  argument
1266                     currentMl = ZSTD_count(ip, match, iLimit);  in ZSTD_RowFindBestMatch()
1271 …                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;  in ZSTD_RowFindBestMatch()
1278 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_RowFindBestMatch()
1286                                                   ip, iLimit, prefixStart, curr, dictLimit, ddsIdx);  in ZSTD_RowFindBestMatch()
1322 …                  currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dmsEnd, prefixStart) + 4;  in ZSTD_RowFindBestMatch()
1329                     if (ip+currentMl == iLimit) break;  in ZSTD_RowFindBestMatch()
1369             const BYTE* ip, const BYTE* const iLimit,                                  \
1373         return ZSTD_BtFindBestMatch(ms, ip, iLimit, offBasePtr, mls, ZSTD_##dictMode); \
1379             const BYTE* ip, const BYTE* const iLimit,                                 \
1383         return ZSTD_HcFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode); \
1389             const BYTE* ip, const BYTE* const iLimit,                                          \
1394         return ZSTD_RowFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode, rowLog); \