iLimit (reference) in projects: kernel - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:iLimit (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-6.6/lib/zstd/compress/
H A D	zstd_lazy.c	383 const BYTE* const ip, const BYTE* const iLimit, in ZSTD_BtFindBestMatch() 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() 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() 695 currentMl = ZSTD_count(ip, match, iLimit); in ZSTD_HcFindBestMatch() 382 ZSTD_BtFindBestMatch( ZSTD_matchState_t* ms, const BYTE* const ip, const BYTE* const iLimit, size_t* offsetPtr, const U32 mls , const ZSTD_dictMode_e dictMode) ZSTD_BtFindBestMatch() argument 516 ZSTD_dedicatedDictSearch_lazy_search(size_t* offsetPtr, size_t ml, U32 nbAttempts, const ZSTD_matchState_t* const dms, const BYTE* const ip, const BYTE* const iLimit, const BYTE* const prefixStart, const U32 curr, const U32 dictLimit, const size_t ddsIdx) ZSTD_dedicatedDictSearch_lazy_search() argument 648 ZSTD_HcFindBestMatch( ZSTD_matchState_t* ms, const BYTE* const ip, const BYTE* const iLimit, size_t* offsetPtr, const U32 mls, const ZSTD_dictMode_e dictMode) ZSTD_HcFindBestMatch() argument 862 ZSTD_row_fillHashCache(ZSTD_matchState_t* ms, const BYTE* base, U32 const rowLog, U32 const mls, U32 idx, const BYTE* const iLimit) ZSTD_row_fillHashCache() argument 1120 ZSTD_RowFindBestMatch( ZSTD_matchState_t* ms, const BYTE* const ip, const BYTE* const iLimit, size_t* offsetPtr, const U32 mls, const ZSTD_dictMode_e dictMode, const U32 rowLog) ZSTD_RowFindBestMatch() argument [all...]
H A D	zstd_opt.c	560 const BYTE* const ip, const BYTE* const iLimit, const ZSTD_dictMode_e dictMode, in ZSTD_insertBtAndGetAllMatches() 623 repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch; in ZSTD_insertBtAndGetAllMatches() 634 repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dictEnd, prefixStart) + minMatch; in ZSTD_insertBtAndGetAllMatches() 640 repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dmsEnd, prefixStart) + minMatch; in ZSTD_insertBtAndGetAllMatches() 651 \| (ip+repLen == iLimit) ) { /* best possible / in ZSTD_insertBtAndGetAllMatches() 663 mlen = ZSTD_count(ip, match, iLimit); in ZSTD_insertBtAndGetAllMatches() 666 mlen = ZSTD_count_2segments(ip, match, iLimit, dictEnd, prefixStart); in ZSTD_insertBtAndGetAllMatches() 680 (ip+mlen == iLimit) ) { / best possible length / in ZSTD_insertBtAndGetAllMatches() 699 matchLength += ZSTD_count(ip+matchLength, match+matchLength, iLimit); in ZSTD_insertBtAndGetAllMatches() 703 matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEn in ZSTD_insertBtAndGetAllMatches() 556 ZSTD_insertBtAndGetAllMatches( ZSTD_match_t matches, ZSTD_matchState_t* ms, U32* nextToUpdate3, const BYTE* const ip, const BYTE* const iLimit, const ZSTD_dictMode_e dictMode, const U32 rep[ZSTD_REP_NUM], U32 const ll0, const U32 lengthToBeat, U32 const mls ) ZSTD_insertBtAndGetAllMatches() argument [all...]
/kernel/linux/linux-5.10/lib/lz4/
H A D	lz4hc_compress.c	102 const BYTE * const iLimit, in LZ4HC_InsertAndFindBestMatch() 131 match + MINMATCH, iLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch() 146 if (vLimit > iLimit) in LZ4HC_InsertAndFindBestMatch() 147 vLimit = iLimit; in LZ4HC_InsertAndFindBestMatch() 151 && (vLimit < iLimit)) in LZ4HC_InsertAndFindBestMatch() 154 iLimit); in LZ4HC_InsertAndFindBestMatch() 99 LZ4HC_InsertAndFindBestMatch( LZ4HC_CCtx_internal hc4, const BYTE ip, const BYTE * const iLimit, const BYTE **matchpos, const int maxNbAttempts) LZ4HC_InsertAndFindBestMatch() argument
/kernel/linux/linux-6.6/lib/lz4/
H A D	lz4hc_compress.c	102 const BYTE * const iLimit, in LZ4HC_InsertAndFindBestMatch() 131 match + MINMATCH, iLimit) + MINMATCH; in LZ4HC_InsertAndFindBestMatch() 146 if (vLimit > iLimit) in LZ4HC_InsertAndFindBestMatch() 147 vLimit = iLimit; in LZ4HC_InsertAndFindBestMatch() 151 && (vLimit < iLimit)) in LZ4HC_InsertAndFindBestMatch() 154 iLimit); in LZ4HC_InsertAndFindBestMatch() 99 LZ4HC_InsertAndFindBestMatch( LZ4HC_CCtx_internal hc4, const BYTE ip, const BYTE * const iLimit, const BYTE **matchpos, const int maxNbAttempts) LZ4HC_InsertAndFindBestMatch() argument
/kernel/linux/linux-5.10/lib/zstd/
H A D	zstd_opt.h	235 static U32 ZSTD_insertBtAndGetAllMatches(ZSTD_CCtx zc, const BYTE const ip, const BYTE const iLimit, U32 nbCompares, const U32 mls, U32 extDict, in ZSTD_insertBtAndGetAllMatches() argument 271 currMl = ZSTD_count(ip, match, iLimit); in ZSTD_insertBtAndGetAllMatches() 276 currMl = ZSTD_count_2segments(ip + MINMATCH, match + MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH; in ZSTD_insertBtAndGetAllMatches() 287 if (ip + currMl == iLimit) in ZSTD_insertBtAndGetAllMatches() 303 matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iLimit) + 1; in ZSTD_insertBtAndGetAllMatches() 307 matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iLimit, dictEnd, prefixStart); in ZSTD_insertBtAndGetAllMatches() 321 if (ip + matchLength == iLimit) / equal : no way to know if inf or sup / in ZSTD_insertBtAndGetAllMatches() 356 static U32 ZSTD_BtGetAllMatches(ZSTD_CCtx zc, const BYTE const ip, const BYTE const iLimit, const U32 maxNbAttempts, const U32 mls, ZSTD_match_t matches, in ZSTD_BtGetAllMatches() argument 361 ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtGetAllMatches() 362 return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempt in ZSTD_BtGetAllMatches() 380 ZSTD_BtGetAllMatches_extDict(ZSTD_CCtx zc, const BYTE const ip, const BYTE const iLimit, const U32 maxNbAttempts, const U32 mls, ZSTD_match_t *matches, const U32 minMatchLen) ZSTD_BtGetAllMatches_extDict() argument [all...]
H A D	compress.c	1735 static size_t ZSTD_BtFindBestMatch(ZSTD_CCtx zc, const BYTE const ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, const U32 mls) in ZSTD_BtFindBestMatch() argument 1739 ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtFindBestMatch() 1740 return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0); in ZSTD_BtFindBestMatch() 1744 const BYTE ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch) in ZSTD_BtFindBestMatch_selectMLS() 1748 case 4: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4); in ZSTD_BtFindBestMatch_selectMLS() 1749 case 5: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5); in ZSTD_BtFindBestMatch_selectMLS() 1751 case 6: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6); in ZSTD_BtFindBestMatch_selectMLS() 1766 static size_t ZSTD_BtFindBestMatch_extDict(ZSTD_CCtx zc, const BYTE const ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, in ZSTD_BtFindBestMatch_extDict() argument 1771 ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls); in ZSTD_BtFindBestMatch_extDict() 1772 return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPt in ZSTD_BtFindBestMatch_extDict() 1743 ZSTD_BtFindBestMatch_selectMLS(ZSTD_CCtx zc, const BYTE ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch) ZSTD_BtFindBestMatch_selectMLS() argument 1775 ZSTD_BtFindBestMatch_selectMLS_extDict(ZSTD_CCtx zc, const BYTE ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch) ZSTD_BtFindBestMatch_selectMLS_extDict() argument 1819 ZSTD_HcFindBestMatch_generic(ZSTD_CCtx zc, const BYTE const ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, const U32 mls, const U32 extDict) ZSTD_HcFindBestMatch_generic() argument 1869 ZSTD_HcFindBestMatch_selectMLS(ZSTD_CCtx zc, const BYTE ip, const BYTE const iLimit, size_t offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch) ZSTD_HcFindBestMatch_selectMLS() argument 1881 ZSTD_HcFindBestMatch_extDict_selectMLS(ZSTD_CCtx zc, const BYTE ip, const BYTE const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch) ZSTD_HcFindBestMatch_extDict_selectMLS() argument [all...]

Completed in 14 milliseconds