Coverage Report

Created: 2026-07-14 07:09

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/CMake/Utilities/cmlibarchive/libarchive/archive_ppmd8.c
Line
Count
Source
1
/* Ppmd8.c -- PPMdI codec
2
2016-05-21 : Igor Pavlov : Public domain
3
This code is based on PPMd var.I (2002): Dmitry Shkarin : Public domain */
4
5
#include "archive_platform.h"
6
7
#ifdef __clang_analyzer__
8
#include <assert.h>
9
#endif
10
11
#include <string.h>
12
13
#include "archive_ppmd8_private.h"
14
15
const Byte PPMD8_kExpEscape[16] = { 25, 14, 9, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2 };
16
static const UInt16 kInitBinEsc[] = { 0x3CDD, 0x1F3F, 0x59BF, 0x48F3, 0x64A1, 0x5ABC, 0x6632, 0x6051};
17
18
48.9M
#define MAX_FREQ 124
19
33.3M
#define UNIT_SIZE 12
20
21
10.4M
#define U2B(nu) ((UInt32)(nu) * UNIT_SIZE)
22
17.4M
#define U2I(nu) (p->Units2Indx[(nu) - 1])
23
15.0M
#define I2U(indx) (p->Indx2Units[indx])
24
25
#ifdef PPMD_32BIT
26
  #define REF(ptr) (ptr)
27
#else
28
114M
  #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
29
#endif
30
31
8.44M
#define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr))
32
33
142M
#define CTX(ref) ((CPpmd8_Context *)Ppmd8_GetContext(p, ref))
34
69.8M
#define STATS(ctx) Ppmd8_GetStats(p, ctx)
35
73.2M
#define ONE_STATE(ctx) Ppmd8Context_OneState(ctx)
36
75.8M
#define SUFFIX(ctx) CTX((ctx)->Suffix)
37
38
91.8M
#define kTop (1 << 24)
39
80.9M
#define kBot (1 << 15)
40
41
typedef CPpmd8_Context * CTX_PTR;
42
43
struct CPpmd8_Node_;
44
45
typedef
46
  #ifdef PPMD_32BIT
47
    struct CPpmd8_Node_ *
48
  #else
49
    UInt32
50
  #endif
51
  CPpmd8_Node_Ref;
52
53
typedef struct CPpmd8_Node_
54
{
55
  UInt32 Stamp;
56
  CPpmd8_Node_Ref Next;
57
  UInt32 NU;
58
} CPpmd8_Node;
59
60
#ifdef PPMD_32BIT
61
  #define NODE(ptr) (ptr)
62
#else
63
13.6M
  #define NODE(offs) ((CPpmd8_Node *)(p->Base + (offs)))
64
#endif
65
66
15.3M
#define EMPTY_NODE 0xFFFFFFFF
67
68
void Ppmd8_Construct(CPpmd8 *p)
69
1.80k
{
70
1.80k
  unsigned i, k, m;
71
72
1.80k
  p->Base = 0;
73
74
70.3k
  for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++)
75
68.5k
  {
76
68.5k
    unsigned step = (i >= 12 ? 4 : (i >> 2) + 1);
77
230k
    do { p->Units2Indx[k++] = (Byte)i; } while (--step);
78
68.5k
    p->Indx2Units[i] = (Byte)k;
79
68.5k
  }
80
81
1.80k
  p->NS2BSIndx[0] = (0 << 1);
82
1.80k
  p->NS2BSIndx[1] = (1 << 1);
83
1.80k
  memset(p->NS2BSIndx + 2, (2 << 1), 9);
84
1.80k
  memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11);
85
86
10.8k
  for (i = 0; i < 5; i++)
87
9.02k
    p->NS2Indx[i] = (Byte)i;
88
461k
  for (m = i, k = 1; i < 260; i++)
89
460k
  {
90
460k
    p->NS2Indx[i] = (Byte)m;
91
460k
    if (--k == 0)
92
39.6k
      k = (++m) - 4;
93
460k
  }
94
1.80k
}
95
96
void Ppmd8_Free(CPpmd8 *p)
97
3.56k
{
98
3.56k
  free(p->Base);
99
3.56k
  p->Size = 0;
100
3.56k
  p->Base = 0;
101
3.56k
}
102
103
Bool Ppmd8_Alloc(CPpmd8 *p, UInt32 size)
104
1.78k
{
105
1.78k
  if (p->Base == 0 || p->Size != size)
106
1.78k
  {
107
1.78k
    Ppmd8_Free(p);
108
1.78k
    p->AlignOffset =
109
      #ifdef PPMD_32BIT
110
        (4 - size) & 3;
111
      #else
112
1.78k
        4 - (size & 3);
113
1.78k
      #endif
114
1.78k
    if ((p->Base = malloc(p->AlignOffset + size)) == 0)
115
0
      return False;
116
1.78k
    p->Size = size;
117
1.78k
  }
118
1.78k
  return True;
119
1.78k
}
120
121
static void InsertNode(CPpmd8 *p, void *node, unsigned indx)
122
12.9M
{
123
12.9M
  ((CPpmd8_Node *)node)->Stamp = EMPTY_NODE;
124
12.9M
  ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx];
125
12.9M
  ((CPpmd8_Node *)node)->NU = I2U(indx);
126
12.9M
  p->FreeList[indx] = REF(node);
127
12.9M
  p->Stamps[indx]++;
128
12.9M
}
129
130
static void *RemoveNode(CPpmd8 *p, unsigned indx)
131
5.74M
{
132
5.74M
  CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]);
133
5.74M
  p->FreeList[indx] = node->Next;
134
5.74M
  p->Stamps[indx]--;
135
5.74M
  return node;
136
5.74M
}
137
138
static void SplitBlock(CPpmd8 *p, void *ptr, unsigned oldIndx, unsigned newIndx)
139
401k
{
140
401k
  unsigned i, nu = I2U(oldIndx) - I2U(newIndx);
141
401k
  ptr = (Byte *)ptr + U2B(I2U(newIndx));
142
401k
  if (I2U(i = U2I(nu)) != nu)
143
69.4k
  {
144
69.4k
    unsigned k = I2U(--i);
145
69.4k
    InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
146
69.4k
  }
147
401k
  InsertNode(p, ptr, i);
148
401k
}
149
150
static void GlueFreeBlocks(CPpmd8 *p)
151
478
{
152
478
  CPpmd8_Node_Ref head = 0;
153
478
  CPpmd8_Node_Ref *prev = &head;
154
478
  unsigned i;
155
156
478
  p->GlueCount = 1 << 13;
157
478
  memset(p->Stamps, 0, sizeof(p->Stamps));
158
  
159
  /* Order-0 context is always at top UNIT, so we don't need guard NODE at the end.
160
     All blocks up to p->LoUnit can be free, so we need guard NODE at LoUnit. */
161
478
  if (p->LoUnit != p->HiUnit)
162
26
    ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
163
164
  /* Glue free blocks */
165
18.6k
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
166
18.1k
  {
167
18.1k
    CPpmd8_Node_Ref next = (CPpmd8_Node_Ref)p->FreeList[i];
168
18.1k
    p->FreeList[i] = 0;
169
2.00M
    while (next != 0)
170
1.98M
    {
171
1.98M
      CPpmd8_Node *node = NODE(next);
172
1.98M
      if (node->NU != 0)
173
1.11M
      {
174
1.11M
        CPpmd8_Node *node2;
175
1.11M
        *prev = next;
176
1.11M
        prev = &(node->Next);
177
2.38M
        while ((node2 = node + node->NU)->Stamp == EMPTY_NODE)
178
1.26M
        {
179
1.26M
          node->NU += node2->NU;
180
1.26M
          node2->NU = 0;
181
1.26M
        }
182
1.11M
      }
183
1.98M
      next = node->Next;
184
1.98M
    }
185
18.1k
  }
186
478
  *prev = 0;
187
  
188
  /* Fill lists of free blocks */
189
1.11M
  while (head != 0)
190
1.11M
  {
191
1.11M
    CPpmd8_Node *node = NODE(head);
192
1.11M
    unsigned nu;
193
1.11M
    head = node->Next;
194
1.11M
    nu = node->NU;
195
1.11M
    if (nu == 0)
196
393k
      continue;
197
721k
    for (; nu > 128; nu -= 128, node += 128)
198
10
      InsertNode(p, node, PPMD_NUM_INDEXES - 1);
199
721k
    if (I2U(i = U2I(nu)) != nu)
200
79.2k
    {
201
79.2k
      unsigned k = I2U(--i);
202
79.2k
      InsertNode(p, node + k, nu - k - 1);
203
79.2k
    }
204
721k
    InsertNode(p, node, i);
205
721k
  }
206
478
}
207
208
static void *AllocUnitsRare(CPpmd8 *p, unsigned indx)
209
2.87M
{
210
2.87M
  unsigned i;
211
2.87M
  void *retVal;
212
2.87M
  if (p->GlueCount == 0)
213
478
  {
214
478
    GlueFreeBlocks(p);
215
478
    if (p->FreeList[indx] != 0)
216
126
      return RemoveNode(p, indx);
217
478
  }
218
2.87M
  i = indx;
219
2.87M
  do
220
94.8M
  {
221
94.8M
    if (++i == PPMD_NUM_INDEXES)
222
2.48M
    {
223
2.48M
      UInt32 numBytes = U2B(I2U(indx));
224
2.48M
      p->GlueCount--;
225
2.48M
      return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL);
226
2.48M
    }
227
94.8M
  }
228
92.3M
  while (p->FreeList[i] == 0);
229
396k
  retVal = RemoveNode(p, i);
230
396k
  SplitBlock(p, retVal, i, indx);
231
396k
  return retVal;
232
2.87M
}
233
234
static void *AllocUnits(CPpmd8 *p, unsigned indx)
235
11.4M
{
236
11.4M
  UInt32 numBytes;
237
11.4M
  if (p->FreeList[indx] != 0)
238
3.93M
    return RemoveNode(p, indx);
239
7.48M
  numBytes = U2B(I2U(indx));
240
7.48M
  if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit))
241
6.66M
  {
242
6.66M
    void *retVal = p->LoUnit;
243
6.66M
    p->LoUnit += numBytes;
244
6.66M
    return retVal;
245
6.66M
  }
246
820k
  return AllocUnitsRare(p, indx);
247
7.48M
}
248
249
4.66M
#define MyMem12Cpy(dest, src, num) do {         \
250
4.66M
  UInt32 *d = (UInt32 *)dest;         \
251
4.66M
  const UInt32 *z = (const UInt32 *)src;        \
252
4.66M
  UInt32 n = num;             \
253
8.33M
  do {               \
254
8.33M
    d[0] = z[0]; d[1] = z[1]; d[2] = z[2]; z += 3; d += 3;  \
255
8.33M
  } while (--n);              \
256
4.66M
} while (0)
257
258
static void *ShrinkUnits(CPpmd8 *p, void *oldPtr, unsigned oldNU, unsigned newNU)
259
807k
{
260
807k
  unsigned i0 = U2I(oldNU);
261
807k
  unsigned i1 = U2I(newNU);
262
807k
  if (i0 == i1)
263
117k
    return oldPtr;
264
689k
  if (p->FreeList[i1] != 0)
265
684k
  {
266
684k
    void *ptr = RemoveNode(p, i1);
267
684k
    MyMem12Cpy(ptr, oldPtr, newNU);
268
684k
    InsertNode(p, oldPtr, i0);
269
684k
    return ptr;
270
684k
  }
271
4.86k
  SplitBlock(p, oldPtr, i0, i1);
272
4.86k
  return oldPtr;
273
689k
}
274
275
static void FreeUnits(CPpmd8 *p, void *ptr, unsigned nu)
276
3.01M
{
277
3.01M
  InsertNode(p, ptr, U2I(nu));
278
3.01M
}
279
280
static void SpecialFreeUnit(CPpmd8 *p, void *ptr)
281
4.02M
{
282
4.02M
  if ((Byte *)ptr != p->UnitsStart)
283
4.02M
    InsertNode(p, ptr, 0);
284
304
  else
285
304
  {
286
    #ifdef PPMD8_FREEZE_SUPPORT
287
    *(UInt32 *)ptr = EMPTY_NODE; /* it's used for (Flags == 0xFF) check in RemoveBinContexts */
288
    #endif
289
304
    p->UnitsStart += UNIT_SIZE;
290
304
  }
291
4.02M
}
292
293
static void *MoveUnitsUp(CPpmd8 *p, void *oldPtr, unsigned nu)
294
4.53M
{
295
4.53M
  unsigned indx = U2I(nu);
296
4.53M
  void *ptr;
297
4.53M
  if ((Byte *)oldPtr > p->UnitsStart + 16 * 1024 || REF(oldPtr) > p->FreeList[indx])
298
4.44M
    return oldPtr;
299
88.5k
  ptr = RemoveNode(p, indx);
300
88.5k
  MyMem12Cpy(ptr, oldPtr, nu);
301
88.5k
  if ((Byte*)oldPtr != p->UnitsStart)
302
88.3k
    InsertNode(p, oldPtr, indx);
303
116
  else
304
116
    p->UnitsStart += U2B(I2U(indx));
305
88.5k
  return ptr;
306
4.53M
}
307
308
static void ExpandTextArea(CPpmd8 *p)
309
266
{
310
266
  UInt32 count[PPMD_NUM_INDEXES];
311
266
  unsigned i;
312
266
  memset(count, 0, sizeof(count));
313
266
  if (p->LoUnit != p->HiUnit)
314
0
    ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
315
  
316
266
  {
317
266
    CPpmd8_Node *node = (CPpmd8_Node *)p->UnitsStart;
318
2.81k
    for (; node->Stamp == EMPTY_NODE; node += node->NU)
319
2.54k
    {
320
2.54k
      node->Stamp = 0;
321
2.54k
      count[U2I(node->NU)]++;
322
2.54k
    }
323
266
    p->UnitsStart = (Byte *)node;
324
266
  }
325
  
326
10.3k
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
327
10.1k
  {
328
10.1k
    CPpmd8_Node_Ref *next = (CPpmd8_Node_Ref *)&p->FreeList[i];
329
4.76M
    while (count[i] != 0)
330
4.75M
    {
331
4.75M
      CPpmd8_Node *node = NODE(*next);
332
4.75M
      while (node->Stamp == 0)
333
2.54k
      {
334
2.54k
        *next = node->Next;
335
2.54k
        node = NODE(*next);
336
2.54k
        p->Stamps[i]--;
337
2.54k
        if (--count[i] == 0)
338
360
          break;
339
2.54k
      }
340
4.75M
      next = &node->Next;
341
4.75M
    }
342
10.1k
  }
343
266
}
344
345
74.7M
#define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
346
347
static void SetSuccessor(CPpmd_State *p, CPpmd_Void_Ref v)
348
73.8M
{
349
  #ifdef __clang_analyzer__
350
  assert(p);
351
  #endif
352
73.8M
  (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF);
353
73.8M
  (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF);
354
73.8M
}
355
356
2.18k
#define RESET_TEXT(offs) do {           \
357
2.18k
  p->Text = p->Base + p->AlignOffset + (offs);      \
358
2.18k
} while (0)
359
360
static void RestartModel(CPpmd8 *p)
361
1.84k
{
362
1.84k
  unsigned i, k, m, r;
363
364
1.84k
  memset(p->FreeList, 0, sizeof(p->FreeList));
365
1.84k
  memset(p->Stamps, 0, sizeof(p->Stamps));
366
1.84k
  RESET_TEXT(0);
367
1.84k
  p->HiUnit = p->Text + p->Size;
368
1.84k
  p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE;
369
1.84k
  p->GlueCount = 0;
370
371
1.84k
  p->OrderFall = p->MaxOrder;
372
1.84k
  p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1;
373
1.84k
  p->PrevSuccess = 0;
374
375
1.84k
  p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */
376
1.84k
  p->MinContext->Suffix = 0;
377
1.84k
  p->MinContext->NumStats = 255;
378
1.84k
  p->MinContext->Flags = 0;
379
1.84k
  p->MinContext->SummFreq = 256 + 1;
380
1.84k
  p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */
381
1.84k
  p->LoUnit += U2B(256 / 2);
382
1.84k
  p->MinContext->Stats = REF(p->FoundState);
383
474k
  for (i = 0; i < 256; i++)
384
473k
  {
385
473k
    CPpmd_State *s = &p->FoundState[i];
386
473k
    s->Symbol = (Byte)i;
387
473k
    s->Freq = 1;
388
473k
    SetSuccessor(s, 0);
389
473k
  }
390
391
48.0k
  for (i = m = 0; m < 25; m++)
392
46.2k
  {
393
443k
    while (p->NS2Indx[i] == m)
394
397k
      i++;
395
415k
    for (k = 0; k < 8; k++)
396
369k
    {
397
369k
      UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 1));
398
369k
      UInt16 *dest = p->BinSumm[m] + k;
399
3.32M
      for (r = 0; r < 64; r += 8)
400
2.95M
        dest[r] = val;
401
369k
    }
402
46.2k
  }
403
404
46.2k
  for (i = m = 0; m < 24; m++)
405
44.3k
  {
406
515k
    while (p->NS2Indx[i + 3] == m + 3)
407
471k
      i++;
408
1.46M
    for (k = 0; k < 32; k++)
409
1.41M
    {
410
1.41M
      CPpmd_See *s = &p->See[m][k];
411
1.41M
      s->Summ = (UInt16)((2 * i + 5) << (s->Shift = PPMD_PERIOD_BITS - 4));
412
1.41M
      s->Count = 7;
413
1.41M
    }
414
44.3k
  }
415
1.84k
}
416
417
void Ppmd8_Init(CPpmd8 *p, unsigned maxOrder, unsigned restoreMethod)
418
1.78k
{
419
1.78k
  p->MaxOrder = maxOrder;
420
1.78k
  p->RestoreMethod = restoreMethod;
421
1.78k
  RestartModel(p);
422
1.78k
  p->DummySee.Shift = PPMD_PERIOD_BITS;
423
1.78k
  p->DummySee.Summ = 0; /* unused */
424
1.78k
  p->DummySee.Count = 64; /* unused */
425
1.78k
}
426
427
static void Refresh(CPpmd8 *p, CTX_PTR ctx, unsigned oldNU, unsigned scale)
428
791k
{
429
791k
  unsigned i = ctx->NumStats, escFreq, sumFreq, flags;
430
791k
  CPpmd_State *s = (CPpmd_State *)ShrinkUnits(p, STATS(ctx), oldNU, (i + 2) >> 1);
431
791k
  ctx->Stats = REF(s);
432
  #ifdef PPMD8_FREEZE_SUPPORT
433
  /* fixed over Shkarin's code. Fixed code is not compatible with original code for some files in FREEZE mode. */
434
  scale |= (ctx->SummFreq >= ((UInt32)1 << 15));
435
  #endif
436
791k
  flags = (ctx->Flags & (0x10 + 0x04 * scale)) + 0x08 * (s->Symbol >= 0x40);
437
791k
  escFreq = ctx->SummFreq - s->Freq;
438
791k
  sumFreq = (s->Freq = (Byte)((s->Freq + scale) >> scale));
439
791k
  do
440
1.89M
  {
441
1.89M
    escFreq -= (++s)->Freq;
442
1.89M
    sumFreq += (s->Freq = (Byte)((s->Freq + scale) >> scale));
443
1.89M
    flags |= 0x08 * (s->Symbol >= 0x40);
444
1.89M
  }
445
1.89M
  while (--i);
446
791k
  ctx->SummFreq = (UInt16)(sumFreq + ((escFreq + scale) >> scale));
447
791k
  ctx->Flags = (Byte)flags;
448
791k
}
449
450
static void SwapStates(CPpmd_State *t1, CPpmd_State *t2)
451
10.3M
{
452
10.3M
  CPpmd_State tmp = *t1;
453
10.3M
  *t1 = *t2;
454
10.3M
  *t2 = tmp;
455
10.3M
}
456
457
static CPpmd_Void_Ref CutOff(CPpmd8 *p, CTX_PTR ctx, unsigned order)
458
15.5M
{
459
15.5M
  int i;
460
15.5M
  unsigned tmp;
461
15.5M
  CPpmd_State *s;
462
  
463
15.5M
  if (!ctx->NumStats)
464
11.0M
  {
465
11.0M
    s = ONE_STATE(ctx);
466
11.0M
    if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart)
467
10.8M
    {
468
10.8M
      if (order < p->MaxOrder)
469
9.51M
        SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
470
1.38M
      else
471
1.38M
        SetSuccessor(s, 0);
472
10.8M
      if (SUCCESSOR(s) || order <= 9) /* O_BOUND */
473
8.21M
        return REF(ctx);
474
10.8M
    }
475
2.83M
    SpecialFreeUnit(p, ctx);
476
2.83M
    return 0;
477
11.0M
  }
478
479
4.53M
  ctx->Stats = STATS_REF(MoveUnitsUp(p, STATS(ctx), tmp = ((unsigned)ctx->NumStats + 2) >> 1));
480
481
17.3M
  for (s = STATS(ctx) + (i = ctx->NumStats); s >= STATS(ctx); s--)
482
12.7M
    if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) < p->UnitsStart)
483
6.47M
    {
484
6.47M
      CPpmd_State *s2 = STATS(ctx) + (i--);
485
6.47M
      SetSuccessor(s, 0);
486
6.47M
      SwapStates(s, s2);
487
6.47M
    }
488
6.31M
    else if (order < p->MaxOrder)
489
6.07M
      SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
490
245k
    else
491
245k
      SetSuccessor(s, 0);
492
    
493
4.53M
  if (i != ctx->NumStats && order)
494
3.80M
  {
495
3.80M
    ctx->NumStats = (Byte)i;
496
3.80M
    s = STATS(ctx);
497
3.80M
    if (i < 0)
498
1.19M
    {
499
1.19M
      FreeUnits(p, s, tmp);
500
1.19M
      SpecialFreeUnit(p, ctx);
501
1.19M
      return 0;
502
1.19M
    }
503
2.60M
    if (i == 0)
504
1.81M
    {
505
1.81M
      ctx->Flags = (Byte)((ctx->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40));
506
1.81M
      *ONE_STATE(ctx) = *s;
507
1.81M
      FreeUnits(p, s, tmp);
508
      /* 9.31: the code was fixed. It's was not BUG, if Freq <= MAX_FREQ = 124 */
509
1.81M
      ONE_STATE(ctx)->Freq = (Byte)(((unsigned)ONE_STATE(ctx)->Freq + 11) >> 3);
510
1.81M
    }
511
790k
    else
512
790k
      Refresh(p, ctx, tmp, ctx->SummFreq > 16 * i);
513
2.60M
  }
514
3.34M
  return REF(ctx);
515
4.53M
}
516
517
#ifdef PPMD8_FREEZE_SUPPORT
518
static CPpmd_Void_Ref RemoveBinContexts(CPpmd8 *p, CTX_PTR ctx, unsigned order)
519
{
520
  CPpmd_State *s;
521
  if (!ctx->NumStats)
522
  {
523
    s = ONE_STATE(ctx);
524
    if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
525
      SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
526
    else
527
      SetSuccessor(s, 0);
528
    /* Suffix context can be removed already, since different (high-order)
529
       Successors may refer to same context. So we check Flags == 0xFF (Stamp == EMPTY_NODE) */
530
    if (!SUCCESSOR(s) && (!SUFFIX(ctx)->NumStats || SUFFIX(ctx)->Flags == 0xFF))
531
    {
532
      FreeUnits(p, ctx, 1);
533
      return 0;
534
    }
535
    else
536
      return REF(ctx);
537
  }
538
539
  for (s = STATS(ctx) + ctx->NumStats; s >= STATS(ctx); s--)
540
    if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
541
      SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
542
    else
543
      SetSuccessor(s, 0);
544
  
545
  return REF(ctx);
546
}
547
#endif
548
549
static UInt32 GetUsedMemory(const CPpmd8 *p)
550
532
{
551
532
  UInt32 v = 0;
552
532
  unsigned i;
553
20.7k
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
554
20.2k
    v += p->Stamps[i] * I2U(i);
555
532
  return p->Size - (UInt32)(p->HiUnit - p->LoUnit) - (UInt32)(p->UnitsStart - p->Text) - U2B(v);
556
532
}
557
558
#ifdef PPMD8_FREEZE_SUPPORT
559
  #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1, fSuccessor)
560
#else
561
334
  #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1)
562
#endif
563
564
static void RestoreModel(CPpmd8 *p, CTX_PTR c1
565
    #ifdef PPMD8_FREEZE_SUPPORT
566
    , CTX_PTR fSuccessor
567
    #endif
568
    )
569
334
{
570
334
  CTX_PTR c;
571
334
  CPpmd_State *s;
572
334
  RESET_TEXT(0);
573
972
  for (c = p->MaxContext; c != c1; c = SUFFIX(c))
574
638
    if (--(c->NumStats) == 0)
575
300
    {
576
300
      s = STATS(c);
577
300
      c->Flags = (Byte)((c->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40));
578
300
      *ONE_STATE(c) = *s;
579
300
      SpecialFreeUnit(p, s);
580
300
      ONE_STATE(c)->Freq = (Byte)(((unsigned)ONE_STATE(c)->Freq + 11) >> 3);
581
300
    }
582
338
    else
583
338
      Refresh(p, c, (c->NumStats+3) >> 1, 0);
584
 
585
1.04k
  for (; c != p->MinContext; c = SUFFIX(c))
586
710
    if (!c->NumStats)
587
274
      ONE_STATE(c)->Freq = (Byte)(ONE_STATE(c)->Freq - (ONE_STATE(c)->Freq >> 1));
588
436
    else if ((c->SummFreq += 4) > 128 + 4 * c->NumStats)
589
38
      Refresh(p, c, (c->NumStats + 2) >> 1, 1);
590
591
  #ifdef PPMD8_FREEZE_SUPPORT
592
  if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
593
  {
594
    p->MaxContext = fSuccessor;
595
    p->GlueCount += !(p->Stamps[1] & 1);
596
  }
597
  else if (p->RestoreMethod == PPMD8_RESTORE_METHOD_FREEZE)
598
  {
599
    while (p->MaxContext->Suffix)
600
      p->MaxContext = SUFFIX(p->MaxContext);
601
    RemoveBinContexts(p, p->MaxContext, 0);
602
    p->RestoreMethod++;
603
    p->GlueCount = 0;
604
    p->OrderFall = p->MaxOrder;
605
  }
606
  else
607
  #endif
608
334
  if (p->RestoreMethod == PPMD8_RESTORE_METHOD_RESTART || GetUsedMemory(p) < (p->Size >> 1))
609
68
    RestartModel(p);
610
266
  else
611
266
  {
612
2.63k
    while (p->MaxContext->Suffix)
613
2.37k
      p->MaxContext = SUFFIX(p->MaxContext);
614
266
    do
615
266
    {
616
266
      CutOff(p, p->MaxContext, 0);
617
266
      ExpandTextArea(p);
618
266
    }
619
266
    while (GetUsedMemory(p) > 3 * (p->Size >> 2));
620
266
    p->GlueCount = 0;
621
266
    p->OrderFall = p->MaxOrder;
622
266
  }
623
334
}
624
625
static CTX_PTR CreateSuccessors(CPpmd8 *p, Bool skip, CPpmd_State *s1, CTX_PTR c)
626
7.40M
{
627
7.40M
  CPpmd_State upState;
628
7.40M
  Byte flags;
629
7.40M
  CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
630
  /* fixed over Shkarin's code. Maybe it could work without + 1 too. */
631
7.40M
  CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
632
7.40M
  unsigned numPs = 0;
633
634
#ifdef __clang_analyzer__
635
  memset(ps, 0, sizeof(ps));
636
#endif
637
638
  
639
7.40M
  if (!skip)
640
4.79M
    ps[numPs++] = p->FoundState;
641
  
642
28.2M
  while (c->Suffix)
643
28.0M
  {
644
28.0M
    CPpmd_Void_Ref successor;
645
28.0M
    CPpmd_State *s;
646
28.0M
    c = SUFFIX(c);
647
28.0M
    if (s1)
648
7.33M
    {
649
7.33M
      s = s1;
650
7.33M
      s1 = NULL;
651
7.33M
    }
652
20.7M
    else if (c->NumStats != 0)
653
7.23M
    {
654
47.8M
      for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++);
655
7.23M
      if (s->Freq < MAX_FREQ - 9)
656
7.20M
      {
657
7.20M
        s->Freq++;
658
7.20M
        c->SummFreq++;
659
7.20M
      }
660
7.23M
    }
661
13.5M
    else
662
13.5M
    {
663
13.5M
      s = ONE_STATE(c);
664
13.5M
      s->Freq = (Byte)(s->Freq + (!SUFFIX(c)->NumStats & (s->Freq < 24)));
665
13.5M
    }
666
28.0M
    successor = SUCCESSOR(s);
667
28.0M
    if (successor != upBranch)
668
7.28M
    {
669
7.28M
      c = CTX(successor);
670
7.28M
      if (numPs == 0)
671
321k
        return c;
672
6.96M
      break;
673
7.28M
    }
674
20.7M
    ps[numPs++] = s;
675
20.7M
  }
676
  
677
7.08M
  upState.Symbol = *(const Byte *)Ppmd8_GetPtr(p, upBranch);
678
7.08M
  SetSuccessor(&upState, upBranch + 1);
679
7.08M
  flags = (Byte)(0x10 * (p->FoundState->Symbol >= 0x40) + 0x08 * (upState.Symbol >= 0x40));
680
681
7.08M
  if (c->NumStats == 0)
682
2.87M
    upState.Freq = ONE_STATE(c)->Freq;
683
4.20M
  else
684
4.20M
  {
685
4.20M
    UInt32 cf, s0;
686
4.20M
    CPpmd_State *s;
687
20.3M
    for (s = STATS(c); s->Symbol != upState.Symbol; s++);
688
4.20M
    cf = s->Freq - 1;
689
4.20M
    s0 = c->SummFreq - c->NumStats - cf;
690
4.20M
    upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((cf + 2 * s0 - 3) / s0)));
691
4.20M
  }
692
693
32.6M
  while (numPs != 0)
694
25.5M
  {
695
    /* Create Child */
696
25.5M
    CTX_PTR c1; /* = AllocContext(p); */
697
25.5M
    if (p->HiUnit != p->LoUnit)
698
22.8M
      c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE);
699
2.70M
    else if (p->FreeList[0] != 0)
700
644k
      c1 = (CTX_PTR)RemoveNode(p, 0);
701
2.05M
    else
702
2.05M
    {
703
2.05M
      c1 = (CTX_PTR)AllocUnitsRare(p, 0);
704
2.05M
      if (!c1)
705
152
        return NULL;
706
2.05M
    }
707
25.5M
    c1->NumStats = 0;
708
25.5M
    c1->Flags = flags;
709
25.5M
    *ONE_STATE(c1) = upState;
710
25.5M
    c1->Suffix = REF(c);
711
25.5M
    SetSuccessor(ps[--numPs], REF(c1));
712
25.5M
    c = c1;
713
25.5M
  }
714
715
7.08M
  return c;
716
7.08M
}
717
718
static CTX_PTR ReduceOrder(CPpmd8 *p, CPpmd_State *s1, CTX_PTR c)
719
273k
{
720
273k
  CPpmd_State *s = NULL;
721
273k
  CTX_PTR c1 = c;
722
273k
  CPpmd_Void_Ref upBranch = REF(p->Text);
723
  
724
  #ifdef PPMD8_FREEZE_SUPPORT
725
  /* The BUG in Shkarin's code was fixed: ps could overflow in CUT_OFF mode. */
726
  CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
727
  unsigned numPs = 0;
728
  ps[numPs++] = p->FoundState;
729
  #endif
730
731
273k
  SetSuccessor(p->FoundState, upBranch);
732
273k
  p->OrderFall++;
733
734
273k
  for (;;)
735
350k
  {
736
350k
    if (s1)
737
131k
    {
738
131k
      c = SUFFIX(c);
739
131k
      s = s1;
740
131k
      s1 = NULL;
741
131k
    }
742
218k
    else
743
218k
    {
744
218k
      if (!c->Suffix)
745
141k
      {
746
        #ifdef PPMD8_FREEZE_SUPPORT
747
        if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
748
        {
749
          do { SetSuccessor(ps[--numPs], REF(c)); } while (numPs);
750
          RESET_TEXT(1);
751
          p->OrderFall = 1;
752
        }
753
        #endif
754
141k
        return c;
755
141k
      }
756
77.2k
      c = SUFFIX(c);
757
77.2k
      if (c->NumStats)
758
39.6k
      {
759
39.6k
        if ((s = STATS(c))->Symbol != p->FoundState->Symbol)
760
144k
          do { s++; } while (s->Symbol != p->FoundState->Symbol);
761
39.6k
        if (s->Freq < MAX_FREQ - 9)
762
39.5k
        {
763
39.5k
          s->Freq += 2;
764
39.5k
          c->SummFreq += 2;
765
39.5k
        }
766
39.6k
      }
767
37.6k
      else
768
37.6k
      {
769
37.6k
        s = ONE_STATE(c);
770
37.6k
        s->Freq = (Byte)(s->Freq + (s->Freq < 32));
771
37.6k
      }
772
77.2k
    }
773
208k
    if (SUCCESSOR(s))
774
132k
      break;
775
    #ifdef PPMD8_FREEZE_SUPPORT
776
    ps[numPs++] = s;
777
    #endif
778
76.3k
    SetSuccessor(s, upBranch);
779
76.3k
    p->OrderFall++;
780
76.3k
  }
781
  
782
  #ifdef PPMD8_FREEZE_SUPPORT
783
  if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
784
  {
785
    c = CTX(SUCCESSOR(s));
786
    do { SetSuccessor(ps[--numPs], REF(c)); } while (numPs);
787
    RESET_TEXT(1);
788
    p->OrderFall = 1;
789
    return c;
790
  }
791
  else
792
  #endif
793
132k
  if (SUCCESSOR(s) <= upBranch)
794
1.63k
  {
795
1.63k
    CTX_PTR successor;
796
1.63k
    CPpmd_State *s2 = p->FoundState;
797
1.63k
    p->FoundState = s;
798
799
1.63k
    successor = CreateSuccessors(p, False, NULL, c);
800
1.63k
    if (successor == NULL)
801
0
      SetSuccessor(s, 0);
802
1.63k
    else
803
1.63k
      SetSuccessor(s, REF(successor));
804
1.63k
    p->FoundState = s2;
805
1.63k
  }
806
  
807
132k
  if (p->OrderFall == 1 && c1 == p->MaxContext)
808
4.30k
  {
809
4.30k
    SetSuccessor(p->FoundState, SUCCESSOR(s));
810
4.30k
    p->Text--;
811
4.30k
  }
812
132k
  if (SUCCESSOR(s) == 0)
813
0
    return NULL;
814
132k
  return CTX(SUCCESSOR(s));
815
132k
}
816
817
static void UpdateModel(CPpmd8 *p)
818
17.0M
{
819
17.0M
  CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
820
17.0M
  CTX_PTR c;
821
17.0M
  unsigned s0, ns, fFreq = p->FoundState->Freq;
822
17.0M
  Byte flag, fSymbol = p->FoundState->Symbol;
823
17.0M
  CPpmd_State *s = NULL;
824
  
825
17.0M
  if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
826
14.5M
  {
827
14.5M
    c = SUFFIX(p->MinContext);
828
    
829
14.5M
    if (c->NumStats == 0)
830
7.18M
    {
831
7.18M
      s = ONE_STATE(c);
832
7.18M
      if (s->Freq < 32)
833
7.18M
        s->Freq++;
834
7.18M
    }
835
7.32M
    else
836
7.32M
    {
837
7.32M
      s = STATS(c);
838
7.32M
      if (s->Symbol != p->FoundState->Symbol)
839
4.82M
      {
840
77.0M
        do { s++; } while (s->Symbol != p->FoundState->Symbol);
841
4.82M
        if (s[0].Freq >= s[-1].Freq)
842
2.06M
        {
843
2.06M
          SwapStates(&s[0], &s[-1]);
844
2.06M
          s--;
845
2.06M
        }
846
4.82M
      }
847
7.32M
      if (s->Freq < MAX_FREQ - 9)
848
7.20M
      {
849
7.20M
        s->Freq += 2;
850
7.20M
        c->SummFreq += 2;
851
7.20M
      }
852
7.32M
    }
853
14.5M
  }
854
  
855
17.0M
  c = p->MaxContext;
856
17.0M
  if (p->OrderFall == 0 && fSuccessor)
857
2.61M
  {
858
2.61M
    CTX_PTR cs = CreateSuccessors(p, True, s, p->MinContext);
859
2.61M
    if (cs == 0)
860
82
    {
861
82
      SetSuccessor(p->FoundState, 0);
862
82
      RESTORE_MODEL(c, CTX(fSuccessor));
863
82
    }
864
2.61M
    else
865
2.61M
    {
866
2.61M
      SetSuccessor(p->FoundState, REF(cs));
867
2.61M
      p->MaxContext = cs;
868
2.61M
    }
869
2.61M
    return;
870
2.61M
  }
871
  
872
14.4M
  *p->Text++ = p->FoundState->Symbol;
873
14.4M
  successor = REF(p->Text);
874
14.4M
  if (p->Text >= p->UnitsStart)
875
10
  {
876
10
    RESTORE_MODEL(c, CTX(fSuccessor)); /* check it */
877
10
    return;
878
10
  }
879
  
880
14.4M
  if (!fSuccessor)
881
273k
  {
882
273k
    CTX_PTR cs = ReduceOrder(p, s, p->MinContext);
883
273k
    if (cs == NULL)
884
0
    {
885
0
      RESTORE_MODEL(c, 0);
886
0
      return;
887
0
    }
888
273k
    fSuccessor = REF(cs);
889
273k
  }
890
14.1M
  else if ((Byte *)Ppmd8_GetPtr(p, fSuccessor) < p->UnitsStart)
891
4.79M
  {
892
4.79M
    CTX_PTR cs = CreateSuccessors(p, False, s, p->MinContext);
893
4.79M
    if (cs == NULL)
894
70
    {
895
70
      RESTORE_MODEL(c, 0);
896
70
      return;
897
70
    }
898
4.79M
    fSuccessor = REF(cs);
899
4.79M
  }
900
  
901
14.4M
  if (--p->OrderFall == 0)
902
1.30M
  {
903
1.30M
    successor = fSuccessor;
904
1.30M
    p->Text -= (p->MaxContext != p->MinContext);
905
1.30M
  }
906
  #ifdef PPMD8_FREEZE_SUPPORT
907
  else if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
908
  {
909
    successor = fSuccessor;
910
    RESET_TEXT(0);
911
    p->OrderFall = 0;
912
  }
913
  #endif
914
  
915
14.4M
  s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - fFreq;
916
14.4M
  flag = (Byte)(0x08 * (fSymbol >= 0x40));
917
  
918
28.4M
  for (; c != p->MinContext; c = SUFFIX(c))
919
14.0M
  {
920
14.0M
    unsigned ns1;
921
14.0M
    UInt32 cf, sf;
922
14.0M
    if ((ns1 = c->NumStats) != 0)
923
6.53M
    {
924
6.53M
      if ((ns1 & 1) != 0)
925
4.14M
      {
926
        /* Expand for one UNIT */
927
4.14M
        unsigned oldNU = (ns1 + 1) >> 1;
928
4.14M
        unsigned i = U2I(oldNU);
929
4.14M
        if (i != U2I(oldNU + 1))
930
3.88M
        {
931
3.88M
          void *ptr = AllocUnits(p, i + 1);
932
3.88M
          void *oldPtr;
933
3.88M
          if (!ptr)
934
106
          {
935
106
            RESTORE_MODEL(c, CTX(fSuccessor));
936
106
            return;
937
106
          }
938
3.88M
          oldPtr = STATS(c);
939
3.88M
          MyMem12Cpy(ptr, oldPtr, oldNU);
940
3.88M
          InsertNode(p, oldPtr, i);
941
3.88M
          c->Stats = STATS_REF(ptr);
942
3.88M
        }
943
4.14M
      }
944
6.53M
      c->SummFreq = (UInt16)(c->SummFreq + (3 * ns1 + 1 < ns));
945
6.53M
    }
946
7.53M
    else
947
7.53M
    {
948
7.53M
      CPpmd_State *s2 = (CPpmd_State*)AllocUnits(p, 0);
949
7.53M
      if (!s2)
950
66
      {
951
66
        RESTORE_MODEL(c, CTX(fSuccessor));
952
66
        return;
953
66
      }
954
7.52M
      *s2 = *ONE_STATE(c);
955
7.52M
      c->Stats = REF(s2);
956
7.52M
      if (s2->Freq < MAX_FREQ / 4 - 1)
957
7.52M
        s2->Freq <<= 1;
958
5.05k
      else
959
5.05k
        s2->Freq = MAX_FREQ - 4;
960
7.52M
      c->SummFreq = (UInt16)(s2->Freq + p->InitEsc + (ns > 2));
961
7.52M
    }
962
14.0M
    cf = 2 * fFreq * (c->SummFreq + 6);
963
14.0M
    sf = (UInt32)s0 + c->SummFreq;
964
14.0M
    if (cf < 6 * sf)
965
8.23M
    {
966
8.23M
      cf = 1 + (cf > sf) + (cf >= 4 * sf);
967
8.23M
      c->SummFreq += 4;
968
8.23M
    }
969
5.83M
    else
970
5.83M
    {
971
5.83M
      cf = 4 + (cf > 9 * sf) + (cf > 12 * sf) + (cf > 15 * sf);
972
5.83M
      c->SummFreq = (UInt16)(c->SummFreq + cf);
973
5.83M
    }
974
14.0M
    {
975
14.0M
      CPpmd_State *s2 = STATS(c) + ns1 + 1;
976
14.0M
      SetSuccessor(s2, successor);
977
14.0M
      s2->Symbol = fSymbol;
978
14.0M
      s2->Freq = (Byte)cf;
979
14.0M
      c->Flags |= flag;
980
14.0M
      c->NumStats = (Byte)(ns1 + 1);
981
14.0M
    }
982
14.0M
  }
983
14.4M
  p->MaxContext = p->MinContext = CTX(fSuccessor);
984
14.4M
}
985
  
986
static void Rescale(CPpmd8 *p)
987
73.0k
{
988
73.0k
  unsigned i, adder, sumFreq, escFreq;
989
73.0k
  CPpmd_State *stats = STATS(p->MinContext);
990
73.0k
  CPpmd_State *s = p->FoundState;
991
73.0k
  {
992
73.0k
    CPpmd_State tmp = *s;
993
122k
    for (; s != stats; s--)
994
48.9k
      s[0] = s[-1];
995
73.0k
    *s = tmp;
996
73.0k
  }
997
73.0k
  escFreq = p->MinContext->SummFreq - s->Freq;
998
73.0k
  s->Freq += 4;
999
73.0k
  adder = (p->OrderFall != 0
1000
      #ifdef PPMD8_FREEZE_SUPPORT
1001
      || p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE
1002
      #endif
1003
73.0k
      );
1004
73.0k
  s->Freq = (Byte)((s->Freq + adder) >> 1);
1005
73.0k
  sumFreq = s->Freq;
1006
  
1007
73.0k
  i = p->MinContext->NumStats;
1008
73.0k
  do
1009
1.59M
  {
1010
1.59M
    escFreq -= (++s)->Freq;
1011
1.59M
    s->Freq = (Byte)((s->Freq + adder) >> 1);
1012
1.59M
    sumFreq += s->Freq;
1013
1.59M
    if (s[0].Freq > s[-1].Freq)
1014
563k
    {
1015
563k
      CPpmd_State *s1 = s;
1016
563k
      CPpmd_State tmp = *s1;
1017
563k
      do
1018
15.6M
        s1[0] = s1[-1];
1019
15.6M
      while (--s1 != stats && tmp.Freq > s1[-1].Freq);
1020
563k
      *s1 = tmp;
1021
563k
    }
1022
1.59M
  }
1023
1.59M
  while (--i);
1024
  
1025
73.0k
  if (s->Freq == 0)
1026
24.3k
  {
1027
24.3k
    unsigned numStats = p->MinContext->NumStats;
1028
24.3k
    unsigned n0, n1;
1029
47.4k
    do { i++; } while ((--s)->Freq == 0);
1030
24.3k
    escFreq += i;
1031
24.3k
    p->MinContext->NumStats = (Byte)(p->MinContext->NumStats - i);
1032
24.3k
    if (p->MinContext->NumStats == 0)
1033
3.59k
    {
1034
3.59k
      CPpmd_State tmp = *stats;
1035
3.59k
      tmp.Freq = (Byte)((2 * tmp.Freq + escFreq - 1) / escFreq);
1036
3.59k
      if (tmp.Freq > MAX_FREQ / 3)
1037
3.10k
        tmp.Freq = MAX_FREQ / 3;
1038
3.59k
      InsertNode(p, stats, U2I((numStats + 2) >> 1));
1039
3.59k
      p->MinContext->Flags = (Byte)((p->MinContext->Flags & 0x10) + 0x08 * (tmp.Symbol >= 0x40));
1040
3.59k
      *(p->FoundState = ONE_STATE(p->MinContext)) = tmp;
1041
3.59k
      return;
1042
3.59k
    }
1043
20.7k
    n0 = (numStats + 2) >> 1;
1044
20.7k
    n1 = (p->MinContext->NumStats + 2) >> 1;
1045
20.7k
    if (n0 != n1)
1046
15.9k
      p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
1047
20.7k
    p->MinContext->Flags &= ~0x08;
1048
20.7k
    p->MinContext->Flags |= 0x08 * ((s = STATS(p->MinContext))->Symbol >= 0x40);
1049
20.7k
    i = p->MinContext->NumStats;
1050
175k
    do { p->MinContext->Flags |= 0x08*((++s)->Symbol >= 0x40); } while (--i);
1051
20.7k
  }
1052
69.4k
  p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1));
1053
69.4k
  p->MinContext->Flags |= 0x4;
1054
69.4k
  p->FoundState = STATS(p->MinContext);
1055
69.4k
}
1056
1057
CPpmd_See *Ppmd8_MakeEscFreq(CPpmd8 *p, unsigned numMasked1, UInt32 *escFreq)
1058
6.49M
{
1059
6.49M
  CPpmd_See *see;
1060
6.49M
  if (p->MinContext->NumStats != 0xFF)
1061
5.41M
  {
1062
5.41M
    see = p->See[(unsigned)p->NS2Indx[(unsigned)p->MinContext->NumStats + 2] - 3] +
1063
5.41M
        (p->MinContext->SummFreq > 11 * ((unsigned)p->MinContext->NumStats + 1)) +
1064
5.41M
        2 * (unsigned)(2 * (unsigned)p->MinContext->NumStats <
1065
5.41M
        ((unsigned)SUFFIX(p->MinContext)->NumStats + numMasked1)) +
1066
5.41M
        p->MinContext->Flags;
1067
5.41M
    {
1068
5.41M
      unsigned r = (see->Summ >> see->Shift);
1069
5.41M
      see->Summ = (UInt16)(see->Summ - r);
1070
5.41M
      *escFreq = r + (r == 0);
1071
5.41M
    }
1072
5.41M
  }
1073
1.08M
  else
1074
1.08M
  {
1075
1.08M
    see = &p->DummySee;
1076
1.08M
    *escFreq = 1;
1077
1.08M
  }
1078
6.49M
  return see;
1079
6.49M
}
1080
1081
static void NextContext(CPpmd8 *p)
1082
29.3M
{
1083
29.3M
  CTX_PTR c = CTX(SUCCESSOR(p->FoundState));
1084
29.3M
  if (p->OrderFall == 0 && (Byte *)c >= p->UnitsStart)
1085
16.9M
    p->MinContext = p->MaxContext = c;
1086
12.4M
  else
1087
12.4M
  {
1088
12.4M
    UpdateModel(p);
1089
12.4M
    p->MinContext = p->MaxContext;
1090
12.4M
  }
1091
29.3M
}
1092
1093
void Ppmd8_Update1(CPpmd8 *p)
1094
3.13M
{
1095
3.13M
  CPpmd_State *s = p->FoundState;
1096
3.13M
  s->Freq += 4;
1097
3.13M
  p->MinContext->SummFreq += 4;
1098
3.13M
  if (s[0].Freq > s[-1].Freq)
1099
1.85M
  {
1100
1.85M
    SwapStates(&s[0], &s[-1]);
1101
1.85M
    p->FoundState = --s;
1102
1.85M
    if (s->Freq > MAX_FREQ)
1103
462
      Rescale(p);
1104
1.85M
  }
1105
3.13M
  NextContext(p);
1106
3.13M
}
1107
1108
void Ppmd8_Update1_0(CPpmd8 *p)
1109
3.30M
{
1110
3.30M
  p->PrevSuccess = (2 * p->FoundState->Freq >= p->MinContext->SummFreq);
1111
3.30M
  p->RunLength += p->PrevSuccess;
1112
3.30M
  p->MinContext->SummFreq += 4;
1113
3.30M
  if ((p->FoundState->Freq += 4) > MAX_FREQ)
1114
62.8k
    Rescale(p);
1115
3.30M
  NextContext(p);
1116
3.30M
}
1117
1118
void Ppmd8_UpdateBin(CPpmd8 *p)
1119
22.9M
{
1120
22.9M
  p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 196));
1121
22.9M
  p->PrevSuccess = 1;
1122
22.9M
  p->RunLength++;
1123
22.9M
  NextContext(p);
1124
22.9M
}
1125
1126
void Ppmd8_Update2(CPpmd8 *p)
1127
4.61M
{
1128
4.61M
  p->MinContext->SummFreq += 4;
1129
4.61M
  if ((p->FoundState->Freq += 4) > MAX_FREQ)
1130
9.78k
    Rescale(p);
1131
4.61M
  p->RunLength = p->InitRL;
1132
4.61M
  UpdateModel(p);
1133
4.61M
  p->MinContext = p->MaxContext;
1134
4.61M
}
1135
1136
/* Ppmd8Dec.c -- PPMdI Decoder
1137
2010-04-16 : Igor Pavlov : Public domain
1138
This code is based on:
1139
  PPMd var.I (2002): Dmitry Shkarin : Public domain
1140
  Carryless rangecoder (1999): Dmitry Subbotin : Public domain */
1141
1142
Bool Ppmd8_RangeDec_Init(CPpmd8 *p)
1143
1.78k
{
1144
1.78k
  unsigned i;
1145
1.78k
  p->Low = 0;
1146
1.78k
  p->Range = 0xFFFFFFFF;
1147
1.78k
  p->Code = 0;
1148
8.91k
  for (i = 0; i < 4; i++)
1149
7.12k
    p->Code = (p->Code << 8) | p->Stream.In->Read(p->Stream.In);
1150
1.78k
  return (p->Code < 0xFFFFFFFF);
1151
1.78k
}
1152
1153
static UInt32 RangeDec_GetThreshold(CPpmd8 *p, UInt32 total)
1154
15.0M
{
1155
15.0M
  return p->Code / (p->Range /= total);
1156
15.0M
}
1157
1158
static void RangeDec_Decode(CPpmd8 *p, UInt32 start, UInt32 size)
1159
40.4M
{
1160
40.4M
  start *= p->Range;
1161
40.4M
  p->Low += start;
1162
40.4M
  p->Code -= start;
1163
40.4M
  p->Range *= size;
1164
1165
45.9M
  while ((p->Low ^ (p->Low + p->Range)) < kTop ||
1166
40.4M
      (p->Range < kBot && ((p->Range = (0 - p->Low) & (kBot - 1)), 1)))
1167
5.44M
  {
1168
5.44M
    p->Code = (p->Code << 8) | p->Stream.In->Read(p->Stream.In);
1169
5.44M
    p->Range <<= 8;
1170
5.44M
    p->Low <<= 8;
1171
5.44M
  }
1172
40.4M
}
1173
1174
366M
#define MASK(sym) ((signed char *)charMask)[sym]
1175
1176
int Ppmd8_DecodeSymbol(CPpmd8 *p)
1177
33.9M
{
1178
33.9M
  size_t charMask[256 / sizeof(size_t)];
1179
33.9M
  if (p->MinContext->NumStats != 0)
1180
8.59M
  {
1181
8.59M
    CPpmd_State *s = Ppmd8_GetStats(p, p->MinContext);
1182
8.59M
    unsigned i;
1183
8.59M
    UInt32 count, hiCnt;
1184
8.59M
    if ((count = RangeDec_GetThreshold(p, p->MinContext->SummFreq)) < (hiCnt = s->Freq))
1185
3.30M
    {
1186
3.30M
      Byte symbol;
1187
3.30M
      RangeDec_Decode(p, 0, s->Freq);
1188
3.30M
      p->FoundState = s;
1189
3.30M
      symbol = s->Symbol;
1190
3.30M
      Ppmd8_Update1_0(p);
1191
3.30M
      return symbol;
1192
3.30M
    }
1193
5.28M
    p->PrevSuccess = 0;
1194
5.28M
    i = p->MinContext->NumStats;
1195
5.28M
    do
1196
33.4M
    {
1197
33.4M
      if ((hiCnt += (++s)->Freq) > count)
1198
3.13M
      {
1199
3.13M
        Byte symbol;
1200
3.13M
        RangeDec_Decode(p, hiCnt - s->Freq, s->Freq);
1201
3.13M
        p->FoundState = s;
1202
3.13M
        symbol = s->Symbol;
1203
3.13M
        Ppmd8_Update1(p);
1204
3.13M
        return symbol;
1205
3.13M
      }
1206
33.4M
    }
1207
30.3M
    while (--i);
1208
2.15M
    if (count >= p->MinContext->SummFreq)
1209
236
      return -2;
1210
2.15M
    RangeDec_Decode(p, hiCnt, p->MinContext->SummFreq - hiCnt);
1211
2.15M
    PPMD_SetAllBitsIn256Bytes(charMask);
1212
2.15M
    MASK(s->Symbol) = 0;
1213
2.15M
    i = p->MinContext->NumStats;
1214
9.89M
    do { MASK((--s)->Symbol) = 0; } while (--i);
1215
2.15M
  }
1216
25.3M
  else
1217
25.3M
  {
1218
25.3M
    UInt16 *prob = Ppmd8_GetBinSumm(p);
1219
25.3M
    if (((p->Code / (p->Range >>= 14)) < *prob))
1220
22.9M
    {
1221
22.9M
      Byte symbol;
1222
22.9M
      RangeDec_Decode(p, 0, *prob);
1223
22.9M
      *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
1224
22.9M
      symbol = (p->FoundState = Ppmd8Context_OneState(p->MinContext))->Symbol;
1225
22.9M
      Ppmd8_UpdateBin(p);
1226
22.9M
      return symbol;
1227
22.9M
    }
1228
2.45M
    RangeDec_Decode(p, *prob, (1 << 14) - *prob);
1229
2.45M
    *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
1230
2.45M
    p->InitEsc = PPMD8_kExpEscape[*prob >> 10];
1231
2.45M
    PPMD_SetAllBitsIn256Bytes(charMask);
1232
2.45M
    MASK(Ppmd8Context_OneState(p->MinContext)->Symbol) = 0;
1233
2.45M
    p->PrevSuccess = 0;
1234
2.45M
  }
1235
4.61M
  for (;;)
1236
6.49M
  {
1237
6.49M
    CPpmd_State *ps[256], *s;
1238
6.49M
    UInt32 freqSum, count, hiCnt;
1239
6.49M
    CPpmd_See *see;
1240
6.49M
    unsigned i, num, numMasked = p->MinContext->NumStats;
1241
6.49M
    do
1242
14.0M
    {
1243
14.0M
      p->OrderFall++;
1244
14.0M
      if (!p->MinContext->Suffix)
1245
408
        return -1;
1246
14.0M
      p->MinContext = Ppmd8_GetContext(p, p->MinContext->Suffix);
1247
14.0M
    }
1248
14.0M
    while (p->MinContext->NumStats == numMasked);
1249
6.49M
    hiCnt = 0;
1250
6.49M
    s = Ppmd8_GetStats(p, p->MinContext);
1251
6.49M
    i = 0;
1252
6.49M
    num = p->MinContext->NumStats - numMasked;
1253
6.49M
    do
1254
342M
    {
1255
342M
      int k = (int)(MASK(s->Symbol));
1256
342M
      hiCnt += (s->Freq & k);
1257
342M
      ps[i] = s++;
1258
342M
      i -= k;
1259
342M
    }
1260
342M
    while (i != num);
1261
    
1262
6.49M
    see = Ppmd8_MakeEscFreq(p, numMasked, &freqSum);
1263
6.49M
    freqSum += hiCnt;
1264
6.49M
    count = RangeDec_GetThreshold(p, freqSum);
1265
    
1266
6.49M
    if (count < hiCnt)
1267
4.61M
    {
1268
4.61M
      Byte symbol;
1269
4.61M
      CPpmd_State **pps = ps;
1270
83.4M
      for (hiCnt = 0; (hiCnt += (*pps)->Freq) <= count; pps++);
1271
4.61M
      s = *pps;
1272
4.61M
      RangeDec_Decode(p, hiCnt - s->Freq, s->Freq);
1273
4.61M
      Ppmd_See_Update(see);
1274
4.61M
      p->FoundState = s;
1275
4.61M
      symbol = s->Symbol;
1276
4.61M
      Ppmd8_Update2(p);
1277
4.61M
      return symbol;
1278
4.61M
    }
1279
1.88M
    if (count >= freqSum)
1280
406
      return -2;
1281
1.88M
    RangeDec_Decode(p, hiCnt, freqSum - hiCnt);
1282
1.88M
    see->Summ = (UInt16)(see->Summ + freqSum);
1283
8.97M
    do { MASK(ps[--i]->Symbol) = 0; } while (i != 0);
1284
1.88M
  }
1285
4.61M
}
1286
1287
/* H->I changes:
1288
  NS2Indx
1289
  GlewCount, and Glue method
1290
  BinSum
1291
  See / EscFreq
1292
  CreateSuccessors updates more suffix contexts
1293
  UpdateModel consts.
1294
  PrevSuccess Update
1295
*/
1296
1297
const IPpmd8 __archive_ppmd8_functions =
1298
{
1299
  &Ppmd8_Construct,
1300
  &Ppmd8_Alloc,
1301
  &Ppmd8_Free,
1302
  &Ppmd8_Init,
1303
  &Ppmd8_RangeDec_Init,
1304
  &Ppmd8_DecodeSymbol,
1305
};