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 #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 void ZSTD_row_update(ZSTD_matchState_t* const ms, const BYTE* ip);
30
31 void ZSTD_dedicatedDictSearch_lazy_loadDictionary(ZSTD_matchState_t* ms, const BYTE* const ip);
32
33 void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue); /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */
34
35 size_t ZSTD_compressBlock_btlazy2(
36 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
37 void const* src, size_t srcSize);
38 size_t ZSTD_compressBlock_lazy2(
39 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
40 void const* src, size_t srcSize);
41 size_t ZSTD_compressBlock_lazy(
42 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
43 void const* src, size_t srcSize);
44 size_t ZSTD_compressBlock_greedy(
45 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
46 void const* src, size_t srcSize);
47 size_t ZSTD_compressBlock_lazy2_row(
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_lazy_row(
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_greedy_row(
54 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
55 void const* src, size_t srcSize);
56
57 size_t ZSTD_compressBlock_btlazy2_dictMatchState(
58 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
59 void const* src, size_t srcSize);
60 size_t ZSTD_compressBlock_lazy2_dictMatchState(
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_dictMatchState(
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_dictMatchState(
67 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
68 void const* src, size_t srcSize);
69 size_t ZSTD_compressBlock_lazy2_dictMatchState_row(
70 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
71 void const* src, size_t srcSize);
72 size_t ZSTD_compressBlock_lazy_dictMatchState_row(
73 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
74 void const* src, size_t srcSize);
75 size_t ZSTD_compressBlock_greedy_dictMatchState_row(
76 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
77 void const* src, size_t srcSize);
78
79 size_t ZSTD_compressBlock_lazy2_dedicatedDictSearch(
80 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
81 void const* src, size_t srcSize);
82 size_t ZSTD_compressBlock_lazy_dedicatedDictSearch(
83 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
84 void const* src, size_t srcSize);
85 size_t ZSTD_compressBlock_greedy_dedicatedDictSearch(
86 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
87 void const* src, size_t srcSize);
88 size_t ZSTD_compressBlock_lazy2_dedicatedDictSearch_row(
89 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
90 void const* src, size_t srcSize);
91 size_t ZSTD_compressBlock_lazy_dedicatedDictSearch_row(
92 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
93 void const* src, size_t srcSize);
94 size_t ZSTD_compressBlock_greedy_dedicatedDictSearch_row(
95 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
96 void const* src, size_t srcSize);
97
98 size_t ZSTD_compressBlock_greedy_extDict(
99 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
100 void const* src, size_t srcSize);
101 size_t ZSTD_compressBlock_lazy_extDict(
102 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
103 void const* src, size_t srcSize);
104 size_t ZSTD_compressBlock_lazy2_extDict(
105 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
106 void const* src, size_t srcSize);
107 size_t ZSTD_compressBlock_greedy_extDict_row(
108 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
109 void const* src, size_t srcSize);
110 size_t ZSTD_compressBlock_lazy_extDict_row(
111 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
112 void const* src, size_t srcSize);
113 size_t ZSTD_compressBlock_lazy2_extDict_row(
114 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
115 void const* src, size_t srcSize);
116 size_t ZSTD_compressBlock_btlazy2_extDict(
117 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
118 void const* src, size_t srcSize);
119
120
121 #if defined (__cplusplus)
122 }
123 #endif
124
125 #endif /* ZSTD_LAZY_H */
Cache object: 424327bd6c94e9ed50e4e6cc63f98584
|