1 /* Ppmd8.c -- PPMdI codec
\r
2 2010-03-24 : Igor Pavlov : Public domain
\r
3 This code is based on PPMd var.I (2002): Dmitry Shkarin : Public domain */
\r
9 const Byte PPMD8_kExpEscape[16] = { 25, 14, 9, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2 };
\r
10 static const UInt16 kInitBinEsc[] = { 0x3CDD, 0x1F3F, 0x59BF, 0x48F3, 0x64A1, 0x5ABC, 0x6632, 0x6051};
\r
12 #define MAX_FREQ 124
\r
13 #define UNIT_SIZE 12
\r
15 #define U2B(nu) ((UInt32)(nu) * UNIT_SIZE)
\r
16 #define U2I(nu) (p->Units2Indx[(nu) - 1])
\r
17 #define I2U(indx) (p->Indx2Units[indx])
\r
20 #define REF(ptr) (ptr)
\r
22 #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
\r
25 #define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr))
\r
27 #define CTX(ref) ((CPpmd8_Context *)Ppmd8_GetContext(p, ref))
\r
28 #define STATS(ctx) Ppmd8_GetStats(p, ctx)
\r
29 #define ONE_STATE(ctx) Ppmd8Context_OneState(ctx)
\r
30 #define SUFFIX(ctx) CTX((ctx)->Suffix)
\r
32 typedef CPpmd8_Context * CTX_PTR;
\r
34 struct CPpmd8_Node_;
\r
38 struct CPpmd8_Node_ *
\r
44 typedef struct CPpmd8_Node_
\r
47 CPpmd8_Node_Ref Next;
\r
52 #define NODE(ptr) (ptr)
\r
54 #define NODE(offs) ((CPpmd8_Node *)(p->Base + (offs)))
\r
57 #define EMPTY_NODE 0xFFFFFFFF
\r
59 void Ppmd8_Construct(CPpmd8 *p)
\r
65 for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++)
\r
67 unsigned step = (i >= 12 ? 4 : (i >> 2) + 1);
\r
68 do { p->Units2Indx[k++] = (Byte)i; } while(--step);
\r
69 p->Indx2Units[i] = (Byte)k;
\r
72 p->NS2BSIndx[0] = (0 << 1);
\r
73 p->NS2BSIndx[1] = (1 << 1);
\r
74 memset(p->NS2BSIndx + 2, (2 << 1), 9);
\r
75 memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11);
\r
77 for (i = 0; i < 5; i++)
\r
78 p->NS2Indx[i] = (Byte)i;
\r
79 for (m = i, k = 1; i < 260; i++)
\r
81 p->NS2Indx[i] = (Byte)m;
\r
87 void Ppmd8_Free(CPpmd8 *p, ISzAlloc *alloc)
\r
89 alloc->Free(alloc, p->Base);
\r
94 Bool Ppmd8_Alloc(CPpmd8 *p, UInt32 size, ISzAlloc *alloc)
\r
96 if (p->Base == 0 || p->Size != size)
\r
98 Ppmd8_Free(p, alloc);
\r
105 if ((p->Base = (Byte *)alloc->Alloc(alloc, p->AlignOffset + size)) == 0)
\r
112 static void InsertNode(CPpmd8 *p, void *node, unsigned indx)
\r
114 ((CPpmd8_Node *)node)->Stamp = EMPTY_NODE;
\r
115 ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx];
\r
116 ((CPpmd8_Node *)node)->NU = I2U(indx);
\r
117 p->FreeList[indx] = REF(node);
\r
121 static void *RemoveNode(CPpmd8 *p, unsigned indx)
\r
123 CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]);
\r
124 p->FreeList[indx] = node->Next;
\r
129 static void SplitBlock(CPpmd8 *p, void *ptr, unsigned oldIndx, unsigned newIndx)
\r
131 unsigned i, nu = I2U(oldIndx) - I2U(newIndx);
\r
132 ptr = (Byte *)ptr + U2B(I2U(newIndx));
\r
133 if (I2U(i = U2I(nu)) != nu)
\r
135 unsigned k = I2U(--i);
\r
136 InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
\r
138 InsertNode(p, ptr, i);
\r
141 static void GlueFreeBlocks(CPpmd8 *p)
\r
143 CPpmd8_Node_Ref head = 0;
\r
144 CPpmd8_Node_Ref *prev = &head;
\r
147 p->GlueCount = 1 << 13;
\r
148 memset(p->Stamps, 0, sizeof(p->Stamps));
\r
150 /* Order-0 context is always at top UNIT, so we don't need guard NODE at the end.
\r
151 All blocks up to p->LoUnit can be free, so we need guard NODE at LoUnit. */
\r
152 if (p->LoUnit != p->HiUnit)
\r
153 ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
\r
155 /* Glue free blocks */
\r
156 for (i = 0; i < PPMD_NUM_INDEXES; i++)
\r
158 CPpmd8_Node_Ref next = (CPpmd8_Node_Ref)p->FreeList[i];
\r
159 p->FreeList[i] = 0;
\r
162 CPpmd8_Node *node = NODE(next);
\r
165 CPpmd8_Node *node2;
\r
167 prev = &(node->Next);
\r
168 while ((node2 = node + node->NU)->Stamp == EMPTY_NODE)
\r
170 node->NU += node2->NU;
\r
179 /* Fill lists of free blocks */
\r
182 CPpmd8_Node *node = NODE(head);
\r
188 for (; nu > 128; nu -= 128, node += 128)
\r
189 InsertNode(p, node, PPMD_NUM_INDEXES - 1);
\r
190 if (I2U(i = U2I(nu)) != nu)
\r
192 unsigned k = I2U(--i);
\r
193 InsertNode(p, node + k, nu - k - 1);
\r
195 InsertNode(p, node, i);
\r
199 static void *AllocUnitsRare(CPpmd8 *p, unsigned indx)
\r
203 if (p->GlueCount == 0)
\r
206 if (p->FreeList[indx] != 0)
\r
207 return RemoveNode(p, indx);
\r
212 if (++i == PPMD_NUM_INDEXES)
\r
214 UInt32 numBytes = U2B(I2U(indx));
\r
216 return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL);
\r
219 while (p->FreeList[i] == 0);
\r
220 retVal = RemoveNode(p, i);
\r
221 SplitBlock(p, retVal, i, indx);
\r
225 static void *AllocUnits(CPpmd8 *p, unsigned indx)
\r
228 if (p->FreeList[indx] != 0)
\r
229 return RemoveNode(p, indx);
\r
230 numBytes = U2B(I2U(indx));
\r
231 if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit))
\r
233 void *retVal = p->LoUnit;
\r
234 p->LoUnit += numBytes;
\r
237 return AllocUnitsRare(p, indx);
\r
240 #define MyMem12Cpy(dest, src, num) \
\r
241 { UInt32 *d = (UInt32 *)dest; const UInt32 *s = (const UInt32 *)src; UInt32 n = num; \
\r
242 do { d[0] = s[0]; d[1] = s[1]; d[2] = s[2]; s += 3; d += 3; } while(--n); }
\r
244 static void *ShrinkUnits(CPpmd8 *p, void *oldPtr, unsigned oldNU, unsigned newNU)
\r
246 unsigned i0 = U2I(oldNU);
\r
247 unsigned i1 = U2I(newNU);
\r
250 if (p->FreeList[i1] != 0)
\r
252 void *ptr = RemoveNode(p, i1);
\r
253 MyMem12Cpy(ptr, oldPtr, newNU);
\r
254 InsertNode(p, oldPtr, i0);
\r
257 SplitBlock(p, oldPtr, i0, i1);
\r
261 static void FreeUnits(CPpmd8 *p, void *ptr, unsigned nu)
\r
263 InsertNode(p, ptr, U2I(nu));
\r
266 static void SpecialFreeUnit(CPpmd8 *p, void *ptr)
\r
268 if ((Byte *)ptr != p->UnitsStart)
\r
269 InsertNode(p, ptr, 0);
\r
272 #ifdef PPMD8_FREEZE_SUPPORT
\r
273 *(UInt32 *)ptr = EMPTY_NODE; /* it's used for (Flags == 0xFF) check in RemoveBinContexts */
\r
275 p->UnitsStart += UNIT_SIZE;
\r
279 static void *MoveUnitsUp(CPpmd8 *p, void *oldPtr, unsigned nu)
\r
281 unsigned indx = U2I(nu);
\r
283 if ((Byte *)oldPtr > p->UnitsStart + 16 * 1024 || REF(oldPtr) > p->FreeList[indx])
\r
285 ptr = RemoveNode(p, indx);
\r
286 MyMem12Cpy(ptr, oldPtr, nu);
\r
287 if ((Byte*)oldPtr != p->UnitsStart)
\r
288 InsertNode(p, oldPtr, indx);
\r
290 p->UnitsStart += U2B(I2U(indx));
\r
294 static void ExpandTextArea(CPpmd8 *p)
\r
296 UInt32 count[PPMD_NUM_INDEXES];
\r
298 memset(count, 0, sizeof(count));
\r
299 if (p->LoUnit != p->HiUnit)
\r
300 ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
\r
303 CPpmd8_Node *node = (CPpmd8_Node *)p->UnitsStart;
\r
304 for (; node->Stamp == EMPTY_NODE; node += node->NU)
\r
307 count[U2I(node->NU)]++;
\r
309 p->UnitsStart = (Byte *)node;
\r
312 for (i = 0; i < PPMD_NUM_INDEXES; i++)
\r
314 CPpmd8_Node_Ref *next = (CPpmd8_Node_Ref *)&p->FreeList[i];
\r
315 while (count[i] != 0)
\r
317 CPpmd8_Node *node = NODE(*next);
\r
318 while (node->Stamp == 0)
\r
320 *next = node->Next;
\r
321 node = NODE(*next);
\r
323 if (--count[i] == 0)
\r
326 next = &node->Next;
\r
331 #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
\r
333 static void SetSuccessor(CPpmd_State *p, CPpmd_Void_Ref v)
\r
335 (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF);
\r
336 (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF);
\r
339 #define RESET_TEXT(offs) { p->Text = p->Base + p->AlignOffset + (offs); }
\r
341 static void RestartModel(CPpmd8 *p)
\r
343 unsigned i, k, m, r;
\r
345 memset(p->FreeList, 0, sizeof(p->FreeList));
\r
346 memset(p->Stamps, 0, sizeof(p->Stamps));
\r
348 p->HiUnit = p->Text + p->Size;
\r
349 p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE;
\r
352 p->OrderFall = p->MaxOrder;
\r
353 p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1;
\r
354 p->PrevSuccess = 0;
\r
356 p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */
\r
357 p->MinContext->Suffix = 0;
\r
358 p->MinContext->NumStats = 255;
\r
359 p->MinContext->Flags = 0;
\r
360 p->MinContext->SummFreq = 256 + 1;
\r
361 p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */
\r
362 p->LoUnit += U2B(256 / 2);
\r
363 p->MinContext->Stats = REF(p->FoundState);
\r
364 for (i = 0; i < 256; i++)
\r
366 CPpmd_State *s = &p->FoundState[i];
\r
367 s->Symbol = (Byte)i;
\r
369 SetSuccessor(s, 0);
\r
372 for (i = m = 0; m < 25; m++)
\r
374 while (p->NS2Indx[i] == m)
\r
376 for (k = 0; k < 8; k++)
\r
378 UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 1));
\r
379 UInt16 *dest = p->BinSumm[m] + k;
\r
380 for (r = 0; r < 64; r += 8)
\r
385 for (i = m = 0; m < 24; m++)
\r
387 while (p->NS2Indx[i + 3] == m + 3)
\r
389 for (k = 0; k < 32; k++)
\r
391 CPpmd_See *s = &p->See[m][k];
\r
392 s->Summ = (UInt16)((2 * i + 5) << (s->Shift = PPMD_PERIOD_BITS - 4));
\r
398 void Ppmd8_Init(CPpmd8 *p, unsigned maxOrder, unsigned restoreMethod)
\r
400 p->MaxOrder = maxOrder;
\r
401 p->RestoreMethod = restoreMethod;
\r
403 p->DummySee.Shift = PPMD_PERIOD_BITS;
\r
404 p->DummySee.Summ = 0; /* unused */
\r
405 p->DummySee.Count = 64; /* unused */
\r
408 static void Refresh(CPpmd8 *p, CTX_PTR ctx, unsigned oldNU, unsigned scale)
\r
410 unsigned i = ctx->NumStats, escFreq, sumFreq, flags;
\r
411 CPpmd_State *s = (CPpmd_State *)ShrinkUnits(p, STATS(ctx), oldNU, (i + 2) >> 1);
\r
412 ctx->Stats = REF(s);
\r
413 #ifdef PPMD8_FREEZE_SUPPORT
\r
414 /* fixed over Shkarin's code. Fixed code is not compatible with original code for some files in FREEZE mode. */
\r
415 scale |= (ctx->SummFreq >= ((UInt32)1 << 15));
\r
417 flags = (ctx->Flags & (0x10 + 0x04 * scale)) + 0x08 * (s->Symbol >= 0x40);
\r
418 escFreq = ctx->SummFreq - s->Freq;
\r
419 sumFreq = (s->Freq = (Byte)((s->Freq + scale) >> scale));
\r
422 escFreq -= (++s)->Freq;
\r
423 sumFreq += (s->Freq = (Byte)((s->Freq + scale) >> scale));
\r
424 flags |= 0x08 * (s->Symbol >= 0x40);
\r
427 ctx->SummFreq = (UInt16)(sumFreq + ((escFreq + scale) >> scale));
\r
428 ctx->Flags = (Byte)flags;
\r
431 static void SwapStates(CPpmd_State *t1, CPpmd_State *t2)
\r
433 CPpmd_State tmp = *t1;
\r
438 static CPpmd_Void_Ref CutOff(CPpmd8 *p, CTX_PTR ctx, unsigned order)
\r
444 if (!ctx->NumStats)
\r
446 s = ONE_STATE(ctx);
\r
447 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart)
\r
449 if (order < p->MaxOrder)
\r
450 SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
\r
452 SetSuccessor(s, 0);
\r
453 if (SUCCESSOR(s) || order <= 9) /* O_BOUND */
\r
456 SpecialFreeUnit(p, ctx);
\r
460 ctx->Stats = STATS_REF(MoveUnitsUp(p, STATS(ctx), tmp = ((unsigned)ctx->NumStats + 2) >> 1));
\r
462 for (s = STATS(ctx) + (i = ctx->NumStats); s >= STATS(ctx); s--)
\r
463 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) < p->UnitsStart)
\r
465 CPpmd_State *s2 = STATS(ctx) + (i--);
\r
466 SetSuccessor(s, 0);
\r
469 else if (order < p->MaxOrder)
\r
470 SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
\r
472 SetSuccessor(s, 0);
\r
474 if (i != ctx->NumStats && order)
\r
476 ctx->NumStats = (Byte)i;
\r
480 FreeUnits(p, s, tmp);
\r
481 SpecialFreeUnit(p, ctx);
\r
486 ctx->Flags = (ctx->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40);
\r
487 *ONE_STATE(ctx) = *s;
\r
488 FreeUnits(p, s, tmp);
\r
489 ONE_STATE(ctx)->Freq = (Byte)((unsigned)ONE_STATE(ctx)->Freq + 11) >> 3;
\r
492 Refresh(p, ctx, tmp, ctx->SummFreq > 16 * i);
\r
497 #ifdef PPMD8_FREEZE_SUPPORT
\r
498 static CPpmd_Void_Ref RemoveBinContexts(CPpmd8 *p, CTX_PTR ctx, unsigned order)
\r
501 if (!ctx->NumStats)
\r
503 s = ONE_STATE(ctx);
\r
504 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
\r
505 SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
\r
507 SetSuccessor(s, 0);
\r
508 /* Suffix context can be removed already, since different (high-order)
\r
509 Successors may refer to same context. So we check Flags == 0xFF (Stamp == EMPTY_NODE) */
\r
510 if (!SUCCESSOR(s) && (!SUFFIX(ctx)->NumStats || SUFFIX(ctx)->Flags == 0xFF))
\r
512 FreeUnits(p, ctx, 1);
\r
519 for (s = STATS(ctx) + ctx->NumStats; s >= STATS(ctx); s--)
\r
520 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
\r
521 SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
\r
523 SetSuccessor(s, 0);
\r
529 static UInt32 GetUsedMemory(const CPpmd8 *p)
\r
533 for (i = 0; i < PPMD_NUM_INDEXES; i++)
\r
534 v += p->Stamps[i] * I2U(i);
\r
535 return p->Size - (UInt32)(p->HiUnit - p->LoUnit) - (UInt32)(p->UnitsStart - p->Text) - U2B(v);
\r
538 #ifdef PPMD8_FREEZE_SUPPORT
\r
539 #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1, fSuccessor)
\r
541 #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1)
\r
544 static void RestoreModel(CPpmd8 *p, CTX_PTR c1
\r
545 #ifdef PPMD8_FREEZE_SUPPORT
\r
546 , CTX_PTR fSuccessor
\r
553 for (c = p->MaxContext; c != c1; c = SUFFIX(c))
\r
554 if (--(c->NumStats) == 0)
\r
557 c->Flags = (c->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40);
\r
558 *ONE_STATE(c) = *s;
\r
559 SpecialFreeUnit(p, s);
\r
560 ONE_STATE(c)->Freq = (ONE_STATE(c)->Freq + 11) >> 3;
\r
563 Refresh(p, c, (c->NumStats+3) >> 1, 0);
\r
565 for (; c != p->MinContext; c = SUFFIX(c))
\r
567 ONE_STATE(c)->Freq -= ONE_STATE(c)->Freq >> 1;
\r
568 else if ((c->SummFreq += 4) > 128 + 4 * c->NumStats)
\r
569 Refresh(p, c, (c->NumStats + 2) >> 1, 1);
\r
571 #ifdef PPMD8_FREEZE_SUPPORT
\r
572 if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
\r
574 p->MaxContext = fSuccessor;
\r
575 p->GlueCount += !(p->Stamps[1] & 1);
\r
577 else if (p->RestoreMethod == PPMD8_RESTORE_METHOD_FREEZE)
\r
579 while (p->MaxContext->Suffix)
\r
580 p->MaxContext = SUFFIX(p->MaxContext);
\r
581 RemoveBinContexts(p, p->MaxContext, 0);
\r
582 p->RestoreMethod++;
\r
584 p->OrderFall = p->MaxOrder;
\r
588 if (p->RestoreMethod == PPMD8_RESTORE_METHOD_RESTART || GetUsedMemory(p) < (p->Size >> 1))
\r
592 while (p->MaxContext->Suffix)
\r
593 p->MaxContext = SUFFIX(p->MaxContext);
\r
596 CutOff(p, p->MaxContext, 0);
\r
599 while (GetUsedMemory(p) > 3 * (p->Size >> 2));
\r
601 p->OrderFall = p->MaxOrder;
\r
605 static CTX_PTR CreateSuccessors(CPpmd8 *p, Bool skip, CPpmd_State *s1, CTX_PTR c)
\r
607 CPpmd_State upState;
\r
609 CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
\r
610 /* fixed over Shkarin's code. Maybe it could work without + 1 too. */
\r
611 CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
\r
612 unsigned numPs = 0;
\r
615 ps[numPs++] = p->FoundState;
\r
619 CPpmd_Void_Ref successor;
\r
627 else if (c->NumStats != 0)
\r
629 for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++);
\r
630 if (s->Freq < MAX_FREQ - 9)
\r
639 s->Freq += (!SUFFIX(c)->NumStats & (s->Freq < 24));
\r
641 successor = SUCCESSOR(s);
\r
642 if (successor != upBranch)
\r
644 c = CTX(successor);
\r
652 upState.Symbol = *(const Byte *)Ppmd8_GetPtr(p, upBranch);
\r
653 SetSuccessor(&upState, upBranch + 1);
\r
654 flags = 0x10 * (p->FoundState->Symbol >= 0x40) + 0x08 * (upState.Symbol >= 0x40);
\r
656 if (c->NumStats == 0)
\r
657 upState.Freq = ONE_STATE(c)->Freq;
\r
662 for (s = STATS(c); s->Symbol != upState.Symbol; s++);
\r
664 s0 = c->SummFreq - c->NumStats - cf;
\r
665 upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((cf + 2 * s0 - 3) / s0)));
\r
671 CTX_PTR c1; /* = AllocContext(p); */
\r
672 if (p->HiUnit != p->LoUnit)
\r
673 c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE);
\r
674 else if (p->FreeList[0] != 0)
\r
675 c1 = (CTX_PTR)RemoveNode(p, 0);
\r
678 c1 = (CTX_PTR)AllocUnitsRare(p, 0);
\r
684 *ONE_STATE(c1) = upState;
\r
685 c1->Suffix = REF(c);
\r
686 SetSuccessor(ps[--numPs], REF(c1));
\r
689 while (numPs != 0);
\r
694 static CTX_PTR ReduceOrder(CPpmd8 *p, CPpmd_State *s1, CTX_PTR c)
\r
696 CPpmd_State *s = NULL;
\r
698 CPpmd_Void_Ref upBranch = REF(p->Text);
\r
700 #ifdef PPMD8_FREEZE_SUPPORT
\r
701 /* The BUG in Shkarin's code was fixed: ps could overflow in CUT_OFF mode. */
\r
702 CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
\r
703 unsigned numPs = 0;
\r
704 ps[numPs++] = p->FoundState;
\r
707 SetSuccessor(p->FoundState, upBranch);
\r
722 #ifdef PPMD8_FREEZE_SUPPORT
\r
723 if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
\r
725 do { SetSuccessor(ps[--numPs], REF(c)); } while (numPs);
\r
735 if ((s = STATS(c))->Symbol != p->FoundState->Symbol)
\r
736 do { s++; } while (s->Symbol != p->FoundState->Symbol);
\r
737 if (s->Freq < MAX_FREQ - 9)
\r
746 s->Freq += (s->Freq < 32);
\r
751 #ifdef PPMD8_FREEZE_SUPPORT
\r
754 SetSuccessor(s, upBranch);
\r
758 #ifdef PPMD8_FREEZE_SUPPORT
\r
759 if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
\r
761 c = CTX(SUCCESSOR(s));
\r
762 do { SetSuccessor(ps[--numPs], REF(c)); } while (numPs);
\r
769 if (SUCCESSOR(s) <= upBranch)
\r
772 CPpmd_State *s1 = p->FoundState;
\r
775 successor = CreateSuccessors(p, False, NULL, c);
\r
776 if (successor == NULL)
\r
777 SetSuccessor(s, 0);
\r
779 SetSuccessor(s, REF(successor));
\r
780 p->FoundState = s1;
\r
783 if (p->OrderFall == 1 && c1 == p->MaxContext)
\r
785 SetSuccessor(p->FoundState, SUCCESSOR(s));
\r
788 if (SUCCESSOR(s) == 0)
\r
790 return CTX(SUCCESSOR(s));
\r
793 static void UpdateModel(CPpmd8 *p)
\r
795 CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
\r
797 unsigned s0, ns, fFreq = p->FoundState->Freq;
\r
798 Byte flag, fSymbol = p->FoundState->Symbol;
\r
799 CPpmd_State *s = NULL;
\r
801 if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
\r
803 c = SUFFIX(p->MinContext);
\r
805 if (c->NumStats == 0)
\r
814 if (s->Symbol != p->FoundState->Symbol)
\r
816 do { s++; } while (s->Symbol != p->FoundState->Symbol);
\r
817 if (s[0].Freq >= s[-1].Freq)
\r
819 SwapStates(&s[0], &s[-1]);
\r
823 if (s->Freq < MAX_FREQ - 9)
\r
832 if (p->OrderFall == 0 && fSuccessor)
\r
834 CTX_PTR cs = CreateSuccessors(p, True, s, p->MinContext);
\r
837 SetSuccessor(p->FoundState, 0);
\r
838 RESTORE_MODEL(c, CTX(fSuccessor));
\r
842 SetSuccessor(p->FoundState, REF(cs));
\r
843 p->MaxContext = cs;
\r
848 *p->Text++ = p->FoundState->Symbol;
\r
849 successor = REF(p->Text);
\r
850 if (p->Text >= p->UnitsStart)
\r
852 RESTORE_MODEL(c, CTX(fSuccessor)); /* check it */
\r
858 CTX_PTR cs = ReduceOrder(p, s, p->MinContext);
\r
861 RESTORE_MODEL(c, 0);
\r
864 fSuccessor = REF(cs);
\r
866 else if ((Byte *)Ppmd8_GetPtr(p, fSuccessor) < p->UnitsStart)
\r
868 CTX_PTR cs = CreateSuccessors(p, False, s, p->MinContext);
\r
871 RESTORE_MODEL(c, 0);
\r
874 fSuccessor = REF(cs);
\r
877 if (--p->OrderFall == 0)
\r
879 successor = fSuccessor;
\r
880 p->Text -= (p->MaxContext != p->MinContext);
\r
882 #ifdef PPMD8_FREEZE_SUPPORT
\r
883 else if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
\r
885 successor = fSuccessor;
\r
891 s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - fFreq;
\r
892 flag = 0x08 * (fSymbol >= 0x40);
\r
894 for (; c != p->MinContext; c = SUFFIX(c))
\r
898 if ((ns1 = c->NumStats) != 0)
\r
900 if ((ns1 & 1) != 0)
\r
902 /* Expand for one UNIT */
\r
903 unsigned oldNU = (ns1 + 1) >> 1;
\r
904 unsigned i = U2I(oldNU);
\r
905 if (i != U2I(oldNU + 1))
\r
907 void *ptr = AllocUnits(p, i + 1);
\r
911 RESTORE_MODEL(c, CTX(fSuccessor));
\r
915 MyMem12Cpy(ptr, oldPtr, oldNU);
\r
916 InsertNode(p, oldPtr, i);
\r
917 c->Stats = STATS_REF(ptr);
\r
920 c->SummFreq = (UInt16)(c->SummFreq + (3 * ns1 + 1 < ns));
\r
924 CPpmd_State *s = (CPpmd_State*)AllocUnits(p, 0);
\r
927 RESTORE_MODEL(c, CTX(fSuccessor));
\r
930 *s = *ONE_STATE(c);
\r
932 if (s->Freq < MAX_FREQ / 4 - 1)
\r
935 s->Freq = MAX_FREQ - 4;
\r
936 c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 2));
\r
938 cf = 2 * fFreq * (c->SummFreq + 6);
\r
939 sf = (UInt32)s0 + c->SummFreq;
\r
942 cf = 1 + (cf > sf) + (cf >= 4 * sf);
\r
947 cf = 4 + (cf > 9 * sf) + (cf > 12 * sf) + (cf > 15 * sf);
\r
948 c->SummFreq = (UInt16)(c->SummFreq + cf);
\r
951 CPpmd_State *s = STATS(c) + ns1 + 1;
\r
952 SetSuccessor(s, successor);
\r
953 s->Symbol = fSymbol;
\r
954 s->Freq = (Byte)cf;
\r
956 c->NumStats = (Byte)(ns1 + 1);
\r
959 p->MaxContext = p->MinContext = CTX(fSuccessor);
\r
962 static void Rescale(CPpmd8 *p)
\r
964 unsigned i, adder, sumFreq, escFreq;
\r
965 CPpmd_State *stats = STATS(p->MinContext);
\r
966 CPpmd_State *s = p->FoundState;
\r
968 CPpmd_State tmp = *s;
\r
969 for (; s != stats; s--)
\r
973 escFreq = p->MinContext->SummFreq - s->Freq;
\r
975 adder = (p->OrderFall != 0
\r
976 #ifdef PPMD8_FREEZE_SUPPORT
\r
977 || p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE
\r
980 s->Freq = (Byte)((s->Freq + adder) >> 1);
\r
983 i = p->MinContext->NumStats;
\r
986 escFreq -= (++s)->Freq;
\r
987 s->Freq = (Byte)((s->Freq + adder) >> 1);
\r
988 sumFreq += s->Freq;
\r
989 if (s[0].Freq > s[-1].Freq)
\r
991 CPpmd_State *s1 = s;
\r
992 CPpmd_State tmp = *s1;
\r
995 while (--s1 != stats && tmp.Freq > s1[-1].Freq);
\r
1003 unsigned numStats = p->MinContext->NumStats;
\r
1005 do { i++; } while ((--s)->Freq == 0);
\r
1007 p->MinContext->NumStats = (Byte)(p->MinContext->NumStats - i);
\r
1008 if (p->MinContext->NumStats == 0)
\r
1010 CPpmd_State tmp = *stats;
\r
1011 tmp.Freq = (Byte)((2 * tmp.Freq + escFreq - 1) / escFreq);
\r
1012 if (tmp.Freq > MAX_FREQ / 3)
\r
1013 tmp.Freq = MAX_FREQ / 3;
\r
1014 InsertNode(p, stats, U2I((numStats + 2) >> 1));
\r
1015 p->MinContext->Flags = (p->MinContext->Flags & 0x10) + 0x08 * (tmp.Symbol >= 0x40);
\r
1016 *(p->FoundState = ONE_STATE(p->MinContext)) = tmp;
\r
1019 n0 = (numStats + 2) >> 1;
\r
1020 n1 = (p->MinContext->NumStats + 2) >> 1;
\r
1022 p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
\r
1023 p->MinContext->Flags &= ~0x08;
\r
1024 p->MinContext->Flags |= 0x08 * ((s = STATS(p->MinContext))->Symbol >= 0x40);
\r
1025 i = p->MinContext->NumStats;
\r
1026 do { p->MinContext->Flags |= 0x08*((++s)->Symbol >= 0x40); } while (--i);
\r
1028 p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1));
\r
1029 p->MinContext->Flags |= 0x4;
\r
1030 p->FoundState = STATS(p->MinContext);
\r
1033 CPpmd_See *Ppmd8_MakeEscFreq(CPpmd8 *p, unsigned numMasked1, UInt32 *escFreq)
\r
1036 if (p->MinContext->NumStats != 0xFF)
\r
1038 see = p->See[p->NS2Indx[p->MinContext->NumStats + 2] - 3] +
\r
1039 (p->MinContext->SummFreq > 11 * ((unsigned)p->MinContext->NumStats + 1)) +
\r
1040 2 * (2 * (unsigned)p->MinContext->NumStats <
\r
1041 ((unsigned)SUFFIX(p->MinContext)->NumStats + numMasked1)) +
\r
1042 p->MinContext->Flags;
\r
1044 unsigned r = (see->Summ >> see->Shift);
\r
1045 see->Summ = (UInt16)(see->Summ - r);
\r
1046 *escFreq = r + (r == 0);
\r
1051 see = &p->DummySee;
\r
1057 static void NextContext(CPpmd8 *p)
\r
1059 CTX_PTR c = CTX(SUCCESSOR(p->FoundState));
\r
1060 if (p->OrderFall == 0 && (Byte *)c >= p->UnitsStart)
\r
1061 p->MinContext = p->MaxContext = c;
\r
1065 p->MinContext = p->MaxContext;
\r
1069 void Ppmd8_Update1(CPpmd8 *p)
\r
1071 CPpmd_State *s = p->FoundState;
\r
1073 p->MinContext->SummFreq += 4;
\r
1074 if (s[0].Freq > s[-1].Freq)
\r
1076 SwapStates(&s[0], &s[-1]);
\r
1077 p->FoundState = --s;
\r
1078 if (s->Freq > MAX_FREQ)
\r
1084 void Ppmd8_Update1_0(CPpmd8 *p)
\r
1086 p->PrevSuccess = (2 * p->FoundState->Freq >= p->MinContext->SummFreq);
\r
1087 p->RunLength += p->PrevSuccess;
\r
1088 p->MinContext->SummFreq += 4;
\r
1089 if ((p->FoundState->Freq += 4) > MAX_FREQ)
\r
1094 void Ppmd8_UpdateBin(CPpmd8 *p)
\r
1096 p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 196));
\r
1097 p->PrevSuccess = 1;
\r
1102 void Ppmd8_Update2(CPpmd8 *p)
\r
1104 p->MinContext->SummFreq += 4;
\r
1105 if ((p->FoundState->Freq += 4) > MAX_FREQ)
\r
1107 p->RunLength = p->InitRL;
\r
1109 p->MinContext = p->MaxContext;
\r
1114 GlewCount, and Glue method
\r
1117 CreateSuccessors updates more suffix contexts
\r
1118 UpdateModel consts.
\r
1119 PrevSuccess Update
\r