1 /* 2 * Copyright (c) 2016-2020, 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 #if defined (__cplusplus) 15 extern "C" { 16 #endif 17 18 #include "zstd_compress_internal.h" 19 20 /** 21 * Dedicated Dictionary Search Structure bucket log. In the 22 * ZSTD_dedicatedDictSearch mode, the hashTable has 23 * 2 ** ZSTD_LAZY_DDSS_BUCKET_LOG entries in each bucket, rather than just 24 * one. 25 */ 26 #define ZSTD_LAZY_DDSS_BUCKET_LOG 2 27 28 U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip); 29 30 void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_matchState_t* ms, const BYTE* const ip); 31 32 void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue); /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */ 33 34 size_t ZSTD_compressBlock_btlazy2( 35 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 36 void const* src, size_t srcSize); 37 size_t ZSTD_compressBlock_lazy2( 38 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 39 void const* src, size_t srcSize); 40 size_t ZSTD_compressBlock_lazy( 41 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 42 void const* src, size_t srcSize); 43 size_t ZSTD_compressBlock_greedy( 44 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 45 void const* src, size_t srcSize); 46 47 size_t ZSTD_compressBlock_btlazy2_dictMatchState( 48 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 49 void const* src, size_t srcSize); 50 size_t ZSTD_compressBlock_lazy2_dictMatchState( 51 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 52 void const* src, size_t srcSize); 53 size_t ZSTD_compressBlock_lazy_dictMatchState( 54 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 55 void const* src, size_t srcSize); 56 size_t ZSTD_compressBlock_greedy_dictMatchState( 57 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 58 void const* src, size_t srcSize); 59 60 size_t ZSTD_compressBlock_lazy2_dedicatedDictSearch( 61 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 62 void const* src, size_t srcSize); 63 size_t ZSTD_compressBlock_lazy_dedicatedDictSearch( 64 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 65 void const* src, size_t srcSize); 66 size_t ZSTD_compressBlock_greedy_dedicatedDictSearch( 67 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 68 void const* src, size_t srcSize); 69 70 size_t ZSTD_compressBlock_greedy_extDict( 71 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 72 void const* src, size_t srcSize); 73 size_t ZSTD_compressBlock_lazy_extDict( 74 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 75 void const* src, size_t srcSize); 76 size_t ZSTD_compressBlock_lazy2_extDict( 77 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 78 void const* src, size_t srcSize); 79 size_t ZSTD_compressBlock_btlazy2_extDict( 80 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 81 void const* src, size_t srcSize); 82 83 #if defined (__cplusplus) 84 } 85 #endif 86 87 #endif /* ZSTD_LAZY_H */ 88