Go to the source code of this file.
|
FORCE_INLINE int | LZ4HC_BinTree_GetAllMatches (LZ4HC_CCtx_internal *ctx, const BYTE *const ip, const BYTE *const iHighLimit, size_t best_mlen, LZ4HC_match_t *matches, const int fullUpdate) |
|
FORCE_INLINE int | LZ4HC_BinTree_InsertAndGetAllMatches (LZ4HC_CCtx_internal *ctx, const BYTE *const ip, const BYTE *const iHighLimit, size_t best_mlen, LZ4HC_match_t *matches, int *matchNum) |
|
static int | LZ4HC_compress_optimal (LZ4HC_CCtx_internal *ctx, const char *const source, char *dest, int inputSize, int maxOutputSize, limitedOutput_directive limit, size_t sufficient_len, const int fullUpdate) |
|
FORCE_INLINE size_t | LZ4HC_literalsPrice (size_t litlen) |
|
FORCE_INLINE size_t | LZ4HC_sequencePrice (size_t litlen, size_t mlen) |
|
FORCE_INLINE void | LZ4HC_updateBinTree (LZ4HC_CCtx_internal *ctx, const BYTE *const ip, const BYTE *const iHighLimit) |
|
#define LZ4_OPT_NUM (1<<12) |
#define SET_PRICE |
( |
|
pos, |
|
|
|
ml, |
|
|
|
offset, |
|
|
|
ll, |
|
|
|
cost |
|
) |
| |
Value:{ \
while (last_pos <
pos) { opt[last_pos+1].price = 1<<30; last_pos++; } \
opt[
pos].mlen = (int)ml; \
opt[
pos].litlen = (int)ll; \
opt[
pos].price = (int)cost; \
}
Definition at line 198 of file lz4opt.h.
Tree updater, providing best match
Definition at line 184 of file lz4opt.h.