H A D | lz4hc.c | 250 const HCfavor_e favorDecSpeed) in LZ4HC_InsertAndGetWiderMatch() 282 if (favorDecSpeed && (ipIndex - matchIndex < 8)) { in LZ4HC_InsertAndGetWiderMatch() 797 const HCfavor_e favorDecSpeed); 843 HCfavor_e const favor = ctx->favorDecSpeed ? favorDecompressionSpeed : favorCompressionRatio; in LZ4HC_compress_generic_internal() 1061 LZ4_streamHCPtr->internal_donotuse.favorDecSpeed = (favor!=0); in LZ4_favorDecompressionSpeed() 1312 const HCfavor_e favorDecSpeed) 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() 1321 if (favorDecSpeed) { in LZ4HC_FindLongerMatch() 1340 const HCfavor_e favorDecSpeed) in LZ4HC_compress_optimal() 1376 LZ4HC_match_t const firstMatch = LZ4HC_FindLongerMatch(ctx, ip, matchlimit, MINMATCH-1, nbSearches, dict, favorDecSpeed); in LZ4HC_compress_optimal() 240 LZ4HC_InsertAndGetWiderMatch( LZ4HC_CCtx_internal* const hc4, const BYTE* const ip, const BYTE* const iLowLimit, const BYTE* const iHighLimit, int longest, const BYTE** matchpos, const BYTE** startpos, const int maxNbAttempts, const int patternAnalysis, const int chainSwap, const dictCtx_directive dict, const HCfavor_e favorDecSpeed) LZ4HC_InsertAndGetWiderMatch() argument 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...] |