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 */
9
const Byte PPMD7_kExpEscape[16] = { 25, 14, 9, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2 };
10
static const UInt16 kInitBinEsc[] = { 0x3CDD, 0x1F3F, 0x59BF, 0x48F3, 0x64A1, 0x5ABC, 0x6632, 0x6051};
15
#define U2B(nu) ((UInt32)(nu) * UNIT_SIZE)
16
#define U2I(nu) (p->Units2Indx[(nu) - 1])
17
#define I2U(indx) (p->Indx2Units[indx])
20
#define REF(ptr) (ptr)
22
#define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
25
#define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr))
27
#define CTX(ref) ((CPpmd7_Context *)Ppmd7_GetContext(p, ref))
28
#define STATS(ctx) Ppmd7_GetStats(p, ctx)
29
#define ONE_STATE(ctx) Ppmd7Context_OneState(ctx)
30
#define SUFFIX(ctx) CTX((ctx)->Suffix)
32
typedef CPpmd7_Context * CTX_PTR;
44
typedef struct CPpmd7_Node_
46
UInt16 Stamp; /* must be at offset 0 as CPpmd7_Context::NumStats. Stamp=0 means free */
48
CPpmd7_Node_Ref Next; /* must be at offset >= 4 */
58
#define NODE(ptr) (ptr)
60
#define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs)))
63
void Ppmd7_Construct(CPpmd7 *p)
69
for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++)
71
unsigned step = (i >= 12 ? 4 : (i >> 2) + 1);
72
do { p->Units2Indx[k++] = (Byte)i; } while(--step);
73
p->Indx2Units[i] = (Byte)k;
76
p->NS2BSIndx[0] = (0 << 1);
77
p->NS2BSIndx[1] = (1 << 1);
78
memset(p->NS2BSIndx + 2, (2 << 1), 9);
79
memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11);
81
for (i = 0; i < 3; i++)
82
p->NS2Indx[i] = (Byte)i;
83
for (m = i, k = 1; i < 256; i++)
85
p->NS2Indx[i] = (Byte)m;
90
memset(p->HB2Flag, 0, 0x40);
91
memset(p->HB2Flag + 0x40, 8, 0x100 - 0x40);
94
void Ppmd7_Free(CPpmd7 *p, ISzAlloc *alloc)
96
alloc->Free(alloc, p->Base);
101
Bool Ppmd7_Alloc(CPpmd7 *p, UInt32 size, ISzAlloc *alloc)
103
if (p->Base == 0 || p->Size != size)
105
Ppmd7_Free(p, alloc);
112
if ((p->Base = (Byte *)alloc->Alloc(alloc, p->AlignOffset + size
123
static void InsertNode(CPpmd7 *p, void *node, unsigned indx)
125
*((CPpmd_Void_Ref *)node) = p->FreeList[indx];
126
p->FreeList[indx] = REF(node);
129
static void *RemoveNode(CPpmd7 *p, unsigned indx)
131
CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]);
132
p->FreeList[indx] = *node;
136
static void SplitBlock(CPpmd7 *p, void *ptr, unsigned oldIndx, unsigned newIndx)
138
unsigned i, nu = I2U(oldIndx) - I2U(newIndx);
139
ptr = (Byte *)ptr + U2B(I2U(newIndx));
140
if (I2U(i = U2I(nu)) != nu)
142
unsigned k = I2U(--i);
143
InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
145
InsertNode(p, ptr, i);
148
static void GlueFreeBlocks(CPpmd7 *p)
151
CPpmd7_Node headItem;
152
CPpmd7_Node_Ref head = &headItem;
154
CPpmd7_Node_Ref head = p->AlignOffset + p->Size;
157
CPpmd7_Node_Ref n = head;
162
/* create doubly-linked list of free blocks */
163
for (i = 0; i < PPMD_NUM_INDEXES; i++)
166
CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i];
170
CPpmd7_Node *node = NODE(next);
172
n = NODE(n)->Prev = next;
173
next = ((const union NodeOrRef *)node)->ref;
175
node->NU = (UInt16)nu;
178
NODE(head)->Stamp = 1;
179
NODE(head)->Next = n;
180
NODE(n)->Prev = head;
181
if (p->LoUnit != p->HiUnit)
182
((CPpmd7_Node *)p->LoUnit)->Stamp = 1;
184
/* Glue free blocks */
187
CPpmd7_Node *node = NODE(n);
188
UInt32 nu = (UInt32)node->NU;
191
CPpmd7_Node *node2 = NODE(n) + nu;
193
if (node2->Stamp != 0 || nu >= 0x10000)
195
NODE(node2->Prev)->Next = node2->Next;
196
NODE(node2->Next)->Prev = node2->Prev;
197
node->NU = (UInt16)nu;
202
/* Fill lists of free blocks */
203
for (n = NODE(head)->Next; n != head;)
205
CPpmd7_Node *node = NODE(n);
207
CPpmd7_Node_Ref next = node->Next;
208
for (nu = node->NU; nu > 128; nu -= 128, node += 128)
209
InsertNode(p, node, PPMD_NUM_INDEXES - 1);
210
if (I2U(i = U2I(nu)) != nu)
212
unsigned k = I2U(--i);
213
InsertNode(p, node + k, nu - k - 1);
215
InsertNode(p, node, i);
220
static void *AllocUnitsRare(CPpmd7 *p, unsigned indx)
224
if (p->GlueCount == 0)
227
if (p->FreeList[indx] != 0)
228
return RemoveNode(p, indx);
233
if (++i == PPMD_NUM_INDEXES)
235
UInt32 numBytes = U2B(I2U(indx));
237
return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL);
240
while (p->FreeList[i] == 0);
241
retVal = RemoveNode(p, i);
242
SplitBlock(p, retVal, i, indx);
246
static void *AllocUnits(CPpmd7 *p, unsigned indx)
249
if (p->FreeList[indx] != 0)
250
return RemoveNode(p, indx);
251
numBytes = U2B(I2U(indx));
252
if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit))
254
void *retVal = p->LoUnit;
255
p->LoUnit += numBytes;
258
return AllocUnitsRare(p, indx);
261
#define MyMem12Cpy(dest, src, num) \
262
{ UInt32 *d = (UInt32 *)dest; const UInt32 *s = (const UInt32 *)src; UInt32 n = num; \
263
do { d[0] = s[0]; d[1] = s[1]; d[2] = s[2]; s += 3; d += 3; } while(--n); }
265
static void *ShrinkUnits(CPpmd7 *p, void *oldPtr, unsigned oldNU, unsigned newNU)
267
unsigned i0 = U2I(oldNU);
268
unsigned i1 = U2I(newNU);
271
if (p->FreeList[i1] != 0)
273
void *ptr = RemoveNode(p, i1);
274
MyMem12Cpy(ptr, oldPtr, newNU);
275
InsertNode(p, oldPtr, i0);
278
SplitBlock(p, oldPtr, i0, i1);
282
#define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
284
static void SetSuccessor(CPpmd_State *p, CPpmd_Void_Ref v)
286
(p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF);
287
(p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF);
290
static void RestartModel(CPpmd7 *p)
294
memset(p->FreeList, 0, sizeof(p->FreeList));
295
p->Text = p->Base + p->AlignOffset;
296
p->HiUnit = p->Text + p->Size;
297
p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE;
300
p->OrderFall = p->MaxOrder;
301
p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1;
304
p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */
305
p->MinContext->Suffix = 0;
306
p->MinContext->NumStats = 256;
307
p->MinContext->SummFreq = 256 + 1;
308
p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */
309
p->LoUnit += U2B(256 / 2);
310
p->MinContext->Stats = REF(p->FoundState);
311
for (i = 0; i < 256; i++)
313
CPpmd_State *s = &p->FoundState[i];
319
for (i = 0; i < 128; i++)
320
for (k = 0; k < 8; k++)
322
UInt16 *dest = p->BinSumm[i] + k;
323
UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 2));
324
for (m = 0; m < 64; m += 8)
328
for (i = 0; i < 25; i++)
329
for (k = 0; k < 16; k++)
331
CPpmd_See *s = &p->See[i][k];
332
s->Summ = (UInt16)((5 * i + 10) << (s->Shift = PPMD_PERIOD_BITS - 4));
337
void Ppmd7_Init(CPpmd7 *p, unsigned maxOrder)
339
p->MaxOrder = maxOrder;
341
p->DummySee.Shift = PPMD_PERIOD_BITS;
342
p->DummySee.Summ = 0; /* unused */
343
p->DummySee.Count = 64; /* unused */
346
static CTX_PTR CreateSuccessors(CPpmd7 *p, Bool skip)
349
CTX_PTR c = p->MinContext;
350
CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
351
CPpmd_State *ps[PPMD7_MAX_ORDER];
355
ps[numPs++] = p->FoundState;
359
CPpmd_Void_Ref successor;
362
if (c->NumStats != 1)
364
for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++);
368
successor = SUCCESSOR(s);
369
if (successor != upBranch)
379
upState.Symbol = *(const Byte *)Ppmd7_GetPtr(p, upBranch);
380
SetSuccessor(&upState, upBranch + 1);
382
if (c->NumStats == 1)
383
upState.Freq = ONE_STATE(c)->Freq;
388
for (s = STATS(c); s->Symbol != upState.Symbol; s++);
390
s0 = c->SummFreq - c->NumStats - cf;
391
upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((2 * cf + 3 * s0 - 1) / (2 * s0))));
397
CTX_PTR c1; /* = AllocContext(p); */
398
if (p->HiUnit != p->LoUnit)
399
c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE);
400
else if (p->FreeList[0] != 0)
401
c1 = (CTX_PTR)RemoveNode(p, 0);
404
c1 = (CTX_PTR)AllocUnitsRare(p, 0);
409
*ONE_STATE(c1) = upState;
411
SetSuccessor(ps[--numPs], REF(c1));
419
static void SwapStates(CPpmd_State *t1, CPpmd_State *t2)
421
CPpmd_State tmp = *t1;
426
static void UpdateModel(CPpmd7 *p)
428
CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
432
if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
434
c = SUFFIX(p->MinContext);
436
if (c->NumStats == 1)
438
CPpmd_State *s = ONE_STATE(c);
444
CPpmd_State *s = STATS(c);
445
if (s->Symbol != p->FoundState->Symbol)
447
do { s++; } while (s->Symbol != p->FoundState->Symbol);
448
if (s[0].Freq >= s[-1].Freq)
450
SwapStates(&s[0], &s[-1]);
454
if (s->Freq < MAX_FREQ - 9)
462
if (p->OrderFall == 0)
464
p->MinContext = p->MaxContext = CreateSuccessors(p, True);
465
if (p->MinContext == 0)
470
SetSuccessor(p->FoundState, REF(p->MinContext));
474
*p->Text++ = p->FoundState->Symbol;
475
successor = REF(p->Text);
476
if (p->Text >= p->UnitsStart)
484
if (fSuccessor <= successor)
486
CTX_PTR cs = CreateSuccessors(p, False);
492
fSuccessor = REF(cs);
494
if (--p->OrderFall == 0)
496
successor = fSuccessor;
497
p->Text -= (p->MaxContext != p->MinContext);
502
SetSuccessor(p->FoundState, successor);
503
fSuccessor = REF(p->MinContext);
506
s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - (p->FoundState->Freq - 1);
508
for (c = p->MaxContext; c != p->MinContext; c = SUFFIX(c))
512
if ((ns1 = c->NumStats) != 1)
516
/* Expand for one UNIT */
517
unsigned oldNU = ns1 >> 1;
518
unsigned i = U2I(oldNU);
519
if (i != U2I(oldNU + 1))
521
void *ptr = AllocUnits(p, i + 1);
529
MyMem12Cpy(ptr, oldPtr, oldNU);
530
InsertNode(p, oldPtr, i);
531
c->Stats = STATS_REF(ptr);
534
c->SummFreq = (UInt16)(c->SummFreq + (2 * ns1 < ns) + 2 * ((4 * ns1 <= ns) & (c->SummFreq <= 8 * ns1)));
538
CPpmd_State *s = (CPpmd_State*)AllocUnits(p, 0);
546
if (s->Freq < MAX_FREQ / 4 - 1)
549
s->Freq = MAX_FREQ - 4;
550
c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 3));
552
cf = 2 * (UInt32)p->FoundState->Freq * (c->SummFreq + 6);
553
sf = (UInt32)s0 + c->SummFreq;
556
cf = 1 + (cf > sf) + (cf >= 4 * sf);
561
cf = 4 + (cf >= 9 * sf) + (cf >= 12 * sf) + (cf >= 15 * sf);
562
c->SummFreq = (UInt16)(c->SummFreq + cf);
565
CPpmd_State *s = STATS(c) + ns1;
566
SetSuccessor(s, successor);
567
s->Symbol = p->FoundState->Symbol;
569
c->NumStats = (UInt16)(ns1 + 1);
572
p->MaxContext = p->MinContext = CTX(fSuccessor);
575
static void Rescale(CPpmd7 *p)
577
unsigned i, adder, sumFreq, escFreq;
578
CPpmd_State *stats = STATS(p->MinContext);
579
CPpmd_State *s = p->FoundState;
581
CPpmd_State tmp = *s;
582
for (; s != stats; s--)
586
escFreq = p->MinContext->SummFreq - s->Freq;
588
adder = (p->OrderFall != 0);
589
s->Freq = (Byte)((s->Freq + adder) >> 1);
592
i = p->MinContext->NumStats - 1;
595
escFreq -= (++s)->Freq;
596
s->Freq = (Byte)((s->Freq + adder) >> 1);
598
if (s[0].Freq > s[-1].Freq)
601
CPpmd_State tmp = *s1;
604
while (--s1 != stats && tmp.Freq > s1[-1].Freq);
612
unsigned numStats = p->MinContext->NumStats;
614
do { i++; } while ((--s)->Freq == 0);
616
p->MinContext->NumStats = (UInt16)(p->MinContext->NumStats - i);
617
if (p->MinContext->NumStats == 1)
619
CPpmd_State tmp = *stats;
622
tmp.Freq = (Byte)(tmp.Freq - (tmp.Freq >> 1));
626
InsertNode(p, stats, U2I(((numStats + 1) >> 1)));
627
*(p->FoundState = ONE_STATE(p->MinContext)) = tmp;
630
n0 = (numStats + 1) >> 1;
631
n1 = (p->MinContext->NumStats + 1) >> 1;
633
p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
635
p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1));
636
p->FoundState = STATS(p->MinContext);
639
CPpmd_See *Ppmd7_MakeEscFreq(CPpmd7 *p, unsigned numMasked, UInt32 *escFreq)
642
unsigned nonMasked = p->MinContext->NumStats - numMasked;
643
if (p->MinContext->NumStats != 256)
645
see = p->See[p->NS2Indx[nonMasked - 1]] +
646
(nonMasked < (unsigned)SUFFIX(p->MinContext)->NumStats - p->MinContext->NumStats) +
647
2 * (p->MinContext->SummFreq < 11 * p->MinContext->NumStats) +
648
4 * (numMasked > nonMasked) +
651
unsigned r = (see->Summ >> see->Shift);
652
see->Summ = (UInt16)(see->Summ - r);
653
*escFreq = r + (r == 0);
664
static void NextContext(CPpmd7 *p)
666
CTX_PTR c = CTX(SUCCESSOR(p->FoundState));
667
if (p->OrderFall == 0 && (Byte *)c > p->Text)
668
p->MinContext = p->MaxContext = c;
673
void Ppmd7_Update1(CPpmd7 *p)
675
CPpmd_State *s = p->FoundState;
677
p->MinContext->SummFreq += 4;
678
if (s[0].Freq > s[-1].Freq)
680
SwapStates(&s[0], &s[-1]);
682
if (s->Freq > MAX_FREQ)
688
void Ppmd7_Update1_0(CPpmd7 *p)
690
p->PrevSuccess = (2 * p->FoundState->Freq > p->MinContext->SummFreq);
691
p->RunLength += p->PrevSuccess;
692
p->MinContext->SummFreq += 4;
693
if ((p->FoundState->Freq += 4) > MAX_FREQ)
698
void Ppmd7_UpdateBin(CPpmd7 *p)
700
p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 128 ? 1: 0));
706
void Ppmd7_Update2(CPpmd7 *p)
708
p->MinContext->SummFreq += 4;
709
if ((p->FoundState->Freq += 4) > MAX_FREQ)
711
p->RunLength = p->InitRL;