]>
Commit | Line | Data |
---|---|---|
0d2711a6 LG |
1 | /** @file\r |
2 | Based on LZMA SDK 4.65:\r | |
3 | LzmaEnc.c -- LZMA Encoder\r | |
4 | 2009-02-02 : Igor Pavlov : Public domain\r | |
5 | \r | |
5aec6991 | 6 | Copyright (c) 2011 - 2016, Intel Corporation. All rights reserved.<BR>\r |
0d2711a6 LG |
7 | This program and the accompanying materials\r |
8 | are licensed and made available under the terms and conditions of the BSD License\r | |
9 | which accompanies this distribution. The full text of the license may be found at\r | |
10 | http://opensource.org/licenses/bsd-license.php\r | |
11 | \r | |
12 | THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r | |
13 | WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\r | |
14 | \r | |
15 | **/\r | |
30fdf114 LG |
16 | \r |
17 | #include <string.h>\r | |
18 | \r | |
19 | /* #define SHOW_STAT */\r | |
20 | /* #define SHOW_STAT2 */\r | |
21 | \r | |
22 | #if defined(SHOW_STAT) || defined(SHOW_STAT2)\r | |
23 | #include <stdio.h>\r | |
24 | #endif\r | |
25 | \r | |
26 | #include "LzmaEnc.h"\r | |
27 | \r | |
28 | #include "LzFind.h"\r | |
29 | #ifdef COMPRESS_MF_MT\r | |
30 | #include "LzFindMt.h"\r | |
31 | #endif\r | |
32 | \r | |
33 | #ifdef SHOW_STAT\r | |
34 | static int ttt = 0;\r | |
35 | #endif\r | |
36 | \r | |
37 | #define kBlockSizeMax ((1 << LZMA_NUM_BLOCK_SIZE_BITS) - 1)\r | |
38 | \r | |
39 | #define kBlockSize (9 << 10)\r | |
40 | #define kUnpackBlockSize (1 << 18)\r | |
41 | #define kMatchArraySize (1 << 21)\r | |
42 | #define kMatchRecordMaxSize ((LZMA_MATCH_LEN_MAX * 2 + 3) * LZMA_MATCH_LEN_MAX)\r | |
43 | \r | |
44 | #define kNumMaxDirectBits (31)\r | |
45 | \r | |
46 | #define kNumTopBits 24\r | |
47 | #define kTopValue ((UInt32)1 << kNumTopBits)\r | |
48 | \r | |
49 | #define kNumBitModelTotalBits 11\r | |
50 | #define kBitModelTotal (1 << kNumBitModelTotalBits)\r | |
51 | #define kNumMoveBits 5\r | |
52 | #define kProbInitValue (kBitModelTotal >> 1)\r | |
53 | \r | |
54 | #define kNumMoveReducingBits 4\r | |
55 | #define kNumBitPriceShiftBits 4\r | |
56 | #define kBitPrice (1 << kNumBitPriceShiftBits)\r | |
57 | \r | |
58 | void LzmaEncProps_Init(CLzmaEncProps *p)\r | |
59 | {\r | |
60 | p->level = 5;\r | |
61 | p->dictSize = p->mc = 0;\r | |
62 | p->lc = p->lp = p->pb = p->algo = p->fb = p->btMode = p->numHashBytes = p->numThreads = -1;\r | |
63 | p->writeEndMark = 0;\r | |
64 | }\r | |
65 | \r | |
66 | void LzmaEncProps_Normalize(CLzmaEncProps *p)\r | |
67 | {\r | |
68 | int level = p->level;\r | |
69 | if (level < 0) level = 5;\r | |
70 | p->level = level;\r | |
71 | if (p->dictSize == 0) p->dictSize = (level <= 5 ? (1 << (level * 2 + 14)) : (level == 6 ? (1 << 25) : (1 << 26)));\r | |
72 | if (p->lc < 0) p->lc = 3;\r | |
73 | if (p->lp < 0) p->lp = 0;\r | |
74 | if (p->pb < 0) p->pb = 2;\r | |
75 | if (p->algo < 0) p->algo = (level < 5 ? 0 : 1);\r | |
76 | if (p->fb < 0) p->fb = (level < 7 ? 32 : 64);\r | |
77 | if (p->btMode < 0) p->btMode = (p->algo == 0 ? 0 : 1);\r | |
78 | if (p->numHashBytes < 0) p->numHashBytes = 4;\r | |
79 | if (p->mc == 0) p->mc = (16 + (p->fb >> 1)) >> (p->btMode ? 0 : 1);\r | |
80 | if (p->numThreads < 0)\r | |
81 | p->numThreads =\r | |
82 | #ifdef COMPRESS_MF_MT\r | |
83 | ((p->btMode && p->algo) ? 2 : 1);\r | |
84 | #else\r | |
85 | 1;\r | |
86 | #endif\r | |
87 | }\r | |
88 | \r | |
89 | UInt32 LzmaEncProps_GetDictSize(const CLzmaEncProps *props2)\r | |
90 | {\r | |
91 | CLzmaEncProps props = *props2;\r | |
92 | LzmaEncProps_Normalize(&props);\r | |
93 | return props.dictSize;\r | |
94 | }\r | |
95 | \r | |
96 | /* #define LZMA_LOG_BSR */\r | |
97 | /* Define it for Intel's CPU */\r | |
98 | \r | |
99 | \r | |
100 | #ifdef LZMA_LOG_BSR\r | |
101 | \r | |
102 | #define kDicLogSizeMaxCompress 30\r | |
103 | \r | |
104 | #define BSR2_RET(pos, res) { unsigned long i; _BitScanReverse(&i, (pos)); res = (i + i) + ((pos >> (i - 1)) & 1); }\r | |
105 | \r | |
106 | UInt32 GetPosSlot1(UInt32 pos)\r | |
107 | {\r | |
108 | UInt32 res;\r | |
109 | BSR2_RET(pos, res);\r | |
110 | return res;\r | |
111 | }\r | |
112 | #define GetPosSlot2(pos, res) { BSR2_RET(pos, res); }\r | |
113 | #define GetPosSlot(pos, res) { if (pos < 2) res = pos; else BSR2_RET(pos, res); }\r | |
114 | \r | |
115 | #else\r | |
116 | \r | |
117 | #define kNumLogBits (9 + (int)sizeof(size_t) / 2)\r | |
118 | #define kDicLogSizeMaxCompress ((kNumLogBits - 1) * 2 + 7)\r | |
119 | \r | |
120 | void LzmaEnc_FastPosInit(Byte *g_FastPos)\r | |
121 | {\r | |
122 | int c = 2, slotFast;\r | |
123 | g_FastPos[0] = 0;\r | |
124 | g_FastPos[1] = 1;\r | |
125 | \r | |
126 | for (slotFast = 2; slotFast < kNumLogBits * 2; slotFast++)\r | |
127 | {\r | |
128 | UInt32 k = (1 << ((slotFast >> 1) - 1));\r | |
129 | UInt32 j;\r | |
130 | for (j = 0; j < k; j++, c++)\r | |
131 | g_FastPos[c] = (Byte)slotFast;\r | |
132 | }\r | |
133 | }\r | |
134 | \r | |
5aec6991 | 135 | #define BSR2_RET(pos, res) { UInt32 ij = 6 + ((kNumLogBits - 1) & \\r |
30fdf114 | 136 | (0 - (((((UInt32)1 << (kNumLogBits + 6)) - 1) - pos) >> 31))); \\r |
5aec6991 | 137 | res = p->g_FastPos[pos >> ij] + (ij * 2); }\r |
30fdf114 LG |
138 | /*\r |
139 | #define BSR2_RET(pos, res) { res = (pos < (1 << (kNumLogBits + 6))) ? \\r | |
140 | p->g_FastPos[pos >> 6] + 12 : \\r | |
141 | p->g_FastPos[pos >> (6 + kNumLogBits - 1)] + (6 + (kNumLogBits - 1)) * 2; }\r | |
142 | */\r | |
143 | \r | |
144 | #define GetPosSlot1(pos) p->g_FastPos[pos]\r | |
145 | #define GetPosSlot2(pos, res) { BSR2_RET(pos, res); }\r | |
146 | #define GetPosSlot(pos, res) { if (pos < kNumFullDistances) res = p->g_FastPos[pos]; else BSR2_RET(pos, res); }\r | |
147 | \r | |
148 | #endif\r | |
149 | \r | |
150 | \r | |
151 | #define LZMA_NUM_REPS 4\r | |
152 | \r | |
153 | typedef unsigned CState;\r | |
154 | \r | |
155 | typedef struct _COptimal\r | |
156 | {\r | |
157 | UInt32 price;\r | |
158 | \r | |
159 | CState state;\r | |
160 | int prev1IsChar;\r | |
161 | int prev2;\r | |
162 | \r | |
163 | UInt32 posPrev2;\r | |
164 | UInt32 backPrev2;\r | |
165 | \r | |
166 | UInt32 posPrev;\r | |
167 | UInt32 backPrev;\r | |
168 | UInt32 backs[LZMA_NUM_REPS];\r | |
169 | } COptimal;\r | |
170 | \r | |
171 | #define kNumOpts (1 << 12)\r | |
172 | \r | |
173 | #define kNumLenToPosStates 4\r | |
174 | #define kNumPosSlotBits 6\r | |
175 | #define kDicLogSizeMin 0\r | |
176 | #define kDicLogSizeMax 32\r | |
177 | #define kDistTableSizeMax (kDicLogSizeMax * 2)\r | |
178 | \r | |
179 | \r | |
180 | #define kNumAlignBits 4\r | |
181 | #define kAlignTableSize (1 << kNumAlignBits)\r | |
182 | #define kAlignMask (kAlignTableSize - 1)\r | |
183 | \r | |
184 | #define kStartPosModelIndex 4\r | |
185 | #define kEndPosModelIndex 14\r | |
186 | #define kNumPosModels (kEndPosModelIndex - kStartPosModelIndex)\r | |
187 | \r | |
188 | #define kNumFullDistances (1 << (kEndPosModelIndex / 2))\r | |
189 | \r | |
190 | #ifdef _LZMA_PROB32\r | |
191 | #define CLzmaProb UInt32\r | |
192 | #else\r | |
193 | #define CLzmaProb UInt16\r | |
194 | #endif\r | |
195 | \r | |
196 | #define LZMA_PB_MAX 4\r | |
197 | #define LZMA_LC_MAX 8\r | |
198 | #define LZMA_LP_MAX 4\r | |
199 | \r | |
200 | #define LZMA_NUM_PB_STATES_MAX (1 << LZMA_PB_MAX)\r | |
201 | \r | |
202 | \r | |
203 | #define kLenNumLowBits 3\r | |
204 | #define kLenNumLowSymbols (1 << kLenNumLowBits)\r | |
205 | #define kLenNumMidBits 3\r | |
206 | #define kLenNumMidSymbols (1 << kLenNumMidBits)\r | |
207 | #define kLenNumHighBits 8\r | |
208 | #define kLenNumHighSymbols (1 << kLenNumHighBits)\r | |
209 | \r | |
210 | #define kLenNumSymbolsTotal (kLenNumLowSymbols + kLenNumMidSymbols + kLenNumHighSymbols)\r | |
211 | \r | |
212 | #define LZMA_MATCH_LEN_MIN 2\r | |
213 | #define LZMA_MATCH_LEN_MAX (LZMA_MATCH_LEN_MIN + kLenNumSymbolsTotal - 1)\r | |
214 | \r | |
215 | #define kNumStates 12\r | |
216 | \r | |
217 | typedef struct\r | |
218 | {\r | |
219 | CLzmaProb choice;\r | |
220 | CLzmaProb choice2;\r | |
221 | CLzmaProb low[LZMA_NUM_PB_STATES_MAX << kLenNumLowBits];\r | |
222 | CLzmaProb mid[LZMA_NUM_PB_STATES_MAX << kLenNumMidBits];\r | |
223 | CLzmaProb high[kLenNumHighSymbols];\r | |
224 | } CLenEnc;\r | |
225 | \r | |
226 | typedef struct\r | |
227 | {\r | |
228 | CLenEnc p;\r | |
229 | UInt32 prices[LZMA_NUM_PB_STATES_MAX][kLenNumSymbolsTotal];\r | |
230 | UInt32 tableSize;\r | |
231 | UInt32 counters[LZMA_NUM_PB_STATES_MAX];\r | |
232 | } CLenPriceEnc;\r | |
233 | \r | |
234 | typedef struct _CRangeEnc\r | |
235 | {\r | |
236 | UInt32 range;\r | |
237 | Byte cache;\r | |
238 | UInt64 low;\r | |
239 | UInt64 cacheSize;\r | |
240 | Byte *buf;\r | |
241 | Byte *bufLim;\r | |
242 | Byte *bufBase;\r | |
243 | ISeqOutStream *outStream;\r | |
244 | UInt64 processed;\r | |
245 | SRes res;\r | |
246 | } CRangeEnc;\r | |
247 | \r | |
248 | typedef struct _CSeqInStreamBuf\r | |
249 | {\r | |
250 | ISeqInStream funcTable;\r | |
251 | const Byte *data;\r | |
252 | SizeT rem;\r | |
253 | } CSeqInStreamBuf;\r | |
254 | \r | |
255 | static SRes MyRead(void *pp, void *data, size_t *size)\r | |
256 | {\r | |
257 | size_t curSize = *size;\r | |
258 | CSeqInStreamBuf *p = (CSeqInStreamBuf *)pp;\r | |
259 | if (p->rem < curSize)\r | |
260 | curSize = p->rem;\r | |
261 | memcpy(data, p->data, curSize);\r | |
262 | p->rem -= curSize;\r | |
263 | p->data += curSize;\r | |
264 | *size = curSize;\r | |
265 | return SZ_OK;\r | |
266 | }\r | |
267 | \r | |
268 | typedef struct\r | |
269 | {\r | |
270 | CLzmaProb *litProbs;\r | |
271 | \r | |
272 | CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX];\r | |
273 | CLzmaProb isRep[kNumStates];\r | |
274 | CLzmaProb isRepG0[kNumStates];\r | |
275 | CLzmaProb isRepG1[kNumStates];\r | |
276 | CLzmaProb isRepG2[kNumStates];\r | |
277 | CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX];\r | |
278 | \r | |
279 | CLzmaProb posSlotEncoder[kNumLenToPosStates][1 << kNumPosSlotBits];\r | |
280 | CLzmaProb posEncoders[kNumFullDistances - kEndPosModelIndex];\r | |
281 | CLzmaProb posAlignEncoder[1 << kNumAlignBits];\r | |
282 | \r | |
283 | CLenPriceEnc lenEnc;\r | |
284 | CLenPriceEnc repLenEnc;\r | |
285 | \r | |
286 | UInt32 reps[LZMA_NUM_REPS];\r | |
287 | UInt32 state;\r | |
288 | } CSaveState;\r | |
289 | \r | |
290 | typedef struct _CLzmaEnc\r | |
291 | {\r | |
292 | IMatchFinder matchFinder;\r | |
293 | void *matchFinderObj;\r | |
294 | \r | |
295 | #ifdef COMPRESS_MF_MT\r | |
296 | Bool mtMode;\r | |
297 | CMatchFinderMt matchFinderMt;\r | |
298 | #endif\r | |
299 | \r | |
300 | CMatchFinder matchFinderBase;\r | |
301 | \r | |
302 | #ifdef COMPRESS_MF_MT\r | |
303 | Byte pad[128];\r | |
304 | #endif\r | |
305 | \r | |
306 | UInt32 optimumEndIndex;\r | |
307 | UInt32 optimumCurrentIndex;\r | |
308 | \r | |
309 | UInt32 longestMatchLength;\r | |
310 | UInt32 numPairs;\r | |
311 | UInt32 numAvail;\r | |
312 | COptimal opt[kNumOpts];\r | |
313 | \r | |
314 | #ifndef LZMA_LOG_BSR\r | |
315 | Byte g_FastPos[1 << kNumLogBits];\r | |
316 | #endif\r | |
317 | \r | |
318 | UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];\r | |
319 | UInt32 matches[LZMA_MATCH_LEN_MAX * 2 + 2 + 1];\r | |
320 | UInt32 numFastBytes;\r | |
321 | UInt32 additionalOffset;\r | |
322 | UInt32 reps[LZMA_NUM_REPS];\r | |
323 | UInt32 state;\r | |
324 | \r | |
325 | UInt32 posSlotPrices[kNumLenToPosStates][kDistTableSizeMax];\r | |
326 | UInt32 distancesPrices[kNumLenToPosStates][kNumFullDistances];\r | |
327 | UInt32 alignPrices[kAlignTableSize];\r | |
328 | UInt32 alignPriceCount;\r | |
329 | \r | |
330 | UInt32 distTableSize;\r | |
331 | \r | |
332 | unsigned lc, lp, pb;\r | |
333 | unsigned lpMask, pbMask;\r | |
334 | \r | |
335 | CLzmaProb *litProbs;\r | |
336 | \r | |
337 | CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX];\r | |
338 | CLzmaProb isRep[kNumStates];\r | |
339 | CLzmaProb isRepG0[kNumStates];\r | |
340 | CLzmaProb isRepG1[kNumStates];\r | |
341 | CLzmaProb isRepG2[kNumStates];\r | |
342 | CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX];\r | |
343 | \r | |
344 | CLzmaProb posSlotEncoder[kNumLenToPosStates][1 << kNumPosSlotBits];\r | |
345 | CLzmaProb posEncoders[kNumFullDistances - kEndPosModelIndex];\r | |
346 | CLzmaProb posAlignEncoder[1 << kNumAlignBits];\r | |
347 | \r | |
348 | CLenPriceEnc lenEnc;\r | |
349 | CLenPriceEnc repLenEnc;\r | |
350 | \r | |
351 | unsigned lclp;\r | |
352 | \r | |
353 | Bool fastMode;\r | |
354 | \r | |
355 | CRangeEnc rc;\r | |
356 | \r | |
357 | Bool writeEndMark;\r | |
358 | UInt64 nowPos64;\r | |
359 | UInt32 matchPriceCount;\r | |
360 | Bool finished;\r | |
361 | Bool multiThread;\r | |
362 | \r | |
363 | SRes result;\r | |
364 | UInt32 dictSize;\r | |
365 | UInt32 matchFinderCycles;\r | |
366 | \r | |
367 | ISeqInStream *inStream;\r | |
368 | CSeqInStreamBuf seqBufInStream;\r | |
369 | \r | |
370 | CSaveState saveState;\r | |
371 | } CLzmaEnc;\r | |
372 | \r | |
373 | void LzmaEnc_SaveState(CLzmaEncHandle pp)\r | |
374 | {\r | |
375 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
376 | CSaveState *dest = &p->saveState;\r | |
377 | int i;\r | |
378 | dest->lenEnc = p->lenEnc;\r | |
379 | dest->repLenEnc = p->repLenEnc;\r | |
380 | dest->state = p->state;\r | |
381 | \r | |
382 | for (i = 0; i < kNumStates; i++)\r | |
383 | {\r | |
384 | memcpy(dest->isMatch[i], p->isMatch[i], sizeof(p->isMatch[i]));\r | |
385 | memcpy(dest->isRep0Long[i], p->isRep0Long[i], sizeof(p->isRep0Long[i]));\r | |
386 | }\r | |
387 | for (i = 0; i < kNumLenToPosStates; i++)\r | |
388 | memcpy(dest->posSlotEncoder[i], p->posSlotEncoder[i], sizeof(p->posSlotEncoder[i]));\r | |
389 | memcpy(dest->isRep, p->isRep, sizeof(p->isRep));\r | |
390 | memcpy(dest->isRepG0, p->isRepG0, sizeof(p->isRepG0));\r | |
391 | memcpy(dest->isRepG1, p->isRepG1, sizeof(p->isRepG1));\r | |
392 | memcpy(dest->isRepG2, p->isRepG2, sizeof(p->isRepG2));\r | |
393 | memcpy(dest->posEncoders, p->posEncoders, sizeof(p->posEncoders));\r | |
394 | memcpy(dest->posAlignEncoder, p->posAlignEncoder, sizeof(p->posAlignEncoder));\r | |
395 | memcpy(dest->reps, p->reps, sizeof(p->reps));\r | |
396 | memcpy(dest->litProbs, p->litProbs, (0x300 << p->lclp) * sizeof(CLzmaProb));\r | |
397 | }\r | |
398 | \r | |
399 | void LzmaEnc_RestoreState(CLzmaEncHandle pp)\r | |
400 | {\r | |
401 | CLzmaEnc *dest = (CLzmaEnc *)pp;\r | |
402 | const CSaveState *p = &dest->saveState;\r | |
403 | int i;\r | |
404 | dest->lenEnc = p->lenEnc;\r | |
405 | dest->repLenEnc = p->repLenEnc;\r | |
406 | dest->state = p->state;\r | |
407 | \r | |
408 | for (i = 0; i < kNumStates; i++)\r | |
409 | {\r | |
410 | memcpy(dest->isMatch[i], p->isMatch[i], sizeof(p->isMatch[i]));\r | |
411 | memcpy(dest->isRep0Long[i], p->isRep0Long[i], sizeof(p->isRep0Long[i]));\r | |
412 | }\r | |
413 | for (i = 0; i < kNumLenToPosStates; i++)\r | |
414 | memcpy(dest->posSlotEncoder[i], p->posSlotEncoder[i], sizeof(p->posSlotEncoder[i]));\r | |
415 | memcpy(dest->isRep, p->isRep, sizeof(p->isRep));\r | |
416 | memcpy(dest->isRepG0, p->isRepG0, sizeof(p->isRepG0));\r | |
417 | memcpy(dest->isRepG1, p->isRepG1, sizeof(p->isRepG1));\r | |
418 | memcpy(dest->isRepG2, p->isRepG2, sizeof(p->isRepG2));\r | |
419 | memcpy(dest->posEncoders, p->posEncoders, sizeof(p->posEncoders));\r | |
420 | memcpy(dest->posAlignEncoder, p->posAlignEncoder, sizeof(p->posAlignEncoder));\r | |
421 | memcpy(dest->reps, p->reps, sizeof(p->reps));\r | |
422 | memcpy(dest->litProbs, p->litProbs, (0x300 << dest->lclp) * sizeof(CLzmaProb));\r | |
423 | }\r | |
424 | \r | |
425 | SRes LzmaEnc_SetProps(CLzmaEncHandle pp, const CLzmaEncProps *props2)\r | |
426 | {\r | |
427 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
428 | CLzmaEncProps props = *props2;\r | |
429 | LzmaEncProps_Normalize(&props);\r | |
430 | \r | |
431 | if (props.lc > LZMA_LC_MAX || props.lp > LZMA_LP_MAX || props.pb > LZMA_PB_MAX ||\r | |
432 | props.dictSize > (1 << kDicLogSizeMaxCompress) || props.dictSize > (1 << 30))\r | |
433 | return SZ_ERROR_PARAM;\r | |
434 | p->dictSize = props.dictSize;\r | |
435 | p->matchFinderCycles = props.mc;\r | |
436 | {\r | |
437 | unsigned fb = props.fb;\r | |
438 | if (fb < 5)\r | |
439 | fb = 5;\r | |
440 | if (fb > LZMA_MATCH_LEN_MAX)\r | |
441 | fb = LZMA_MATCH_LEN_MAX;\r | |
442 | p->numFastBytes = fb;\r | |
443 | }\r | |
444 | p->lc = props.lc;\r | |
445 | p->lp = props.lp;\r | |
446 | p->pb = props.pb;\r | |
447 | p->fastMode = (props.algo == 0);\r | |
448 | p->matchFinderBase.btMode = props.btMode;\r | |
449 | {\r | |
450 | UInt32 numHashBytes = 4;\r | |
451 | if (props.btMode)\r | |
452 | {\r | |
453 | if (props.numHashBytes < 2)\r | |
454 | numHashBytes = 2;\r | |
455 | else if (props.numHashBytes < 4)\r | |
456 | numHashBytes = props.numHashBytes;\r | |
457 | }\r | |
458 | p->matchFinderBase.numHashBytes = numHashBytes;\r | |
459 | }\r | |
460 | \r | |
461 | p->matchFinderBase.cutValue = props.mc;\r | |
462 | \r | |
463 | p->writeEndMark = props.writeEndMark;\r | |
464 | \r | |
465 | #ifdef COMPRESS_MF_MT\r | |
466 | /*\r | |
467 | if (newMultiThread != _multiThread)\r | |
468 | {\r | |
469 | ReleaseMatchFinder();\r | |
470 | _multiThread = newMultiThread;\r | |
471 | }\r | |
472 | */\r | |
473 | p->multiThread = (props.numThreads > 1);\r | |
474 | #endif\r | |
475 | \r | |
476 | return SZ_OK;\r | |
477 | }\r | |
478 | \r | |
479 | static const int kLiteralNextStates[kNumStates] = {0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5};\r | |
480 | static const int kMatchNextStates[kNumStates] = {7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10};\r | |
481 | static const int kRepNextStates[kNumStates] = {8, 8, 8, 8, 8, 8, 8, 11, 11, 11, 11, 11};\r | |
482 | static const int kShortRepNextStates[kNumStates]= {9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11};\r | |
483 | \r | |
484 | #define IsCharState(s) ((s) < 7)\r | |
485 | \r | |
486 | #define GetLenToPosState(len) (((len) < kNumLenToPosStates + 1) ? (len) - 2 : kNumLenToPosStates - 1)\r | |
487 | \r | |
488 | #define kInfinityPrice (1 << 30)\r | |
489 | \r | |
490 | static void RangeEnc_Construct(CRangeEnc *p)\r | |
491 | {\r | |
492 | p->outStream = 0;\r | |
493 | p->bufBase = 0;\r | |
494 | }\r | |
495 | \r | |
496 | #define RangeEnc_GetProcessed(p) ((p)->processed + ((p)->buf - (p)->bufBase) + (p)->cacheSize)\r | |
497 | \r | |
498 | #define RC_BUF_SIZE (1 << 16)\r | |
499 | static int RangeEnc_Alloc(CRangeEnc *p, ISzAlloc *alloc)\r | |
500 | {\r | |
501 | if (p->bufBase == 0)\r | |
502 | {\r | |
503 | p->bufBase = (Byte *)alloc->Alloc(alloc, RC_BUF_SIZE);\r | |
504 | if (p->bufBase == 0)\r | |
505 | return 0;\r | |
506 | p->bufLim = p->bufBase + RC_BUF_SIZE;\r | |
507 | }\r | |
508 | return 1;\r | |
509 | }\r | |
510 | \r | |
511 | static void RangeEnc_Free(CRangeEnc *p, ISzAlloc *alloc)\r | |
512 | {\r | |
513 | alloc->Free(alloc, p->bufBase);\r | |
514 | p->bufBase = 0;\r | |
515 | }\r | |
516 | \r | |
517 | static void RangeEnc_Init(CRangeEnc *p)\r | |
518 | {\r | |
519 | /* Stream.Init(); */\r | |
520 | p->low = 0;\r | |
521 | p->range = 0xFFFFFFFF;\r | |
522 | p->cacheSize = 1;\r | |
523 | p->cache = 0;\r | |
524 | \r | |
525 | p->buf = p->bufBase;\r | |
526 | \r | |
527 | p->processed = 0;\r | |
528 | p->res = SZ_OK;\r | |
529 | }\r | |
530 | \r | |
531 | static void RangeEnc_FlushStream(CRangeEnc *p)\r | |
532 | {\r | |
533 | size_t num;\r | |
534 | if (p->res != SZ_OK)\r | |
535 | return;\r | |
536 | num = p->buf - p->bufBase;\r | |
537 | if (num != p->outStream->Write(p->outStream, p->bufBase, num))\r | |
538 | p->res = SZ_ERROR_WRITE;\r | |
539 | p->processed += num;\r | |
540 | p->buf = p->bufBase;\r | |
541 | }\r | |
542 | \r | |
543 | static void MY_FAST_CALL RangeEnc_ShiftLow(CRangeEnc *p)\r | |
544 | {\r | |
545 | if ((UInt32)p->low < (UInt32)0xFF000000 || (int)(p->low >> 32) != 0)\r | |
546 | {\r | |
547 | Byte temp = p->cache;\r | |
548 | do\r | |
549 | {\r | |
550 | Byte *buf = p->buf;\r | |
551 | *buf++ = (Byte)(temp + (Byte)(p->low >> 32));\r | |
552 | p->buf = buf;\r | |
553 | if (buf == p->bufLim)\r | |
554 | RangeEnc_FlushStream(p);\r | |
555 | temp = 0xFF;\r | |
556 | }\r | |
557 | while (--p->cacheSize != 0);\r | |
558 | p->cache = (Byte)((UInt32)p->low >> 24);\r | |
559 | }\r | |
560 | p->cacheSize++;\r | |
561 | p->low = (UInt32)p->low << 8;\r | |
562 | }\r | |
563 | \r | |
564 | static void RangeEnc_FlushData(CRangeEnc *p)\r | |
565 | {\r | |
566 | int i;\r | |
567 | for (i = 0; i < 5; i++)\r | |
568 | RangeEnc_ShiftLow(p);\r | |
569 | }\r | |
570 | \r | |
571 | static void RangeEnc_EncodeDirectBits(CRangeEnc *p, UInt32 value, int numBits)\r | |
572 | {\r | |
573 | do\r | |
574 | {\r | |
575 | p->range >>= 1;\r | |
576 | p->low += p->range & (0 - ((value >> --numBits) & 1));\r | |
577 | if (p->range < kTopValue)\r | |
578 | {\r | |
579 | p->range <<= 8;\r | |
580 | RangeEnc_ShiftLow(p);\r | |
581 | }\r | |
582 | }\r | |
583 | while (numBits != 0);\r | |
584 | }\r | |
585 | \r | |
586 | static void RangeEnc_EncodeBit(CRangeEnc *p, CLzmaProb *prob, UInt32 symbol)\r | |
587 | {\r | |
588 | UInt32 ttt = *prob;\r | |
589 | UInt32 newBound = (p->range >> kNumBitModelTotalBits) * ttt;\r | |
590 | if (symbol == 0)\r | |
591 | {\r | |
592 | p->range = newBound;\r | |
593 | ttt += (kBitModelTotal - ttt) >> kNumMoveBits;\r | |
594 | }\r | |
595 | else\r | |
596 | {\r | |
597 | p->low += newBound;\r | |
598 | p->range -= newBound;\r | |
599 | ttt -= ttt >> kNumMoveBits;\r | |
600 | }\r | |
601 | *prob = (CLzmaProb)ttt;\r | |
602 | if (p->range < kTopValue)\r | |
603 | {\r | |
604 | p->range <<= 8;\r | |
605 | RangeEnc_ShiftLow(p);\r | |
606 | }\r | |
607 | }\r | |
608 | \r | |
609 | static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)\r | |
610 | {\r | |
611 | symbol |= 0x100;\r | |
612 | do\r | |
613 | {\r | |
614 | RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);\r | |
615 | symbol <<= 1;\r | |
616 | }\r | |
617 | while (symbol < 0x10000);\r | |
618 | }\r | |
619 | \r | |
620 | static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)\r | |
621 | {\r | |
622 | UInt32 offs = 0x100;\r | |
623 | symbol |= 0x100;\r | |
624 | do\r | |
625 | {\r | |
626 | matchByte <<= 1;\r | |
627 | RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);\r | |
628 | symbol <<= 1;\r | |
629 | offs &= ~(matchByte ^ symbol);\r | |
630 | }\r | |
631 | while (symbol < 0x10000);\r | |
632 | }\r | |
633 | \r | |
634 | void LzmaEnc_InitPriceTables(UInt32 *ProbPrices)\r | |
635 | {\r | |
636 | UInt32 i;\r | |
637 | for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits))\r | |
638 | {\r | |
639 | const int kCyclesBits = kNumBitPriceShiftBits;\r | |
640 | UInt32 w = i;\r | |
641 | UInt32 bitCount = 0;\r | |
642 | int j;\r | |
643 | for (j = 0; j < kCyclesBits; j++)\r | |
644 | {\r | |
645 | w = w * w;\r | |
646 | bitCount <<= 1;\r | |
647 | while (w >= ((UInt32)1 << 16))\r | |
648 | {\r | |
649 | w >>= 1;\r | |
650 | bitCount++;\r | |
651 | }\r | |
652 | }\r | |
653 | ProbPrices[i >> kNumMoveReducingBits] = ((kNumBitModelTotalBits << kCyclesBits) - 15 - bitCount);\r | |
654 | }\r | |
655 | }\r | |
656 | \r | |
657 | \r | |
658 | #define GET_PRICE(prob, symbol) \\r | |
659 | p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];\r | |
660 | \r | |
661 | #define GET_PRICEa(prob, symbol) \\r | |
662 | ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];\r | |
663 | \r | |
664 | #define GET_PRICE_0(prob) p->ProbPrices[(prob) >> kNumMoveReducingBits]\r | |
665 | #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]\r | |
666 | \r | |
667 | #define GET_PRICE_0a(prob) ProbPrices[(prob) >> kNumMoveReducingBits]\r | |
668 | #define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]\r | |
669 | \r | |
670 | static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices)\r | |
671 | {\r | |
672 | UInt32 price = 0;\r | |
673 | symbol |= 0x100;\r | |
674 | do\r | |
675 | {\r | |
676 | price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);\r | |
677 | symbol <<= 1;\r | |
678 | }\r | |
679 | while (symbol < 0x10000);\r | |
680 | return price;\r | |
681 | }\r | |
682 | \r | |
683 | static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices)\r | |
684 | {\r | |
685 | UInt32 price = 0;\r | |
686 | UInt32 offs = 0x100;\r | |
687 | symbol |= 0x100;\r | |
688 | do\r | |
689 | {\r | |
690 | matchByte <<= 1;\r | |
691 | price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);\r | |
692 | symbol <<= 1;\r | |
693 | offs &= ~(matchByte ^ symbol);\r | |
694 | }\r | |
695 | while (symbol < 0x10000);\r | |
696 | return price;\r | |
697 | }\r | |
698 | \r | |
699 | \r | |
700 | static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)\r | |
701 | {\r | |
702 | UInt32 m = 1;\r | |
703 | int i;\r | |
704 | for (i = numBitLevels; i != 0;)\r | |
705 | {\r | |
706 | UInt32 bit;\r | |
707 | i--;\r | |
708 | bit = (symbol >> i) & 1;\r | |
709 | RangeEnc_EncodeBit(rc, probs + m, bit);\r | |
710 | m = (m << 1) | bit;\r | |
711 | }\r | |
712 | }\r | |
713 | \r | |
714 | static void RcTree_ReverseEncode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)\r | |
715 | {\r | |
716 | UInt32 m = 1;\r | |
717 | int i;\r | |
718 | for (i = 0; i < numBitLevels; i++)\r | |
719 | {\r | |
720 | UInt32 bit = symbol & 1;\r | |
721 | RangeEnc_EncodeBit(rc, probs + m, bit);\r | |
722 | m = (m << 1) | bit;\r | |
723 | symbol >>= 1;\r | |
724 | }\r | |
725 | }\r | |
726 | \r | |
727 | static UInt32 RcTree_GetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices)\r | |
728 | {\r | |
729 | UInt32 price = 0;\r | |
730 | symbol |= (1 << numBitLevels);\r | |
731 | while (symbol != 1)\r | |
732 | {\r | |
733 | price += GET_PRICEa(probs[symbol >> 1], symbol & 1);\r | |
734 | symbol >>= 1;\r | |
735 | }\r | |
736 | return price;\r | |
737 | }\r | |
738 | \r | |
739 | static UInt32 RcTree_ReverseGetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices)\r | |
740 | {\r | |
741 | UInt32 price = 0;\r | |
742 | UInt32 m = 1;\r | |
743 | int i;\r | |
744 | for (i = numBitLevels; i != 0; i--)\r | |
745 | {\r | |
746 | UInt32 bit = symbol & 1;\r | |
747 | symbol >>= 1;\r | |
748 | price += GET_PRICEa(probs[m], bit);\r | |
749 | m = (m << 1) | bit;\r | |
750 | }\r | |
751 | return price;\r | |
752 | }\r | |
753 | \r | |
754 | \r | |
755 | static void LenEnc_Init(CLenEnc *p)\r | |
756 | {\r | |
757 | unsigned i;\r | |
758 | p->choice = p->choice2 = kProbInitValue;\r | |
759 | for (i = 0; i < (LZMA_NUM_PB_STATES_MAX << kLenNumLowBits); i++)\r | |
760 | p->low[i] = kProbInitValue;\r | |
761 | for (i = 0; i < (LZMA_NUM_PB_STATES_MAX << kLenNumMidBits); i++)\r | |
762 | p->mid[i] = kProbInitValue;\r | |
763 | for (i = 0; i < kLenNumHighSymbols; i++)\r | |
764 | p->high[i] = kProbInitValue;\r | |
765 | }\r | |
766 | \r | |
767 | static void LenEnc_Encode(CLenEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState)\r | |
768 | {\r | |
769 | if (symbol < kLenNumLowSymbols)\r | |
770 | {\r | |
771 | RangeEnc_EncodeBit(rc, &p->choice, 0);\r | |
772 | RcTree_Encode(rc, p->low + (posState << kLenNumLowBits), kLenNumLowBits, symbol);\r | |
773 | }\r | |
774 | else\r | |
775 | {\r | |
776 | RangeEnc_EncodeBit(rc, &p->choice, 1);\r | |
777 | if (symbol < kLenNumLowSymbols + kLenNumMidSymbols)\r | |
778 | {\r | |
779 | RangeEnc_EncodeBit(rc, &p->choice2, 0);\r | |
780 | RcTree_Encode(rc, p->mid + (posState << kLenNumMidBits), kLenNumMidBits, symbol - kLenNumLowSymbols);\r | |
781 | }\r | |
782 | else\r | |
783 | {\r | |
784 | RangeEnc_EncodeBit(rc, &p->choice2, 1);\r | |
785 | RcTree_Encode(rc, p->high, kLenNumHighBits, symbol - kLenNumLowSymbols - kLenNumMidSymbols);\r | |
786 | }\r | |
787 | }\r | |
788 | }\r | |
789 | \r | |
790 | static void LenEnc_SetPrices(CLenEnc *p, UInt32 posState, UInt32 numSymbols, UInt32 *prices, UInt32 *ProbPrices)\r | |
791 | {\r | |
792 | UInt32 a0 = GET_PRICE_0a(p->choice);\r | |
793 | UInt32 a1 = GET_PRICE_1a(p->choice);\r | |
794 | UInt32 b0 = a1 + GET_PRICE_0a(p->choice2);\r | |
795 | UInt32 b1 = a1 + GET_PRICE_1a(p->choice2);\r | |
796 | UInt32 i = 0;\r | |
797 | for (i = 0; i < kLenNumLowSymbols; i++)\r | |
798 | {\r | |
799 | if (i >= numSymbols)\r | |
800 | return;\r | |
801 | prices[i] = a0 + RcTree_GetPrice(p->low + (posState << kLenNumLowBits), kLenNumLowBits, i, ProbPrices);\r | |
802 | }\r | |
803 | for (; i < kLenNumLowSymbols + kLenNumMidSymbols; i++)\r | |
804 | {\r | |
805 | if (i >= numSymbols)\r | |
806 | return;\r | |
807 | prices[i] = b0 + RcTree_GetPrice(p->mid + (posState << kLenNumMidBits), kLenNumMidBits, i - kLenNumLowSymbols, ProbPrices);\r | |
808 | }\r | |
809 | for (; i < numSymbols; i++)\r | |
810 | prices[i] = b1 + RcTree_GetPrice(p->high, kLenNumHighBits, i - kLenNumLowSymbols - kLenNumMidSymbols, ProbPrices);\r | |
811 | }\r | |
812 | \r | |
813 | static void MY_FAST_CALL LenPriceEnc_UpdateTable(CLenPriceEnc *p, UInt32 posState, UInt32 *ProbPrices)\r | |
814 | {\r | |
815 | LenEnc_SetPrices(&p->p, posState, p->tableSize, p->prices[posState], ProbPrices);\r | |
816 | p->counters[posState] = p->tableSize;\r | |
817 | }\r | |
818 | \r | |
819 | static void LenPriceEnc_UpdateTables(CLenPriceEnc *p, UInt32 numPosStates, UInt32 *ProbPrices)\r | |
820 | {\r | |
821 | UInt32 posState;\r | |
822 | for (posState = 0; posState < numPosStates; posState++)\r | |
823 | LenPriceEnc_UpdateTable(p, posState, ProbPrices);\r | |
824 | }\r | |
825 | \r | |
826 | static void LenEnc_Encode2(CLenPriceEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState, Bool updatePrice, UInt32 *ProbPrices)\r | |
827 | {\r | |
828 | LenEnc_Encode(&p->p, rc, symbol, posState);\r | |
829 | if (updatePrice)\r | |
830 | if (--p->counters[posState] == 0)\r | |
831 | LenPriceEnc_UpdateTable(p, posState, ProbPrices);\r | |
832 | }\r | |
833 | \r | |
834 | \r | |
835 | \r | |
836 | \r | |
837 | static void MovePos(CLzmaEnc *p, UInt32 num)\r | |
838 | {\r | |
839 | #ifdef SHOW_STAT\r | |
840 | ttt += num;\r | |
841 | printf("\n MovePos %d", num);\r | |
842 | #endif\r | |
843 | if (num != 0)\r | |
844 | {\r | |
845 | p->additionalOffset += num;\r | |
846 | p->matchFinder.Skip(p->matchFinderObj, num);\r | |
847 | }\r | |
848 | }\r | |
849 | \r | |
850 | static UInt32 ReadMatchDistances(CLzmaEnc *p, UInt32 *numDistancePairsRes)\r | |
851 | {\r | |
852 | UInt32 lenRes = 0, numPairs;\r | |
853 | p->numAvail = p->matchFinder.GetNumAvailableBytes(p->matchFinderObj);\r | |
854 | numPairs = p->matchFinder.GetMatches(p->matchFinderObj, p->matches);\r | |
855 | #ifdef SHOW_STAT\r | |
856 | printf("\n i = %d numPairs = %d ", ttt, numPairs / 2);\r | |
857 | ttt++;\r | |
858 | {\r | |
859 | UInt32 i;\r | |
860 | for (i = 0; i < numPairs; i += 2)\r | |
861 | printf("%2d %6d | ", p->matches[i], p->matches[i + 1]);\r | |
862 | }\r | |
863 | #endif\r | |
864 | if (numPairs > 0)\r | |
865 | {\r | |
866 | lenRes = p->matches[numPairs - 2];\r | |
867 | if (lenRes == p->numFastBytes)\r | |
868 | {\r | |
869 | const Byte *pby = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;\r | |
870 | UInt32 distance = p->matches[numPairs - 1] + 1;\r | |
871 | UInt32 numAvail = p->numAvail;\r | |
872 | if (numAvail > LZMA_MATCH_LEN_MAX)\r | |
873 | numAvail = LZMA_MATCH_LEN_MAX;\r | |
874 | {\r | |
875 | const Byte *pby2 = pby - distance;\r | |
876 | for (; lenRes < numAvail && pby[lenRes] == pby2[lenRes]; lenRes++);\r | |
877 | }\r | |
878 | }\r | |
879 | }\r | |
880 | p->additionalOffset++;\r | |
881 | *numDistancePairsRes = numPairs;\r | |
882 | return lenRes;\r | |
883 | }\r | |
884 | \r | |
885 | \r | |
886 | #define MakeAsChar(p) (p)->backPrev = (UInt32)(-1); (p)->prev1IsChar = False;\r | |
887 | #define MakeAsShortRep(p) (p)->backPrev = 0; (p)->prev1IsChar = False;\r | |
888 | #define IsShortRep(p) ((p)->backPrev == 0)\r | |
889 | \r | |
890 | static UInt32 GetRepLen1Price(CLzmaEnc *p, UInt32 state, UInt32 posState)\r | |
891 | {\r | |
892 | return\r | |
893 | GET_PRICE_0(p->isRepG0[state]) +\r | |
894 | GET_PRICE_0(p->isRep0Long[state][posState]);\r | |
895 | }\r | |
896 | \r | |
897 | static UInt32 GetPureRepPrice(CLzmaEnc *p, UInt32 repIndex, UInt32 state, UInt32 posState)\r | |
898 | {\r | |
899 | UInt32 price;\r | |
900 | if (repIndex == 0)\r | |
901 | {\r | |
902 | price = GET_PRICE_0(p->isRepG0[state]);\r | |
903 | price += GET_PRICE_1(p->isRep0Long[state][posState]);\r | |
904 | }\r | |
905 | else\r | |
906 | {\r | |
907 | price = GET_PRICE_1(p->isRepG0[state]);\r | |
908 | if (repIndex == 1)\r | |
909 | price += GET_PRICE_0(p->isRepG1[state]);\r | |
910 | else\r | |
911 | {\r | |
912 | price += GET_PRICE_1(p->isRepG1[state]);\r | |
913 | price += GET_PRICE(p->isRepG2[state], repIndex - 2);\r | |
914 | }\r | |
915 | }\r | |
916 | return price;\r | |
917 | }\r | |
918 | \r | |
919 | static UInt32 GetRepPrice(CLzmaEnc *p, UInt32 repIndex, UInt32 len, UInt32 state, UInt32 posState)\r | |
920 | {\r | |
921 | return p->repLenEnc.prices[posState][len - LZMA_MATCH_LEN_MIN] +\r | |
922 | GetPureRepPrice(p, repIndex, state, posState);\r | |
923 | }\r | |
924 | \r | |
925 | static UInt32 Backward(CLzmaEnc *p, UInt32 *backRes, UInt32 cur)\r | |
926 | {\r | |
927 | UInt32 posMem = p->opt[cur].posPrev;\r | |
928 | UInt32 backMem = p->opt[cur].backPrev;\r | |
929 | p->optimumEndIndex = cur;\r | |
930 | do\r | |
931 | {\r | |
932 | if (p->opt[cur].prev1IsChar)\r | |
933 | {\r | |
934 | MakeAsChar(&p->opt[posMem])\r | |
935 | p->opt[posMem].posPrev = posMem - 1;\r | |
936 | if (p->opt[cur].prev2)\r | |
937 | {\r | |
938 | p->opt[posMem - 1].prev1IsChar = False;\r | |
939 | p->opt[posMem - 1].posPrev = p->opt[cur].posPrev2;\r | |
940 | p->opt[posMem - 1].backPrev = p->opt[cur].backPrev2;\r | |
941 | }\r | |
942 | }\r | |
943 | {\r | |
944 | UInt32 posPrev = posMem;\r | |
945 | UInt32 backCur = backMem;\r | |
946 | \r | |
947 | backMem = p->opt[posPrev].backPrev;\r | |
948 | posMem = p->opt[posPrev].posPrev;\r | |
949 | \r | |
950 | p->opt[posPrev].backPrev = backCur;\r | |
951 | p->opt[posPrev].posPrev = cur;\r | |
952 | cur = posPrev;\r | |
953 | }\r | |
954 | }\r | |
955 | while (cur != 0);\r | |
956 | *backRes = p->opt[0].backPrev;\r | |
957 | p->optimumCurrentIndex = p->opt[0].posPrev;\r | |
958 | return p->optimumCurrentIndex;\r | |
959 | }\r | |
960 | \r | |
961 | #define LIT_PROBS(pos, prevByte) (p->litProbs + ((((pos) & p->lpMask) << p->lc) + ((prevByte) >> (8 - p->lc))) * 0x300)\r | |
962 | \r | |
963 | static UInt32 GetOptimum(CLzmaEnc *p, UInt32 position, UInt32 *backRes)\r | |
964 | {\r | |
965 | UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur;\r | |
966 | UInt32 matchPrice, repMatchPrice, normalMatchPrice;\r | |
967 | UInt32 reps[LZMA_NUM_REPS], repLens[LZMA_NUM_REPS];\r | |
968 | UInt32 *matches;\r | |
969 | const Byte *data;\r | |
970 | Byte curByte, matchByte;\r | |
971 | if (p->optimumEndIndex != p->optimumCurrentIndex)\r | |
972 | {\r | |
973 | const COptimal *opt = &p->opt[p->optimumCurrentIndex];\r | |
974 | UInt32 lenRes = opt->posPrev - p->optimumCurrentIndex;\r | |
975 | *backRes = opt->backPrev;\r | |
976 | p->optimumCurrentIndex = opt->posPrev;\r | |
977 | return lenRes;\r | |
978 | }\r | |
979 | p->optimumCurrentIndex = p->optimumEndIndex = 0;\r | |
980 | \r | |
981 | if (p->additionalOffset == 0)\r | |
982 | mainLen = ReadMatchDistances(p, &numPairs);\r | |
983 | else\r | |
984 | {\r | |
985 | mainLen = p->longestMatchLength;\r | |
986 | numPairs = p->numPairs;\r | |
987 | }\r | |
988 | \r | |
989 | numAvail = p->numAvail;\r | |
990 | if (numAvail < 2)\r | |
991 | {\r | |
992 | *backRes = (UInt32)(-1);\r | |
993 | return 1;\r | |
994 | }\r | |
995 | if (numAvail > LZMA_MATCH_LEN_MAX)\r | |
996 | numAvail = LZMA_MATCH_LEN_MAX;\r | |
997 | \r | |
998 | data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;\r | |
999 | repMaxIndex = 0;\r | |
1000 | for (i = 0; i < LZMA_NUM_REPS; i++)\r | |
1001 | {\r | |
1002 | UInt32 lenTest;\r | |
1003 | const Byte *data2;\r | |
1004 | reps[i] = p->reps[i];\r | |
1005 | data2 = data - (reps[i] + 1);\r | |
1006 | if (data[0] != data2[0] || data[1] != data2[1])\r | |
1007 | {\r | |
1008 | repLens[i] = 0;\r | |
1009 | continue;\r | |
1010 | }\r | |
1011 | for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);\r | |
1012 | repLens[i] = lenTest;\r | |
1013 | if (lenTest > repLens[repMaxIndex])\r | |
1014 | repMaxIndex = i;\r | |
1015 | }\r | |
1016 | if (repLens[repMaxIndex] >= p->numFastBytes)\r | |
1017 | {\r | |
1018 | UInt32 lenRes;\r | |
1019 | *backRes = repMaxIndex;\r | |
1020 | lenRes = repLens[repMaxIndex];\r | |
1021 | MovePos(p, lenRes - 1);\r | |
1022 | return lenRes;\r | |
1023 | }\r | |
1024 | \r | |
1025 | matches = p->matches;\r | |
1026 | if (mainLen >= p->numFastBytes)\r | |
1027 | {\r | |
1028 | *backRes = matches[numPairs - 1] + LZMA_NUM_REPS;\r | |
1029 | MovePos(p, mainLen - 1);\r | |
1030 | return mainLen;\r | |
1031 | }\r | |
1032 | curByte = *data;\r | |
1033 | matchByte = *(data - (reps[0] + 1));\r | |
1034 | \r | |
1035 | if (mainLen < 2 && curByte != matchByte && repLens[repMaxIndex] < 2)\r | |
1036 | {\r | |
1037 | *backRes = (UInt32)-1;\r | |
1038 | return 1;\r | |
1039 | }\r | |
1040 | \r | |
1041 | p->opt[0].state = (CState)p->state;\r | |
1042 | \r | |
1043 | posState = (position & p->pbMask);\r | |
1044 | \r | |
1045 | {\r | |
1046 | const CLzmaProb *probs = LIT_PROBS(position, *(data - 1));\r | |
1047 | p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) +\r | |
1048 | (!IsCharState(p->state) ?\r | |
1049 | LitEnc_GetPriceMatched(probs, curByte, matchByte, p->ProbPrices) :\r | |
1050 | LitEnc_GetPrice(probs, curByte, p->ProbPrices));\r | |
1051 | }\r | |
1052 | \r | |
1053 | MakeAsChar(&p->opt[1]);\r | |
1054 | \r | |
1055 | matchPrice = GET_PRICE_1(p->isMatch[p->state][posState]);\r | |
1056 | repMatchPrice = matchPrice + GET_PRICE_1(p->isRep[p->state]);\r | |
1057 | \r | |
1058 | if (matchByte == curByte)\r | |
1059 | {\r | |
1060 | UInt32 shortRepPrice = repMatchPrice + GetRepLen1Price(p, p->state, posState);\r | |
1061 | if (shortRepPrice < p->opt[1].price)\r | |
1062 | {\r | |
1063 | p->opt[1].price = shortRepPrice;\r | |
1064 | MakeAsShortRep(&p->opt[1]);\r | |
1065 | }\r | |
1066 | }\r | |
1067 | lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]);\r | |
1068 | \r | |
1069 | if (lenEnd < 2)\r | |
1070 | {\r | |
1071 | *backRes = p->opt[1].backPrev;\r | |
1072 | return 1;\r | |
1073 | }\r | |
1074 | \r | |
1075 | p->opt[1].posPrev = 0;\r | |
1076 | for (i = 0; i < LZMA_NUM_REPS; i++)\r | |
1077 | p->opt[0].backs[i] = reps[i];\r | |
1078 | \r | |
1079 | len = lenEnd;\r | |
1080 | do\r | |
1081 | p->opt[len--].price = kInfinityPrice;\r | |
1082 | while (len >= 2);\r | |
1083 | \r | |
1084 | for (i = 0; i < LZMA_NUM_REPS; i++)\r | |
1085 | {\r | |
1086 | UInt32 repLen = repLens[i];\r | |
1087 | UInt32 price;\r | |
1088 | if (repLen < 2)\r | |
1089 | continue;\r | |
1090 | price = repMatchPrice + GetPureRepPrice(p, i, p->state, posState);\r | |
1091 | do\r | |
1092 | {\r | |
1093 | UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][repLen - 2];\r | |
1094 | COptimal *opt = &p->opt[repLen];\r | |
1095 | if (curAndLenPrice < opt->price)\r | |
1096 | {\r | |
1097 | opt->price = curAndLenPrice;\r | |
1098 | opt->posPrev = 0;\r | |
1099 | opt->backPrev = i;\r | |
1100 | opt->prev1IsChar = False;\r | |
1101 | }\r | |
1102 | }\r | |
1103 | while (--repLen >= 2);\r | |
1104 | }\r | |
1105 | \r | |
1106 | normalMatchPrice = matchPrice + GET_PRICE_0(p->isRep[p->state]);\r | |
1107 | \r | |
1108 | len = ((repLens[0] >= 2) ? repLens[0] + 1 : 2);\r | |
1109 | if (len <= mainLen)\r | |
1110 | {\r | |
1111 | UInt32 offs = 0;\r | |
1112 | while (len > matches[offs])\r | |
1113 | offs += 2;\r | |
1114 | for (; ; len++)\r | |
1115 | {\r | |
1116 | COptimal *opt;\r | |
1117 | UInt32 distance = matches[offs + 1];\r | |
1118 | \r | |
1119 | UInt32 curAndLenPrice = normalMatchPrice + p->lenEnc.prices[posState][len - LZMA_MATCH_LEN_MIN];\r | |
1120 | UInt32 lenToPosState = GetLenToPosState(len);\r | |
1121 | if (distance < kNumFullDistances)\r | |
1122 | curAndLenPrice += p->distancesPrices[lenToPosState][distance];\r | |
1123 | else\r | |
1124 | {\r | |
1125 | UInt32 slot;\r | |
1126 | GetPosSlot2(distance, slot);\r | |
1127 | curAndLenPrice += p->alignPrices[distance & kAlignMask] + p->posSlotPrices[lenToPosState][slot];\r | |
1128 | }\r | |
1129 | opt = &p->opt[len];\r | |
1130 | if (curAndLenPrice < opt->price)\r | |
1131 | {\r | |
1132 | opt->price = curAndLenPrice;\r | |
1133 | opt->posPrev = 0;\r | |
1134 | opt->backPrev = distance + LZMA_NUM_REPS;\r | |
1135 | opt->prev1IsChar = False;\r | |
1136 | }\r | |
1137 | if (len == matches[offs])\r | |
1138 | {\r | |
1139 | offs += 2;\r | |
1140 | if (offs == numPairs)\r | |
1141 | break;\r | |
1142 | }\r | |
1143 | }\r | |
1144 | }\r | |
1145 | \r | |
1146 | cur = 0;\r | |
1147 | \r | |
1148 | #ifdef SHOW_STAT2\r | |
1149 | if (position >= 0)\r | |
1150 | {\r | |
5aec6991 | 1151 | unsigned ii;\r |
30fdf114 | 1152 | printf("\n pos = %4X", position);\r |
5aec6991 YZ |
1153 | for (ii = cur; ii <= lenEnd; ii++)\r |
1154 | printf("\nprice[%4X] = %d", position - cur + ii, p->opt[ii].price);\r | |
30fdf114 LG |
1155 | }\r |
1156 | #endif\r | |
1157 | \r | |
1158 | for (;;)\r | |
1159 | {\r | |
5aec6991 YZ |
1160 | UInt32 numAvailFull, newLen, posPrev, state, startLen;\r |
1161 | UInt32 curPrice, curAnd1Price;\r | |
30fdf114 | 1162 | Bool nextIsChar;\r |
30fdf114 LG |
1163 | COptimal *curOpt;\r |
1164 | COptimal *nextOpt;\r | |
1165 | \r | |
1166 | cur++;\r | |
1167 | if (cur == lenEnd)\r | |
1168 | return Backward(p, backRes, cur);\r | |
1169 | \r | |
1170 | newLen = ReadMatchDistances(p, &numPairs);\r | |
1171 | if (newLen >= p->numFastBytes)\r | |
1172 | {\r | |
1173 | p->numPairs = numPairs;\r | |
1174 | p->longestMatchLength = newLen;\r | |
1175 | return Backward(p, backRes, cur);\r | |
1176 | }\r | |
1177 | position++;\r | |
1178 | curOpt = &p->opt[cur];\r | |
1179 | posPrev = curOpt->posPrev;\r | |
1180 | if (curOpt->prev1IsChar)\r | |
1181 | {\r | |
1182 | posPrev--;\r | |
1183 | if (curOpt->prev2)\r | |
1184 | {\r | |
1185 | state = p->opt[curOpt->posPrev2].state;\r | |
1186 | if (curOpt->backPrev2 < LZMA_NUM_REPS)\r | |
1187 | state = kRepNextStates[state];\r | |
1188 | else\r | |
1189 | state = kMatchNextStates[state];\r | |
1190 | }\r | |
1191 | else\r | |
1192 | state = p->opt[posPrev].state;\r | |
1193 | state = kLiteralNextStates[state];\r | |
1194 | }\r | |
1195 | else\r | |
1196 | state = p->opt[posPrev].state;\r | |
1197 | if (posPrev == cur - 1)\r | |
1198 | {\r | |
1199 | if (IsShortRep(curOpt))\r | |
1200 | state = kShortRepNextStates[state];\r | |
1201 | else\r | |
1202 | state = kLiteralNextStates[state];\r | |
1203 | }\r | |
1204 | else\r | |
1205 | {\r | |
1206 | UInt32 pos;\r | |
1207 | const COptimal *prevOpt;\r | |
1208 | if (curOpt->prev1IsChar && curOpt->prev2)\r | |
1209 | {\r | |
1210 | posPrev = curOpt->posPrev2;\r | |
1211 | pos = curOpt->backPrev2;\r | |
1212 | state = kRepNextStates[state];\r | |
1213 | }\r | |
1214 | else\r | |
1215 | {\r | |
1216 | pos = curOpt->backPrev;\r | |
1217 | if (pos < LZMA_NUM_REPS)\r | |
1218 | state = kRepNextStates[state];\r | |
1219 | else\r | |
1220 | state = kMatchNextStates[state];\r | |
1221 | }\r | |
1222 | prevOpt = &p->opt[posPrev];\r | |
1223 | if (pos < LZMA_NUM_REPS)\r | |
1224 | {\r | |
30fdf114 LG |
1225 | reps[0] = prevOpt->backs[pos];\r |
1226 | for (i = 1; i <= pos; i++)\r | |
1227 | reps[i] = prevOpt->backs[i - 1];\r | |
1228 | for (; i < LZMA_NUM_REPS; i++)\r | |
1229 | reps[i] = prevOpt->backs[i];\r | |
1230 | }\r | |
1231 | else\r | |
1232 | {\r | |
30fdf114 LG |
1233 | reps[0] = (pos - LZMA_NUM_REPS);\r |
1234 | for (i = 1; i < LZMA_NUM_REPS; i++)\r | |
1235 | reps[i] = prevOpt->backs[i - 1];\r | |
1236 | }\r | |
1237 | }\r | |
1238 | curOpt->state = (CState)state;\r | |
1239 | \r | |
1240 | curOpt->backs[0] = reps[0];\r | |
1241 | curOpt->backs[1] = reps[1];\r | |
1242 | curOpt->backs[2] = reps[2];\r | |
1243 | curOpt->backs[3] = reps[3];\r | |
1244 | \r | |
1245 | curPrice = curOpt->price;\r | |
1246 | nextIsChar = False;\r | |
1247 | data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;\r | |
1248 | curByte = *data;\r | |
1249 | matchByte = *(data - (reps[0] + 1));\r | |
1250 | \r | |
1251 | posState = (position & p->pbMask);\r | |
1252 | \r | |
1253 | curAnd1Price = curPrice + GET_PRICE_0(p->isMatch[state][posState]);\r | |
1254 | {\r | |
1255 | const CLzmaProb *probs = LIT_PROBS(position, *(data - 1));\r | |
1256 | curAnd1Price +=\r | |
1257 | (!IsCharState(state) ?\r | |
1258 | LitEnc_GetPriceMatched(probs, curByte, matchByte, p->ProbPrices) :\r | |
1259 | LitEnc_GetPrice(probs, curByte, p->ProbPrices));\r | |
1260 | }\r | |
1261 | \r | |
1262 | nextOpt = &p->opt[cur + 1];\r | |
1263 | \r | |
1264 | if (curAnd1Price < nextOpt->price)\r | |
1265 | {\r | |
1266 | nextOpt->price = curAnd1Price;\r | |
1267 | nextOpt->posPrev = cur;\r | |
1268 | MakeAsChar(nextOpt);\r | |
1269 | nextIsChar = True;\r | |
1270 | }\r | |
1271 | \r | |
1272 | matchPrice = curPrice + GET_PRICE_1(p->isMatch[state][posState]);\r | |
1273 | repMatchPrice = matchPrice + GET_PRICE_1(p->isRep[state]);\r | |
1274 | \r | |
1275 | if (matchByte == curByte && !(nextOpt->posPrev < cur && nextOpt->backPrev == 0))\r | |
1276 | {\r | |
1277 | UInt32 shortRepPrice = repMatchPrice + GetRepLen1Price(p, state, posState);\r | |
1278 | if (shortRepPrice <= nextOpt->price)\r | |
1279 | {\r | |
1280 | nextOpt->price = shortRepPrice;\r | |
1281 | nextOpt->posPrev = cur;\r | |
1282 | MakeAsShortRep(nextOpt);\r | |
1283 | nextIsChar = True;\r | |
1284 | }\r | |
1285 | }\r | |
1286 | numAvailFull = p->numAvail;\r | |
1287 | {\r | |
1288 | UInt32 temp = kNumOpts - 1 - cur;\r | |
1289 | if (temp < numAvailFull)\r | |
1290 | numAvailFull = temp;\r | |
1291 | }\r | |
1292 | \r | |
1293 | if (numAvailFull < 2)\r | |
1294 | continue;\r | |
1295 | numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes);\r | |
1296 | \r | |
1297 | if (!nextIsChar && matchByte != curByte) /* speed optimization */\r | |
1298 | {\r | |
1299 | /* try Literal + rep0 */\r | |
1300 | UInt32 temp;\r | |
1301 | UInt32 lenTest2;\r | |
1302 | const Byte *data2 = data - (reps[0] + 1);\r | |
1303 | UInt32 limit = p->numFastBytes + 1;\r | |
1304 | if (limit > numAvailFull)\r | |
1305 | limit = numAvailFull;\r | |
1306 | \r | |
1307 | for (temp = 1; temp < limit && data[temp] == data2[temp]; temp++);\r | |
1308 | lenTest2 = temp - 1;\r | |
1309 | if (lenTest2 >= 2)\r | |
1310 | {\r | |
1311 | UInt32 state2 = kLiteralNextStates[state];\r | |
1312 | UInt32 posStateNext = (position + 1) & p->pbMask;\r | |
1313 | UInt32 nextRepMatchPrice = curAnd1Price +\r | |
1314 | GET_PRICE_1(p->isMatch[state2][posStateNext]) +\r | |
1315 | GET_PRICE_1(p->isRep[state2]);\r | |
1316 | /* for (; lenTest2 >= 2; lenTest2--) */\r | |
1317 | {\r | |
30fdf114 LG |
1318 | COptimal *opt;\r |
1319 | UInt32 offset = cur + 1 + lenTest2;\r | |
1320 | while (lenEnd < offset)\r | |
1321 | p->opt[++lenEnd].price = kInfinityPrice;\r | |
5aec6991 | 1322 | UInt32 curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext);\r |
30fdf114 LG |
1323 | opt = &p->opt[offset];\r |
1324 | if (curAndLenPrice < opt->price)\r | |
1325 | {\r | |
1326 | opt->price = curAndLenPrice;\r | |
1327 | opt->posPrev = cur + 1;\r | |
1328 | opt->backPrev = 0;\r | |
1329 | opt->prev1IsChar = True;\r | |
1330 | opt->prev2 = False;\r | |
1331 | }\r | |
1332 | }\r | |
1333 | }\r | |
1334 | }\r | |
1335 | \r | |
1336 | startLen = 2; /* speed optimization */\r | |
1337 | {\r | |
1338 | UInt32 repIndex;\r | |
1339 | for (repIndex = 0; repIndex < LZMA_NUM_REPS; repIndex++)\r | |
1340 | {\r | |
1341 | UInt32 lenTest;\r | |
1342 | UInt32 lenTestTemp;\r | |
1343 | UInt32 price;\r | |
1344 | const Byte *data2 = data - (reps[repIndex] + 1);\r | |
1345 | if (data[0] != data2[0] || data[1] != data2[1])\r | |
1346 | continue;\r | |
1347 | for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);\r | |
1348 | while (lenEnd < cur + lenTest)\r | |
1349 | p->opt[++lenEnd].price = kInfinityPrice;\r | |
1350 | lenTestTemp = lenTest;\r | |
1351 | price = repMatchPrice + GetPureRepPrice(p, repIndex, state, posState);\r | |
1352 | do\r | |
1353 | {\r | |
1354 | UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][lenTest - 2];\r | |
1355 | COptimal *opt = &p->opt[cur + lenTest];\r | |
1356 | if (curAndLenPrice < opt->price)\r | |
1357 | {\r | |
1358 | opt->price = curAndLenPrice;\r | |
1359 | opt->posPrev = cur;\r | |
1360 | opt->backPrev = repIndex;\r | |
1361 | opt->prev1IsChar = False;\r | |
1362 | }\r | |
1363 | }\r | |
1364 | while (--lenTest >= 2);\r | |
1365 | lenTest = lenTestTemp;\r | |
1366 | \r | |
1367 | if (repIndex == 0)\r | |
1368 | startLen = lenTest + 1;\r | |
b9da8fe0 YZ |
1369 | \r |
1370 | #ifndef _MSC_VER\r | |
6cc7ada4 | 1371 | if (1 /* _maxMode */)\r |
b9da8fe0 | 1372 | #endif\r |
30fdf114 LG |
1373 | {\r |
1374 | UInt32 lenTest2 = lenTest + 1;\r | |
1375 | UInt32 limit = lenTest2 + p->numFastBytes;\r | |
1376 | UInt32 nextRepMatchPrice;\r | |
1377 | if (limit > numAvailFull)\r | |
1378 | limit = numAvailFull;\r | |
1379 | for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++);\r | |
1380 | lenTest2 -= lenTest + 1;\r | |
1381 | if (lenTest2 >= 2)\r | |
1382 | {\r | |
1383 | UInt32 state2 = kRepNextStates[state];\r | |
1384 | UInt32 posStateNext = (position + lenTest) & p->pbMask;\r | |
1385 | UInt32 curAndLenCharPrice =\r | |
1386 | price + p->repLenEnc.prices[posState][lenTest - 2] +\r | |
1387 | GET_PRICE_0(p->isMatch[state2][posStateNext]) +\r | |
1388 | LitEnc_GetPriceMatched(LIT_PROBS(position + lenTest, data[lenTest - 1]),\r | |
1389 | data[lenTest], data2[lenTest], p->ProbPrices);\r | |
1390 | state2 = kLiteralNextStates[state2];\r | |
1391 | posStateNext = (position + lenTest + 1) & p->pbMask;\r | |
1392 | nextRepMatchPrice = curAndLenCharPrice +\r | |
1393 | GET_PRICE_1(p->isMatch[state2][posStateNext]) +\r | |
1394 | GET_PRICE_1(p->isRep[state2]);\r | |
1395 | \r | |
1396 | /* for (; lenTest2 >= 2; lenTest2--) */\r | |
1397 | {\r | |
1398 | UInt32 curAndLenPrice;\r | |
1399 | COptimal *opt;\r | |
1400 | UInt32 offset = cur + lenTest + 1 + lenTest2;\r | |
1401 | while (lenEnd < offset)\r | |
1402 | p->opt[++lenEnd].price = kInfinityPrice;\r | |
1403 | curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext);\r | |
1404 | opt = &p->opt[offset];\r | |
1405 | if (curAndLenPrice < opt->price)\r | |
1406 | {\r | |
1407 | opt->price = curAndLenPrice;\r | |
1408 | opt->posPrev = cur + lenTest + 1;\r | |
1409 | opt->backPrev = 0;\r | |
1410 | opt->prev1IsChar = True;\r | |
1411 | opt->prev2 = True;\r | |
1412 | opt->posPrev2 = cur;\r | |
1413 | opt->backPrev2 = repIndex;\r | |
1414 | }\r | |
1415 | }\r | |
1416 | }\r | |
1417 | }\r | |
1418 | }\r | |
1419 | }\r | |
1420 | /* for (UInt32 lenTest = 2; lenTest <= newLen; lenTest++) */\r | |
1421 | if (newLen > numAvail)\r | |
1422 | {\r | |
1423 | newLen = numAvail;\r | |
1424 | for (numPairs = 0; newLen > matches[numPairs]; numPairs += 2);\r | |
1425 | matches[numPairs] = newLen;\r | |
1426 | numPairs += 2;\r | |
1427 | }\r | |
1428 | if (newLen >= startLen)\r | |
1429 | {\r | |
5aec6991 | 1430 | normalMatchPrice = matchPrice + GET_PRICE_0(p->isRep[state]);\r |
30fdf114 LG |
1431 | UInt32 offs, curBack, posSlot;\r |
1432 | UInt32 lenTest;\r | |
1433 | while (lenEnd < cur + newLen)\r | |
1434 | p->opt[++lenEnd].price = kInfinityPrice;\r | |
1435 | \r | |
1436 | offs = 0;\r | |
1437 | while (startLen > matches[offs])\r | |
1438 | offs += 2;\r | |
1439 | curBack = matches[offs + 1];\r | |
1440 | GetPosSlot2(curBack, posSlot);\r | |
1441 | for (lenTest = /*2*/ startLen; ; lenTest++)\r | |
1442 | {\r | |
5aec6991 YZ |
1443 | UInt32 curAndLenPrice;\r |
1444 | curAndLenPrice = normalMatchPrice + p->lenEnc.prices[posState][lenTest - LZMA_MATCH_LEN_MIN];\r | |
30fdf114 LG |
1445 | UInt32 lenToPosState = GetLenToPosState(lenTest);\r |
1446 | COptimal *opt;\r | |
1447 | if (curBack < kNumFullDistances)\r | |
1448 | curAndLenPrice += p->distancesPrices[lenToPosState][curBack];\r | |
1449 | else\r | |
1450 | curAndLenPrice += p->posSlotPrices[lenToPosState][posSlot] + p->alignPrices[curBack & kAlignMask];\r | |
1451 | \r | |
1452 | opt = &p->opt[cur + lenTest];\r | |
1453 | if (curAndLenPrice < opt->price)\r | |
1454 | {\r | |
1455 | opt->price = curAndLenPrice;\r | |
1456 | opt->posPrev = cur;\r | |
1457 | opt->backPrev = curBack + LZMA_NUM_REPS;\r | |
1458 | opt->prev1IsChar = False;\r | |
1459 | }\r | |
1460 | \r | |
1461 | if (/*_maxMode && */lenTest == matches[offs])\r | |
1462 | {\r | |
1463 | /* Try Match + Literal + Rep0 */\r | |
1464 | const Byte *data2 = data - (curBack + 1);\r | |
1465 | UInt32 lenTest2 = lenTest + 1;\r | |
1466 | UInt32 limit = lenTest2 + p->numFastBytes;\r | |
1467 | UInt32 nextRepMatchPrice;\r | |
1468 | if (limit > numAvailFull)\r | |
1469 | limit = numAvailFull;\r | |
1470 | for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++);\r | |
1471 | lenTest2 -= lenTest + 1;\r | |
1472 | if (lenTest2 >= 2)\r | |
1473 | {\r | |
1474 | UInt32 state2 = kMatchNextStates[state];\r | |
1475 | UInt32 posStateNext = (position + lenTest) & p->pbMask;\r | |
1476 | UInt32 curAndLenCharPrice = curAndLenPrice +\r | |
1477 | GET_PRICE_0(p->isMatch[state2][posStateNext]) +\r | |
1478 | LitEnc_GetPriceMatched(LIT_PROBS(position + lenTest, data[lenTest - 1]),\r | |
1479 | data[lenTest], data2[lenTest], p->ProbPrices);\r | |
1480 | state2 = kLiteralNextStates[state2];\r | |
1481 | posStateNext = (posStateNext + 1) & p->pbMask;\r | |
1482 | nextRepMatchPrice = curAndLenCharPrice +\r | |
1483 | GET_PRICE_1(p->isMatch[state2][posStateNext]) +\r | |
1484 | GET_PRICE_1(p->isRep[state2]);\r | |
1485 | \r | |
1486 | /* for (; lenTest2 >= 2; lenTest2--) */\r | |
1487 | {\r | |
1488 | UInt32 offset = cur + lenTest + 1 + lenTest2;\r | |
5aec6991 | 1489 | \r |
30fdf114 LG |
1490 | while (lenEnd < offset)\r |
1491 | p->opt[++lenEnd].price = kInfinityPrice;\r | |
1492 | curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext);\r | |
1493 | opt = &p->opt[offset];\r | |
1494 | if (curAndLenPrice < opt->price)\r | |
1495 | {\r | |
1496 | opt->price = curAndLenPrice;\r | |
1497 | opt->posPrev = cur + lenTest + 1;\r | |
1498 | opt->backPrev = 0;\r | |
1499 | opt->prev1IsChar = True;\r | |
1500 | opt->prev2 = True;\r | |
1501 | opt->posPrev2 = cur;\r | |
1502 | opt->backPrev2 = curBack + LZMA_NUM_REPS;\r | |
1503 | }\r | |
1504 | }\r | |
1505 | }\r | |
1506 | offs += 2;\r | |
1507 | if (offs == numPairs)\r | |
1508 | break;\r | |
1509 | curBack = matches[offs + 1];\r | |
1510 | if (curBack >= kNumFullDistances)\r | |
1511 | GetPosSlot2(curBack, posSlot);\r | |
1512 | }\r | |
1513 | }\r | |
1514 | }\r | |
1515 | }\r | |
1516 | }\r | |
1517 | \r | |
1518 | #define ChangePair(smallDist, bigDist) (((bigDist) >> 7) > (smallDist))\r | |
1519 | \r | |
1520 | static UInt32 GetOptimumFast(CLzmaEnc *p, UInt32 *backRes)\r | |
1521 | {\r | |
1522 | UInt32 numAvail, mainLen, mainDist, numPairs, repIndex, repLen, i;\r | |
1523 | const Byte *data;\r | |
1524 | const UInt32 *matches;\r | |
1525 | \r | |
1526 | if (p->additionalOffset == 0)\r | |
1527 | mainLen = ReadMatchDistances(p, &numPairs);\r | |
1528 | else\r | |
1529 | {\r | |
1530 | mainLen = p->longestMatchLength;\r | |
1531 | numPairs = p->numPairs;\r | |
1532 | }\r | |
1533 | \r | |
1534 | numAvail = p->numAvail;\r | |
1535 | *backRes = (UInt32)-1;\r | |
1536 | if (numAvail < 2)\r | |
1537 | return 1;\r | |
1538 | if (numAvail > LZMA_MATCH_LEN_MAX)\r | |
1539 | numAvail = LZMA_MATCH_LEN_MAX;\r | |
1540 | data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;\r | |
1541 | \r | |
1542 | repLen = repIndex = 0;\r | |
1543 | for (i = 0; i < LZMA_NUM_REPS; i++)\r | |
1544 | {\r | |
1545 | UInt32 len;\r | |
1546 | const Byte *data2 = data - (p->reps[i] + 1);\r | |
1547 | if (data[0] != data2[0] || data[1] != data2[1])\r | |
1548 | continue;\r | |
1549 | for (len = 2; len < numAvail && data[len] == data2[len]; len++);\r | |
1550 | if (len >= p->numFastBytes)\r | |
1551 | {\r | |
1552 | *backRes = i;\r | |
1553 | MovePos(p, len - 1);\r | |
1554 | return len;\r | |
1555 | }\r | |
1556 | if (len > repLen)\r | |
1557 | {\r | |
1558 | repIndex = i;\r | |
1559 | repLen = len;\r | |
1560 | }\r | |
1561 | }\r | |
1562 | \r | |
1563 | matches = p->matches;\r | |
1564 | if (mainLen >= p->numFastBytes)\r | |
1565 | {\r | |
1566 | *backRes = matches[numPairs - 1] + LZMA_NUM_REPS;\r | |
1567 | MovePos(p, mainLen - 1);\r | |
1568 | return mainLen;\r | |
1569 | }\r | |
1570 | \r | |
1571 | mainDist = 0; /* for GCC */\r | |
1572 | if (mainLen >= 2)\r | |
1573 | {\r | |
1574 | mainDist = matches[numPairs - 1];\r | |
1575 | while (numPairs > 2 && mainLen == matches[numPairs - 4] + 1)\r | |
1576 | {\r | |
1577 | if (!ChangePair(matches[numPairs - 3], mainDist))\r | |
1578 | break;\r | |
1579 | numPairs -= 2;\r | |
1580 | mainLen = matches[numPairs - 2];\r | |
1581 | mainDist = matches[numPairs - 1];\r | |
1582 | }\r | |
1583 | if (mainLen == 2 && mainDist >= 0x80)\r | |
1584 | mainLen = 1;\r | |
1585 | }\r | |
1586 | \r | |
1587 | if (repLen >= 2 && (\r | |
1588 | (repLen + 1 >= mainLen) ||\r | |
1589 | (repLen + 2 >= mainLen && mainDist >= (1 << 9)) ||\r | |
1590 | (repLen + 3 >= mainLen && mainDist >= (1 << 15))))\r | |
1591 | {\r | |
1592 | *backRes = repIndex;\r | |
1593 | MovePos(p, repLen - 1);\r | |
1594 | return repLen;\r | |
1595 | }\r | |
1596 | \r | |
1597 | if (mainLen < 2 || numAvail <= 2)\r | |
1598 | return 1;\r | |
1599 | \r | |
1600 | p->longestMatchLength = ReadMatchDistances(p, &p->numPairs);\r | |
1601 | if (p->longestMatchLength >= 2)\r | |
1602 | {\r | |
1603 | UInt32 newDistance = matches[p->numPairs - 1];\r | |
1604 | if ((p->longestMatchLength >= mainLen && newDistance < mainDist) ||\r | |
1605 | (p->longestMatchLength == mainLen + 1 && !ChangePair(mainDist, newDistance)) ||\r | |
1606 | (p->longestMatchLength > mainLen + 1) ||\r | |
1607 | (p->longestMatchLength + 1 >= mainLen && mainLen >= 3 && ChangePair(newDistance, mainDist)))\r | |
1608 | return 1;\r | |
1609 | }\r | |
1610 | \r | |
1611 | data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;\r | |
1612 | for (i = 0; i < LZMA_NUM_REPS; i++)\r | |
1613 | {\r | |
1614 | UInt32 len, limit;\r | |
1615 | const Byte *data2 = data - (p->reps[i] + 1);\r | |
1616 | if (data[0] != data2[0] || data[1] != data2[1])\r | |
1617 | continue;\r | |
1618 | limit = mainLen - 1;\r | |
1619 | for (len = 2; len < limit && data[len] == data2[len]; len++);\r | |
1620 | if (len >= limit)\r | |
1621 | return 1;\r | |
1622 | }\r | |
1623 | *backRes = mainDist + LZMA_NUM_REPS;\r | |
1624 | MovePos(p, mainLen - 2);\r | |
1625 | return mainLen;\r | |
1626 | }\r | |
1627 | \r | |
1628 | static void WriteEndMarker(CLzmaEnc *p, UInt32 posState)\r | |
1629 | {\r | |
1630 | UInt32 len;\r | |
1631 | RangeEnc_EncodeBit(&p->rc, &p->isMatch[p->state][posState], 1);\r | |
1632 | RangeEnc_EncodeBit(&p->rc, &p->isRep[p->state], 0);\r | |
1633 | p->state = kMatchNextStates[p->state];\r | |
1634 | len = LZMA_MATCH_LEN_MIN;\r | |
1635 | LenEnc_Encode2(&p->lenEnc, &p->rc, len - LZMA_MATCH_LEN_MIN, posState, !p->fastMode, p->ProbPrices);\r | |
1636 | RcTree_Encode(&p->rc, p->posSlotEncoder[GetLenToPosState(len)], kNumPosSlotBits, (1 << kNumPosSlotBits) - 1);\r | |
1637 | RangeEnc_EncodeDirectBits(&p->rc, (((UInt32)1 << 30) - 1) >> kNumAlignBits, 30 - kNumAlignBits);\r | |
1638 | RcTree_ReverseEncode(&p->rc, p->posAlignEncoder, kNumAlignBits, kAlignMask);\r | |
1639 | }\r | |
1640 | \r | |
1641 | static SRes CheckErrors(CLzmaEnc *p)\r | |
1642 | {\r | |
1643 | if (p->result != SZ_OK)\r | |
1644 | return p->result;\r | |
1645 | if (p->rc.res != SZ_OK)\r | |
1646 | p->result = SZ_ERROR_WRITE;\r | |
1647 | if (p->matchFinderBase.result != SZ_OK)\r | |
1648 | p->result = SZ_ERROR_READ;\r | |
1649 | if (p->result != SZ_OK)\r | |
1650 | p->finished = True;\r | |
1651 | return p->result;\r | |
1652 | }\r | |
1653 | \r | |
1654 | static SRes Flush(CLzmaEnc *p, UInt32 nowPos)\r | |
1655 | {\r | |
1656 | /* ReleaseMFStream(); */\r | |
1657 | p->finished = True;\r | |
1658 | if (p->writeEndMark)\r | |
1659 | WriteEndMarker(p, nowPos & p->pbMask);\r | |
1660 | RangeEnc_FlushData(&p->rc);\r | |
1661 | RangeEnc_FlushStream(&p->rc);\r | |
1662 | return CheckErrors(p);\r | |
1663 | }\r | |
1664 | \r | |
1665 | static void FillAlignPrices(CLzmaEnc *p)\r | |
1666 | {\r | |
1667 | UInt32 i;\r | |
1668 | for (i = 0; i < kAlignTableSize; i++)\r | |
1669 | p->alignPrices[i] = RcTree_ReverseGetPrice(p->posAlignEncoder, kNumAlignBits, i, p->ProbPrices);\r | |
1670 | p->alignPriceCount = 0;\r | |
1671 | }\r | |
1672 | \r | |
1673 | static void FillDistancesPrices(CLzmaEnc *p)\r | |
1674 | {\r | |
1675 | UInt32 tempPrices[kNumFullDistances];\r | |
1676 | UInt32 i, lenToPosState;\r | |
1677 | for (i = kStartPosModelIndex; i < kNumFullDistances; i++)\r | |
1678 | {\r | |
1679 | UInt32 posSlot = GetPosSlot1(i);\r | |
1680 | UInt32 footerBits = ((posSlot >> 1) - 1);\r | |
1681 | UInt32 base = ((2 | (posSlot & 1)) << footerBits);\r | |
1682 | tempPrices[i] = RcTree_ReverseGetPrice(p->posEncoders + base - posSlot - 1, footerBits, i - base, p->ProbPrices);\r | |
1683 | }\r | |
1684 | \r | |
1685 | for (lenToPosState = 0; lenToPosState < kNumLenToPosStates; lenToPosState++)\r | |
1686 | {\r | |
1687 | UInt32 posSlot;\r | |
1688 | const CLzmaProb *encoder = p->posSlotEncoder[lenToPosState];\r | |
1689 | UInt32 *posSlotPrices = p->posSlotPrices[lenToPosState];\r | |
1690 | for (posSlot = 0; posSlot < p->distTableSize; posSlot++)\r | |
1691 | posSlotPrices[posSlot] = RcTree_GetPrice(encoder, kNumPosSlotBits, posSlot, p->ProbPrices);\r | |
1692 | for (posSlot = kEndPosModelIndex; posSlot < p->distTableSize; posSlot++)\r | |
1693 | posSlotPrices[posSlot] += ((((posSlot >> 1) - 1) - kNumAlignBits) << kNumBitPriceShiftBits);\r | |
1694 | \r | |
1695 | {\r | |
1696 | UInt32 *distancesPrices = p->distancesPrices[lenToPosState];\r | |
5aec6991 | 1697 | \r |
30fdf114 LG |
1698 | for (i = 0; i < kStartPosModelIndex; i++)\r |
1699 | distancesPrices[i] = posSlotPrices[i];\r | |
1700 | for (; i < kNumFullDistances; i++)\r | |
1701 | distancesPrices[i] = posSlotPrices[GetPosSlot1(i)] + tempPrices[i];\r | |
1702 | }\r | |
1703 | }\r | |
1704 | p->matchPriceCount = 0;\r | |
1705 | }\r | |
1706 | \r | |
1707 | void LzmaEnc_Construct(CLzmaEnc *p)\r | |
1708 | {\r | |
1709 | RangeEnc_Construct(&p->rc);\r | |
1710 | MatchFinder_Construct(&p->matchFinderBase);\r | |
1711 | #ifdef COMPRESS_MF_MT\r | |
1712 | MatchFinderMt_Construct(&p->matchFinderMt);\r | |
1713 | p->matchFinderMt.MatchFinder = &p->matchFinderBase;\r | |
1714 | #endif\r | |
1715 | \r | |
1716 | {\r | |
1717 | CLzmaEncProps props;\r | |
1718 | LzmaEncProps_Init(&props);\r | |
1719 | LzmaEnc_SetProps(p, &props);\r | |
1720 | }\r | |
1721 | \r | |
1722 | #ifndef LZMA_LOG_BSR\r | |
1723 | LzmaEnc_FastPosInit(p->g_FastPos);\r | |
1724 | #endif\r | |
1725 | \r | |
1726 | LzmaEnc_InitPriceTables(p->ProbPrices);\r | |
1727 | p->litProbs = 0;\r | |
1728 | p->saveState.litProbs = 0;\r | |
1729 | }\r | |
1730 | \r | |
1731 | CLzmaEncHandle LzmaEnc_Create(ISzAlloc *alloc)\r | |
1732 | {\r | |
1733 | void *p;\r | |
1734 | p = alloc->Alloc(alloc, sizeof(CLzmaEnc));\r | |
1735 | if (p != 0)\r | |
1736 | LzmaEnc_Construct((CLzmaEnc *)p);\r | |
1737 | return p;\r | |
1738 | }\r | |
1739 | \r | |
1740 | void LzmaEnc_FreeLits(CLzmaEnc *p, ISzAlloc *alloc)\r | |
1741 | {\r | |
1742 | alloc->Free(alloc, p->litProbs);\r | |
1743 | alloc->Free(alloc, p->saveState.litProbs);\r | |
1744 | p->litProbs = 0;\r | |
1745 | p->saveState.litProbs = 0;\r | |
1746 | }\r | |
1747 | \r | |
1748 | void LzmaEnc_Destruct(CLzmaEnc *p, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
1749 | {\r | |
1750 | #ifdef COMPRESS_MF_MT\r | |
1751 | MatchFinderMt_Destruct(&p->matchFinderMt, allocBig);\r | |
1752 | #endif\r | |
1753 | MatchFinder_Free(&p->matchFinderBase, allocBig);\r | |
1754 | LzmaEnc_FreeLits(p, alloc);\r | |
1755 | RangeEnc_Free(&p->rc, alloc);\r | |
1756 | }\r | |
1757 | \r | |
1758 | void LzmaEnc_Destroy(CLzmaEncHandle p, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
1759 | {\r | |
1760 | LzmaEnc_Destruct((CLzmaEnc *)p, alloc, allocBig);\r | |
1761 | alloc->Free(alloc, p);\r | |
1762 | }\r | |
1763 | \r | |
1764 | static SRes LzmaEnc_CodeOneBlock(CLzmaEnc *p, Bool useLimits, UInt32 maxPackSize, UInt32 maxUnpackSize)\r | |
1765 | {\r | |
1766 | UInt32 nowPos32, startPos32;\r | |
1767 | if (p->inStream != 0)\r | |
1768 | {\r | |
1769 | p->matchFinderBase.stream = p->inStream;\r | |
1770 | p->matchFinder.Init(p->matchFinderObj);\r | |
1771 | p->inStream = 0;\r | |
1772 | }\r | |
1773 | \r | |
1774 | if (p->finished)\r | |
1775 | return p->result;\r | |
1776 | RINOK(CheckErrors(p));\r | |
1777 | \r | |
1778 | nowPos32 = (UInt32)p->nowPos64;\r | |
1779 | startPos32 = nowPos32;\r | |
1780 | \r | |
1781 | if (p->nowPos64 == 0)\r | |
1782 | {\r | |
1783 | UInt32 numPairs;\r | |
1784 | Byte curByte;\r | |
1785 | if (p->matchFinder.GetNumAvailableBytes(p->matchFinderObj) == 0)\r | |
1786 | return Flush(p, nowPos32);\r | |
1787 | ReadMatchDistances(p, &numPairs);\r | |
1788 | RangeEnc_EncodeBit(&p->rc, &p->isMatch[p->state][0], 0);\r | |
1789 | p->state = kLiteralNextStates[p->state];\r | |
1790 | curByte = p->matchFinder.GetIndexByte(p->matchFinderObj, 0 - p->additionalOffset);\r | |
1791 | LitEnc_Encode(&p->rc, p->litProbs, curByte);\r | |
1792 | p->additionalOffset--;\r | |
1793 | nowPos32++;\r | |
1794 | }\r | |
1795 | \r | |
1796 | if (p->matchFinder.GetNumAvailableBytes(p->matchFinderObj) != 0)\r | |
1797 | for (;;)\r | |
1798 | {\r | |
1799 | UInt32 pos, len, posState;\r | |
1800 | \r | |
1801 | if (p->fastMode)\r | |
1802 | len = GetOptimumFast(p, &pos);\r | |
1803 | else\r | |
1804 | len = GetOptimum(p, nowPos32, &pos);\r | |
1805 | \r | |
1806 | #ifdef SHOW_STAT2\r | |
1807 | printf("\n pos = %4X, len = %d pos = %d", nowPos32, len, pos);\r | |
1808 | #endif\r | |
1809 | \r | |
1810 | posState = nowPos32 & p->pbMask;\r | |
1811 | if (len == 1 && pos == (UInt32)-1)\r | |
1812 | {\r | |
1813 | Byte curByte;\r | |
1814 | CLzmaProb *probs;\r | |
1815 | const Byte *data;\r | |
1816 | \r | |
1817 | RangeEnc_EncodeBit(&p->rc, &p->isMatch[p->state][posState], 0);\r | |
1818 | data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - p->additionalOffset;\r | |
1819 | curByte = *data;\r | |
1820 | probs = LIT_PROBS(nowPos32, *(data - 1));\r | |
1821 | if (IsCharState(p->state))\r | |
1822 | LitEnc_Encode(&p->rc, probs, curByte);\r | |
1823 | else\r | |
1824 | LitEnc_EncodeMatched(&p->rc, probs, curByte, *(data - p->reps[0] - 1));\r | |
1825 | p->state = kLiteralNextStates[p->state];\r | |
1826 | }\r | |
1827 | else\r | |
1828 | {\r | |
1829 | RangeEnc_EncodeBit(&p->rc, &p->isMatch[p->state][posState], 1);\r | |
1830 | if (pos < LZMA_NUM_REPS)\r | |
1831 | {\r | |
1832 | RangeEnc_EncodeBit(&p->rc, &p->isRep[p->state], 1);\r | |
1833 | if (pos == 0)\r | |
1834 | {\r | |
1835 | RangeEnc_EncodeBit(&p->rc, &p->isRepG0[p->state], 0);\r | |
1836 | RangeEnc_EncodeBit(&p->rc, &p->isRep0Long[p->state][posState], ((len == 1) ? 0 : 1));\r | |
1837 | }\r | |
1838 | else\r | |
1839 | {\r | |
1840 | UInt32 distance = p->reps[pos];\r | |
1841 | RangeEnc_EncodeBit(&p->rc, &p->isRepG0[p->state], 1);\r | |
1842 | if (pos == 1)\r | |
1843 | RangeEnc_EncodeBit(&p->rc, &p->isRepG1[p->state], 0);\r | |
1844 | else\r | |
1845 | {\r | |
1846 | RangeEnc_EncodeBit(&p->rc, &p->isRepG1[p->state], 1);\r | |
1847 | RangeEnc_EncodeBit(&p->rc, &p->isRepG2[p->state], pos - 2);\r | |
1848 | if (pos == 3)\r | |
1849 | p->reps[3] = p->reps[2];\r | |
1850 | p->reps[2] = p->reps[1];\r | |
1851 | }\r | |
1852 | p->reps[1] = p->reps[0];\r | |
1853 | p->reps[0] = distance;\r | |
1854 | }\r | |
1855 | if (len == 1)\r | |
1856 | p->state = kShortRepNextStates[p->state];\r | |
1857 | else\r | |
1858 | {\r | |
1859 | LenEnc_Encode2(&p->repLenEnc, &p->rc, len - LZMA_MATCH_LEN_MIN, posState, !p->fastMode, p->ProbPrices);\r | |
1860 | p->state = kRepNextStates[p->state];\r | |
1861 | }\r | |
1862 | }\r | |
1863 | else\r | |
1864 | {\r | |
1865 | UInt32 posSlot;\r | |
1866 | RangeEnc_EncodeBit(&p->rc, &p->isRep[p->state], 0);\r | |
1867 | p->state = kMatchNextStates[p->state];\r | |
1868 | LenEnc_Encode2(&p->lenEnc, &p->rc, len - LZMA_MATCH_LEN_MIN, posState, !p->fastMode, p->ProbPrices);\r | |
1869 | pos -= LZMA_NUM_REPS;\r | |
1870 | GetPosSlot(pos, posSlot);\r | |
1871 | RcTree_Encode(&p->rc, p->posSlotEncoder[GetLenToPosState(len)], kNumPosSlotBits, posSlot);\r | |
1872 | \r | |
1873 | if (posSlot >= kStartPosModelIndex)\r | |
1874 | {\r | |
1875 | UInt32 footerBits = ((posSlot >> 1) - 1);\r | |
1876 | UInt32 base = ((2 | (posSlot & 1)) << footerBits);\r | |
1877 | UInt32 posReduced = pos - base;\r | |
1878 | \r | |
1879 | if (posSlot < kEndPosModelIndex)\r | |
1880 | RcTree_ReverseEncode(&p->rc, p->posEncoders + base - posSlot - 1, footerBits, posReduced);\r | |
1881 | else\r | |
1882 | {\r | |
1883 | RangeEnc_EncodeDirectBits(&p->rc, posReduced >> kNumAlignBits, footerBits - kNumAlignBits);\r | |
1884 | RcTree_ReverseEncode(&p->rc, p->posAlignEncoder, kNumAlignBits, posReduced & kAlignMask);\r | |
1885 | p->alignPriceCount++;\r | |
1886 | }\r | |
1887 | }\r | |
1888 | p->reps[3] = p->reps[2];\r | |
1889 | p->reps[2] = p->reps[1];\r | |
1890 | p->reps[1] = p->reps[0];\r | |
1891 | p->reps[0] = pos;\r | |
1892 | p->matchPriceCount++;\r | |
1893 | }\r | |
1894 | }\r | |
1895 | p->additionalOffset -= len;\r | |
1896 | nowPos32 += len;\r | |
1897 | if (p->additionalOffset == 0)\r | |
1898 | {\r | |
1899 | UInt32 processed;\r | |
1900 | if (!p->fastMode)\r | |
1901 | {\r | |
1902 | if (p->matchPriceCount >= (1 << 7))\r | |
1903 | FillDistancesPrices(p);\r | |
1904 | if (p->alignPriceCount >= kAlignTableSize)\r | |
1905 | FillAlignPrices(p);\r | |
1906 | }\r | |
1907 | if (p->matchFinder.GetNumAvailableBytes(p->matchFinderObj) == 0)\r | |
1908 | break;\r | |
1909 | processed = nowPos32 - startPos32;\r | |
1910 | if (useLimits)\r | |
1911 | {\r | |
1912 | if (processed + kNumOpts + 300 >= maxUnpackSize ||\r | |
1913 | RangeEnc_GetProcessed(&p->rc) + kNumOpts * 2 >= maxPackSize)\r | |
1914 | break;\r | |
1915 | }\r | |
1916 | else if (processed >= (1 << 15))\r | |
1917 | {\r | |
1918 | p->nowPos64 += nowPos32 - startPos32;\r | |
1919 | return CheckErrors(p);\r | |
1920 | }\r | |
1921 | }\r | |
1922 | }\r | |
1923 | p->nowPos64 += nowPos32 - startPos32;\r | |
1924 | return Flush(p, nowPos32);\r | |
1925 | }\r | |
1926 | \r | |
1927 | #define kBigHashDicLimit ((UInt32)1 << 24)\r | |
1928 | \r | |
1929 | static SRes LzmaEnc_Alloc(CLzmaEnc *p, UInt32 keepWindowSize, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
1930 | {\r | |
1931 | UInt32 beforeSize = kNumOpts;\r | |
0d2711a6 | 1932 | #ifdef COMPRESS_MF_MT\r |
30fdf114 | 1933 | Bool btMode;\r |
0d2711a6 | 1934 | #endif\r |
30fdf114 LG |
1935 | if (!RangeEnc_Alloc(&p->rc, alloc))\r |
1936 | return SZ_ERROR_MEM;\r | |
30fdf114 | 1937 | #ifdef COMPRESS_MF_MT\r |
0d2711a6 | 1938 | btMode = (p->matchFinderBase.btMode != 0);\r |
30fdf114 LG |
1939 | p->mtMode = (p->multiThread && !p->fastMode && btMode);\r |
1940 | #endif\r | |
1941 | \r | |
1942 | {\r | |
1943 | unsigned lclp = p->lc + p->lp;\r | |
1944 | if (p->litProbs == 0 || p->saveState.litProbs == 0 || p->lclp != lclp)\r | |
1945 | {\r | |
1946 | LzmaEnc_FreeLits(p, alloc);\r | |
1947 | p->litProbs = (CLzmaProb *)alloc->Alloc(alloc, (0x300 << lclp) * sizeof(CLzmaProb));\r | |
1948 | p->saveState.litProbs = (CLzmaProb *)alloc->Alloc(alloc, (0x300 << lclp) * sizeof(CLzmaProb));\r | |
1949 | if (p->litProbs == 0 || p->saveState.litProbs == 0)\r | |
1950 | {\r | |
1951 | LzmaEnc_FreeLits(p, alloc);\r | |
1952 | return SZ_ERROR_MEM;\r | |
1953 | }\r | |
1954 | p->lclp = lclp;\r | |
1955 | }\r | |
1956 | }\r | |
1957 | \r | |
1958 | p->matchFinderBase.bigHash = (p->dictSize > kBigHashDicLimit);\r | |
1959 | \r | |
1960 | if (beforeSize + p->dictSize < keepWindowSize)\r | |
1961 | beforeSize = keepWindowSize - p->dictSize;\r | |
1962 | \r | |
1963 | #ifdef COMPRESS_MF_MT\r | |
1964 | if (p->mtMode)\r | |
1965 | {\r | |
1966 | RINOK(MatchFinderMt_Create(&p->matchFinderMt, p->dictSize, beforeSize, p->numFastBytes, LZMA_MATCH_LEN_MAX, allocBig));\r | |
1967 | p->matchFinderObj = &p->matchFinderMt;\r | |
1968 | MatchFinderMt_CreateVTable(&p->matchFinderMt, &p->matchFinder);\r | |
1969 | }\r | |
1970 | else\r | |
1971 | #endif\r | |
1972 | {\r | |
1973 | if (!MatchFinder_Create(&p->matchFinderBase, p->dictSize, beforeSize, p->numFastBytes, LZMA_MATCH_LEN_MAX, allocBig))\r | |
1974 | return SZ_ERROR_MEM;\r | |
1975 | p->matchFinderObj = &p->matchFinderBase;\r | |
1976 | MatchFinder_CreateVTable(&p->matchFinderBase, &p->matchFinder);\r | |
1977 | }\r | |
1978 | return SZ_OK;\r | |
1979 | }\r | |
1980 | \r | |
1981 | void LzmaEnc_Init(CLzmaEnc *p)\r | |
1982 | {\r | |
1983 | UInt32 i;\r | |
1984 | p->state = 0;\r | |
1985 | for (i = 0 ; i < LZMA_NUM_REPS; i++)\r | |
1986 | p->reps[i] = 0;\r | |
1987 | \r | |
1988 | RangeEnc_Init(&p->rc);\r | |
1989 | \r | |
1990 | \r | |
1991 | for (i = 0; i < kNumStates; i++)\r | |
1992 | {\r | |
1993 | UInt32 j;\r | |
1994 | for (j = 0; j < LZMA_NUM_PB_STATES_MAX; j++)\r | |
1995 | {\r | |
1996 | p->isMatch[i][j] = kProbInitValue;\r | |
1997 | p->isRep0Long[i][j] = kProbInitValue;\r | |
1998 | }\r | |
1999 | p->isRep[i] = kProbInitValue;\r | |
2000 | p->isRepG0[i] = kProbInitValue;\r | |
2001 | p->isRepG1[i] = kProbInitValue;\r | |
2002 | p->isRepG2[i] = kProbInitValue;\r | |
2003 | }\r | |
2004 | \r | |
2005 | {\r | |
2006 | UInt32 num = 0x300 << (p->lp + p->lc);\r | |
2007 | for (i = 0; i < num; i++)\r | |
2008 | p->litProbs[i] = kProbInitValue;\r | |
2009 | }\r | |
2010 | \r | |
2011 | {\r | |
2012 | for (i = 0; i < kNumLenToPosStates; i++)\r | |
2013 | {\r | |
2014 | CLzmaProb *probs = p->posSlotEncoder[i];\r | |
2015 | UInt32 j;\r | |
2016 | for (j = 0; j < (1 << kNumPosSlotBits); j++)\r | |
2017 | probs[j] = kProbInitValue;\r | |
2018 | }\r | |
2019 | }\r | |
2020 | {\r | |
2021 | for (i = 0; i < kNumFullDistances - kEndPosModelIndex; i++)\r | |
2022 | p->posEncoders[i] = kProbInitValue;\r | |
2023 | }\r | |
2024 | \r | |
2025 | LenEnc_Init(&p->lenEnc.p);\r | |
2026 | LenEnc_Init(&p->repLenEnc.p);\r | |
2027 | \r | |
2028 | for (i = 0; i < (1 << kNumAlignBits); i++)\r | |
2029 | p->posAlignEncoder[i] = kProbInitValue;\r | |
2030 | \r | |
2031 | p->optimumEndIndex = 0;\r | |
2032 | p->optimumCurrentIndex = 0;\r | |
2033 | p->additionalOffset = 0;\r | |
2034 | \r | |
2035 | p->pbMask = (1 << p->pb) - 1;\r | |
2036 | p->lpMask = (1 << p->lp) - 1;\r | |
2037 | }\r | |
2038 | \r | |
2039 | void LzmaEnc_InitPrices(CLzmaEnc *p)\r | |
2040 | {\r | |
2041 | if (!p->fastMode)\r | |
2042 | {\r | |
2043 | FillDistancesPrices(p);\r | |
2044 | FillAlignPrices(p);\r | |
2045 | }\r | |
2046 | \r | |
2047 | p->lenEnc.tableSize =\r | |
2048 | p->repLenEnc.tableSize =\r | |
2049 | p->numFastBytes + 1 - LZMA_MATCH_LEN_MIN;\r | |
2050 | LenPriceEnc_UpdateTables(&p->lenEnc, 1 << p->pb, p->ProbPrices);\r | |
2051 | LenPriceEnc_UpdateTables(&p->repLenEnc, 1 << p->pb, p->ProbPrices);\r | |
2052 | }\r | |
2053 | \r | |
2054 | static SRes LzmaEnc_AllocAndInit(CLzmaEnc *p, UInt32 keepWindowSize, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2055 | {\r | |
2056 | UInt32 i;\r | |
2057 | for (i = 0; i < (UInt32)kDicLogSizeMaxCompress; i++)\r | |
2058 | if (p->dictSize <= ((UInt32)1 << i))\r | |
2059 | break;\r | |
2060 | p->distTableSize = i * 2;\r | |
2061 | \r | |
2062 | p->finished = False;\r | |
2063 | p->result = SZ_OK;\r | |
2064 | RINOK(LzmaEnc_Alloc(p, keepWindowSize, alloc, allocBig));\r | |
2065 | LzmaEnc_Init(p);\r | |
2066 | LzmaEnc_InitPrices(p);\r | |
2067 | p->nowPos64 = 0;\r | |
2068 | return SZ_OK;\r | |
2069 | }\r | |
2070 | \r | |
2071 | static SRes LzmaEnc_Prepare(CLzmaEncHandle pp, ISeqInStream *inStream, ISeqOutStream *outStream,\r | |
2072 | ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2073 | {\r | |
2074 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2075 | p->inStream = inStream;\r | |
2076 | p->rc.outStream = outStream;\r | |
2077 | return LzmaEnc_AllocAndInit(p, 0, alloc, allocBig);\r | |
2078 | }\r | |
2079 | \r | |
2080 | SRes LzmaEnc_PrepareForLzma2(CLzmaEncHandle pp,\r | |
2081 | ISeqInStream *inStream, UInt32 keepWindowSize,\r | |
2082 | ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2083 | {\r | |
2084 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2085 | p->inStream = inStream;\r | |
2086 | return LzmaEnc_AllocAndInit(p, keepWindowSize, alloc, allocBig);\r | |
2087 | }\r | |
2088 | \r | |
2089 | static void LzmaEnc_SetInputBuf(CLzmaEnc *p, const Byte *src, SizeT srcLen)\r | |
2090 | {\r | |
2091 | p->seqBufInStream.funcTable.Read = MyRead;\r | |
2092 | p->seqBufInStream.data = src;\r | |
2093 | p->seqBufInStream.rem = srcLen;\r | |
2094 | }\r | |
2095 | \r | |
2096 | SRes LzmaEnc_MemPrepare(CLzmaEncHandle pp, const Byte *src, SizeT srcLen,\r | |
2097 | UInt32 keepWindowSize, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2098 | {\r | |
2099 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2100 | LzmaEnc_SetInputBuf(p, src, srcLen);\r | |
2101 | p->inStream = &p->seqBufInStream.funcTable;\r | |
2102 | return LzmaEnc_AllocAndInit(p, keepWindowSize, alloc, allocBig);\r | |
2103 | }\r | |
2104 | \r | |
2105 | void LzmaEnc_Finish(CLzmaEncHandle pp)\r | |
2106 | {\r | |
2107 | #ifdef COMPRESS_MF_MT\r | |
2108 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2109 | if (p->mtMode)\r | |
2110 | MatchFinderMt_ReleaseStream(&p->matchFinderMt);\r | |
2111 | #else\r | |
5ddccf34 | 2112 | (void)pp;\r |
30fdf114 LG |
2113 | #endif\r |
2114 | }\r | |
2115 | \r | |
2116 | typedef struct _CSeqOutStreamBuf\r | |
2117 | {\r | |
2118 | ISeqOutStream funcTable;\r | |
2119 | Byte *data;\r | |
2120 | SizeT rem;\r | |
2121 | Bool overflow;\r | |
2122 | } CSeqOutStreamBuf;\r | |
2123 | \r | |
2124 | static size_t MyWrite(void *pp, const void *data, size_t size)\r | |
2125 | {\r | |
2126 | CSeqOutStreamBuf *p = (CSeqOutStreamBuf *)pp;\r | |
2127 | if (p->rem < size)\r | |
2128 | {\r | |
2129 | size = p->rem;\r | |
2130 | p->overflow = True;\r | |
2131 | }\r | |
2132 | memcpy(p->data, data, size);\r | |
2133 | p->rem -= size;\r | |
2134 | p->data += size;\r | |
2135 | return size;\r | |
2136 | }\r | |
2137 | \r | |
2138 | \r | |
2139 | UInt32 LzmaEnc_GetNumAvailableBytes(CLzmaEncHandle pp)\r | |
2140 | {\r | |
2141 | const CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2142 | return p->matchFinder.GetNumAvailableBytes(p->matchFinderObj);\r | |
2143 | }\r | |
2144 | \r | |
2145 | const Byte *LzmaEnc_GetCurBuf(CLzmaEncHandle pp)\r | |
2146 | {\r | |
2147 | const CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2148 | return p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - p->additionalOffset;\r | |
2149 | }\r | |
2150 | \r | |
2151 | SRes LzmaEnc_CodeOneMemBlock(CLzmaEncHandle pp, Bool reInit,\r | |
2152 | Byte *dest, size_t *destLen, UInt32 desiredPackSize, UInt32 *unpackSize)\r | |
2153 | {\r | |
2154 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2155 | UInt64 nowPos64;\r | |
2156 | SRes res;\r | |
2157 | CSeqOutStreamBuf outStream;\r | |
2158 | \r | |
2159 | outStream.funcTable.Write = MyWrite;\r | |
2160 | outStream.data = dest;\r | |
2161 | outStream.rem = *destLen;\r | |
2162 | outStream.overflow = False;\r | |
2163 | \r | |
2164 | p->writeEndMark = False;\r | |
2165 | p->finished = False;\r | |
2166 | p->result = SZ_OK;\r | |
2167 | \r | |
2168 | if (reInit)\r | |
2169 | LzmaEnc_Init(p);\r | |
2170 | LzmaEnc_InitPrices(p);\r | |
2171 | nowPos64 = p->nowPos64;\r | |
2172 | RangeEnc_Init(&p->rc);\r | |
2173 | p->rc.outStream = &outStream.funcTable;\r | |
2174 | \r | |
2175 | res = LzmaEnc_CodeOneBlock(p, True, desiredPackSize, *unpackSize);\r | |
2176 | \r | |
2177 | *unpackSize = (UInt32)(p->nowPos64 - nowPos64);\r | |
2178 | *destLen -= outStream.rem;\r | |
2179 | if (outStream.overflow)\r | |
2180 | return SZ_ERROR_OUTPUT_EOF;\r | |
2181 | \r | |
2182 | return res;\r | |
2183 | }\r | |
2184 | \r | |
2185 | SRes LzmaEnc_Encode(CLzmaEncHandle pp, ISeqOutStream *outStream, ISeqInStream *inStream, ICompressProgress *progress,\r | |
2186 | ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2187 | {\r | |
2188 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2189 | SRes res = SZ_OK;\r | |
2190 | \r | |
2191 | #ifdef COMPRESS_MF_MT\r | |
2192 | Byte allocaDummy[0x300];\r | |
2193 | int i = 0;\r | |
2194 | for (i = 0; i < 16; i++)\r | |
2195 | allocaDummy[i] = (Byte)i;\r | |
2196 | #endif\r | |
2197 | \r | |
2198 | RINOK(LzmaEnc_Prepare(pp, inStream, outStream, alloc, allocBig));\r | |
2199 | \r | |
2200 | for (;;)\r | |
2201 | {\r | |
2202 | res = LzmaEnc_CodeOneBlock(p, False, 0, 0);\r | |
2203 | if (res != SZ_OK || p->finished != 0)\r | |
2204 | break;\r | |
2205 | if (progress != 0)\r | |
2206 | {\r | |
2207 | res = progress->Progress(progress, p->nowPos64, RangeEnc_GetProcessed(&p->rc));\r | |
2208 | if (res != SZ_OK)\r | |
2209 | {\r | |
2210 | res = SZ_ERROR_PROGRESS;\r | |
2211 | break;\r | |
2212 | }\r | |
2213 | }\r | |
2214 | }\r | |
2215 | LzmaEnc_Finish(pp);\r | |
2216 | return res;\r | |
2217 | }\r | |
2218 | \r | |
2219 | SRes LzmaEnc_WriteProperties(CLzmaEncHandle pp, Byte *props, SizeT *size)\r | |
2220 | {\r | |
2221 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2222 | int i;\r | |
2223 | UInt32 dictSize = p->dictSize;\r | |
2224 | if (*size < LZMA_PROPS_SIZE)\r | |
2225 | return SZ_ERROR_PARAM;\r | |
2226 | *size = LZMA_PROPS_SIZE;\r | |
2227 | props[0] = (Byte)((p->pb * 5 + p->lp) * 9 + p->lc);\r | |
2228 | \r | |
2229 | for (i = 11; i <= 30; i++)\r | |
2230 | {\r | |
2231 | if (dictSize <= ((UInt32)2 << i))\r | |
2232 | {\r | |
2233 | dictSize = (2 << i);\r | |
2234 | break;\r | |
2235 | }\r | |
2236 | if (dictSize <= ((UInt32)3 << i))\r | |
2237 | {\r | |
2238 | dictSize = (3 << i);\r | |
2239 | break;\r | |
2240 | }\r | |
2241 | }\r | |
2242 | \r | |
2243 | for (i = 0; i < 4; i++)\r | |
2244 | props[1 + i] = (Byte)(dictSize >> (8 * i));\r | |
2245 | return SZ_OK;\r | |
2246 | }\r | |
2247 | \r | |
2248 | SRes LzmaEnc_MemEncode(CLzmaEncHandle pp, Byte *dest, SizeT *destLen, const Byte *src, SizeT srcLen,\r | |
2249 | int writeEndMark, ICompressProgress *progress, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2250 | {\r | |
2251 | SRes res;\r | |
2252 | CLzmaEnc *p = (CLzmaEnc *)pp;\r | |
2253 | \r | |
2254 | CSeqOutStreamBuf outStream;\r | |
2255 | \r | |
2256 | LzmaEnc_SetInputBuf(p, src, srcLen);\r | |
2257 | \r | |
2258 | outStream.funcTable.Write = MyWrite;\r | |
2259 | outStream.data = dest;\r | |
2260 | outStream.rem = *destLen;\r | |
2261 | outStream.overflow = False;\r | |
2262 | \r | |
2263 | p->writeEndMark = writeEndMark;\r | |
2264 | res = LzmaEnc_Encode(pp, &outStream.funcTable, &p->seqBufInStream.funcTable,\r | |
2265 | progress, alloc, allocBig);\r | |
2266 | \r | |
2267 | *destLen -= outStream.rem;\r | |
2268 | if (outStream.overflow)\r | |
2269 | return SZ_ERROR_OUTPUT_EOF;\r | |
2270 | return res;\r | |
2271 | }\r | |
2272 | \r | |
2273 | SRes LzmaEncode(Byte *dest, SizeT *destLen, const Byte *src, SizeT srcLen,\r | |
2274 | const CLzmaEncProps *props, Byte *propsEncoded, SizeT *propsSize, int writeEndMark,\r | |
2275 | ICompressProgress *progress, ISzAlloc *alloc, ISzAlloc *allocBig)\r | |
2276 | {\r | |
2277 | CLzmaEnc *p = (CLzmaEnc *)LzmaEnc_Create(alloc);\r | |
2278 | SRes res;\r | |
2279 | if (p == 0)\r | |
2280 | return SZ_ERROR_MEM;\r | |
2281 | \r | |
2282 | res = LzmaEnc_SetProps(p, props);\r | |
2283 | if (res == SZ_OK)\r | |
2284 | {\r | |
2285 | res = LzmaEnc_WriteProperties(p, propsEncoded, propsSize);\r | |
2286 | if (res == SZ_OK)\r | |
2287 | res = LzmaEnc_MemEncode(p, dest, destLen, src, srcLen,\r | |
2288 | writeEndMark, progress, alloc, allocBig);\r | |
2289 | }\r | |
2290 | \r | |
2291 | LzmaEnc_Destroy(p, alloc, allocBig);\r | |
2292 | return res;\r | |
2293 | }\r |