/src/lzma-fuzz/sdk/C/Ppmd7.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Ppmd7.c -- PPMdH codec |
2 | | 2018-07-04 : Igor Pavlov : Public domain |
3 | | This code is based on PPMd var.H (2001): Dmitry Shkarin : Public domain */ |
4 | | |
5 | | #include "Precomp.h" |
6 | | |
7 | | #include <string.h> |
8 | | |
9 | | #include "Ppmd7.h" |
10 | | |
11 | | const Byte PPMD7_kExpEscape[16] = { 25, 14, 9, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2 }; |
12 | | static const UInt16 kInitBinEsc[] = { 0x3CDD, 0x1F3F, 0x59BF, 0x48F3, 0x64A1, 0x5ABC, 0x6632, 0x6051}; |
13 | | |
14 | 19.3M | #define MAX_FREQ 124 |
15 | 2.53M | #define UNIT_SIZE 12 |
16 | | |
17 | 1.61M | #define U2B(nu) ((UInt32)(nu) * UNIT_SIZE) |
18 | 391k | #define U2I(nu) (p->Units2Indx[(size_t)(nu) - 1]) |
19 | 2.78M | #define I2U(indx) (p->Indx2Units[indx]) |
20 | | |
21 | | #ifdef PPMD_32BIT |
22 | | #define REF(ptr) (ptr) |
23 | | #else |
24 | 23.6M | #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base)) |
25 | | #endif |
26 | | |
27 | 162k | #define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr)) |
28 | | |
29 | 27.8M | #define CTX(ref) ((CPpmd7_Context *)Ppmd7_GetContext(p, ref)) |
30 | 2.71M | #define STATS(ctx) Ppmd7_GetStats(p, ctx) |
31 | 2.30M | #define ONE_STATE(ctx) Ppmd7Context_OneState(ctx) |
32 | 2.12M | #define SUFFIX(ctx) CTX((ctx)->Suffix) |
33 | | |
34 | | typedef CPpmd7_Context * CTX_PTR; |
35 | | |
36 | | struct CPpmd7_Node_; |
37 | | |
38 | | typedef |
39 | | #ifdef PPMD_32BIT |
40 | | struct CPpmd7_Node_ * |
41 | | #else |
42 | | UInt32 |
43 | | #endif |
44 | | CPpmd7_Node_Ref; |
45 | | |
46 | | typedef struct CPpmd7_Node_ |
47 | | { |
48 | | UInt16 Stamp; /* must be at offset 0 as CPpmd7_Context::NumStats. Stamp=0 means free */ |
49 | | UInt16 NU; |
50 | | CPpmd7_Node_Ref Next; /* must be at offset >= 4 */ |
51 | | CPpmd7_Node_Ref Prev; |
52 | | } CPpmd7_Node; |
53 | | |
54 | | #ifdef PPMD_32BIT |
55 | | #define NODE(ptr) (ptr) |
56 | | #else |
57 | 420k | #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs))) |
58 | | #endif |
59 | | |
60 | | void Ppmd7_Construct(CPpmd7 *p) |
61 | 3.31k | { |
62 | 3.31k | unsigned i, k, m; |
63 | | |
64 | 3.31k | p->Base = 0; |
65 | | |
66 | 129k | for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++) |
67 | 125k | { |
68 | 125k | unsigned step = (i >= 12 ? 4 : (i >> 2) + 1); |
69 | 423k | do { p->Units2Indx[k++] = (Byte)i; } while (--step); |
70 | 125k | p->Indx2Units[i] = (Byte)k; |
71 | 125k | } |
72 | | |
73 | 3.31k | p->NS2BSIndx[0] = (0 << 1); |
74 | 3.31k | p->NS2BSIndx[1] = (1 << 1); |
75 | 3.31k | memset(p->NS2BSIndx + 2, (2 << 1), 9); |
76 | 3.31k | memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11); |
77 | | |
78 | 13.2k | for (i = 0; i < 3; i++) |
79 | 9.93k | p->NS2Indx[i] = (Byte)i; |
80 | 840k | for (m = i, k = 1; i < 256; i++) |
81 | 837k | { |
82 | 837k | p->NS2Indx[i] = (Byte)m; |
83 | 837k | if (--k == 0) |
84 | 72.8k | k = (++m) - 2; |
85 | 837k | } |
86 | | |
87 | 3.31k | memset(p->HB2Flag, 0, 0x40); |
88 | 3.31k | memset(p->HB2Flag + 0x40, 8, 0x100 - 0x40); |
89 | 3.31k | } |
90 | | |
91 | | void Ppmd7_Free(CPpmd7 *p, ISzAllocPtr alloc) |
92 | 6.62k | { |
93 | 6.62k | ISzAlloc_Free(alloc, p->Base); |
94 | 6.62k | p->Size = 0; |
95 | 6.62k | p->Base = 0; |
96 | 6.62k | } |
97 | | |
98 | | BoolInt Ppmd7_Alloc(CPpmd7 *p, UInt32 size, ISzAllocPtr alloc) |
99 | 3.31k | { |
100 | 3.31k | if (!p->Base || p->Size != size) |
101 | 3.31k | { |
102 | 3.31k | size_t size2; |
103 | 3.31k | Ppmd7_Free(p, alloc); |
104 | 3.31k | size2 = 0 |
105 | 3.31k | #ifndef PPMD_32BIT |
106 | 3.31k | + UNIT_SIZE |
107 | 3.31k | #endif |
108 | 3.31k | ; |
109 | 3.31k | p->AlignOffset = |
110 | | #ifdef PPMD_32BIT |
111 | | (4 - size) & 3; |
112 | | #else |
113 | 3.31k | 4 - (size & 3); |
114 | 3.31k | #endif |
115 | 3.31k | if ((p->Base = (Byte *)ISzAlloc_Alloc(alloc, p->AlignOffset + size + size2)) == 0) |
116 | 0 | return False; |
117 | 3.31k | p->Size = size; |
118 | 3.31k | } |
119 | 3.31k | return True; |
120 | 3.31k | } |
121 | | |
122 | | static void InsertNode(CPpmd7 *p, void *node, unsigned indx) |
123 | 239k | { |
124 | 239k | *((CPpmd_Void_Ref *)node) = p->FreeList[indx]; |
125 | 239k | p->FreeList[indx] = REF(node); |
126 | 239k | } |
127 | | |
128 | | static void *RemoveNode(CPpmd7 *p, unsigned indx) |
129 | 170k | { |
130 | 170k | CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); |
131 | 170k | p->FreeList[indx] = *node; |
132 | 170k | return node; |
133 | 170k | } |
134 | | |
135 | | static void SplitBlock(CPpmd7 *p, void *ptr, unsigned oldIndx, unsigned newIndx) |
136 | 41.6k | { |
137 | 41.6k | unsigned i, nu = I2U(oldIndx) - I2U(newIndx); |
138 | 41.6k | ptr = (Byte *)ptr + U2B(I2U(newIndx)); |
139 | 41.6k | if (I2U(i = U2I(nu)) != nu) |
140 | 1.58k | { |
141 | 1.58k | unsigned k = I2U(--i); |
142 | 1.58k | InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1); |
143 | 1.58k | } |
144 | 41.6k | InsertNode(p, ptr, i); |
145 | 41.6k | } |
146 | | |
147 | | static void GlueFreeBlocks(CPpmd7 *p) |
148 | 69.6k | { |
149 | | #ifdef PPMD_32BIT |
150 | | CPpmd7_Node headItem; |
151 | | CPpmd7_Node_Ref head = &headItem; |
152 | | #else |
153 | 69.6k | CPpmd7_Node_Ref head = p->AlignOffset + p->Size; |
154 | 69.6k | #endif |
155 | | |
156 | 69.6k | CPpmd7_Node_Ref n = head; |
157 | 69.6k | unsigned i; |
158 | | |
159 | 69.6k | p->GlueCount = 255; |
160 | | |
161 | | /* create doubly-linked list of free blocks */ |
162 | 2.71M | for (i = 0; i < PPMD_NUM_INDEXES; i++) |
163 | 2.64M | { |
164 | 2.64M | UInt16 nu = I2U(i); |
165 | 2.64M | CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i]; |
166 | 2.64M | p->FreeList[i] = 0; |
167 | 2.67M | while (next != 0) |
168 | 25.4k | { |
169 | 25.4k | CPpmd7_Node *node = NODE(next); |
170 | 25.4k | node->Next = n; |
171 | 25.4k | n = NODE(n)->Prev = next; |
172 | 25.4k | next = *(const CPpmd7_Node_Ref *)node; |
173 | 25.4k | node->Stamp = 0; |
174 | 25.4k | node->NU = (UInt16)nu; |
175 | 25.4k | } |
176 | 2.64M | } |
177 | 69.6k | NODE(head)->Stamp = 1; |
178 | 69.6k | NODE(head)->Next = n; |
179 | 69.6k | NODE(n)->Prev = head; |
180 | 69.6k | if (p->LoUnit != p->HiUnit) |
181 | 3.26k | ((CPpmd7_Node *)p->LoUnit)->Stamp = 1; |
182 | | |
183 | | /* Glue free blocks */ |
184 | 89.6k | while (n != head) |
185 | 19.9k | { |
186 | 19.9k | CPpmd7_Node *node = NODE(n); |
187 | 19.9k | UInt32 nu = (UInt32)node->NU; |
188 | 19.9k | for (;;) |
189 | 32.7k | { |
190 | 32.7k | CPpmd7_Node *node2 = NODE(n) + nu; |
191 | 32.7k | nu += node2->NU; |
192 | 32.7k | if (node2->Stamp != 0 || nu >= 0x10000) |
193 | 19.9k | break; |
194 | 12.8k | NODE(node2->Prev)->Next = node2->Next; |
195 | 12.8k | NODE(node2->Next)->Prev = node2->Prev; |
196 | 12.8k | node->NU = (UInt16)nu; |
197 | 12.8k | } |
198 | 19.9k | n = node->Next; |
199 | 19.9k | } |
200 | | |
201 | | /* Fill lists of free blocks */ |
202 | 82.3k | for (n = NODE(head)->Next; n != head;) |
203 | 12.6k | { |
204 | 12.6k | CPpmd7_Node *node = NODE(n); |
205 | 12.6k | unsigned nu; |
206 | 12.6k | CPpmd7_Node_Ref next = node->Next; |
207 | 12.6k | for (nu = node->NU; nu > 128; nu -= 128, node += 128) |
208 | 0 | InsertNode(p, node, PPMD_NUM_INDEXES - 1); |
209 | 12.6k | if (I2U(i = U2I(nu)) != nu) |
210 | 2.29k | { |
211 | 2.29k | unsigned k = I2U(--i); |
212 | 2.29k | InsertNode(p, node + k, nu - k - 1); |
213 | 2.29k | } |
214 | 12.6k | InsertNode(p, node, i); |
215 | 12.6k | n = next; |
216 | 12.6k | } |
217 | 69.6k | } |
218 | | |
219 | | static void *AllocUnitsRare(CPpmd7 *p, unsigned indx) |
220 | 697k | { |
221 | 697k | unsigned i; |
222 | 697k | void *retVal; |
223 | 697k | if (p->GlueCount == 0) |
224 | 69.6k | { |
225 | 69.6k | GlueFreeBlocks(p); |
226 | 69.6k | if (p->FreeList[indx] != 0) |
227 | 2.72k | return RemoveNode(p, indx); |
228 | 69.6k | } |
229 | 694k | i = indx; |
230 | 694k | do |
231 | 24.8M | { |
232 | 24.8M | if (++i == PPMD_NUM_INDEXES) |
233 | 655k | { |
234 | 655k | UInt32 numBytes = U2B(I2U(indx)); |
235 | 655k | p->GlueCount--; |
236 | 655k | return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL); |
237 | 655k | } |
238 | 24.8M | } |
239 | 24.1M | while (p->FreeList[i] == 0); |
240 | 39.5k | retVal = RemoveNode(p, i); |
241 | 39.5k | SplitBlock(p, retVal, i, indx); |
242 | 39.5k | return retVal; |
243 | 694k | } |
244 | | |
245 | | static void *AllocUnits(CPpmd7 *p, unsigned indx) |
246 | 925k | { |
247 | 925k | UInt32 numBytes; |
248 | 925k | if (p->FreeList[indx] != 0) |
249 | 78.3k | return RemoveNode(p, indx); |
250 | 847k | numBytes = U2B(I2U(indx)); |
251 | 847k | if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit)) |
252 | 498k | { |
253 | 498k | void *retVal = p->LoUnit; |
254 | 498k | p->LoUnit += numBytes; |
255 | 498k | return retVal; |
256 | 498k | } |
257 | 348k | return AllocUnitsRare(p, indx); |
258 | 847k | } |
259 | | |
260 | | #define MyMem12Cpy(dest, src, num) \ |
261 | 160k | { UInt32 *d = (UInt32 *)dest; const UInt32 *s = (const UInt32 *)src; UInt32 n = num; \ |
262 | 268k | do { d[0] = s[0]; d[1] = s[1]; d[2] = s[2]; s += 3; d += 3; } while (--n); } |
263 | | |
264 | | static void *ShrinkUnits(CPpmd7 *p, void *oldPtr, unsigned oldNU, unsigned newNU) |
265 | 10.1k | { |
266 | 10.1k | unsigned i0 = U2I(oldNU); |
267 | 10.1k | unsigned i1 = U2I(newNU); |
268 | 10.1k | if (i0 == i1) |
269 | 436 | return oldPtr; |
270 | 9.74k | if (p->FreeList[i1] != 0) |
271 | 7.58k | { |
272 | 7.58k | void *ptr = RemoveNode(p, i1); |
273 | 7.58k | MyMem12Cpy(ptr, oldPtr, newNU); |
274 | 7.58k | InsertNode(p, oldPtr, i0); |
275 | 7.58k | return ptr; |
276 | 7.58k | } |
277 | 2.15k | SplitBlock(p, oldPtr, i0, i1); |
278 | 2.15k | return oldPtr; |
279 | 9.74k | } |
280 | | |
281 | 11.8M | #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16))) |
282 | | |
283 | | static void SetSuccessor(CPpmd_State *p, CPpmd_Void_Ref v) |
284 | 30.6M | { |
285 | 30.6M | (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF); |
286 | 30.6M | (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF); |
287 | 30.6M | } |
288 | | |
289 | | static void RestartModel(CPpmd7 *p) |
290 | 71.8k | { |
291 | 71.8k | unsigned i, k, m; |
292 | | |
293 | 71.8k | memset(p->FreeList, 0, sizeof(p->FreeList)); |
294 | 71.8k | p->Text = p->Base + p->AlignOffset; |
295 | 71.8k | p->HiUnit = p->Text + p->Size; |
296 | 71.8k | p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE; |
297 | 71.8k | p->GlueCount = 0; |
298 | | |
299 | 71.8k | p->OrderFall = p->MaxOrder; |
300 | 71.8k | p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1; |
301 | 71.8k | p->PrevSuccess = 0; |
302 | | |
303 | 71.8k | p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */ |
304 | 71.8k | p->MinContext->Suffix = 0; |
305 | 71.8k | p->MinContext->NumStats = 256; |
306 | 71.8k | p->MinContext->SummFreq = 256 + 1; |
307 | 71.8k | p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */ |
308 | 71.8k | p->LoUnit += U2B(256 / 2); |
309 | 71.8k | p->MinContext->Stats = REF(p->FoundState); |
310 | 18.4M | for (i = 0; i < 256; i++) |
311 | 18.4M | { |
312 | 18.4M | CPpmd_State *s = &p->FoundState[i]; |
313 | 18.4M | s->Symbol = (Byte)i; |
314 | 18.4M | s->Freq = 1; |
315 | 18.4M | SetSuccessor(s, 0); |
316 | 18.4M | } |
317 | | |
318 | 9.27M | for (i = 0; i < 128; i++) |
319 | 82.8M | for (k = 0; k < 8; k++) |
320 | 73.6M | { |
321 | 73.6M | UInt16 *dest = p->BinSumm[i] + k; |
322 | 73.6M | UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 2)); |
323 | 662M | for (m = 0; m < 64; m += 8) |
324 | 588M | dest[m] = val; |
325 | 73.6M | } |
326 | | |
327 | 1.86M | for (i = 0; i < 25; i++) |
328 | 30.5M | for (k = 0; k < 16; k++) |
329 | 28.7M | { |
330 | 28.7M | CPpmd_See *s = &p->See[i][k]; |
331 | 28.7M | s->Summ = (UInt16)((5 * i + 10) << (s->Shift = PPMD_PERIOD_BITS - 4)); |
332 | 28.7M | s->Count = 4; |
333 | 28.7M | } |
334 | 71.8k | } |
335 | | |
336 | | void Ppmd7_Init(CPpmd7 *p, unsigned maxOrder) |
337 | 3.30k | { |
338 | 3.30k | p->MaxOrder = maxOrder; |
339 | 3.30k | RestartModel(p); |
340 | 3.30k | p->DummySee.Shift = PPMD_PERIOD_BITS; |
341 | 3.30k | p->DummySee.Summ = 0; /* unused */ |
342 | 3.30k | p->DummySee.Count = 64; /* unused */ |
343 | 3.30k | } |
344 | | |
345 | | static CTX_PTR CreateSuccessors(CPpmd7 *p, BoolInt skip) |
346 | 919k | { |
347 | 919k | CPpmd_State upState; |
348 | 919k | CTX_PTR c = p->MinContext; |
349 | 919k | CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState); |
350 | 919k | CPpmd_State *ps[PPMD7_MAX_ORDER]; |
351 | 919k | unsigned numPs = 0; |
352 | | |
353 | 919k | if (!skip) |
354 | 807k | ps[numPs++] = p->FoundState; |
355 | | |
356 | 1.20M | while (c->Suffix) |
357 | 536k | { |
358 | 536k | CPpmd_Void_Ref successor; |
359 | 536k | CPpmd_State *s; |
360 | 536k | c = SUFFIX(c); |
361 | 536k | if (c->NumStats != 1) |
362 | 310k | { |
363 | 12.8M | for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++); |
364 | 310k | } |
365 | 225k | else |
366 | 225k | s = ONE_STATE(c); |
367 | 536k | successor = SUCCESSOR(s); |
368 | 536k | if (successor != upBranch) |
369 | 252k | { |
370 | 252k | c = CTX(successor); |
371 | 252k | if (numPs == 0) |
372 | 39.3k | return c; |
373 | 213k | break; |
374 | 252k | } |
375 | 284k | ps[numPs++] = s; |
376 | 284k | } |
377 | | |
378 | 879k | upState.Symbol = *(const Byte *)Ppmd7_GetPtr(p, upBranch); |
379 | 879k | SetSuccessor(&upState, upBranch + 1); |
380 | | |
381 | 879k | if (c->NumStats == 1) |
382 | 115k | upState.Freq = ONE_STATE(c)->Freq; |
383 | 764k | else |
384 | 764k | { |
385 | 764k | UInt32 cf, s0; |
386 | 764k | CPpmd_State *s; |
387 | 76.5M | for (s = STATS(c); s->Symbol != upState.Symbol; s++); |
388 | 764k | cf = s->Freq - 1; |
389 | 764k | s0 = c->SummFreq - c->NumStats - cf; |
390 | 764k | upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((2 * cf + 3 * s0 - 1) / (2 * s0)))); |
391 | 764k | } |
392 | | |
393 | 879k | do |
394 | 1.08M | { |
395 | | /* Create Child */ |
396 | 1.08M | CTX_PTR c1; /* = AllocContext(p); */ |
397 | 1.08M | if (p->HiUnit != p->LoUnit) |
398 | 696k | c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); |
399 | 390k | else if (p->FreeList[0] != 0) |
400 | 42.2k | c1 = (CTX_PTR)RemoveNode(p, 0); |
401 | 348k | else |
402 | 348k | { |
403 | 348k | c1 = (CTX_PTR)AllocUnitsRare(p, 0); |
404 | 348k | if (!c1) |
405 | 23.7k | return NULL; |
406 | 348k | } |
407 | 1.06M | c1->NumStats = 1; |
408 | 1.06M | *ONE_STATE(c1) = upState; |
409 | 1.06M | c1->Suffix = REF(c); |
410 | 1.06M | SetSuccessor(ps[--numPs], REF(c1)); |
411 | 1.06M | c = c1; |
412 | 1.06M | } |
413 | 1.06M | while (numPs != 0); |
414 | | |
415 | 856k | return c; |
416 | 879k | } |
417 | | |
418 | | static void SwapStates(CPpmd_State *t1, CPpmd_State *t2) |
419 | 5.41M | { |
420 | 5.41M | CPpmd_State tmp = *t1; |
421 | 5.41M | *t1 = *t2; |
422 | 5.41M | *t2 = tmp; |
423 | 5.41M | } |
424 | | |
425 | | static void UpdateModel(CPpmd7 *p) |
426 | 10.4M | { |
427 | 10.4M | CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState); |
428 | 10.4M | CTX_PTR c; |
429 | 10.4M | unsigned s0, ns; |
430 | | |
431 | 10.4M | if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0) |
432 | 428k | { |
433 | 428k | c = SUFFIX(p->MinContext); |
434 | | |
435 | 428k | if (c->NumStats == 1) |
436 | 145k | { |
437 | 145k | CPpmd_State *s = ONE_STATE(c); |
438 | 145k | if (s->Freq < 32) |
439 | 145k | s->Freq++; |
440 | 145k | } |
441 | 283k | else |
442 | 283k | { |
443 | 283k | CPpmd_State *s = STATS(c); |
444 | 283k | if (s->Symbol != p->FoundState->Symbol) |
445 | 160k | { |
446 | 8.89M | do { s++; } while (s->Symbol != p->FoundState->Symbol); |
447 | 160k | if (s[0].Freq >= s[-1].Freq) |
448 | 121k | { |
449 | 121k | SwapStates(&s[0], &s[-1]); |
450 | 121k | s--; |
451 | 121k | } |
452 | 160k | } |
453 | 283k | if (s->Freq < MAX_FREQ - 9) |
454 | 283k | { |
455 | 283k | s->Freq += 2; |
456 | 283k | c->SummFreq += 2; |
457 | 283k | } |
458 | 283k | } |
459 | 428k | } |
460 | | |
461 | 10.4M | if (p->OrderFall == 0) |
462 | 111k | { |
463 | 111k | p->MinContext = p->MaxContext = CreateSuccessors(p, True); |
464 | 111k | if (p->MinContext == 0) |
465 | 2.23k | { |
466 | 2.23k | RestartModel(p); |
467 | 2.23k | return; |
468 | 2.23k | } |
469 | 109k | SetSuccessor(p->FoundState, REF(p->MinContext)); |
470 | 109k | return; |
471 | 111k | } |
472 | | |
473 | 10.3M | *p->Text++ = p->FoundState->Symbol; |
474 | 10.3M | successor = REF(p->Text); |
475 | 10.3M | if (p->Text >= p->UnitsStart) |
476 | 3.40k | { |
477 | 3.40k | RestartModel(p); |
478 | 3.40k | return; |
479 | 3.40k | } |
480 | | |
481 | 10.3M | if (fSuccessor) |
482 | 1.15M | { |
483 | 1.15M | if (fSuccessor <= successor) |
484 | 807k | { |
485 | 807k | CTX_PTR cs = CreateSuccessors(p, False); |
486 | 807k | if (cs == NULL) |
487 | 21.5k | { |
488 | 21.5k | RestartModel(p); |
489 | 21.5k | return; |
490 | 21.5k | } |
491 | 785k | fSuccessor = REF(cs); |
492 | 785k | } |
493 | 1.13M | if (--p->OrderFall == 0) |
494 | 173k | { |
495 | 173k | successor = fSuccessor; |
496 | 173k | p->Text -= (p->MaxContext != p->MinContext); |
497 | 173k | } |
498 | 1.13M | } |
499 | 9.14M | else |
500 | 9.14M | { |
501 | 9.14M | SetSuccessor(p->FoundState, successor); |
502 | 9.14M | fSuccessor = REF(p->MinContext); |
503 | 9.14M | } |
504 | | |
505 | 10.2M | s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - (p->FoundState->Freq - 1); |
506 | | |
507 | 11.2M | for (c = p->MaxContext; c != p->MinContext; c = SUFFIX(c)) |
508 | 1.05M | { |
509 | 1.05M | unsigned ns1; |
510 | 1.05M | UInt32 cf, sf; |
511 | 1.05M | if ((ns1 = c->NumStats) != 1) |
512 | 291k | { |
513 | 291k | if ((ns1 & 1) == 0) |
514 | 175k | { |
515 | | /* Expand for one UNIT */ |
516 | 175k | unsigned oldNU = ns1 >> 1; |
517 | 175k | unsigned i = U2I(oldNU); |
518 | 175k | if (i != U2I((size_t)oldNU + 1)) |
519 | 166k | { |
520 | 166k | void *ptr = AllocUnits(p, i + 1); |
521 | 166k | void *oldPtr; |
522 | 166k | if (!ptr) |
523 | 13.7k | { |
524 | 13.7k | RestartModel(p); |
525 | 13.7k | return; |
526 | 13.7k | } |
527 | 152k | oldPtr = STATS(c); |
528 | 152k | MyMem12Cpy(ptr, oldPtr, oldNU); |
529 | 152k | InsertNode(p, oldPtr, i); |
530 | 152k | c->Stats = STATS_REF(ptr); |
531 | 152k | } |
532 | 175k | } |
533 | 277k | c->SummFreq = (UInt16)(c->SummFreq + (2 * ns1 < ns) + 2 * ((4 * ns1 <= ns) & (c->SummFreq <= 8 * ns1))); |
534 | 277k | } |
535 | 759k | else |
536 | 759k | { |
537 | 759k | CPpmd_State *s = (CPpmd_State*)AllocUnits(p, 0); |
538 | 759k | if (!s) |
539 | 27.7k | { |
540 | 27.7k | RestartModel(p); |
541 | 27.7k | return; |
542 | 27.7k | } |
543 | 731k | *s = *ONE_STATE(c); |
544 | 731k | c->Stats = REF(s); |
545 | 731k | if (s->Freq < MAX_FREQ / 4 - 1) |
546 | 708k | s->Freq <<= 1; |
547 | 22.7k | else |
548 | 22.7k | s->Freq = MAX_FREQ - 4; |
549 | 731k | c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 3)); |
550 | 731k | } |
551 | 1.00M | cf = 2 * (UInt32)p->FoundState->Freq * (c->SummFreq + 6); |
552 | 1.00M | sf = (UInt32)s0 + c->SummFreq; |
553 | 1.00M | if (cf < 6 * sf) |
554 | 727k | { |
555 | 727k | cf = 1 + (cf > sf) + (cf >= 4 * sf); |
556 | 727k | c->SummFreq += 3; |
557 | 727k | } |
558 | 281k | else |
559 | 281k | { |
560 | 281k | cf = 4 + (cf >= 9 * sf) + (cf >= 12 * sf) + (cf >= 15 * sf); |
561 | 281k | c->SummFreq = (UInt16)(c->SummFreq + cf); |
562 | 281k | } |
563 | 1.00M | { |
564 | 1.00M | CPpmd_State *s = STATS(c) + ns1; |
565 | 1.00M | SetSuccessor(s, successor); |
566 | 1.00M | s->Symbol = p->FoundState->Symbol; |
567 | 1.00M | s->Freq = (Byte)cf; |
568 | 1.00M | c->NumStats = (UInt16)(ns1 + 1); |
569 | 1.00M | } |
570 | 1.00M | } |
571 | 10.2M | p->MaxContext = p->MinContext = CTX(fSuccessor); |
572 | 10.2M | } |
573 | | |
574 | | static void Rescale(CPpmd7 *p) |
575 | 107k | { |
576 | 107k | unsigned i, adder, sumFreq, escFreq; |
577 | 107k | CPpmd_State *stats = STATS(p->MinContext); |
578 | 107k | CPpmd_State *s = p->FoundState; |
579 | 107k | { |
580 | 107k | CPpmd_State tmp = *s; |
581 | 151k | for (; s != stats; s--) |
582 | 43.9k | s[0] = s[-1]; |
583 | 107k | *s = tmp; |
584 | 107k | } |
585 | 107k | escFreq = p->MinContext->SummFreq - s->Freq; |
586 | 107k | s->Freq += 4; |
587 | 107k | adder = (p->OrderFall != 0); |
588 | 107k | s->Freq = (Byte)((s->Freq + adder) >> 1); |
589 | 107k | sumFreq = s->Freq; |
590 | | |
591 | 107k | i = p->MinContext->NumStats - 1; |
592 | 107k | do |
593 | 399k | { |
594 | 399k | escFreq -= (++s)->Freq; |
595 | 399k | s->Freq = (Byte)((s->Freq + adder) >> 1); |
596 | 399k | sumFreq += s->Freq; |
597 | 399k | if (s[0].Freq > s[-1].Freq) |
598 | 65.1k | { |
599 | 65.1k | CPpmd_State *s1 = s; |
600 | 65.1k | CPpmd_State tmp = *s1; |
601 | 65.1k | do |
602 | 1.15M | s1[0] = s1[-1]; |
603 | 1.15M | while (--s1 != stats && tmp.Freq > s1[-1].Freq); |
604 | 65.1k | *s1 = tmp; |
605 | 65.1k | } |
606 | 399k | } |
607 | 399k | while (--i); |
608 | | |
609 | 107k | if (s->Freq == 0) |
610 | 48.0k | { |
611 | 48.0k | unsigned numStats = p->MinContext->NumStats; |
612 | 48.0k | unsigned n0, n1; |
613 | 77.5k | do { i++; } while ((--s)->Freq == 0); |
614 | 48.0k | escFreq += i; |
615 | 48.0k | p->MinContext->NumStats = (UInt16)(p->MinContext->NumStats - i); |
616 | 48.0k | if (p->MinContext->NumStats == 1) |
617 | 20.9k | { |
618 | 20.9k | CPpmd_State tmp = *stats; |
619 | 20.9k | do |
620 | 35.4k | { |
621 | 35.4k | tmp.Freq = (Byte)(tmp.Freq - (tmp.Freq >> 1)); |
622 | 35.4k | escFreq >>= 1; |
623 | 35.4k | } |
624 | 35.4k | while (escFreq > 1); |
625 | 20.9k | InsertNode(p, stats, U2I(((numStats + 1) >> 1))); |
626 | 20.9k | *(p->FoundState = ONE_STATE(p->MinContext)) = tmp; |
627 | 20.9k | return; |
628 | 20.9k | } |
629 | 27.0k | n0 = (numStats + 1) >> 1; |
630 | 27.0k | n1 = (p->MinContext->NumStats + 1) >> 1; |
631 | 27.0k | if (n0 != n1) |
632 | 10.1k | p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1)); |
633 | 27.0k | } |
634 | 86.6k | p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1)); |
635 | 86.6k | p->FoundState = STATS(p->MinContext); |
636 | 86.6k | } |
637 | | |
638 | | CPpmd_See *Ppmd7_MakeEscFreq(CPpmd7 *p, unsigned numMasked, UInt32 *escFreq) |
639 | 838k | { |
640 | 838k | CPpmd_See *see; |
641 | 838k | unsigned nonMasked = p->MinContext->NumStats - numMasked; |
642 | 838k | if (p->MinContext->NumStats != 256) |
643 | 148k | { |
644 | 148k | see = p->See[(unsigned)p->NS2Indx[(size_t)nonMasked - 1]] + |
645 | 148k | (nonMasked < (unsigned)SUFFIX(p->MinContext)->NumStats - p->MinContext->NumStats) + |
646 | 148k | 2 * (unsigned)(p->MinContext->SummFreq < 11 * p->MinContext->NumStats) + |
647 | 148k | 4 * (unsigned)(numMasked > nonMasked) + |
648 | 148k | p->HiBitsFlag; |
649 | 148k | { |
650 | 148k | unsigned r = (see->Summ >> see->Shift); |
651 | 148k | see->Summ = (UInt16)(see->Summ - r); |
652 | 148k | *escFreq = r + (r == 0); |
653 | 148k | } |
654 | 148k | } |
655 | 690k | else |
656 | 690k | { |
657 | 690k | see = &p->DummySee; |
658 | 690k | *escFreq = 1; |
659 | 690k | } |
660 | 838k | return see; |
661 | 838k | } |
662 | | |
663 | | static void NextContext(CPpmd7 *p) |
664 | 15.2M | { |
665 | 15.2M | CTX_PTR c = CTX(SUCCESSOR(p->FoundState)); |
666 | 15.2M | if (p->OrderFall == 0 && (Byte *)c > p->Text) |
667 | 5.60M | p->MinContext = p->MaxContext = c; |
668 | 9.63M | else |
669 | 9.63M | UpdateModel(p); |
670 | 15.2M | } |
671 | | |
672 | | void Ppmd7_Update1(CPpmd7 *p) |
673 | 9.64M | { |
674 | 9.64M | CPpmd_State *s = p->FoundState; |
675 | 9.64M | s->Freq += 4; |
676 | 9.64M | p->MinContext->SummFreq += 4; |
677 | 9.64M | if (s[0].Freq > s[-1].Freq) |
678 | 5.29M | { |
679 | 5.29M | SwapStates(&s[0], &s[-1]); |
680 | 5.29M | p->FoundState = --s; |
681 | 5.29M | if (s->Freq > MAX_FREQ) |
682 | 872 | Rescale(p); |
683 | 5.29M | } |
684 | 9.64M | NextContext(p); |
685 | 9.64M | } |
686 | | |
687 | | void Ppmd7_Update1_0(CPpmd7 *p) |
688 | 1.78M | { |
689 | 1.78M | p->PrevSuccess = (2 * p->FoundState->Freq > p->MinContext->SummFreq); |
690 | 1.78M | p->RunLength += p->PrevSuccess; |
691 | 1.78M | p->MinContext->SummFreq += 4; |
692 | 1.78M | if ((p->FoundState->Freq += 4) > MAX_FREQ) |
693 | 105k | Rescale(p); |
694 | 1.78M | NextContext(p); |
695 | 1.78M | } |
696 | | |
697 | | void Ppmd7_UpdateBin(CPpmd7 *p) |
698 | 3.80M | { |
699 | 3.80M | p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 128 ? 1: 0)); |
700 | 3.80M | p->PrevSuccess = 1; |
701 | 3.80M | p->RunLength++; |
702 | 3.80M | NextContext(p); |
703 | 3.80M | } |
704 | | |
705 | | void Ppmd7_Update2(CPpmd7 *p) |
706 | 779k | { |
707 | 779k | p->MinContext->SummFreq += 4; |
708 | 779k | if ((p->FoundState->Freq += 4) > MAX_FREQ) |
709 | 732 | Rescale(p); |
710 | 779k | p->RunLength = p->InitRL; |
711 | 779k | UpdateModel(p); |
712 | 779k | } |