zstd_lazy.h (3500B)
1/* 2 * Copyright (c) Yann Collet, Facebook, Inc. 3 * All rights reserved. 4 * 5 * This source code is licensed under both the BSD-style license (found in the 6 * LICENSE file in the root directory of this source tree) and the GPLv2 (found 7 * in the COPYING file in the root directory of this source tree). 8 * You may select, at your option, one of the above-listed licenses. 9 */ 10 11#ifndef ZSTD_LAZY_H 12#define ZSTD_LAZY_H 13 14 15#include "zstd_compress_internal.h" 16 17/* 18 * Dedicated Dictionary Search Structure bucket log. In the 19 * ZSTD_dedicatedDictSearch mode, the hashTable has 20 * 2 ** ZSTD_LAZY_DDSS_BUCKET_LOG entries in each bucket, rather than just 21 * one. 22 */ 23#define ZSTD_LAZY_DDSS_BUCKET_LOG 2 24 25U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip); 26 27void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_matchState_t* ms, const BYTE* const ip); 28 29void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue); /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */ 30 31size_t ZSTD_compressBlock_btlazy2( 32 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 33 void const* src, size_t srcSize); 34size_t ZSTD_compressBlock_lazy2( 35 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 36 void const* src, size_t srcSize); 37size_t ZSTD_compressBlock_lazy( 38 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 39 void const* src, size_t srcSize); 40size_t ZSTD_compressBlock_greedy( 41 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 42 void const* src, size_t srcSize); 43 44size_t ZSTD_compressBlock_btlazy2_dictMatchState( 45 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 46 void const* src, size_t srcSize); 47size_t ZSTD_compressBlock_lazy2_dictMatchState( 48 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 49 void const* src, size_t srcSize); 50size_t ZSTD_compressBlock_lazy_dictMatchState( 51 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 52 void const* src, size_t srcSize); 53size_t ZSTD_compressBlock_greedy_dictMatchState( 54 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 55 void const* src, size_t srcSize); 56 57size_t ZSTD_compressBlock_lazy2_dedicatedDictSearch( 58 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 59 void const* src, size_t srcSize); 60size_t ZSTD_compressBlock_lazy_dedicatedDictSearch( 61 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 62 void const* src, size_t srcSize); 63size_t ZSTD_compressBlock_greedy_dedicatedDictSearch( 64 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 65 void const* src, size_t srcSize); 66 67size_t ZSTD_compressBlock_greedy_extDict( 68 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 69 void const* src, size_t srcSize); 70size_t ZSTD_compressBlock_lazy_extDict( 71 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 72 void const* src, size_t srcSize); 73size_t ZSTD_compressBlock_lazy2_extDict( 74 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 75 void const* src, size_t srcSize); 76size_t ZSTD_compressBlock_btlazy2_extDict( 77 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 78 void const* src, size_t srcSize); 79 80 81#endif /* ZSTD_LAZY_H */