Home
last modified time | relevance | path

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

/third_party/lz4/lib/
H A Dlz4hc.c794 int const nbSearches, size_t sufficient_len,
814 int nbSearches; in LZ4HC_compress_generic_internal() member
849 cParam.nbSearches, limit, dict); in LZ4HC_compress_generic_internal()
854 cParam.nbSearches, cParam.targetLength, limit, in LZ4HC_compress_generic_internal()
1310 int minLen, int nbSearches, in LZ4HC_FindLongerMatch()
1319 int matchLength = LZ4HC_InsertAndGetWiderMatch(ctx, ip, ip, iHighLimit, minLen, &matchPtr, &ip, nbSearches, 1 /*patternAnalysis*/, 1 /*chainSwap*/, dict, favorDecSpeed); in LZ4HC_FindLongerMatch()
1335 int const nbSearches, in LZ4HC_compress_optimal()
1376 LZ4HC_match_t const firstMatch = LZ4HC_FindLongerMatch(ctx, ip, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed); in LZ4HC_compress_optimal()
1449 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed); in LZ4HC_compress_optimal()
1452 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, last_match_pos - cur, nbSearches, dic in LZ4HC_compress_optimal()
1308 LZ4HC_FindLongerMatch(LZ4HC_CCtx_internal* const ctx, const BYTE* ip, const BYTE* const iHighLimit, int minLen, int nbSearches, const dictCtx_directive dict, const HCfavor_e favorDecSpeed) LZ4HC_FindLongerMatch() argument
1330 LZ4HC_compress_optimal( LZ4HC_CCtx_internal* ctx, const char* const source, char* dst, int* srcSizePtr, int dstCapacity, int const nbSearches, size_t sufficient_len, const limitedOutput_directive limit, int const fullUpdate, const dictCtx_directive dict, const HCfavor_e favorDecSpeed) LZ4HC_compress_optimal() argument
[all...]

Completed in 3 milliseconds