383                 const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_BtFindBestMatch()  argument
390     ZSTD_updateDUBT(ms, ip, iLimit, mls);  in ZSTD_BtFindBestMatch()
391     return ZSTD_DUBT_findBestMatch(ms, ip, iLimit, offsetPtr, mls, dictMode);  in ZSTD_BtFindBestMatch()
518                                             const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_dedicatedDictSearch_lazy_search()  argument
558             currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, ddsEnd, prefixStart) + 4;  in ZSTD_dedicatedDictSearch_lazy_search()
565             if (ip+currentMl == iLimit) {  in ZSTD_dedicatedDictSearch_lazy_search()
595                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, ddsEnd, prefixStart) + 4;  in ZSTD_dedicatedDictSearch_lazy_search()
602 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_dedicatedDictSearch_lazy_search()
650                         const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_HcFindBestMatch()  argument
695                 currentMl = ZSTD_count(ip, match, iLimit);  in ZSTD_HcFindBestMatch()
700                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;  in ZSTD_HcFindBestMatch()
707 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_HcFindBestMatch()
717                                                   ip, iLimit, prefixStart, curr, dictLimit, ddsIdx);  in ZSTD_HcFindBestMatch()
736                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dmsEnd, prefixStart) + 4;  in ZSTD_HcFindBestMatch()
743 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_HcFindBestMatch()
873                                    U32 idx, const BYTE* const iLimit)  in ZSTD_row_fillHashCache()  argument
878     U32 const maxElemsToPrefetch = (base + idx) > iLimit ? 0 : (U32)(iLimit - (base + idx) + 1);  in ZSTD_row_fillHashCache()
1131                         const BYTE* const ip, const BYTE* const iLimit,  in ZSTD_RowFindBestMatch()  argument
1237                     currentMl = ZSTD_count(ip, match, iLimit);  in ZSTD_RowFindBestMatch()
1242 …                 currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;  in ZSTD_RowFindBestMatch()
1249 …       if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */  in ZSTD_RowFindBestMatch()
1257                                                   ip, iLimit, prefixStart, curr, dictLimit, ddsIdx);  in ZSTD_RowFindBestMatch()
1291 …                  currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dmsEnd, prefixStart) + 4;  in ZSTD_RowFindBestMatch()
1298                     if (ip+currentMl == iLimit) break;  in ZSTD_RowFindBestMatch()
1309                     const BYTE* ip, const BYTE* iLimit, size_t* offsetPtr);
1339             const BYTE* ip, const BYTE* const iLimit,                                 \
1343         return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode); \
1352             const BYTE* ip, const BYTE* const iLimit,                                 \
1356         return ZSTD_HcFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode); \
1365             const BYTE* ip, const BYTE* const iLimit,                                          \
1370         return ZSTD_RowFindBestMatch(ms, ip, iLimit, offsetPtr, mls, ZSTD_##dictMode, rowLog); \