/src/CMake/Utilities/cmlibarchive/libarchive/archive_ppmd7.c
Line | Count | Source |
1 | | /* Ppmd7.c -- PPMdH codec |
2 | | 2010-03-12 : Igor Pavlov : Public domain |
3 | | This code is based on PPMd var.H (2001): Dmitry Shkarin : Public domain */ |
4 | | |
5 | | #include "archive_platform.h" |
6 | | |
7 | | #include <stdlib.h> |
8 | | |
9 | | #include "archive_ppmd7_private.h" |
10 | | |
11 | | #ifdef PPMD_32BIT |
12 | | #define Ppmd7_GetPtr(p, ptr) (ptr) |
13 | | #define Ppmd7_GetContext(p, ptr) (ptr) |
14 | | #define Ppmd7_GetStats(p, ctx) ((ctx)->Stats) |
15 | | #else |
16 | 0 | #define Ppmd7_GetPtr(p, offs) ((void *)((p)->Base + (offs))) |
17 | 0 | #define Ppmd7_GetContext(p, offs) ((CPpmd7_Context *)Ppmd7_GetPtr((p), (offs))) |
18 | 0 | #define Ppmd7_GetStats(p, ctx) ((CPpmd_State *)Ppmd7_GetPtr((p), ((ctx)->Stats))) |
19 | | #endif |
20 | | |
21 | | #define Ppmd7_GetBinSumm(p) \ |
22 | 0 | &p->BinSumm[Ppmd7Context_OneState(p->MinContext)->Freq - 1][p->PrevSuccess + \ |
23 | 0 | p->NS2BSIndx[Ppmd7_GetContext(p, p->MinContext->Suffix)->NumStats - 1] + \ |
24 | 0 | (p->HiBitsFlag = p->HB2Flag[p->FoundState->Symbol]) + \ |
25 | 0 | 2 * p->HB2Flag[Ppmd7Context_OneState(p->MinContext)->Symbol] + \ |
26 | 0 | ((p->RunLength >> 26) & 0x20)] |
27 | | |
28 | 0 | #define kTopValue (1 << 24) |
29 | 0 | #define MAX_FREQ 124 |
30 | 0 | #define UNIT_SIZE 12 |
31 | | |
32 | 0 | #define U2B(nu) ((UInt32)(nu) * UNIT_SIZE) |
33 | 0 | #define U2I(nu) (p->Units2Indx[(nu) - 1]) |
34 | 0 | #define I2U(indx) (p->Indx2Units[indx]) |
35 | | |
36 | | #ifdef PPMD_32BIT |
37 | | #define REF(ptr) (ptr) |
38 | | #else |
39 | 0 | #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base)) |
40 | | #endif |
41 | | |
42 | 0 | #define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr)) |
43 | | |
44 | 0 | #define CTX(ref) ((CPpmd7_Context *)Ppmd7_GetContext(p, ref)) |
45 | 0 | #define STATS(ctx) Ppmd7_GetStats(p, ctx) |
46 | 0 | #define ONE_STATE(ctx) Ppmd7Context_OneState(ctx) |
47 | 0 | #define SUFFIX(ctx) CTX((ctx)->Suffix) |
48 | | |
49 | | static const UInt16 kInitBinEsc[] = { 0x3CDD, 0x1F3F, 0x59BF, 0x48F3, 0x64A1, 0x5ABC, 0x6632, 0x6051}; |
50 | | static const Byte PPMD7_kExpEscape[16] = { 25, 14, 9, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2 }; |
51 | | |
52 | | typedef CPpmd7_Context * CTX_PTR; |
53 | | |
54 | | struct CPpmd7_Node_; |
55 | | |
56 | | typedef |
57 | | #ifdef PPMD_32BIT |
58 | | struct CPpmd7_Node_ * |
59 | | #else |
60 | | UInt32 |
61 | | #endif |
62 | | CPpmd7_Node_Ref; |
63 | | |
64 | | typedef struct CPpmd7_Node_ |
65 | | { |
66 | | UInt16 Stamp; /* must be at offset 0 as CPpmd7_Context::NumStats. Stamp=0 means free */ |
67 | | UInt16 NU; |
68 | | CPpmd7_Node_Ref Next; /* must be at offset >= 4 */ |
69 | | CPpmd7_Node_Ref Prev; |
70 | | } CPpmd7_Node; |
71 | | |
72 | | #ifdef PPMD_32BIT |
73 | | #define NODE(ptr) (ptr) |
74 | | #else |
75 | 0 | #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs))) |
76 | | #endif |
77 | | |
78 | | static void Ppmd7_Update1(CPpmd7 *p); |
79 | | static void Ppmd7_Update1_0(CPpmd7 *p); |
80 | | static void Ppmd7_Update2(CPpmd7 *p); |
81 | | static void Ppmd7_UpdateBin(CPpmd7 *p); |
82 | | static CPpmd_See *Ppmd7_MakeEscFreq(CPpmd7 *p, unsigned numMasked, |
83 | | UInt32 *scale); |
84 | | |
85 | | /* ----------- Base ----------- */ |
86 | | |
87 | | static void Ppmd7_Construct(CPpmd7 *p) |
88 | 0 | { |
89 | 0 | unsigned i, k, m; |
90 | |
|
91 | 0 | p->Base = 0; |
92 | |
|
93 | 0 | for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++) |
94 | 0 | { |
95 | 0 | unsigned step = (i >= 12 ? 4 : (i >> 2) + 1); |
96 | 0 | do { p->Units2Indx[k++] = (Byte)i; } while(--step); |
97 | 0 | p->Indx2Units[i] = (Byte)k; |
98 | 0 | } |
99 | |
|
100 | 0 | p->NS2BSIndx[0] = (0 << 1); |
101 | 0 | p->NS2BSIndx[1] = (1 << 1); |
102 | 0 | memset(p->NS2BSIndx + 2, (2 << 1), 9); |
103 | 0 | memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11); |
104 | |
|
105 | 0 | for (i = 0; i < 3; i++) |
106 | 0 | p->NS2Indx[i] = (Byte)i; |
107 | 0 | for (m = i, k = 1; i < 256; i++) |
108 | 0 | { |
109 | 0 | p->NS2Indx[i] = (Byte)m; |
110 | 0 | if (--k == 0) |
111 | 0 | k = (++m) - 2; |
112 | 0 | } |
113 | |
|
114 | 0 | memset(p->HB2Flag, 0, 0x40); |
115 | 0 | memset(p->HB2Flag + 0x40, 8, 0x100 - 0x40); |
116 | 0 | } |
117 | | |
118 | | static void Ppmd7_Free(CPpmd7 *p) |
119 | 29.0k | { |
120 | 29.0k | free(p->Base); |
121 | 29.0k | p->Size = 0; |
122 | 29.0k | p->Base = 0; |
123 | 29.0k | } |
124 | | |
125 | | static Bool Ppmd7_Alloc(CPpmd7 *p, UInt32 size) |
126 | 0 | { |
127 | 0 | if (p->Base == 0 || p->Size != size) |
128 | 0 | { |
129 | | /* RestartModel() below assumes that p->Size >= UNIT_SIZE |
130 | | (see the calculation of m->MinContext). */ |
131 | 0 | if (size < UNIT_SIZE) { |
132 | 0 | return False; |
133 | 0 | } |
134 | 0 | Ppmd7_Free(p); |
135 | 0 | p->AlignOffset = |
136 | | #ifdef PPMD_32BIT |
137 | | (4 - size) & 3; |
138 | | #else |
139 | 0 | 4 - (size & 3); |
140 | 0 | #endif |
141 | 0 | if ((p->Base = malloc(p->AlignOffset + size |
142 | 0 | #ifndef PPMD_32BIT |
143 | 0 | + UNIT_SIZE |
144 | 0 | #endif |
145 | 0 | )) == 0) |
146 | 0 | return False; |
147 | 0 | p->Size = size; |
148 | 0 | } |
149 | 0 | return True; |
150 | 0 | } |
151 | | |
152 | | static void InsertNode(CPpmd7 *p, void *node, unsigned indx) |
153 | 0 | { |
154 | 0 | *((CPpmd_Void_Ref *)node) = p->FreeList[indx]; |
155 | 0 | p->FreeList[indx] = REF(node); |
156 | 0 | } |
157 | | |
158 | | static void *RemoveNode(CPpmd7 *p, unsigned indx) |
159 | 0 | { |
160 | 0 | CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); |
161 | 0 | p->FreeList[indx] = *node; |
162 | 0 | return node; |
163 | 0 | } |
164 | | |
165 | | static void SplitBlock(CPpmd7 *p, void *ptr, unsigned oldIndx, unsigned newIndx) |
166 | 0 | { |
167 | 0 | unsigned i, nu = I2U(oldIndx) - I2U(newIndx); |
168 | 0 | ptr = (Byte *)ptr + U2B(I2U(newIndx)); |
169 | 0 | if (I2U(i = U2I(nu)) != nu) |
170 | 0 | { |
171 | 0 | unsigned k = I2U(--i); |
172 | 0 | InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1); |
173 | 0 | } |
174 | 0 | InsertNode(p, ptr, i); |
175 | 0 | } |
176 | | |
177 | | static void GlueFreeBlocks(CPpmd7 *p) |
178 | 0 | { |
179 | | #ifdef PPMD_32BIT |
180 | | CPpmd7_Node headItem; |
181 | | CPpmd7_Node_Ref head = &headItem; |
182 | | #else |
183 | 0 | CPpmd7_Node_Ref head = p->AlignOffset + p->Size; |
184 | 0 | #endif |
185 | | |
186 | 0 | CPpmd7_Node_Ref n = head; |
187 | 0 | unsigned i; |
188 | |
|
189 | 0 | p->GlueCount = 255; |
190 | | |
191 | | /* create doubly-linked list of free blocks */ |
192 | 0 | for (i = 0; i < PPMD_NUM_INDEXES; i++) |
193 | 0 | { |
194 | 0 | UInt16 nu = I2U(i); |
195 | 0 | CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i]; |
196 | 0 | p->FreeList[i] = 0; |
197 | 0 | while (next != 0) |
198 | 0 | { |
199 | 0 | CPpmd7_Node *node = NODE(next); |
200 | 0 | node->Next = n; |
201 | 0 | n = NODE(n)->Prev = next; |
202 | 0 | next = *(const CPpmd7_Node_Ref *)node; |
203 | 0 | node->Stamp = 0; |
204 | 0 | node->NU = (UInt16)nu; |
205 | 0 | } |
206 | 0 | } |
207 | 0 | NODE(head)->Stamp = 1; |
208 | 0 | NODE(head)->Next = n; |
209 | 0 | NODE(n)->Prev = head; |
210 | 0 | if (p->LoUnit != p->HiUnit) |
211 | 0 | ((CPpmd7_Node *)p->LoUnit)->Stamp = 1; |
212 | | |
213 | | /* Glue free blocks */ |
214 | 0 | while (n != head) |
215 | 0 | { |
216 | 0 | CPpmd7_Node *node = NODE(n); |
217 | 0 | UInt32 nu = (UInt32)node->NU; |
218 | 0 | for (;;) |
219 | 0 | { |
220 | 0 | CPpmd7_Node *node2 = NODE(n) + nu; |
221 | 0 | nu += node2->NU; |
222 | 0 | if (node2->Stamp != 0 || nu >= 0x10000) |
223 | 0 | break; |
224 | 0 | NODE(node2->Prev)->Next = node2->Next; |
225 | 0 | NODE(node2->Next)->Prev = node2->Prev; |
226 | 0 | node->NU = (UInt16)nu; |
227 | 0 | } |
228 | 0 | n = node->Next; |
229 | 0 | } |
230 | | |
231 | | /* Fill lists of free blocks */ |
232 | 0 | for (n = NODE(head)->Next; n != head;) |
233 | 0 | { |
234 | 0 | CPpmd7_Node *node = NODE(n); |
235 | 0 | unsigned nu; |
236 | 0 | CPpmd7_Node_Ref next = node->Next; |
237 | 0 | for (nu = node->NU; nu > 128; nu -= 128, node += 128) |
238 | 0 | InsertNode(p, node, PPMD_NUM_INDEXES - 1); |
239 | 0 | if (I2U(i = U2I(nu)) != nu) |
240 | 0 | { |
241 | 0 | unsigned k = I2U(--i); |
242 | 0 | InsertNode(p, node + k, nu - k - 1); |
243 | 0 | } |
244 | 0 | InsertNode(p, node, i); |
245 | 0 | n = next; |
246 | 0 | } |
247 | 0 | } |
248 | | |
249 | | static void *AllocUnitsRare(CPpmd7 *p, unsigned indx) |
250 | 0 | { |
251 | 0 | unsigned i; |
252 | 0 | void *retVal; |
253 | 0 | if (p->GlueCount == 0) |
254 | 0 | { |
255 | 0 | GlueFreeBlocks(p); |
256 | 0 | if (p->FreeList[indx] != 0) |
257 | 0 | return RemoveNode(p, indx); |
258 | 0 | } |
259 | 0 | i = indx; |
260 | 0 | do |
261 | 0 | { |
262 | 0 | if (++i == PPMD_NUM_INDEXES) |
263 | 0 | { |
264 | 0 | UInt32 numBytes = U2B(I2U(indx)); |
265 | 0 | p->GlueCount--; |
266 | 0 | return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL); |
267 | 0 | } |
268 | 0 | } |
269 | 0 | while (p->FreeList[i] == 0); |
270 | 0 | retVal = RemoveNode(p, i); |
271 | 0 | SplitBlock(p, retVal, i, indx); |
272 | 0 | return retVal; |
273 | 0 | } |
274 | | |
275 | | static void *AllocUnits(CPpmd7 *p, unsigned indx) |
276 | 0 | { |
277 | 0 | UInt32 numBytes; |
278 | 0 | if (p->FreeList[indx] != 0) |
279 | 0 | return RemoveNode(p, indx); |
280 | 0 | numBytes = U2B(I2U(indx)); |
281 | 0 | if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit)) |
282 | 0 | { |
283 | 0 | void *retVal = p->LoUnit; |
284 | 0 | p->LoUnit += numBytes; |
285 | 0 | return retVal; |
286 | 0 | } |
287 | 0 | return AllocUnitsRare(p, indx); |
288 | 0 | } |
289 | | |
290 | 0 | #define MyMem12Cpy(dest, src, num) do { \ |
291 | 0 | UInt32 *d = (UInt32 *)dest; \ |
292 | 0 | const UInt32 *s = (const UInt32 *)src; \ |
293 | 0 | UInt32 n = num; \ |
294 | 0 | do { \ |
295 | 0 | d[0] = s[0]; d[1] = s[1]; d[2] = s[2]; s += 3; d += 3; \ |
296 | 0 | } while(--n); \ |
297 | 0 | } while (0) |
298 | | |
299 | | static void *ShrinkUnits(CPpmd7 *p, void *oldPtr, unsigned oldNU, unsigned newNU) |
300 | 0 | { |
301 | 0 | unsigned i0 = U2I(oldNU); |
302 | 0 | unsigned i1 = U2I(newNU); |
303 | 0 | if (i0 == i1) |
304 | 0 | return oldPtr; |
305 | 0 | if (p->FreeList[i1] != 0) |
306 | 0 | { |
307 | 0 | void *ptr = RemoveNode(p, i1); |
308 | 0 | MyMem12Cpy(ptr, oldPtr, newNU); |
309 | 0 | InsertNode(p, oldPtr, i0); |
310 | 0 | return ptr; |
311 | 0 | } |
312 | 0 | SplitBlock(p, oldPtr, i0, i1); |
313 | 0 | return oldPtr; |
314 | 0 | } |
315 | | |
316 | 0 | #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16))) |
317 | | |
318 | | static void SetSuccessor(CPpmd_State *p, CPpmd_Void_Ref v) |
319 | 0 | { |
320 | 0 | (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF); |
321 | 0 | (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF); |
322 | 0 | } |
323 | | |
324 | | static void RestartModel(CPpmd7 *p) |
325 | 0 | { |
326 | 0 | unsigned i, k, m; |
327 | |
|
328 | 0 | memset(p->FreeList, 0, sizeof(p->FreeList)); |
329 | 0 | p->Text = p->Base + p->AlignOffset; |
330 | 0 | p->HiUnit = p->Text + p->Size; |
331 | 0 | p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE; |
332 | 0 | p->GlueCount = 0; |
333 | |
|
334 | 0 | p->OrderFall = p->MaxOrder; |
335 | 0 | p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1; |
336 | 0 | p->PrevSuccess = 0; |
337 | |
|
338 | 0 | p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */ |
339 | 0 | p->MinContext->Suffix = 0; |
340 | 0 | p->MinContext->NumStats = 256; |
341 | 0 | p->MinContext->SummFreq = 256 + 1; |
342 | 0 | p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */ |
343 | 0 | p->LoUnit += U2B(256 / 2); |
344 | 0 | p->MinContext->Stats = REF(p->FoundState); |
345 | 0 | for (i = 0; i < 256; i++) |
346 | 0 | { |
347 | 0 | CPpmd_State *s = &p->FoundState[i]; |
348 | 0 | s->Symbol = (Byte)i; |
349 | 0 | s->Freq = 1; |
350 | 0 | SetSuccessor(s, 0); |
351 | 0 | } |
352 | |
|
353 | 0 | for (i = 0; i < 128; i++) |
354 | 0 | for (k = 0; k < 8; k++) |
355 | 0 | { |
356 | 0 | UInt16 *dest = p->BinSumm[i] + k; |
357 | 0 | UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 2)); |
358 | 0 | for (m = 0; m < 64; m += 8) |
359 | 0 | dest[m] = val; |
360 | 0 | } |
361 | | |
362 | 0 | for (i = 0; i < 25; i++) |
363 | 0 | for (k = 0; k < 16; k++) |
364 | 0 | { |
365 | 0 | CPpmd_See *s = &p->See[i][k]; |
366 | 0 | s->Summ = (UInt16)((5 * i + 10) << (s->Shift = PPMD_PERIOD_BITS - 4)); |
367 | 0 | s->Count = 4; |
368 | 0 | } |
369 | 0 | } |
370 | | |
371 | | static void Ppmd7_Init(CPpmd7 *p, unsigned maxOrder) |
372 | 0 | { |
373 | 0 | p->MaxOrder = maxOrder; |
374 | 0 | RestartModel(p); |
375 | 0 | p->DummySee.Shift = PPMD_PERIOD_BITS; |
376 | 0 | p->DummySee.Summ = 0; /* unused */ |
377 | 0 | p->DummySee.Count = 64; /* unused */ |
378 | 0 | } |
379 | | |
380 | | static CTX_PTR CreateSuccessors(CPpmd7 *p, Bool skip) |
381 | 0 | { |
382 | 0 | CPpmd_State upState; |
383 | 0 | CTX_PTR c = p->MinContext; |
384 | 0 | CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState); |
385 | 0 | CPpmd_State *ps[PPMD7_MAX_ORDER]; |
386 | 0 | unsigned numPs = 0; |
387 | | |
388 | 0 | if (!skip) |
389 | 0 | ps[numPs++] = p->FoundState; |
390 | | |
391 | 0 | while (c->Suffix) |
392 | 0 | { |
393 | 0 | CPpmd_Void_Ref successor; |
394 | 0 | CPpmd_State *s; |
395 | 0 | c = SUFFIX(c); |
396 | 0 | if (c->NumStats != 1) |
397 | 0 | { |
398 | 0 | for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++); |
399 | 0 | } |
400 | 0 | else |
401 | 0 | s = ONE_STATE(c); |
402 | 0 | successor = SUCCESSOR(s); |
403 | 0 | if (successor != upBranch) |
404 | 0 | { |
405 | 0 | c = CTX(successor); |
406 | 0 | if (numPs == 0) |
407 | 0 | return c; |
408 | 0 | break; |
409 | 0 | } |
410 | 0 | ps[numPs++] = s; |
411 | 0 | } |
412 | | |
413 | 0 | upState.Symbol = *(const Byte *)Ppmd7_GetPtr(p, upBranch); |
414 | 0 | SetSuccessor(&upState, upBranch + 1); |
415 | | |
416 | 0 | if (c->NumStats == 1) |
417 | 0 | upState.Freq = ONE_STATE(c)->Freq; |
418 | 0 | else |
419 | 0 | { |
420 | 0 | UInt32 cf, s0; |
421 | 0 | CPpmd_State *s; |
422 | 0 | for (s = STATS(c); s->Symbol != upState.Symbol; s++); |
423 | 0 | cf = s->Freq - 1; |
424 | 0 | s0 = c->SummFreq - c->NumStats - cf; |
425 | 0 | upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((2 * cf + 3 * s0 - 1) / (2 * s0)))); |
426 | 0 | } |
427 | |
|
428 | 0 | while (numPs != 0) |
429 | 0 | { |
430 | | /* Create Child */ |
431 | 0 | CTX_PTR c1; /* = AllocContext(p); */ |
432 | 0 | if (p->HiUnit != p->LoUnit) |
433 | 0 | c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); |
434 | 0 | else if (p->FreeList[0] != 0) |
435 | 0 | c1 = (CTX_PTR)RemoveNode(p, 0); |
436 | 0 | else |
437 | 0 | { |
438 | 0 | c1 = (CTX_PTR)AllocUnitsRare(p, 0); |
439 | 0 | if (!c1) |
440 | 0 | return NULL; |
441 | 0 | } |
442 | 0 | c1->NumStats = 1; |
443 | 0 | *ONE_STATE(c1) = upState; |
444 | 0 | c1->Suffix = REF(c); |
445 | 0 | SetSuccessor(ps[--numPs], REF(c1)); |
446 | 0 | c = c1; |
447 | 0 | } |
448 | | |
449 | 0 | return c; |
450 | 0 | } |
451 | | |
452 | | static void SwapStates(CPpmd_State *t1, CPpmd_State *t2) |
453 | 0 | { |
454 | 0 | CPpmd_State tmp = *t1; |
455 | 0 | *t1 = *t2; |
456 | 0 | *t2 = tmp; |
457 | 0 | } |
458 | | |
459 | | static void UpdateModel(CPpmd7 *p) |
460 | 0 | { |
461 | 0 | CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState); |
462 | 0 | CTX_PTR c; |
463 | 0 | unsigned s0, ns; |
464 | | |
465 | 0 | if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0) |
466 | 0 | { |
467 | 0 | c = SUFFIX(p->MinContext); |
468 | | |
469 | 0 | if (c->NumStats == 1) |
470 | 0 | { |
471 | 0 | CPpmd_State *s = ONE_STATE(c); |
472 | 0 | if (s->Freq < 32) |
473 | 0 | s->Freq++; |
474 | 0 | } |
475 | 0 | else |
476 | 0 | { |
477 | 0 | CPpmd_State *s = STATS(c); |
478 | 0 | if (s->Symbol != p->FoundState->Symbol) |
479 | 0 | { |
480 | 0 | do { s++; } while (s->Symbol != p->FoundState->Symbol); |
481 | 0 | if (s[0].Freq >= s[-1].Freq) |
482 | 0 | { |
483 | 0 | SwapStates(&s[0], &s[-1]); |
484 | 0 | s--; |
485 | 0 | } |
486 | 0 | } |
487 | 0 | if (s->Freq < MAX_FREQ - 9) |
488 | 0 | { |
489 | 0 | s->Freq += 2; |
490 | 0 | c->SummFreq += 2; |
491 | 0 | } |
492 | 0 | } |
493 | 0 | } |
494 | |
|
495 | 0 | if (p->OrderFall == 0) |
496 | 0 | { |
497 | 0 | p->MinContext = p->MaxContext = CreateSuccessors(p, True); |
498 | 0 | if (p->MinContext == 0) |
499 | 0 | { |
500 | 0 | RestartModel(p); |
501 | 0 | return; |
502 | 0 | } |
503 | 0 | SetSuccessor(p->FoundState, REF(p->MinContext)); |
504 | 0 | return; |
505 | 0 | } |
506 | | |
507 | 0 | *p->Text++ = p->FoundState->Symbol; |
508 | 0 | successor = REF(p->Text); |
509 | 0 | if (p->Text >= p->UnitsStart) |
510 | 0 | { |
511 | 0 | RestartModel(p); |
512 | 0 | return; |
513 | 0 | } |
514 | | |
515 | 0 | if (fSuccessor) |
516 | 0 | { |
517 | 0 | if (fSuccessor <= successor) |
518 | 0 | { |
519 | 0 | CTX_PTR cs = CreateSuccessors(p, False); |
520 | 0 | if (cs == NULL) |
521 | 0 | { |
522 | 0 | RestartModel(p); |
523 | 0 | return; |
524 | 0 | } |
525 | 0 | fSuccessor = REF(cs); |
526 | 0 | } |
527 | 0 | if (--p->OrderFall == 0) |
528 | 0 | { |
529 | 0 | successor = fSuccessor; |
530 | 0 | p->Text -= (p->MaxContext != p->MinContext); |
531 | 0 | } |
532 | 0 | } |
533 | 0 | else |
534 | 0 | { |
535 | 0 | SetSuccessor(p->FoundState, successor); |
536 | 0 | fSuccessor = REF(p->MinContext); |
537 | 0 | } |
538 | | |
539 | 0 | s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - (p->FoundState->Freq - 1); |
540 | | |
541 | 0 | for (c = p->MaxContext; c != p->MinContext; c = SUFFIX(c)) |
542 | 0 | { |
543 | 0 | unsigned ns1; |
544 | 0 | UInt32 cf, sf; |
545 | 0 | if ((ns1 = c->NumStats) != 1) |
546 | 0 | { |
547 | 0 | if ((ns1 & 1) == 0) |
548 | 0 | { |
549 | | /* Expand for one UNIT */ |
550 | 0 | unsigned oldNU = ns1 >> 1; |
551 | 0 | unsigned i = U2I(oldNU); |
552 | 0 | if (i != U2I(oldNU + 1)) |
553 | 0 | { |
554 | 0 | void *ptr = AllocUnits(p, i + 1); |
555 | 0 | void *oldPtr; |
556 | 0 | if (!ptr) |
557 | 0 | { |
558 | 0 | RestartModel(p); |
559 | 0 | return; |
560 | 0 | } |
561 | 0 | oldPtr = STATS(c); |
562 | 0 | MyMem12Cpy(ptr, oldPtr, oldNU); |
563 | 0 | InsertNode(p, oldPtr, i); |
564 | 0 | c->Stats = STATS_REF(ptr); |
565 | 0 | } |
566 | 0 | } |
567 | 0 | c->SummFreq = (UInt16)(c->SummFreq + (2 * ns1 < ns) + 2 * ((4 * ns1 <= ns) & (c->SummFreq <= 8 * ns1))); |
568 | 0 | } |
569 | 0 | else |
570 | 0 | { |
571 | 0 | CPpmd_State *s = (CPpmd_State*)AllocUnits(p, 0); |
572 | 0 | if (!s) |
573 | 0 | { |
574 | 0 | RestartModel(p); |
575 | 0 | return; |
576 | 0 | } |
577 | 0 | *s = *ONE_STATE(c); |
578 | 0 | c->Stats = REF(s); |
579 | 0 | if (s->Freq < MAX_FREQ / 4 - 1) |
580 | 0 | s->Freq <<= 1; |
581 | 0 | else |
582 | 0 | s->Freq = MAX_FREQ - 4; |
583 | 0 | c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 3)); |
584 | 0 | } |
585 | 0 | cf = 2 * (UInt32)p->FoundState->Freq * (c->SummFreq + 6); |
586 | 0 | sf = (UInt32)s0 + c->SummFreq; |
587 | 0 | if (cf < 6 * sf) |
588 | 0 | { |
589 | 0 | cf = 1 + (cf > sf) + (cf >= 4 * sf); |
590 | 0 | c->SummFreq += 3; |
591 | 0 | } |
592 | 0 | else |
593 | 0 | { |
594 | 0 | cf = 4 + (cf >= 9 * sf) + (cf >= 12 * sf) + (cf >= 15 * sf); |
595 | 0 | c->SummFreq = (UInt16)(c->SummFreq + cf); |
596 | 0 | } |
597 | 0 | { |
598 | 0 | CPpmd_State *s = STATS(c) + ns1; |
599 | 0 | SetSuccessor(s, successor); |
600 | 0 | s->Symbol = p->FoundState->Symbol; |
601 | 0 | s->Freq = (Byte)cf; |
602 | 0 | c->NumStats = (UInt16)(ns1 + 1); |
603 | 0 | } |
604 | 0 | } |
605 | 0 | p->MaxContext = p->MinContext = CTX(fSuccessor); |
606 | 0 | } |
607 | | |
608 | | static void Rescale(CPpmd7 *p) |
609 | 0 | { |
610 | 0 | unsigned i, adder, sumFreq, escFreq; |
611 | 0 | CPpmd_State *stats = STATS(p->MinContext); |
612 | 0 | CPpmd_State *s = p->FoundState; |
613 | 0 | { |
614 | 0 | CPpmd_State tmp = *s; |
615 | 0 | for (; s != stats; s--) |
616 | 0 | s[0] = s[-1]; |
617 | 0 | *s = tmp; |
618 | 0 | } |
619 | 0 | escFreq = p->MinContext->SummFreq - s->Freq; |
620 | 0 | s->Freq += 4; |
621 | 0 | adder = (p->OrderFall != 0); |
622 | 0 | s->Freq = (Byte)((s->Freq + adder) >> 1); |
623 | 0 | sumFreq = s->Freq; |
624 | | |
625 | 0 | i = p->MinContext->NumStats - 1; |
626 | 0 | do |
627 | 0 | { |
628 | 0 | escFreq -= (++s)->Freq; |
629 | 0 | s->Freq = (Byte)((s->Freq + adder) >> 1); |
630 | 0 | sumFreq += s->Freq; |
631 | 0 | if (s[0].Freq > s[-1].Freq) |
632 | 0 | { |
633 | 0 | CPpmd_State *s1 = s; |
634 | 0 | CPpmd_State tmp = *s1; |
635 | 0 | do |
636 | 0 | s1[0] = s1[-1]; |
637 | 0 | while (--s1 != stats && tmp.Freq > s1[-1].Freq); |
638 | 0 | *s1 = tmp; |
639 | 0 | } |
640 | 0 | } |
641 | 0 | while (--i); |
642 | | |
643 | 0 | if (s->Freq == 0) |
644 | 0 | { |
645 | 0 | unsigned numStats = p->MinContext->NumStats; |
646 | 0 | unsigned n0, n1; |
647 | 0 | do { i++; } while ((--s)->Freq == 0); |
648 | 0 | escFreq += i; |
649 | 0 | p->MinContext->NumStats = (UInt16)(p->MinContext->NumStats - i); |
650 | 0 | if (p->MinContext->NumStats == 1) |
651 | 0 | { |
652 | 0 | CPpmd_State tmp = *stats; |
653 | 0 | do |
654 | 0 | { |
655 | 0 | tmp.Freq = (Byte)(tmp.Freq - (tmp.Freq >> 1)); |
656 | 0 | escFreq >>= 1; |
657 | 0 | } |
658 | 0 | while (escFreq > 1); |
659 | 0 | InsertNode(p, stats, U2I(((numStats + 1) >> 1))); |
660 | 0 | *(p->FoundState = ONE_STATE(p->MinContext)) = tmp; |
661 | 0 | return; |
662 | 0 | } |
663 | 0 | n0 = (numStats + 1) >> 1; |
664 | 0 | n1 = (p->MinContext->NumStats + 1) >> 1; |
665 | 0 | if (n0 != n1) |
666 | 0 | p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1)); |
667 | 0 | } |
668 | 0 | p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1)); |
669 | 0 | p->FoundState = STATS(p->MinContext); |
670 | 0 | } |
671 | | |
672 | | static CPpmd_See *Ppmd7_MakeEscFreq(CPpmd7 *p, unsigned numMasked, UInt32 *escFreq) |
673 | 0 | { |
674 | 0 | CPpmd_See *see; |
675 | 0 | unsigned nonMasked = p->MinContext->NumStats - numMasked; |
676 | 0 | if (p->MinContext->NumStats != 256) |
677 | 0 | { |
678 | 0 | see = p->See[p->NS2Indx[nonMasked - 1]] + |
679 | 0 | (nonMasked < (unsigned)SUFFIX(p->MinContext)->NumStats - p->MinContext->NumStats) + |
680 | 0 | 2 * (p->MinContext->SummFreq < 11 * p->MinContext->NumStats) + |
681 | 0 | 4 * (numMasked > nonMasked) + |
682 | 0 | p->HiBitsFlag; |
683 | 0 | { |
684 | 0 | unsigned r = (see->Summ >> see->Shift); |
685 | 0 | see->Summ = (UInt16)(see->Summ - r); |
686 | 0 | *escFreq = r + (r == 0); |
687 | 0 | } |
688 | 0 | } |
689 | 0 | else |
690 | 0 | { |
691 | 0 | see = &p->DummySee; |
692 | 0 | *escFreq = 1; |
693 | 0 | } |
694 | 0 | return see; |
695 | 0 | } |
696 | | |
697 | | static void NextContext(CPpmd7 *p) |
698 | 0 | { |
699 | 0 | CTX_PTR c = CTX(SUCCESSOR(p->FoundState)); |
700 | 0 | if (p->OrderFall == 0 && (Byte *)c > p->Text) |
701 | 0 | p->MinContext = p->MaxContext = c; |
702 | 0 | else |
703 | 0 | UpdateModel(p); |
704 | 0 | } |
705 | | |
706 | | static void Ppmd7_Update1(CPpmd7 *p) |
707 | 0 | { |
708 | 0 | CPpmd_State *s = p->FoundState; |
709 | 0 | s->Freq += 4; |
710 | 0 | p->MinContext->SummFreq += 4; |
711 | 0 | if (s[0].Freq > s[-1].Freq) |
712 | 0 | { |
713 | 0 | SwapStates(&s[0], &s[-1]); |
714 | 0 | p->FoundState = --s; |
715 | 0 | if (s->Freq > MAX_FREQ) |
716 | 0 | Rescale(p); |
717 | 0 | } |
718 | 0 | NextContext(p); |
719 | 0 | } |
720 | | |
721 | | static void Ppmd7_Update1_0(CPpmd7 *p) |
722 | 0 | { |
723 | 0 | p->PrevSuccess = (2 * p->FoundState->Freq > p->MinContext->SummFreq); |
724 | 0 | p->RunLength += p->PrevSuccess; |
725 | 0 | p->MinContext->SummFreq += 4; |
726 | 0 | if ((p->FoundState->Freq += 4) > MAX_FREQ) |
727 | 0 | Rescale(p); |
728 | 0 | NextContext(p); |
729 | 0 | } |
730 | | |
731 | | static void Ppmd7_UpdateBin(CPpmd7 *p) |
732 | 0 | { |
733 | 0 | p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 128 ? 1: 0)); |
734 | 0 | p->PrevSuccess = 1; |
735 | 0 | p->RunLength++; |
736 | 0 | NextContext(p); |
737 | 0 | } |
738 | | |
739 | | static void Ppmd7_Update2(CPpmd7 *p) |
740 | 0 | { |
741 | 0 | p->MinContext->SummFreq += 4; |
742 | 0 | if ((p->FoundState->Freq += 4) > MAX_FREQ) |
743 | 0 | Rescale(p); |
744 | 0 | p->RunLength = p->InitRL; |
745 | 0 | UpdateModel(p); |
746 | 0 | } |
747 | | |
748 | | /* ---------- Decode ---------- */ |
749 | | |
750 | | static Bool Ppmd_RangeDec_Init(CPpmd7z_RangeDec *p) |
751 | 0 | { |
752 | 0 | unsigned i; |
753 | 0 | p->Low = p->Bottom = 0; |
754 | 0 | p->Range = 0xFFFFFFFF; |
755 | 0 | for (i = 0; i < 4; i++) |
756 | 0 | p->Code = (p->Code << 8) | p->Stream->Read((void *)p->Stream); |
757 | 0 | return (p->Code < 0xFFFFFFFF); |
758 | 0 | } |
759 | | |
760 | | static Bool Ppmd7z_RangeDec_Init(CPpmd7z_RangeDec *p) |
761 | 0 | { |
762 | 0 | if (p->Stream->Read((void *)p->Stream) != 0) |
763 | 0 | return False; |
764 | 0 | return Ppmd_RangeDec_Init(p); |
765 | 0 | } |
766 | | |
767 | | static Bool PpmdRAR_RangeDec_Init(CPpmd7z_RangeDec *p) |
768 | 0 | { |
769 | 0 | if (!Ppmd_RangeDec_Init(p)) |
770 | 0 | return False; |
771 | 0 | p->Bottom = 0x8000; |
772 | 0 | return True; |
773 | 0 | } |
774 | | |
775 | | static UInt32 Range_GetThreshold(void *pp, UInt32 total) |
776 | 0 | { |
777 | 0 | CPpmd7z_RangeDec *p = (CPpmd7z_RangeDec *)pp; |
778 | 0 | return (p->Code - p->Low) / (p->Range /= total); |
779 | 0 | } |
780 | | |
781 | | static void Range_Normalize(CPpmd7z_RangeDec *p) |
782 | 0 | { |
783 | 0 | while (1) |
784 | 0 | { |
785 | 0 | if((p->Low ^ (p->Low + p->Range)) >= kTopValue) |
786 | 0 | { |
787 | 0 | if(p->Range >= p->Bottom) |
788 | 0 | break; |
789 | 0 | else |
790 | 0 | p->Range = ((uint32_t)(-(int32_t)p->Low)) & (p->Bottom - 1); |
791 | 0 | } |
792 | 0 | p->Code = (p->Code << 8) | p->Stream->Read((void *)p->Stream); |
793 | 0 | p->Range <<= 8; |
794 | 0 | p->Low <<= 8; |
795 | 0 | } |
796 | 0 | } |
797 | | |
798 | | static void Range_Decode_7z(void *pp, UInt32 start, UInt32 size) |
799 | 0 | { |
800 | 0 | CPpmd7z_RangeDec *p = (CPpmd7z_RangeDec *)pp; |
801 | 0 | p->Code -= start * p->Range; |
802 | 0 | p->Range *= size; |
803 | 0 | Range_Normalize(p); |
804 | 0 | } |
805 | | |
806 | | static void Range_Decode_RAR(void *pp, UInt32 start, UInt32 size) |
807 | 0 | { |
808 | 0 | CPpmd7z_RangeDec *p = (CPpmd7z_RangeDec *)pp; |
809 | 0 | p->Low += start * p->Range; |
810 | 0 | p->Range *= size; |
811 | 0 | Range_Normalize(p); |
812 | 0 | } |
813 | | |
814 | | static UInt32 Range_DecodeBit_7z(void *pp, UInt32 size0) |
815 | 0 | { |
816 | 0 | CPpmd7z_RangeDec *p = (CPpmd7z_RangeDec *)pp; |
817 | 0 | UInt32 newBound = (p->Range >> 14) * size0; |
818 | 0 | UInt32 symbol; |
819 | 0 | if (p->Code < newBound) |
820 | 0 | { |
821 | 0 | symbol = 0; |
822 | 0 | p->Range = newBound; |
823 | 0 | } |
824 | 0 | else |
825 | 0 | { |
826 | 0 | symbol = 1; |
827 | 0 | p->Code -= newBound; |
828 | 0 | p->Range -= newBound; |
829 | 0 | } |
830 | 0 | Range_Normalize(p); |
831 | 0 | return symbol; |
832 | 0 | } |
833 | | |
834 | | static UInt32 Range_DecodeBit_RAR(void *pp, UInt32 size0) |
835 | 0 | { |
836 | 0 | CPpmd7z_RangeDec *p = (CPpmd7z_RangeDec *)pp; |
837 | 0 | UInt32 bit, value = p->p.GetThreshold(p, PPMD_BIN_SCALE); |
838 | 0 | if(value < size0) |
839 | 0 | { |
840 | 0 | bit = 0; |
841 | 0 | p->p.Decode(p, 0, size0); |
842 | 0 | } |
843 | 0 | else |
844 | 0 | { |
845 | 0 | bit = 1; |
846 | 0 | p->p.Decode(p, size0, PPMD_BIN_SCALE - size0); |
847 | 0 | } |
848 | 0 | return bit; |
849 | 0 | } |
850 | | |
851 | | static void Ppmd7z_RangeDec_CreateVTable(CPpmd7z_RangeDec *p) |
852 | 0 | { |
853 | 0 | p->p.GetThreshold = Range_GetThreshold; |
854 | 0 | p->p.Decode = Range_Decode_7z; |
855 | 0 | p->p.DecodeBit = Range_DecodeBit_7z; |
856 | 0 | } |
857 | | |
858 | | static void PpmdRAR_RangeDec_CreateVTable(CPpmd7z_RangeDec *p) |
859 | 0 | { |
860 | 0 | p->p.GetThreshold = Range_GetThreshold; |
861 | 0 | p->p.Decode = Range_Decode_RAR; |
862 | 0 | p->p.DecodeBit = Range_DecodeBit_RAR; |
863 | 0 | } |
864 | | |
865 | 0 | #define MASK(sym) ((signed char *)charMask)[sym] |
866 | | |
867 | | static int Ppmd7_DecodeSymbol(CPpmd7 *p, IPpmd7_RangeDec *rc) |
868 | 0 | { |
869 | 0 | size_t charMask[256 / sizeof(size_t)]; |
870 | 0 | if (p->MinContext->NumStats != 1) |
871 | 0 | { |
872 | 0 | CPpmd_State *s = Ppmd7_GetStats(p, p->MinContext); |
873 | 0 | unsigned i; |
874 | 0 | UInt32 count, hiCnt; |
875 | 0 | if ((count = rc->GetThreshold(rc, p->MinContext->SummFreq)) < (hiCnt = s->Freq)) |
876 | 0 | { |
877 | 0 | Byte symbol; |
878 | 0 | rc->Decode(rc, 0, s->Freq); |
879 | 0 | p->FoundState = s; |
880 | 0 | symbol = s->Symbol; |
881 | 0 | Ppmd7_Update1_0(p); |
882 | 0 | return symbol; |
883 | 0 | } |
884 | 0 | p->PrevSuccess = 0; |
885 | 0 | i = p->MinContext->NumStats - 1; |
886 | 0 | do |
887 | 0 | { |
888 | 0 | if ((hiCnt += (++s)->Freq) > count) |
889 | 0 | { |
890 | 0 | Byte symbol; |
891 | 0 | rc->Decode(rc, hiCnt - s->Freq, s->Freq); |
892 | 0 | p->FoundState = s; |
893 | 0 | symbol = s->Symbol; |
894 | 0 | Ppmd7_Update1(p); |
895 | 0 | return symbol; |
896 | 0 | } |
897 | 0 | } |
898 | 0 | while (--i); |
899 | 0 | if (count >= p->MinContext->SummFreq) |
900 | 0 | return -2; |
901 | 0 | p->HiBitsFlag = p->HB2Flag[p->FoundState->Symbol]; |
902 | 0 | rc->Decode(rc, hiCnt, p->MinContext->SummFreq - hiCnt); |
903 | 0 | PPMD_SetAllBitsIn256Bytes(charMask); |
904 | 0 | MASK(s->Symbol) = 0; |
905 | 0 | i = p->MinContext->NumStats - 1; |
906 | 0 | do { MASK((--s)->Symbol) = 0; } while (--i); |
907 | 0 | } |
908 | 0 | else |
909 | 0 | { |
910 | 0 | UInt16 *prob = Ppmd7_GetBinSumm(p); |
911 | 0 | if (rc->DecodeBit(rc, *prob) == 0) |
912 | 0 | { |
913 | 0 | Byte symbol; |
914 | 0 | *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob); |
915 | 0 | symbol = (p->FoundState = Ppmd7Context_OneState(p->MinContext))->Symbol; |
916 | 0 | Ppmd7_UpdateBin(p); |
917 | 0 | return symbol; |
918 | 0 | } |
919 | 0 | *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob); |
920 | 0 | p->InitEsc = PPMD7_kExpEscape[*prob >> 10]; |
921 | 0 | PPMD_SetAllBitsIn256Bytes(charMask); |
922 | 0 | MASK(Ppmd7Context_OneState(p->MinContext)->Symbol) = 0; |
923 | 0 | p->PrevSuccess = 0; |
924 | 0 | } |
925 | 0 | for (;;) |
926 | 0 | { |
927 | 0 | CPpmd_State *ps[256], *s; |
928 | 0 | UInt32 freqSum, count, hiCnt; |
929 | 0 | CPpmd_See *see; |
930 | 0 | unsigned i, num, numMasked = p->MinContext->NumStats; |
931 | 0 | do |
932 | 0 | { |
933 | 0 | p->OrderFall++; |
934 | 0 | if (!p->MinContext->Suffix) |
935 | 0 | return -1; |
936 | 0 | p->MinContext = Ppmd7_GetContext(p, p->MinContext->Suffix); |
937 | 0 | } |
938 | 0 | while (p->MinContext->NumStats == numMasked); |
939 | 0 | hiCnt = 0; |
940 | 0 | s = Ppmd7_GetStats(p, p->MinContext); |
941 | 0 | i = 0; |
942 | 0 | num = p->MinContext->NumStats - numMasked; |
943 | 0 | do |
944 | 0 | { |
945 | 0 | int k = (int)(MASK(s->Symbol)); |
946 | 0 | hiCnt += (s->Freq & k); |
947 | 0 | ps[i] = s++; |
948 | 0 | i -= k; |
949 | 0 | } |
950 | 0 | while (i != num); |
951 | |
|
952 | 0 | see = Ppmd7_MakeEscFreq(p, numMasked, &freqSum); |
953 | 0 | freqSum += hiCnt; |
954 | 0 | count = rc->GetThreshold(rc, freqSum); |
955 | |
|
956 | 0 | if (count < hiCnt) |
957 | 0 | { |
958 | 0 | Byte symbol; |
959 | 0 | CPpmd_State **pps = ps; |
960 | 0 | for (hiCnt = 0; (hiCnt += (*pps)->Freq) <= count; pps++); |
961 | 0 | s = *pps; |
962 | 0 | rc->Decode(rc, hiCnt - s->Freq, s->Freq); |
963 | 0 | Ppmd_See_Update(see); |
964 | 0 | p->FoundState = s; |
965 | 0 | symbol = s->Symbol; |
966 | 0 | Ppmd7_Update2(p); |
967 | 0 | return symbol; |
968 | 0 | } |
969 | 0 | if (count >= freqSum) |
970 | 0 | return -2; |
971 | 0 | rc->Decode(rc, hiCnt, freqSum - hiCnt); |
972 | 0 | see->Summ = (UInt16)(see->Summ + freqSum); |
973 | 0 | do { MASK(ps[--i]->Symbol) = 0; } while (i != 0); |
974 | 0 | } |
975 | 0 | } |
976 | | |
977 | | /* ---------- Encode ---------- Ppmd7Enc.c */ |
978 | | |
979 | 0 | #define kTopValue (1 << 24) |
980 | | |
981 | | static void Ppmd7z_RangeEnc_Init(CPpmd7z_RangeEnc *p) |
982 | 0 | { |
983 | 0 | p->Low = 0; |
984 | 0 | p->Range = 0xFFFFFFFF; |
985 | 0 | p->Cache = 0; |
986 | 0 | p->CacheSize = 1; |
987 | 0 | } |
988 | | |
989 | | static void RangeEnc_ShiftLow(CPpmd7z_RangeEnc *p) |
990 | 0 | { |
991 | 0 | if ((UInt32)p->Low < (UInt32)0xFF000000 || (unsigned)(p->Low >> 32) != 0) |
992 | 0 | { |
993 | 0 | Byte temp = p->Cache; |
994 | 0 | do |
995 | 0 | { |
996 | 0 | p->Stream->Write(p->Stream, (Byte)(temp + (Byte)(p->Low >> 32))); |
997 | 0 | temp = 0xFF; |
998 | 0 | } |
999 | 0 | while(--p->CacheSize != 0); |
1000 | 0 | p->Cache = (Byte)((UInt32)p->Low >> 24); |
1001 | 0 | } |
1002 | 0 | p->CacheSize++; |
1003 | 0 | p->Low = ((UInt32)p->Low << 8) & 0xFFFFFFFF; |
1004 | 0 | } |
1005 | | |
1006 | | static void RangeEnc_Encode(CPpmd7z_RangeEnc *p, UInt32 start, UInt32 size, UInt32 total) |
1007 | 0 | { |
1008 | 0 | p->Low += (UInt64)start * (UInt64)(p->Range /= total); |
1009 | 0 | p->Range *= size; |
1010 | 0 | while (p->Range < kTopValue) |
1011 | 0 | { |
1012 | 0 | p->Range <<= 8; |
1013 | 0 | RangeEnc_ShiftLow(p); |
1014 | 0 | } |
1015 | 0 | } |
1016 | | |
1017 | | static void RangeEnc_EncodeBit_0(CPpmd7z_RangeEnc *p, UInt32 size0) |
1018 | 0 | { |
1019 | 0 | p->Range = (p->Range >> 14) * size0; |
1020 | 0 | while (p->Range < kTopValue) |
1021 | 0 | { |
1022 | 0 | p->Range <<= 8; |
1023 | 0 | RangeEnc_ShiftLow(p); |
1024 | 0 | } |
1025 | 0 | } |
1026 | | |
1027 | | static void RangeEnc_EncodeBit_1(CPpmd7z_RangeEnc *p, UInt32 size0) |
1028 | 0 | { |
1029 | 0 | UInt32 newBound = (p->Range >> 14) * size0; |
1030 | 0 | p->Low += newBound; |
1031 | 0 | p->Range -= newBound; |
1032 | 0 | while (p->Range < kTopValue) |
1033 | 0 | { |
1034 | 0 | p->Range <<= 8; |
1035 | 0 | RangeEnc_ShiftLow(p); |
1036 | 0 | } |
1037 | 0 | } |
1038 | | |
1039 | | static void Ppmd7z_RangeEnc_FlushData(CPpmd7z_RangeEnc *p) |
1040 | 0 | { |
1041 | 0 | unsigned i; |
1042 | 0 | for (i = 0; i < 5; i++) |
1043 | 0 | RangeEnc_ShiftLow(p); |
1044 | 0 | } |
1045 | | |
1046 | | |
1047 | 0 | #define MASK(sym) ((signed char *)charMask)[sym] |
1048 | | |
1049 | | static void Ppmd7_EncodeSymbol(CPpmd7 *p, CPpmd7z_RangeEnc *rc, int symbol) |
1050 | 0 | { |
1051 | 0 | size_t charMask[256 / sizeof(size_t)]; |
1052 | 0 | if (p->MinContext->NumStats != 1) |
1053 | 0 | { |
1054 | 0 | CPpmd_State *s = Ppmd7_GetStats(p, p->MinContext); |
1055 | 0 | UInt32 sum; |
1056 | 0 | unsigned i; |
1057 | 0 | if (s->Symbol == symbol) |
1058 | 0 | { |
1059 | 0 | RangeEnc_Encode(rc, 0, s->Freq, p->MinContext->SummFreq); |
1060 | 0 | p->FoundState = s; |
1061 | 0 | Ppmd7_Update1_0(p); |
1062 | 0 | return; |
1063 | 0 | } |
1064 | 0 | p->PrevSuccess = 0; |
1065 | 0 | sum = s->Freq; |
1066 | 0 | i = p->MinContext->NumStats - 1; |
1067 | 0 | do |
1068 | 0 | { |
1069 | 0 | if ((++s)->Symbol == symbol) |
1070 | 0 | { |
1071 | 0 | RangeEnc_Encode(rc, sum, s->Freq, p->MinContext->SummFreq); |
1072 | 0 | p->FoundState = s; |
1073 | 0 | Ppmd7_Update1(p); |
1074 | 0 | return; |
1075 | 0 | } |
1076 | 0 | sum += s->Freq; |
1077 | 0 | } |
1078 | 0 | while (--i); |
1079 | | |
1080 | 0 | p->HiBitsFlag = p->HB2Flag[p->FoundState->Symbol]; |
1081 | 0 | PPMD_SetAllBitsIn256Bytes(charMask); |
1082 | 0 | MASK(s->Symbol) = 0; |
1083 | 0 | i = p->MinContext->NumStats - 1; |
1084 | 0 | do { MASK((--s)->Symbol) = 0; } while (--i); |
1085 | 0 | RangeEnc_Encode(rc, sum, p->MinContext->SummFreq - sum, p->MinContext->SummFreq); |
1086 | 0 | } |
1087 | 0 | else |
1088 | 0 | { |
1089 | 0 | UInt16 *prob = Ppmd7_GetBinSumm(p); |
1090 | 0 | CPpmd_State *s = Ppmd7Context_OneState(p->MinContext); |
1091 | 0 | if (s->Symbol == symbol) |
1092 | 0 | { |
1093 | 0 | RangeEnc_EncodeBit_0(rc, *prob); |
1094 | 0 | *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob); |
1095 | 0 | p->FoundState = s; |
1096 | 0 | Ppmd7_UpdateBin(p); |
1097 | 0 | return; |
1098 | 0 | } |
1099 | 0 | else |
1100 | 0 | { |
1101 | 0 | RangeEnc_EncodeBit_1(rc, *prob); |
1102 | 0 | *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob); |
1103 | 0 | p->InitEsc = PPMD7_kExpEscape[*prob >> 10]; |
1104 | 0 | PPMD_SetAllBitsIn256Bytes(charMask); |
1105 | 0 | MASK(s->Symbol) = 0; |
1106 | 0 | p->PrevSuccess = 0; |
1107 | 0 | } |
1108 | 0 | } |
1109 | 0 | for (;;) |
1110 | 0 | { |
1111 | 0 | UInt32 escFreq; |
1112 | 0 | CPpmd_See *see; |
1113 | 0 | CPpmd_State *s; |
1114 | 0 | UInt32 sum; |
1115 | 0 | unsigned i, numMasked = p->MinContext->NumStats; |
1116 | 0 | do |
1117 | 0 | { |
1118 | 0 | p->OrderFall++; |
1119 | 0 | if (!p->MinContext->Suffix) |
1120 | 0 | return; /* EndMarker (symbol = -1) */ |
1121 | 0 | p->MinContext = Ppmd7_GetContext(p, p->MinContext->Suffix); |
1122 | 0 | } |
1123 | 0 | while (p->MinContext->NumStats == numMasked); |
1124 | | |
1125 | 0 | see = Ppmd7_MakeEscFreq(p, numMasked, &escFreq); |
1126 | 0 | s = Ppmd7_GetStats(p, p->MinContext); |
1127 | 0 | sum = 0; |
1128 | 0 | i = p->MinContext->NumStats; |
1129 | 0 | do |
1130 | 0 | { |
1131 | 0 | int cur = s->Symbol; |
1132 | 0 | if (cur == symbol) |
1133 | 0 | { |
1134 | 0 | UInt32 low = sum; |
1135 | 0 | CPpmd_State *s1 = s; |
1136 | 0 | do |
1137 | 0 | { |
1138 | 0 | sum += (s->Freq & (int)(MASK(s->Symbol))); |
1139 | 0 | s++; |
1140 | 0 | } |
1141 | 0 | while (--i); |
1142 | 0 | RangeEnc_Encode(rc, low, s1->Freq, sum + escFreq); |
1143 | 0 | Ppmd_See_Update(see); |
1144 | 0 | p->FoundState = s1; |
1145 | 0 | Ppmd7_Update2(p); |
1146 | 0 | return; |
1147 | 0 | } |
1148 | 0 | sum += (s->Freq & (int)(MASK(cur))); |
1149 | 0 | MASK(cur) = 0; |
1150 | 0 | s++; |
1151 | 0 | } |
1152 | 0 | while (--i); |
1153 | | |
1154 | 0 | RangeEnc_Encode(rc, sum, escFreq, sum + escFreq); |
1155 | 0 | see->Summ = (UInt16)(see->Summ + sum + escFreq); |
1156 | 0 | } |
1157 | 0 | } |
1158 | | |
1159 | | const IPpmd7 __archive_ppmd7_functions = |
1160 | | { |
1161 | | &Ppmd7_Construct, |
1162 | | &Ppmd7_Alloc, |
1163 | | &Ppmd7_Free, |
1164 | | &Ppmd7_Init, |
1165 | | &Ppmd7z_RangeDec_CreateVTable, |
1166 | | &PpmdRAR_RangeDec_CreateVTable, |
1167 | | &Ppmd7z_RangeDec_Init, |
1168 | | &PpmdRAR_RangeDec_Init, |
1169 | | &Ppmd7_DecodeSymbol, |
1170 | | &Ppmd7z_RangeEnc_Init, |
1171 | | &Ppmd7z_RangeEnc_FlushData, |
1172 | | &Ppmd7_EncodeSymbol |
1173 | | }; |