zstdlib 0.6.0 → 0.9.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (129) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGES.md +20 -0
  3. data/README.md +7 -1
  4. data/Rakefile +38 -8
  5. data/ext/{zstdlib → zstdlib_c}/extconf.rb +10 -5
  6. data/ext/{zstdlib → zstdlib_c}/ruby/zlib-2.2/zstdlib.c +2 -2
  7. data/ext/{zstdlib → zstdlib_c}/ruby/zlib-2.3/zstdlib.c +2 -2
  8. data/ext/{zstdlib → zstdlib_c}/ruby/zlib-2.4/zstdlib.c +2 -2
  9. data/ext/{zstdlib → zstdlib_c}/ruby/zlib-2.5/zstdlib.c +2 -2
  10. data/ext/{zstdlib → zstdlib_c}/ruby/zlib-2.6/zstdlib.c +2 -2
  11. data/ext/{zstdlib → zstdlib_c}/ruby/zlib-2.7/zstdlib.c +2 -2
  12. data/ext/zstdlib_c/ruby/zlib-3.0/zstdlib.c +4994 -0
  13. data/ext/zstdlib_c/ruby/zlib-3.1/zstdlib.c +5076 -0
  14. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/adler32.c +0 -0
  15. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/compress.c +0 -0
  16. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/crc32.c +0 -0
  17. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/crc32.h +0 -0
  18. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/deflate.c +0 -0
  19. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/deflate.h +0 -0
  20. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/gzclose.c +0 -0
  21. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/gzguts.h +0 -0
  22. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/gzlib.c +0 -0
  23. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/gzread.c +0 -0
  24. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/gzwrite.c +0 -0
  25. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/infback.c +0 -0
  26. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inffast.c +0 -0
  27. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inffast.h +0 -0
  28. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inffixed.h +0 -0
  29. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inflate.c +0 -0
  30. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inflate.h +0 -0
  31. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inftrees.c +0 -0
  32. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/inftrees.h +0 -0
  33. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/trees.c +0 -0
  34. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/trees.h +0 -0
  35. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/uncompr.c +0 -0
  36. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/zconf.h +0 -0
  37. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/zlib.h +0 -0
  38. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/zutil.c +0 -0
  39. data/ext/{zstdlib → zstdlib_c}/zlib-1.2.11/zutil.h +0 -0
  40. data/ext/{zstdlib → zstdlib_c}/zlib.mk +0 -0
  41. data/ext/{zstdlib → zstdlib_c}/zlibwrapper/zlibwrapper.c +1 -5
  42. data/ext/{zstdlib → zstdlib_c}/zlibwrapper.mk +0 -0
  43. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/bitstream.h +75 -57
  44. data/ext/zstdlib_c/zstd-1.5.2/lib/common/compiler.h +335 -0
  45. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/cpu.h +1 -3
  46. data/ext/zstdlib_c/zstd-1.5.2/lib/common/debug.c +24 -0
  47. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/debug.h +22 -49
  48. data/ext/zstdlib_c/zstd-1.5.2/lib/common/entropy_common.c +368 -0
  49. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/error_private.c +3 -1
  50. data/ext/zstdlib_c/zstd-1.5.2/lib/common/error_private.h +159 -0
  51. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/fse.h +51 -42
  52. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/fse_decompress.c +149 -57
  53. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/huf.h +60 -54
  54. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/mem.h +87 -98
  55. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/pool.c +34 -23
  56. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/pool.h +5 -5
  57. data/ext/zstdlib_c/zstd-1.5.2/lib/common/portability_macros.h +137 -0
  58. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/threading.c +10 -8
  59. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/threading.h +4 -3
  60. data/ext/zstdlib_c/zstd-1.5.2/lib/common/xxhash.c +24 -0
  61. data/ext/zstdlib_c/zstd-1.5.2/lib/common/xxhash.h +5686 -0
  62. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/common/zstd_common.c +10 -10
  63. data/ext/zstdlib_c/zstd-1.5.2/lib/common/zstd_deps.h +111 -0
  64. data/ext/zstdlib_c/zstd-1.5.2/lib/common/zstd_internal.h +493 -0
  65. data/ext/zstdlib_c/zstd-1.5.2/lib/common/zstd_trace.h +163 -0
  66. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/clevels.h +134 -0
  67. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/fse_compress.c +105 -85
  68. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/hist.c +41 -63
  69. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/hist.h +13 -33
  70. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/huf_compress.c +1370 -0
  71. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstd_compress.c +6327 -0
  72. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_compress_internal.h +537 -82
  73. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_compress_literals.c +21 -16
  74. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_compress_literals.h +4 -2
  75. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_compress_sequences.c +61 -34
  76. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_compress_sequences.h +10 -3
  77. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstd_compress_superblock.c +573 -0
  78. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstd_compress_superblock.h +32 -0
  79. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_cwksp.h +236 -95
  80. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_double_fast.c +321 -143
  81. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_double_fast.h +2 -2
  82. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_fast.c +328 -137
  83. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_fast.h +2 -2
  84. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstd_lazy.c +2104 -0
  85. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstd_lazy.h +125 -0
  86. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_ldm.c +336 -209
  87. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_ldm.h +15 -3
  88. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstd_ldm_geartab.h +106 -0
  89. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_opt.c +439 -239
  90. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstd_opt.h +1 -1
  91. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/compress/zstdmt_compress.c +205 -462
  92. data/ext/zstdlib_c/zstd-1.5.2/lib/compress/zstdmt_compress.h +113 -0
  93. data/ext/zstdlib_c/zstd-1.5.2/lib/decompress/huf_decompress.c +1889 -0
  94. data/ext/zstdlib_c/zstd-1.5.2/lib/decompress/huf_decompress_amd64.S +585 -0
  95. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/decompress/zstd_ddict.c +20 -16
  96. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/decompress/zstd_ddict.h +3 -3
  97. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/decompress/zstd_decompress.c +691 -230
  98. data/ext/zstdlib_c/zstd-1.5.2/lib/decompress/zstd_decompress_block.c +2072 -0
  99. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/decompress/zstd_decompress_block.h +16 -7
  100. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/decompress/zstd_decompress_internal.h +71 -10
  101. data/ext/zstdlib_c/zstd-1.5.2/lib/zdict.h +452 -0
  102. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/lib/zstd.h +760 -234
  103. data/ext/{zstdlib/zstd-1.4.4/lib/common → zstdlib_c/zstd-1.5.2/lib}/zstd_errors.h +3 -1
  104. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/gzclose.c +0 -0
  105. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/gzcompatibility.h +1 -1
  106. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/gzguts.h +0 -0
  107. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/gzlib.c +0 -0
  108. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/gzread.c +0 -0
  109. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/gzwrite.c +0 -0
  110. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/zstd_zlibwrapper.c +133 -44
  111. data/ext/{zstdlib/zstd-1.4.4 → zstdlib_c/zstd-1.5.2}/zlibWrapper/zstd_zlibwrapper.h +1 -1
  112. data/ext/zstdlib_c/zstd.mk +15 -0
  113. data/lib/zstdlib.rb +2 -2
  114. metadata +118 -107
  115. data/ext/zstdlib/zstd-1.4.4/lib/common/compiler.h +0 -159
  116. data/ext/zstdlib/zstd-1.4.4/lib/common/debug.c +0 -44
  117. data/ext/zstdlib/zstd-1.4.4/lib/common/entropy_common.c +0 -236
  118. data/ext/zstdlib/zstd-1.4.4/lib/common/error_private.h +0 -76
  119. data/ext/zstdlib/zstd-1.4.4/lib/common/xxhash.c +0 -882
  120. data/ext/zstdlib/zstd-1.4.4/lib/common/xxhash.h +0 -305
  121. data/ext/zstdlib/zstd-1.4.4/lib/common/zstd_internal.h +0 -350
  122. data/ext/zstdlib/zstd-1.4.4/lib/compress/huf_compress.c +0 -798
  123. data/ext/zstdlib/zstd-1.4.4/lib/compress/zstd_compress.c +0 -4103
  124. data/ext/zstdlib/zstd-1.4.4/lib/compress/zstd_lazy.c +0 -1115
  125. data/ext/zstdlib/zstd-1.4.4/lib/compress/zstd_lazy.h +0 -67
  126. data/ext/zstdlib/zstd-1.4.4/lib/compress/zstdmt_compress.h +0 -192
  127. data/ext/zstdlib/zstd-1.4.4/lib/decompress/huf_decompress.c +0 -1234
  128. data/ext/zstdlib/zstd-1.4.4/lib/decompress/zstd_decompress_block.c +0 -1323
  129. data/ext/zstdlib/zstd.mk +0 -14
@@ -1,1115 +0,0 @@
1
- /*
2
- * Copyright (c) 2016-present, 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
- #include "zstd_compress_internal.h"
12
- #include "zstd_lazy.h"
13
-
14
-
15
- /*-*************************************
16
- * Binary Tree search
17
- ***************************************/
18
-
19
- static void
20
- ZSTD_updateDUBT(ZSTD_matchState_t* ms,
21
- const BYTE* ip, const BYTE* iend,
22
- U32 mls)
23
- {
24
- const ZSTD_compressionParameters* const cParams = &ms->cParams;
25
- U32* const hashTable = ms->hashTable;
26
- U32 const hashLog = cParams->hashLog;
27
-
28
- U32* const bt = ms->chainTable;
29
- U32 const btLog = cParams->chainLog - 1;
30
- U32 const btMask = (1 << btLog) - 1;
31
-
32
- const BYTE* const base = ms->window.base;
33
- U32 const target = (U32)(ip - base);
34
- U32 idx = ms->nextToUpdate;
35
-
36
- if (idx != target)
37
- DEBUGLOG(7, "ZSTD_updateDUBT, from %u to %u (dictLimit:%u)",
38
- idx, target, ms->window.dictLimit);
39
- assert(ip + 8 <= iend); /* condition for ZSTD_hashPtr */
40
- (void)iend;
41
-
42
- assert(idx >= ms->window.dictLimit); /* condition for valid base+idx */
43
- for ( ; idx < target ; idx++) {
44
- size_t const h = ZSTD_hashPtr(base + idx, hashLog, mls); /* assumption : ip + 8 <= iend */
45
- U32 const matchIndex = hashTable[h];
46
-
47
- U32* const nextCandidatePtr = bt + 2*(idx&btMask);
48
- U32* const sortMarkPtr = nextCandidatePtr + 1;
49
-
50
- DEBUGLOG(8, "ZSTD_updateDUBT: insert %u", idx);
51
- hashTable[h] = idx; /* Update Hash Table */
52
- *nextCandidatePtr = matchIndex; /* update BT like a chain */
53
- *sortMarkPtr = ZSTD_DUBT_UNSORTED_MARK;
54
- }
55
- ms->nextToUpdate = target;
56
- }
57
-
58
-
59
- /** ZSTD_insertDUBT1() :
60
- * sort one already inserted but unsorted position
61
- * assumption : current >= btlow == (current - btmask)
62
- * doesn't fail */
63
- static void
64
- ZSTD_insertDUBT1(ZSTD_matchState_t* ms,
65
- U32 current, const BYTE* inputEnd,
66
- U32 nbCompares, U32 btLow,
67
- const ZSTD_dictMode_e dictMode)
68
- {
69
- const ZSTD_compressionParameters* const cParams = &ms->cParams;
70
- U32* const bt = ms->chainTable;
71
- U32 const btLog = cParams->chainLog - 1;
72
- U32 const btMask = (1 << btLog) - 1;
73
- size_t commonLengthSmaller=0, commonLengthLarger=0;
74
- const BYTE* const base = ms->window.base;
75
- const BYTE* const dictBase = ms->window.dictBase;
76
- const U32 dictLimit = ms->window.dictLimit;
77
- const BYTE* const ip = (current>=dictLimit) ? base + current : dictBase + current;
78
- const BYTE* const iend = (current>=dictLimit) ? inputEnd : dictBase + dictLimit;
79
- const BYTE* const dictEnd = dictBase + dictLimit;
80
- const BYTE* const prefixStart = base + dictLimit;
81
- const BYTE* match;
82
- U32* smallerPtr = bt + 2*(current&btMask);
83
- U32* largerPtr = smallerPtr + 1;
84
- U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *largerPtr contains previous unsorted candidate (which is already saved and can be overwritten) */
85
- U32 dummy32; /* to be nullified at the end */
86
- U32 const windowValid = ms->window.lowLimit;
87
- U32 const maxDistance = 1U << cParams->windowLog;
88
- U32 const windowLow = (current - windowValid > maxDistance) ? current - maxDistance : windowValid;
89
-
90
-
91
- DEBUGLOG(8, "ZSTD_insertDUBT1(%u) (dictLimit=%u, lowLimit=%u)",
92
- current, dictLimit, windowLow);
93
- assert(current >= btLow);
94
- assert(ip < iend); /* condition for ZSTD_count */
95
-
96
- while (nbCompares-- && (matchIndex > windowLow)) {
97
- U32* const nextPtr = bt + 2*(matchIndex & btMask);
98
- size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
99
- assert(matchIndex < current);
100
- /* note : all candidates are now supposed sorted,
101
- * but it's still possible to have nextPtr[1] == ZSTD_DUBT_UNSORTED_MARK
102
- * when a real index has the same value as ZSTD_DUBT_UNSORTED_MARK */
103
-
104
- if ( (dictMode != ZSTD_extDict)
105
- || (matchIndex+matchLength >= dictLimit) /* both in current segment*/
106
- || (current < dictLimit) /* both in extDict */) {
107
- const BYTE* const mBase = ( (dictMode != ZSTD_extDict)
108
- || (matchIndex+matchLength >= dictLimit)) ?
109
- base : dictBase;
110
- assert( (matchIndex+matchLength >= dictLimit) /* might be wrong if extDict is incorrectly set to 0 */
111
- || (current < dictLimit) );
112
- match = mBase + matchIndex;
113
- matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
114
- } else {
115
- match = dictBase + matchIndex;
116
- matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
117
- if (matchIndex+matchLength >= dictLimit)
118
- match = base + matchIndex; /* preparation for next read of match[matchLength] */
119
- }
120
-
121
- DEBUGLOG(8, "ZSTD_insertDUBT1: comparing %u with %u : found %u common bytes ",
122
- current, matchIndex, (U32)matchLength);
123
-
124
- if (ip+matchLength == iend) { /* equal : no way to know if inf or sup */
125
- break; /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt tree */
126
- }
127
-
128
- if (match[matchLength] < ip[matchLength]) { /* necessarily within buffer */
129
- /* match is smaller than current */
130
- *smallerPtr = matchIndex; /* update smaller idx */
131
- commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
132
- if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */
133
- DEBUGLOG(8, "ZSTD_insertDUBT1: %u (>btLow=%u) is smaller : next => %u",
134
- matchIndex, btLow, nextPtr[1]);
135
- smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
136
- matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to current */
137
- } else {
138
- /* match is larger than current */
139
- *largerPtr = matchIndex;
140
- commonLengthLarger = matchLength;
141
- if (matchIndex <= btLow) { largerPtr=&dummy32; break; } /* beyond tree size, stop searching */
142
- DEBUGLOG(8, "ZSTD_insertDUBT1: %u (>btLow=%u) is larger => %u",
143
- matchIndex, btLow, nextPtr[0]);
144
- largerPtr = nextPtr;
145
- matchIndex = nextPtr[0];
146
- } }
147
-
148
- *smallerPtr = *largerPtr = 0;
149
- }
150
-
151
-
152
- static size_t
153
- ZSTD_DUBT_findBetterDictMatch (
154
- ZSTD_matchState_t* ms,
155
- const BYTE* const ip, const BYTE* const iend,
156
- size_t* offsetPtr,
157
- size_t bestLength,
158
- U32 nbCompares,
159
- U32 const mls,
160
- const ZSTD_dictMode_e dictMode)
161
- {
162
- const ZSTD_matchState_t * const dms = ms->dictMatchState;
163
- const ZSTD_compressionParameters* const dmsCParams = &dms->cParams;
164
- const U32 * const dictHashTable = dms->hashTable;
165
- U32 const hashLog = dmsCParams->hashLog;
166
- size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
167
- U32 dictMatchIndex = dictHashTable[h];
168
-
169
- const BYTE* const base = ms->window.base;
170
- const BYTE* const prefixStart = base + ms->window.dictLimit;
171
- U32 const current = (U32)(ip-base);
172
- const BYTE* const dictBase = dms->window.base;
173
- const BYTE* const dictEnd = dms->window.nextSrc;
174
- U32 const dictHighLimit = (U32)(dms->window.nextSrc - dms->window.base);
175
- U32 const dictLowLimit = dms->window.lowLimit;
176
- U32 const dictIndexDelta = ms->window.lowLimit - dictHighLimit;
177
-
178
- U32* const dictBt = dms->chainTable;
179
- U32 const btLog = dmsCParams->chainLog - 1;
180
- U32 const btMask = (1 << btLog) - 1;
181
- U32 const btLow = (btMask >= dictHighLimit - dictLowLimit) ? dictLowLimit : dictHighLimit - btMask;
182
-
183
- size_t commonLengthSmaller=0, commonLengthLarger=0;
184
-
185
- (void)dictMode;
186
- assert(dictMode == ZSTD_dictMatchState);
187
-
188
- while (nbCompares-- && (dictMatchIndex > dictLowLimit)) {
189
- U32* const nextPtr = dictBt + 2*(dictMatchIndex & btMask);
190
- size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
191
- const BYTE* match = dictBase + dictMatchIndex;
192
- matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
193
- if (dictMatchIndex+matchLength >= dictHighLimit)
194
- match = base + dictMatchIndex + dictIndexDelta; /* to prepare for next usage of match[matchLength] */
195
-
196
- if (matchLength > bestLength) {
197
- U32 matchIndex = dictMatchIndex + dictIndexDelta;
198
- if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) ) {
199
- DEBUGLOG(9, "ZSTD_DUBT_findBetterDictMatch(%u) : found better match length %u -> %u and offsetCode %u -> %u (dictMatchIndex %u, matchIndex %u)",
200
- current, (U32)bestLength, (U32)matchLength, (U32)*offsetPtr, ZSTD_REP_MOVE + current - matchIndex, dictMatchIndex, matchIndex);
201
- bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
202
- }
203
- if (ip+matchLength == iend) { /* reached end of input : ip[matchLength] is not valid, no way to know if it's larger or smaller than match */
204
- break; /* drop, to guarantee consistency (miss a little bit of compression) */
205
- }
206
- }
207
-
208
- if (match[matchLength] < ip[matchLength]) {
209
- if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */
210
- commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
211
- dictMatchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */
212
- } else {
213
- /* match is larger than current */
214
- if (dictMatchIndex <= btLow) { break; } /* beyond tree size, stop the search */
215
- commonLengthLarger = matchLength;
216
- dictMatchIndex = nextPtr[0];
217
- }
218
- }
219
-
220
- if (bestLength >= MINMATCH) {
221
- U32 const mIndex = current - ((U32)*offsetPtr - ZSTD_REP_MOVE); (void)mIndex;
222
- DEBUGLOG(8, "ZSTD_DUBT_findBetterDictMatch(%u) : found match of length %u and offsetCode %u (pos %u)",
223
- current, (U32)bestLength, (U32)*offsetPtr, mIndex);
224
- }
225
- return bestLength;
226
-
227
- }
228
-
229
-
230
- static size_t
231
- ZSTD_DUBT_findBestMatch(ZSTD_matchState_t* ms,
232
- const BYTE* const ip, const BYTE* const iend,
233
- size_t* offsetPtr,
234
- U32 const mls,
235
- const ZSTD_dictMode_e dictMode)
236
- {
237
- const ZSTD_compressionParameters* const cParams = &ms->cParams;
238
- U32* const hashTable = ms->hashTable;
239
- U32 const hashLog = cParams->hashLog;
240
- size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
241
- U32 matchIndex = hashTable[h];
242
-
243
- const BYTE* const base = ms->window.base;
244
- U32 const current = (U32)(ip-base);
245
- U32 const windowLow = ZSTD_getLowestMatchIndex(ms, current, cParams->windowLog);
246
-
247
- U32* const bt = ms->chainTable;
248
- U32 const btLog = cParams->chainLog - 1;
249
- U32 const btMask = (1 << btLog) - 1;
250
- U32 const btLow = (btMask >= current) ? 0 : current - btMask;
251
- U32 const unsortLimit = MAX(btLow, windowLow);
252
-
253
- U32* nextCandidate = bt + 2*(matchIndex&btMask);
254
- U32* unsortedMark = bt + 2*(matchIndex&btMask) + 1;
255
- U32 nbCompares = 1U << cParams->searchLog;
256
- U32 nbCandidates = nbCompares;
257
- U32 previousCandidate = 0;
258
-
259
- DEBUGLOG(7, "ZSTD_DUBT_findBestMatch (%u) ", current);
260
- assert(ip <= iend-8); /* required for h calculation */
261
-
262
- /* reach end of unsorted candidates list */
263
- while ( (matchIndex > unsortLimit)
264
- && (*unsortedMark == ZSTD_DUBT_UNSORTED_MARK)
265
- && (nbCandidates > 1) ) {
266
- DEBUGLOG(8, "ZSTD_DUBT_findBestMatch: candidate %u is unsorted",
267
- matchIndex);
268
- *unsortedMark = previousCandidate; /* the unsortedMark becomes a reversed chain, to move up back to original position */
269
- previousCandidate = matchIndex;
270
- matchIndex = *nextCandidate;
271
- nextCandidate = bt + 2*(matchIndex&btMask);
272
- unsortedMark = bt + 2*(matchIndex&btMask) + 1;
273
- nbCandidates --;
274
- }
275
-
276
- /* nullify last candidate if it's still unsorted
277
- * simplification, detrimental to compression ratio, beneficial for speed */
278
- if ( (matchIndex > unsortLimit)
279
- && (*unsortedMark==ZSTD_DUBT_UNSORTED_MARK) ) {
280
- DEBUGLOG(7, "ZSTD_DUBT_findBestMatch: nullify last unsorted candidate %u",
281
- matchIndex);
282
- *nextCandidate = *unsortedMark = 0;
283
- }
284
-
285
- /* batch sort stacked candidates */
286
- matchIndex = previousCandidate;
287
- while (matchIndex) { /* will end on matchIndex == 0 */
288
- U32* const nextCandidateIdxPtr = bt + 2*(matchIndex&btMask) + 1;
289
- U32 const nextCandidateIdx = *nextCandidateIdxPtr;
290
- ZSTD_insertDUBT1(ms, matchIndex, iend,
291
- nbCandidates, unsortLimit, dictMode);
292
- matchIndex = nextCandidateIdx;
293
- nbCandidates++;
294
- }
295
-
296
- /* find longest match */
297
- { size_t commonLengthSmaller = 0, commonLengthLarger = 0;
298
- const BYTE* const dictBase = ms->window.dictBase;
299
- const U32 dictLimit = ms->window.dictLimit;
300
- const BYTE* const dictEnd = dictBase + dictLimit;
301
- const BYTE* const prefixStart = base + dictLimit;
302
- U32* smallerPtr = bt + 2*(current&btMask);
303
- U32* largerPtr = bt + 2*(current&btMask) + 1;
304
- U32 matchEndIdx = current + 8 + 1;
305
- U32 dummy32; /* to be nullified at the end */
306
- size_t bestLength = 0;
307
-
308
- matchIndex = hashTable[h];
309
- hashTable[h] = current; /* Update Hash Table */
310
-
311
- while (nbCompares-- && (matchIndex > windowLow)) {
312
- U32* const nextPtr = bt + 2*(matchIndex & btMask);
313
- size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
314
- const BYTE* match;
315
-
316
- if ((dictMode != ZSTD_extDict) || (matchIndex+matchLength >= dictLimit)) {
317
- match = base + matchIndex;
318
- matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
319
- } else {
320
- match = dictBase + matchIndex;
321
- matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
322
- if (matchIndex+matchLength >= dictLimit)
323
- match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
324
- }
325
-
326
- if (matchLength > bestLength) {
327
- if (matchLength > matchEndIdx - matchIndex)
328
- matchEndIdx = matchIndex + (U32)matchLength;
329
- if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) )
330
- bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
331
- if (ip+matchLength == iend) { /* equal : no way to know if inf or sup */
332
- if (dictMode == ZSTD_dictMatchState) {
333
- nbCompares = 0; /* in addition to avoiding checking any
334
- * further in this loop, make sure we
335
- * skip checking in the dictionary. */
336
- }
337
- break; /* drop, to guarantee consistency (miss a little bit of compression) */
338
- }
339
- }
340
-
341
- if (match[matchLength] < ip[matchLength]) {
342
- /* match is smaller than current */
343
- *smallerPtr = matchIndex; /* update smaller idx */
344
- commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
345
- if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */
346
- smallerPtr = nextPtr+1; /* new "smaller" => larger of match */
347
- matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */
348
- } else {
349
- /* match is larger than current */
350
- *largerPtr = matchIndex;
351
- commonLengthLarger = matchLength;
352
- if (matchIndex <= btLow) { largerPtr=&dummy32; break; } /* beyond tree size, stop the search */
353
- largerPtr = nextPtr;
354
- matchIndex = nextPtr[0];
355
- } }
356
-
357
- *smallerPtr = *largerPtr = 0;
358
-
359
- if (dictMode == ZSTD_dictMatchState && nbCompares) {
360
- bestLength = ZSTD_DUBT_findBetterDictMatch(
361
- ms, ip, iend,
362
- offsetPtr, bestLength, nbCompares,
363
- mls, dictMode);
364
- }
365
-
366
- assert(matchEndIdx > current+8); /* ensure nextToUpdate is increased */
367
- ms->nextToUpdate = matchEndIdx - 8; /* skip repetitive patterns */
368
- if (bestLength >= MINMATCH) {
369
- U32 const mIndex = current - ((U32)*offsetPtr - ZSTD_REP_MOVE); (void)mIndex;
370
- DEBUGLOG(8, "ZSTD_DUBT_findBestMatch(%u) : found match of length %u and offsetCode %u (pos %u)",
371
- current, (U32)bestLength, (U32)*offsetPtr, mIndex);
372
- }
373
- return bestLength;
374
- }
375
- }
376
-
377
-
378
- /** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
379
- FORCE_INLINE_TEMPLATE size_t
380
- ZSTD_BtFindBestMatch( ZSTD_matchState_t* ms,
381
- const BYTE* const ip, const BYTE* const iLimit,
382
- size_t* offsetPtr,
383
- const U32 mls /* template */,
384
- const ZSTD_dictMode_e dictMode)
385
- {
386
- DEBUGLOG(7, "ZSTD_BtFindBestMatch");
387
- if (ip < ms->window.base + ms->nextToUpdate) return 0; /* skipped area */
388
- ZSTD_updateDUBT(ms, ip, iLimit, mls);
389
- return ZSTD_DUBT_findBestMatch(ms, ip, iLimit, offsetPtr, mls, dictMode);
390
- }
391
-
392
-
393
- static size_t
394
- ZSTD_BtFindBestMatch_selectMLS ( ZSTD_matchState_t* ms,
395
- const BYTE* ip, const BYTE* const iLimit,
396
- size_t* offsetPtr)
397
- {
398
- switch(ms->cParams.minMatch)
399
- {
400
- default : /* includes case 3 */
401
- case 4 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 4, ZSTD_noDict);
402
- case 5 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 5, ZSTD_noDict);
403
- case 7 :
404
- case 6 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 6, ZSTD_noDict);
405
- }
406
- }
407
-
408
-
409
- static size_t ZSTD_BtFindBestMatch_dictMatchState_selectMLS (
410
- ZSTD_matchState_t* ms,
411
- const BYTE* ip, const BYTE* const iLimit,
412
- size_t* offsetPtr)
413
- {
414
- switch(ms->cParams.minMatch)
415
- {
416
- default : /* includes case 3 */
417
- case 4 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 4, ZSTD_dictMatchState);
418
- case 5 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 5, ZSTD_dictMatchState);
419
- case 7 :
420
- case 6 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 6, ZSTD_dictMatchState);
421
- }
422
- }
423
-
424
-
425
- static size_t ZSTD_BtFindBestMatch_extDict_selectMLS (
426
- ZSTD_matchState_t* ms,
427
- const BYTE* ip, const BYTE* const iLimit,
428
- size_t* offsetPtr)
429
- {
430
- switch(ms->cParams.minMatch)
431
- {
432
- default : /* includes case 3 */
433
- case 4 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 4, ZSTD_extDict);
434
- case 5 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 5, ZSTD_extDict);
435
- case 7 :
436
- case 6 : return ZSTD_BtFindBestMatch(ms, ip, iLimit, offsetPtr, 6, ZSTD_extDict);
437
- }
438
- }
439
-
440
-
441
-
442
- /* *********************************
443
- * Hash Chain
444
- ***********************************/
445
- #define NEXT_IN_CHAIN(d, mask) chainTable[(d) & (mask)]
446
-
447
- /* Update chains up to ip (excluded)
448
- Assumption : always within prefix (i.e. not within extDict) */
449
- static U32 ZSTD_insertAndFindFirstIndex_internal(
450
- ZSTD_matchState_t* ms,
451
- const ZSTD_compressionParameters* const cParams,
452
- const BYTE* ip, U32 const mls)
453
- {
454
- U32* const hashTable = ms->hashTable;
455
- const U32 hashLog = cParams->hashLog;
456
- U32* const chainTable = ms->chainTable;
457
- const U32 chainMask = (1 << cParams->chainLog) - 1;
458
- const BYTE* const base = ms->window.base;
459
- const U32 target = (U32)(ip - base);
460
- U32 idx = ms->nextToUpdate;
461
-
462
- while(idx < target) { /* catch up */
463
- size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
464
- NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
465
- hashTable[h] = idx;
466
- idx++;
467
- }
468
-
469
- ms->nextToUpdate = target;
470
- return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
471
- }
472
-
473
- U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip) {
474
- const ZSTD_compressionParameters* const cParams = &ms->cParams;
475
- return ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, ms->cParams.minMatch);
476
- }
477
-
478
-
479
- /* inlining is important to hardwire a hot branch (template emulation) */
480
- FORCE_INLINE_TEMPLATE
481
- size_t ZSTD_HcFindBestMatch_generic (
482
- ZSTD_matchState_t* ms,
483
- const BYTE* const ip, const BYTE* const iLimit,
484
- size_t* offsetPtr,
485
- const U32 mls, const ZSTD_dictMode_e dictMode)
486
- {
487
- const ZSTD_compressionParameters* const cParams = &ms->cParams;
488
- U32* const chainTable = ms->chainTable;
489
- const U32 chainSize = (1 << cParams->chainLog);
490
- const U32 chainMask = chainSize-1;
491
- const BYTE* const base = ms->window.base;
492
- const BYTE* const dictBase = ms->window.dictBase;
493
- const U32 dictLimit = ms->window.dictLimit;
494
- const BYTE* const prefixStart = base + dictLimit;
495
- const BYTE* const dictEnd = dictBase + dictLimit;
496
- const U32 current = (U32)(ip-base);
497
- const U32 maxDistance = 1U << cParams->windowLog;
498
- const U32 lowestValid = ms->window.lowLimit;
499
- const U32 withinMaxDistance = (current - lowestValid > maxDistance) ? current - maxDistance : lowestValid;
500
- const U32 isDictionary = (ms->loadedDictEnd != 0);
501
- const U32 lowLimit = isDictionary ? lowestValid : withinMaxDistance;
502
- const U32 minChain = current > chainSize ? current - chainSize : 0;
503
- U32 nbAttempts = 1U << cParams->searchLog;
504
- size_t ml=4-1;
505
-
506
- /* HC4 match finder */
507
- U32 matchIndex = ZSTD_insertAndFindFirstIndex_internal(ms, cParams, ip, mls);
508
-
509
- for ( ; (matchIndex>lowLimit) & (nbAttempts>0) ; nbAttempts--) {
510
- size_t currentMl=0;
511
- if ((dictMode != ZSTD_extDict) || matchIndex >= dictLimit) {
512
- const BYTE* const match = base + matchIndex;
513
- assert(matchIndex >= dictLimit); /* ensures this is true if dictMode != ZSTD_extDict */
514
- if (match[ml] == ip[ml]) /* potentially better */
515
- currentMl = ZSTD_count(ip, match, iLimit);
516
- } else {
517
- const BYTE* const match = dictBase + matchIndex;
518
- assert(match+4 <= dictEnd);
519
- if (MEM_read32(match) == MEM_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
520
- currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;
521
- }
522
-
523
- /* save best solution */
524
- if (currentMl > ml) {
525
- ml = currentMl;
526
- *offsetPtr = current - matchIndex + ZSTD_REP_MOVE;
527
- if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */
528
- }
529
-
530
- if (matchIndex <= minChain) break;
531
- matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
532
- }
533
-
534
- if (dictMode == ZSTD_dictMatchState) {
535
- const ZSTD_matchState_t* const dms = ms->dictMatchState;
536
- const U32* const dmsChainTable = dms->chainTable;
537
- const U32 dmsChainSize = (1 << dms->cParams.chainLog);
538
- const U32 dmsChainMask = dmsChainSize - 1;
539
- const U32 dmsLowestIndex = dms->window.dictLimit;
540
- const BYTE* const dmsBase = dms->window.base;
541
- const BYTE* const dmsEnd = dms->window.nextSrc;
542
- const U32 dmsSize = (U32)(dmsEnd - dmsBase);
543
- const U32 dmsIndexDelta = dictLimit - dmsSize;
544
- const U32 dmsMinChain = dmsSize > dmsChainSize ? dmsSize - dmsChainSize : 0;
545
-
546
- matchIndex = dms->hashTable[ZSTD_hashPtr(ip, dms->cParams.hashLog, mls)];
547
-
548
- for ( ; (matchIndex>dmsLowestIndex) & (nbAttempts>0) ; nbAttempts--) {
549
- size_t currentMl=0;
550
- const BYTE* const match = dmsBase + matchIndex;
551
- assert(match+4 <= dmsEnd);
552
- if (MEM_read32(match) == MEM_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
553
- currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dmsEnd, prefixStart) + 4;
554
-
555
- /* save best solution */
556
- if (currentMl > ml) {
557
- ml = currentMl;
558
- *offsetPtr = current - (matchIndex + dmsIndexDelta) + ZSTD_REP_MOVE;
559
- if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */
560
- }
561
-
562
- if (matchIndex <= dmsMinChain) break;
563
- matchIndex = dmsChainTable[matchIndex & dmsChainMask];
564
- }
565
- }
566
-
567
- return ml;
568
- }
569
-
570
-
571
- FORCE_INLINE_TEMPLATE size_t ZSTD_HcFindBestMatch_selectMLS (
572
- ZSTD_matchState_t* ms,
573
- const BYTE* ip, const BYTE* const iLimit,
574
- size_t* offsetPtr)
575
- {
576
- switch(ms->cParams.minMatch)
577
- {
578
- default : /* includes case 3 */
579
- case 4 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 4, ZSTD_noDict);
580
- case 5 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 5, ZSTD_noDict);
581
- case 7 :
582
- case 6 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 6, ZSTD_noDict);
583
- }
584
- }
585
-
586
-
587
- static size_t ZSTD_HcFindBestMatch_dictMatchState_selectMLS (
588
- ZSTD_matchState_t* ms,
589
- const BYTE* ip, const BYTE* const iLimit,
590
- size_t* offsetPtr)
591
- {
592
- switch(ms->cParams.minMatch)
593
- {
594
- default : /* includes case 3 */
595
- case 4 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 4, ZSTD_dictMatchState);
596
- case 5 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 5, ZSTD_dictMatchState);
597
- case 7 :
598
- case 6 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 6, ZSTD_dictMatchState);
599
- }
600
- }
601
-
602
-
603
- FORCE_INLINE_TEMPLATE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
604
- ZSTD_matchState_t* ms,
605
- const BYTE* ip, const BYTE* const iLimit,
606
- size_t* offsetPtr)
607
- {
608
- switch(ms->cParams.minMatch)
609
- {
610
- default : /* includes case 3 */
611
- case 4 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 4, ZSTD_extDict);
612
- case 5 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 5, ZSTD_extDict);
613
- case 7 :
614
- case 6 : return ZSTD_HcFindBestMatch_generic(ms, ip, iLimit, offsetPtr, 6, ZSTD_extDict);
615
- }
616
- }
617
-
618
-
619
- /* *******************************
620
- * Common parser - lazy strategy
621
- *********************************/
622
- typedef enum { search_hashChain, search_binaryTree } searchMethod_e;
623
-
624
- FORCE_INLINE_TEMPLATE size_t
625
- ZSTD_compressBlock_lazy_generic(
626
- ZSTD_matchState_t* ms, seqStore_t* seqStore,
627
- U32 rep[ZSTD_REP_NUM],
628
- const void* src, size_t srcSize,
629
- const searchMethod_e searchMethod, const U32 depth,
630
- ZSTD_dictMode_e const dictMode)
631
- {
632
- const BYTE* const istart = (const BYTE*)src;
633
- const BYTE* ip = istart;
634
- const BYTE* anchor = istart;
635
- const BYTE* const iend = istart + srcSize;
636
- const BYTE* const ilimit = iend - 8;
637
- const BYTE* const base = ms->window.base;
638
- const U32 prefixLowestIndex = ms->window.dictLimit;
639
- const BYTE* const prefixLowest = base + prefixLowestIndex;
640
-
641
- typedef size_t (*searchMax_f)(
642
- ZSTD_matchState_t* ms,
643
- const BYTE* ip, const BYTE* iLimit, size_t* offsetPtr);
644
- searchMax_f const searchMax = dictMode == ZSTD_dictMatchState ?
645
- (searchMethod==search_binaryTree ? ZSTD_BtFindBestMatch_dictMatchState_selectMLS
646
- : ZSTD_HcFindBestMatch_dictMatchState_selectMLS) :
647
- (searchMethod==search_binaryTree ? ZSTD_BtFindBestMatch_selectMLS
648
- : ZSTD_HcFindBestMatch_selectMLS);
649
- U32 offset_1 = rep[0], offset_2 = rep[1], savedOffset=0;
650
-
651
- const ZSTD_matchState_t* const dms = ms->dictMatchState;
652
- const U32 dictLowestIndex = dictMode == ZSTD_dictMatchState ?
653
- dms->window.dictLimit : 0;
654
- const BYTE* const dictBase = dictMode == ZSTD_dictMatchState ?
655
- dms->window.base : NULL;
656
- const BYTE* const dictLowest = dictMode == ZSTD_dictMatchState ?
657
- dictBase + dictLowestIndex : NULL;
658
- const BYTE* const dictEnd = dictMode == ZSTD_dictMatchState ?
659
- dms->window.nextSrc : NULL;
660
- const U32 dictIndexDelta = dictMode == ZSTD_dictMatchState ?
661
- prefixLowestIndex - (U32)(dictEnd - dictBase) :
662
- 0;
663
- const U32 dictAndPrefixLength = (U32)(ip - prefixLowest + dictEnd - dictLowest);
664
-
665
- /* init */
666
- ip += (dictAndPrefixLength == 0);
667
- if (dictMode == ZSTD_noDict) {
668
- U32 const maxRep = (U32)(ip - prefixLowest);
669
- if (offset_2 > maxRep) savedOffset = offset_2, offset_2 = 0;
670
- if (offset_1 > maxRep) savedOffset = offset_1, offset_1 = 0;
671
- }
672
- if (dictMode == ZSTD_dictMatchState) {
673
- /* dictMatchState repCode checks don't currently handle repCode == 0
674
- * disabling. */
675
- assert(offset_1 <= dictAndPrefixLength);
676
- assert(offset_2 <= dictAndPrefixLength);
677
- }
678
-
679
- /* Match Loop */
680
- while (ip < ilimit) {
681
- size_t matchLength=0;
682
- size_t offset=0;
683
- const BYTE* start=ip+1;
684
-
685
- /* check repCode */
686
- if (dictMode == ZSTD_dictMatchState) {
687
- const U32 repIndex = (U32)(ip - base) + 1 - offset_1;
688
- const BYTE* repMatch = (dictMode == ZSTD_dictMatchState
689
- && repIndex < prefixLowestIndex) ?
690
- dictBase + (repIndex - dictIndexDelta) :
691
- base + repIndex;
692
- if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
693
- && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
694
- const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
695
- matchLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
696
- if (depth==0) goto _storeSequence;
697
- }
698
- }
699
- if ( dictMode == ZSTD_noDict
700
- && ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1)))) {
701
- matchLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
702
- if (depth==0) goto _storeSequence;
703
- }
704
-
705
- /* first search (depth 0) */
706
- { size_t offsetFound = 999999999;
707
- size_t const ml2 = searchMax(ms, ip, iend, &offsetFound);
708
- if (ml2 > matchLength)
709
- matchLength = ml2, start = ip, offset=offsetFound;
710
- }
711
-
712
- if (matchLength < 4) {
713
- ip += ((ip-anchor) >> kSearchStrength) + 1; /* jump faster over incompressible sections */
714
- continue;
715
- }
716
-
717
- /* let's try to find a better solution */
718
- if (depth>=1)
719
- while (ip<ilimit) {
720
- ip ++;
721
- if ( (dictMode == ZSTD_noDict)
722
- && (offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
723
- size_t const mlRep = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
724
- int const gain2 = (int)(mlRep * 3);
725
- int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
726
- if ((mlRep >= 4) && (gain2 > gain1))
727
- matchLength = mlRep, offset = 0, start = ip;
728
- }
729
- if (dictMode == ZSTD_dictMatchState) {
730
- const U32 repIndex = (U32)(ip - base) - offset_1;
731
- const BYTE* repMatch = repIndex < prefixLowestIndex ?
732
- dictBase + (repIndex - dictIndexDelta) :
733
- base + repIndex;
734
- if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
735
- && (MEM_read32(repMatch) == MEM_read32(ip)) ) {
736
- const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
737
- size_t const mlRep = ZSTD_count_2segments(ip+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
738
- int const gain2 = (int)(mlRep * 3);
739
- int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
740
- if ((mlRep >= 4) && (gain2 > gain1))
741
- matchLength = mlRep, offset = 0, start = ip;
742
- }
743
- }
744
- { size_t offset2=999999999;
745
- size_t const ml2 = searchMax(ms, ip, iend, &offset2);
746
- int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1)); /* raw approx */
747
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
748
- if ((ml2 >= 4) && (gain2 > gain1)) {
749
- matchLength = ml2, offset = offset2, start = ip;
750
- continue; /* search a better one */
751
- } }
752
-
753
- /* let's find an even better one */
754
- if ((depth==2) && (ip<ilimit)) {
755
- ip ++;
756
- if ( (dictMode == ZSTD_noDict)
757
- && (offset) && ((offset_1>0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
758
- size_t const mlRep = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
759
- int const gain2 = (int)(mlRep * 4);
760
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
761
- if ((mlRep >= 4) && (gain2 > gain1))
762
- matchLength = mlRep, offset = 0, start = ip;
763
- }
764
- if (dictMode == ZSTD_dictMatchState) {
765
- const U32 repIndex = (U32)(ip - base) - offset_1;
766
- const BYTE* repMatch = repIndex < prefixLowestIndex ?
767
- dictBase + (repIndex - dictIndexDelta) :
768
- base + repIndex;
769
- if (((U32)((prefixLowestIndex-1) - repIndex) >= 3 /* intentional underflow */)
770
- && (MEM_read32(repMatch) == MEM_read32(ip)) ) {
771
- const BYTE* repMatchEnd = repIndex < prefixLowestIndex ? dictEnd : iend;
772
- size_t const mlRep = ZSTD_count_2segments(ip+4, repMatch+4, iend, repMatchEnd, prefixLowest) + 4;
773
- int const gain2 = (int)(mlRep * 4);
774
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
775
- if ((mlRep >= 4) && (gain2 > gain1))
776
- matchLength = mlRep, offset = 0, start = ip;
777
- }
778
- }
779
- { size_t offset2=999999999;
780
- size_t const ml2 = searchMax(ms, ip, iend, &offset2);
781
- int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1)); /* raw approx */
782
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
783
- if ((ml2 >= 4) && (gain2 > gain1)) {
784
- matchLength = ml2, offset = offset2, start = ip;
785
- continue;
786
- } } }
787
- break; /* nothing found : store previous solution */
788
- }
789
-
790
- /* NOTE:
791
- * start[-offset+ZSTD_REP_MOVE-1] is undefined behavior.
792
- * (-offset+ZSTD_REP_MOVE-1) is unsigned, and is added to start, which
793
- * overflows the pointer, which is undefined behavior.
794
- */
795
- /* catch up */
796
- if (offset) {
797
- if (dictMode == ZSTD_noDict) {
798
- while ( ((start > anchor) & (start - (offset-ZSTD_REP_MOVE) > prefixLowest))
799
- && (start[-1] == (start-(offset-ZSTD_REP_MOVE))[-1]) ) /* only search for offset within prefix */
800
- { start--; matchLength++; }
801
- }
802
- if (dictMode == ZSTD_dictMatchState) {
803
- U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
804
- const BYTE* match = (matchIndex < prefixLowestIndex) ? dictBase + matchIndex - dictIndexDelta : base + matchIndex;
805
- const BYTE* const mStart = (matchIndex < prefixLowestIndex) ? dictLowest : prefixLowest;
806
- while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; } /* catch up */
807
- }
808
- offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
809
- }
810
- /* store sequence */
811
- _storeSequence:
812
- { size_t const litLength = start - anchor;
813
- ZSTD_storeSeq(seqStore, litLength, anchor, iend, (U32)offset, matchLength-MINMATCH);
814
- anchor = ip = start + matchLength;
815
- }
816
-
817
- /* check immediate repcode */
818
- if (dictMode == ZSTD_dictMatchState) {
819
- while (ip <= ilimit) {
820
- U32 const current2 = (U32)(ip-base);
821
- U32 const repIndex = current2 - offset_2;
822
- const BYTE* repMatch = dictMode == ZSTD_dictMatchState
823
- && repIndex < prefixLowestIndex ?
824
- dictBase - dictIndexDelta + repIndex :
825
- base + repIndex;
826
- if ( ((U32)((prefixLowestIndex-1) - (U32)repIndex) >= 3 /* intentional overflow */)
827
- && (MEM_read32(repMatch) == MEM_read32(ip)) ) {
828
- const BYTE* const repEnd2 = repIndex < prefixLowestIndex ? dictEnd : iend;
829
- matchLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd2, prefixLowest) + 4;
830
- offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap offset_2 <=> offset_1 */
831
- ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, matchLength-MINMATCH);
832
- ip += matchLength;
833
- anchor = ip;
834
- continue;
835
- }
836
- break;
837
- }
838
- }
839
-
840
- if (dictMode == ZSTD_noDict) {
841
- while ( ((ip <= ilimit) & (offset_2>0))
842
- && (MEM_read32(ip) == MEM_read32(ip - offset_2)) ) {
843
- /* store sequence */
844
- matchLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
845
- offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
846
- ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, matchLength-MINMATCH);
847
- ip += matchLength;
848
- anchor = ip;
849
- continue; /* faster when present ... (?) */
850
- } } }
851
-
852
- /* Save reps for next block */
853
- rep[0] = offset_1 ? offset_1 : savedOffset;
854
- rep[1] = offset_2 ? offset_2 : savedOffset;
855
-
856
- /* Return the last literals size */
857
- return (size_t)(iend - anchor);
858
- }
859
-
860
-
861
- size_t ZSTD_compressBlock_btlazy2(
862
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
863
- void const* src, size_t srcSize)
864
- {
865
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_binaryTree, 2, ZSTD_noDict);
866
- }
867
-
868
- size_t ZSTD_compressBlock_lazy2(
869
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
870
- void const* src, size_t srcSize)
871
- {
872
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 2, ZSTD_noDict);
873
- }
874
-
875
- size_t ZSTD_compressBlock_lazy(
876
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
877
- void const* src, size_t srcSize)
878
- {
879
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 1, ZSTD_noDict);
880
- }
881
-
882
- size_t ZSTD_compressBlock_greedy(
883
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
884
- void const* src, size_t srcSize)
885
- {
886
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 0, ZSTD_noDict);
887
- }
888
-
889
- size_t ZSTD_compressBlock_btlazy2_dictMatchState(
890
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
891
- void const* src, size_t srcSize)
892
- {
893
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_binaryTree, 2, ZSTD_dictMatchState);
894
- }
895
-
896
- size_t ZSTD_compressBlock_lazy2_dictMatchState(
897
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
898
- void const* src, size_t srcSize)
899
- {
900
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 2, ZSTD_dictMatchState);
901
- }
902
-
903
- size_t ZSTD_compressBlock_lazy_dictMatchState(
904
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
905
- void const* src, size_t srcSize)
906
- {
907
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 1, ZSTD_dictMatchState);
908
- }
909
-
910
- size_t ZSTD_compressBlock_greedy_dictMatchState(
911
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
912
- void const* src, size_t srcSize)
913
- {
914
- return ZSTD_compressBlock_lazy_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 0, ZSTD_dictMatchState);
915
- }
916
-
917
-
918
- FORCE_INLINE_TEMPLATE
919
- size_t ZSTD_compressBlock_lazy_extDict_generic(
920
- ZSTD_matchState_t* ms, seqStore_t* seqStore,
921
- U32 rep[ZSTD_REP_NUM],
922
- const void* src, size_t srcSize,
923
- const searchMethod_e searchMethod, const U32 depth)
924
- {
925
- const BYTE* const istart = (const BYTE*)src;
926
- const BYTE* ip = istart;
927
- const BYTE* anchor = istart;
928
- const BYTE* const iend = istart + srcSize;
929
- const BYTE* const ilimit = iend - 8;
930
- const BYTE* const base = ms->window.base;
931
- const U32 dictLimit = ms->window.dictLimit;
932
- const U32 lowestIndex = ms->window.lowLimit;
933
- const BYTE* const prefixStart = base + dictLimit;
934
- const BYTE* const dictBase = ms->window.dictBase;
935
- const BYTE* const dictEnd = dictBase + dictLimit;
936
- const BYTE* const dictStart = dictBase + lowestIndex;
937
-
938
- typedef size_t (*searchMax_f)(
939
- ZSTD_matchState_t* ms,
940
- const BYTE* ip, const BYTE* iLimit, size_t* offsetPtr);
941
- searchMax_f searchMax = searchMethod==search_binaryTree ? ZSTD_BtFindBestMatch_extDict_selectMLS : ZSTD_HcFindBestMatch_extDict_selectMLS;
942
-
943
- U32 offset_1 = rep[0], offset_2 = rep[1];
944
-
945
- /* init */
946
- ip += (ip == prefixStart);
947
-
948
- /* Match Loop */
949
- while (ip < ilimit) {
950
- size_t matchLength=0;
951
- size_t offset=0;
952
- const BYTE* start=ip+1;
953
- U32 current = (U32)(ip-base);
954
-
955
- /* check repCode */
956
- { const U32 repIndex = (U32)(current+1 - offset_1);
957
- const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
958
- const BYTE* const repMatch = repBase + repIndex;
959
- if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
960
- if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
961
- /* repcode detected we should take it */
962
- const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
963
- matchLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repEnd, prefixStart) + 4;
964
- if (depth==0) goto _storeSequence;
965
- } }
966
-
967
- /* first search (depth 0) */
968
- { size_t offsetFound = 999999999;
969
- size_t const ml2 = searchMax(ms, ip, iend, &offsetFound);
970
- if (ml2 > matchLength)
971
- matchLength = ml2, start = ip, offset=offsetFound;
972
- }
973
-
974
- if (matchLength < 4) {
975
- ip += ((ip-anchor) >> kSearchStrength) + 1; /* jump faster over incompressible sections */
976
- continue;
977
- }
978
-
979
- /* let's try to find a better solution */
980
- if (depth>=1)
981
- while (ip<ilimit) {
982
- ip ++;
983
- current++;
984
- /* check repCode */
985
- if (offset) {
986
- const U32 repIndex = (U32)(current - offset_1);
987
- const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
988
- const BYTE* const repMatch = repBase + repIndex;
989
- if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
990
- if (MEM_read32(ip) == MEM_read32(repMatch)) {
991
- /* repcode detected */
992
- const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
993
- size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
994
- int const gain2 = (int)(repLength * 3);
995
- int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
996
- if ((repLength >= 4) && (gain2 > gain1))
997
- matchLength = repLength, offset = 0, start = ip;
998
- } }
999
-
1000
- /* search match, depth 1 */
1001
- { size_t offset2=999999999;
1002
- size_t const ml2 = searchMax(ms, ip, iend, &offset2);
1003
- int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1)); /* raw approx */
1004
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
1005
- if ((ml2 >= 4) && (gain2 > gain1)) {
1006
- matchLength = ml2, offset = offset2, start = ip;
1007
- continue; /* search a better one */
1008
- } }
1009
-
1010
- /* let's find an even better one */
1011
- if ((depth==2) && (ip<ilimit)) {
1012
- ip ++;
1013
- current++;
1014
- /* check repCode */
1015
- if (offset) {
1016
- const U32 repIndex = (U32)(current - offset_1);
1017
- const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1018
- const BYTE* const repMatch = repBase + repIndex;
1019
- if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
1020
- if (MEM_read32(ip) == MEM_read32(repMatch)) {
1021
- /* repcode detected */
1022
- const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
1023
- size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
1024
- int const gain2 = (int)(repLength * 4);
1025
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
1026
- if ((repLength >= 4) && (gain2 > gain1))
1027
- matchLength = repLength, offset = 0, start = ip;
1028
- } }
1029
-
1030
- /* search match, depth 2 */
1031
- { size_t offset2=999999999;
1032
- size_t const ml2 = searchMax(ms, ip, iend, &offset2);
1033
- int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1)); /* raw approx */
1034
- int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
1035
- if ((ml2 >= 4) && (gain2 > gain1)) {
1036
- matchLength = ml2, offset = offset2, start = ip;
1037
- continue;
1038
- } } }
1039
- break; /* nothing found : store previous solution */
1040
- }
1041
-
1042
- /* catch up */
1043
- if (offset) {
1044
- U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
1045
- const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
1046
- const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
1047
- while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; } /* catch up */
1048
- offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
1049
- }
1050
-
1051
- /* store sequence */
1052
- _storeSequence:
1053
- { size_t const litLength = start - anchor;
1054
- ZSTD_storeSeq(seqStore, litLength, anchor, iend, (U32)offset, matchLength-MINMATCH);
1055
- anchor = ip = start + matchLength;
1056
- }
1057
-
1058
- /* check immediate repcode */
1059
- while (ip <= ilimit) {
1060
- const U32 repIndex = (U32)((ip-base) - offset_2);
1061
- const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
1062
- const BYTE* const repMatch = repBase + repIndex;
1063
- if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
1064
- if (MEM_read32(ip) == MEM_read32(repMatch)) {
1065
- /* repcode detected we should take it */
1066
- const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
1067
- matchLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
1068
- offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap offset history */
1069
- ZSTD_storeSeq(seqStore, 0, anchor, iend, 0, matchLength-MINMATCH);
1070
- ip += matchLength;
1071
- anchor = ip;
1072
- continue; /* faster when present ... (?) */
1073
- }
1074
- break;
1075
- } }
1076
-
1077
- /* Save reps for next block */
1078
- rep[0] = offset_1;
1079
- rep[1] = offset_2;
1080
-
1081
- /* Return the last literals size */
1082
- return (size_t)(iend - anchor);
1083
- }
1084
-
1085
-
1086
- size_t ZSTD_compressBlock_greedy_extDict(
1087
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
1088
- void const* src, size_t srcSize)
1089
- {
1090
- return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 0);
1091
- }
1092
-
1093
- size_t ZSTD_compressBlock_lazy_extDict(
1094
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
1095
- void const* src, size_t srcSize)
1096
-
1097
- {
1098
- return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 1);
1099
- }
1100
-
1101
- size_t ZSTD_compressBlock_lazy2_extDict(
1102
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
1103
- void const* src, size_t srcSize)
1104
-
1105
- {
1106
- return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_hashChain, 2);
1107
- }
1108
-
1109
- size_t ZSTD_compressBlock_btlazy2_extDict(
1110
- ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
1111
- void const* src, size_t srcSize)
1112
-
1113
- {
1114
- return ZSTD_compressBlock_lazy_extDict_generic(ms, seqStore, rep, src, srcSize, search_binaryTree, 2);
1115
- }