Coverage Report

Created: 2026-09-14 06:43

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
17.8M
#define MAX_FREQ 124
19
13.6M
#define UNIT_SIZE 12
20
21
3.66M
#define U2B(nu) ((UInt32)(nu) * UNIT_SIZE)
22
3.11M
#define U2I(nu) (p->Units2Indx[(nu) - 1])
23
1.64M
#define I2U(indx) (p->Indx2Units[indx])
24
25
#ifdef PPMD_32BIT
26
  #define REF(ptr) (ptr)
27
#else
28
35.4M
  #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
29
#endif
30
31
1.46M
#define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr))
32
33
95.9M
#define CTX(ref) ((CPpmd8_Context *)Ppmd8_GetContext(p, ref))
34
13.7M
#define STATS(ctx) Ppmd8_GetStats(p, ctx)
35
23.4M
#define ONE_STATE(ctx) Ppmd8Context_OneState(ctx)
36
29.8M
#define SUFFIX(ctx) CTX((ctx)->Suffix)
37
38
127M
#define kTop (1 << 24)
39
123M
#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
1.50M
  #define NODE(offs) ((CPpmd8_Node *)(p->Base + (offs)))
64
#endif
65
66
1.54M
#define EMPTY_NODE 0xFFFFFFFF
67
68
static void Ppmd8_Construct(CPpmd8 *p)
69
1.43k
{
70
1.43k
  unsigned i, k, m;
71
72
1.43k
  p->Base = 0;
73
74
56.0k
  for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++)
75
54.6k
  {
76
54.6k
    unsigned step = (i >= 12 ? 4 : (i >> 2) + 1);
77
184k
    do { p->Units2Indx[k++] = (Byte)i; } while (--step);
78
54.6k
    p->Indx2Units[i] = (Byte)k;
79
54.6k
  }
80
81
1.43k
  p->NS2BSIndx[0] = (0 << 1);
82
1.43k
  p->NS2BSIndx[1] = (1 << 1);
83
1.43k
  memset(p->NS2BSIndx + 2, (2 << 1), 9);
84
1.43k
  memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11);
85
86
8.62k
  for (i = 0; i < 5; i++)
87
7.19k
    p->NS2Indx[i] = (Byte)i;
88
368k
  for (m = i, k = 1; i < 260; i++)
89
366k
  {
90
366k
    p->NS2Indx[i] = (Byte)m;
91
366k
    if (--k == 0)
92
31.6k
      k = (++m) - 4;
93
366k
  }
94
1.43k
}
95
96
static void Ppmd8_Free(CPpmd8 *p)
97
2.82k
{
98
2.82k
  free(p->Base);
99
2.82k
  p->Size = 0;
100
2.82k
  p->Base = 0;
101
2.82k
}
102
103
static Bool Ppmd8_Alloc(CPpmd8 *p, UInt32 size)
104
1.41k
{
105
1.41k
  if (p->Base == 0 || p->Size != size)
106
1.41k
  {
107
1.41k
    Ppmd8_Free(p);
108
1.41k
    p->AlignOffset =
109
      #ifdef PPMD_32BIT
110
        (4 - size) & 3;
111
      #else
112
1.41k
        4 - (size & 3);
113
1.41k
      #endif
114
1.41k
    if ((p->Base = malloc(p->AlignOffset + size)) == 0)
115
0
      return False;
116
1.41k
    p->Size = size;
117
1.41k
  }
118
1.41k
  return True;
119
1.41k
}
120
121
static void InsertNode(CPpmd8 *p, void *node, unsigned indx)
122
1.54M
{
123
1.54M
  ((CPpmd8_Node *)node)->Stamp = EMPTY_NODE;
124
1.54M
  ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx];
125
1.54M
  ((CPpmd8_Node *)node)->NU = I2U(indx);
126
1.54M
  p->FreeList[indx] = REF(node);
127
1.54M
  p->Stamps[indx]++;
128
1.54M
}
129
130
static void *RemoveNode(CPpmd8 *p, unsigned indx)
131
1.46M
{
132
1.46M
  CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]);
133
1.46M
  p->FreeList[indx] = node->Next;
134
1.46M
  p->Stamps[indx]--;
135
1.46M
  return node;
136
1.46M
}
137
138
static void SplitBlock(CPpmd8 *p, void *ptr, unsigned oldIndx, unsigned newIndx)
139
33.4k
{
140
33.4k
  unsigned i, nu = I2U(oldIndx) - I2U(newIndx);
141
33.4k
  ptr = (Byte *)ptr + U2B(I2U(newIndx));
142
33.4k
  if (I2U(i = U2I(nu)) != nu)
143
5.68k
  {
144
5.68k
    unsigned k = I2U(--i);
145
5.68k
    InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
146
5.68k
  }
147
33.4k
  InsertNode(p, ptr, i);
148
33.4k
}
149
150
static void GlueFreeBlocks(CPpmd8 *p)
151
162
{
152
162
  CPpmd8_Node_Ref head = 0;
153
162
  CPpmd8_Node_Ref *prev = &head;
154
162
  unsigned i;
155
156
162
  p->GlueCount = 1 << 13;
157
162
  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
162
  if (p->LoUnit != p->HiUnit)
162
18
    ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
163
164
  /* Glue free blocks */
165
6.31k
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
166
6.15k
  {
167
6.15k
    CPpmd8_Node_Ref next = (CPpmd8_Node_Ref)p->FreeList[i];
168
6.15k
    p->FreeList[i] = 0;
169
8.22k
    while (next != 0)
170
2.06k
    {
171
2.06k
      CPpmd8_Node *node = NODE(next);
172
2.06k
      if (node->NU != 0)
173
1.98k
      {
174
1.98k
        CPpmd8_Node *node2;
175
1.98k
        *prev = next;
176
1.98k
        prev = &(node->Next);
177
2.42k
        while ((node2 = node + node->NU)->Stamp == EMPTY_NODE)
178
444
        {
179
444
          node->NU += node2->NU;
180
444
          node2->NU = 0;
181
444
        }
182
1.98k
      }
183
2.06k
      next = node->Next;
184
2.06k
    }
185
6.15k
  }
186
162
  *prev = 0;
187
  
188
  /* Fill lists of free blocks */
189
2.14k
  while (head != 0)
190
1.98k
  {
191
1.98k
    CPpmd8_Node *node = NODE(head);
192
1.98k
    unsigned nu;
193
1.98k
    head = node->Next;
194
1.98k
    nu = node->NU;
195
1.98k
    if (nu == 0)
196
360
      continue;
197
1.62k
    for (; nu > 128; nu -= 128, node += 128)
198
0
      InsertNode(p, node, PPMD_NUM_INDEXES - 1);
199
1.62k
    if (I2U(i = U2I(nu)) != nu)
200
68
    {
201
68
      unsigned k = I2U(--i);
202
68
      InsertNode(p, node + k, nu - k - 1);
203
68
    }
204
1.62k
    InsertNode(p, node, i);
205
1.62k
  }
206
162
}
207
208
static void *AllocUnitsRare(CPpmd8 *p, unsigned indx)
209
749k
{
210
749k
  unsigned i;
211
749k
  void *retVal;
212
749k
  if (p->GlueCount == 0)
213
162
  {
214
162
    GlueFreeBlocks(p);
215
162
    if (p->FreeList[indx] != 0)
216
42
      return RemoveNode(p, indx);
217
162
  }
218
749k
  i = indx;
219
749k
  do
220
27.2M
  {
221
27.2M
    if (++i == PPMD_NUM_INDEXES)
222
717k
    {
223
717k
      UInt32 numBytes = U2B(I2U(indx));
224
717k
      p->GlueCount--;
225
717k
      return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL);
226
717k
    }
227
27.2M
  }
228
26.5M
  while (p->FreeList[i] == 0);
229
31.9k
  retVal = RemoveNode(p, i);
230
31.9k
  SplitBlock(p, retVal, i, indx);
231
31.9k
  return retVal;
232
749k
}
233
234
static void *AllocUnits(CPpmd8 *p, unsigned indx)
235
4.28M
{
236
4.28M
  UInt32 numBytes;
237
4.28M
  if (p->FreeList[indx] != 0)
238
1.37M
    return RemoveNode(p, indx);
239
2.90M
  numBytes = U2B(I2U(indx));
240
2.90M
  if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit))
241
2.71M
  {
242
2.71M
    void *retVal = p->LoUnit;
243
2.71M
    p->LoUnit += numBytes;
244
2.71M
    return retVal;
245
2.71M
  }
246
191k
  return AllocUnitsRare(p, indx);
247
2.90M
}
248
249
1.43M
#define MyMem12Cpy(dest, src, num) do {         \
250
1.43M
  UInt32 *d = (UInt32 *)dest;         \
251
1.43M
  const UInt32 *z = (const UInt32 *)src;        \
252
1.43M
  UInt32 n = num;             \
253
2.54M
  do {               \
254
2.54M
    d[0] = z[0]; d[1] = z[1]; d[2] = z[2]; z += 3; d += 3;  \
255
2.54M
  } while (--n);              \
256
1.43M
} while (0)
257
258
static void *ShrinkUnits(CPpmd8 *p, void *oldPtr, unsigned oldNU, unsigned newNU)
259
11.3k
{
260
11.3k
  unsigned i0 = U2I(oldNU);
261
11.3k
  unsigned i1 = U2I(newNU);
262
11.3k
  if (i0 == i1)
263
1.78k
    return oldPtr;
264
9.60k
  if (p->FreeList[i1] != 0)
265
8.11k
  {
266
8.11k
    void *ptr = RemoveNode(p, i1);
267
8.11k
    MyMem12Cpy(ptr, oldPtr, newNU);
268
8.11k
    InsertNode(p, oldPtr, i0);
269
8.11k
    return ptr;
270
8.11k
  }
271
1.49k
  SplitBlock(p, oldPtr, i0, i1);
272
1.49k
  return oldPtr;
273
9.60k
}
274
275
static void FreeUnits(CPpmd8 *p, void *ptr, unsigned nu)
276
21.3k
{
277
21.3k
  InsertNode(p, ptr, U2I(nu));
278
21.3k
}
279
280
static void SpecialFreeUnit(CPpmd8 *p, void *ptr)
281
42.9k
{
282
42.9k
  if ((Byte *)ptr != p->UnitsStart)
283
42.9k
    InsertNode(p, ptr, 0);
284
10
  else
285
10
  {
286
    #ifdef PPMD8_FREEZE_SUPPORT
287
    *(UInt32 *)ptr = EMPTY_NODE; /* it's used for (Flags == 0xFF) check in RemoveBinContexts */
288
    #endif
289
10
    p->UnitsStart += UNIT_SIZE;
290
10
  }
291
42.9k
}
292
293
static void *MoveUnitsUp(CPpmd8 *p, void *oldPtr, unsigned nu)
294
31.3k
{
295
31.3k
  unsigned indx = U2I(nu);
296
31.3k
  void *ptr;
297
31.3k
  if ((Byte *)oldPtr > p->UnitsStart + 16 * 1024 || REF(oldPtr) > p->FreeList[indx])
298
30.6k
    return oldPtr;
299
674
  ptr = RemoveNode(p, indx);
300
674
  MyMem12Cpy(ptr, oldPtr, nu);
301
674
  if ((Byte*)oldPtr != p->UnitsStart)
302
674
    InsertNode(p, oldPtr, indx);
303
0
  else
304
0
    p->UnitsStart += U2B(I2U(indx));
305
674
  return ptr;
306
31.3k
}
307
308
static void ExpandTextArea(CPpmd8 *p)
309
2
{
310
2
  UInt32 count[PPMD_NUM_INDEXES];
311
2
  unsigned i;
312
2
  memset(count, 0, sizeof(count));
313
2
  if (p->LoUnit != p->HiUnit)
314
0
    ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
315
  
316
2
  {
317
2
    CPpmd8_Node *node = (CPpmd8_Node *)p->UnitsStart;
318
46
    for (; node->Stamp == EMPTY_NODE; node += node->NU)
319
44
    {
320
44
      node->Stamp = 0;
321
44
      count[U2I(node->NU)]++;
322
44
    }
323
2
    p->UnitsStart = (Byte *)node;
324
2
  }
325
  
326
78
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
327
76
  {
328
76
    CPpmd8_Node_Ref *next = (CPpmd8_Node_Ref *)&p->FreeList[i];
329
34.2k
    while (count[i] != 0)
330
34.2k
    {
331
34.2k
      CPpmd8_Node *node = NODE(*next);
332
34.2k
      while (node->Stamp == 0)
333
44
      {
334
44
        *next = node->Next;
335
44
        node = NODE(*next);
336
44
        p->Stamps[i]--;
337
44
        if (--count[i] == 0)
338
6
          break;
339
44
      }
340
34.2k
      next = &node->Next;
341
34.2k
    }
342
76
  }
343
2
}
344
345
20.6M
#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
20.0M
{
349
  #ifdef __clang_analyzer__
350
  assert(p);
351
  #endif
352
20.0M
  (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF);
353
20.0M
  (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF);
354
20.0M
}
355
356
1.53k
#define RESET_TEXT(offs) do {           \
357
1.53k
  p->Text = p->Base + p->AlignOffset + (offs);      \
358
1.53k
} while (0)
359
360
static void RestartModel(CPpmd8 *p)
361
1.47k
{
362
1.47k
  unsigned i, k, m, r;
363
364
1.47k
  memset(p->FreeList, 0, sizeof(p->FreeList));
365
1.47k
  memset(p->Stamps, 0, sizeof(p->Stamps));
366
1.47k
  RESET_TEXT(0);
367
1.47k
  p->HiUnit = p->Text + p->Size;
368
1.47k
  p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE;
369
1.47k
  p->GlueCount = 0;
370
371
1.47k
  p->OrderFall = p->MaxOrder;
372
1.47k
  p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1;
373
1.47k
  p->PrevSuccess = 0;
374
375
1.47k
  p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */
376
1.47k
  p->MinContext->Suffix = 0;
377
1.47k
  p->MinContext->NumStats = 255;
378
1.47k
  p->MinContext->Flags = 0;
379
1.47k
  p->MinContext->SummFreq = 256 + 1;
380
1.47k
  p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */
381
1.47k
  p->LoUnit += U2B(256 / 2);
382
1.47k
  p->MinContext->Stats = REF(p->FoundState);
383
378k
  for (i = 0; i < 256; i++)
384
377k
  {
385
377k
    CPpmd_State *s = &p->FoundState[i];
386
377k
    s->Symbol = (Byte)i;
387
377k
    s->Freq = 1;
388
377k
    SetSuccessor(s, 0);
389
377k
  }
390
391
38.3k
  for (i = m = 0; m < 25; m++)
392
36.8k
  {
393
353k
    while (p->NS2Indx[i] == m)
394
316k
      i++;
395
331k
    for (k = 0; k < 8; k++)
396
294k
    {
397
294k
      UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 1));
398
294k
      UInt16 *dest = p->BinSumm[m] + k;
399
2.65M
      for (r = 0; r < 64; r += 8)
400
2.35M
        dest[r] = val;
401
294k
    }
402
36.8k
  }
403
404
36.8k
  for (i = m = 0; m < 24; m++)
405
35.3k
  {
406
411k
    while (p->NS2Indx[i + 3] == m + 3)
407
375k
      i++;
408
1.16M
    for (k = 0; k < 32; k++)
409
1.13M
    {
410
1.13M
      CPpmd_See *s = &p->See[m][k];
411
1.13M
      s->Summ = (UInt16)((2 * i + 5) << (s->Shift = PPMD_PERIOD_BITS - 4));
412
1.13M
      s->Count = 7;
413
1.13M
    }
414
35.3k
  }
415
1.47k
}
416
417
static void Ppmd8_Init(CPpmd8 *p, unsigned maxOrder, unsigned restoreMethod)
418
1.41k
{
419
1.41k
  p->MaxOrder = maxOrder;
420
1.41k
  p->RestoreMethod = restoreMethod;
421
1.41k
  RestartModel(p);
422
1.41k
  p->DummySee.Shift = PPMD_PERIOD_BITS;
423
1.41k
  p->DummySee.Summ = 0; /* unused */
424
1.41k
  p->DummySee.Count = 64; /* unused */
425
1.41k
}
426
427
static void Refresh(CPpmd8 *p, CTX_PTR ctx, unsigned oldNU, unsigned scale)
428
5.62k
{
429
5.62k
  unsigned i = ctx->NumStats, escFreq, sumFreq, flags;
430
5.62k
  CPpmd_State *s = (CPpmd_State *)ShrinkUnits(p, STATS(ctx), oldNU, (i + 2) >> 1);
431
5.62k
  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
5.62k
  flags = (ctx->Flags & (0x10 + 0x04 * scale)) + 0x08 * (s->Symbol >= 0x40);
437
5.62k
  escFreq = ctx->SummFreq - s->Freq;
438
5.62k
  sumFreq = (s->Freq = (Byte)((s->Freq + scale) >> scale));
439
5.62k
  do
440
12.9k
  {
441
12.9k
    escFreq -= (++s)->Freq;
442
12.9k
    sumFreq += (s->Freq = (Byte)((s->Freq + scale) >> scale));
443
12.9k
    flags |= 0x08 * (s->Symbol >= 0x40);
444
12.9k
  }
445
12.9k
  while (--i);
446
5.62k
  ctx->SummFreq = (UInt16)(sumFreq + ((escFreq + scale) >> scale));
447
5.62k
  ctx->Flags = (Byte)flags;
448
5.62k
}
449
450
static void SwapStates(CPpmd_State *t1, CPpmd_State *t2)
451
1.52M
{
452
1.52M
  CPpmd_State tmp = *t1;
453
1.52M
  *t1 = *t2;
454
1.52M
  *t2 = tmp;
455
1.52M
}
456
457
static CPpmd_Void_Ref CutOff(CPpmd8 *p, CTX_PTR ctx, unsigned order)
458
123k
{
459
123k
  int i;
460
123k
  unsigned tmp;
461
123k
  CPpmd_State *s;
462
  
463
123k
  if (!ctx->NumStats)
464
91.8k
  {
465
91.8k
    s = ONE_STATE(ctx);
466
91.8k
    if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart)
467
91.8k
    {
468
91.8k
      if (order < p->MaxOrder)
469
82.7k
        SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
470
9.07k
      else
471
9.07k
        SetSuccessor(s, 0);
472
91.8k
      if (SUCCESSOR(s) || order <= 9) /* O_BOUND */
473
57.3k
        return REF(ctx);
474
91.8k
    }
475
34.4k
    SpecialFreeUnit(p, ctx);
476
34.4k
    return 0;
477
91.8k
  }
478
479
31.3k
  ctx->Stats = STATS_REF(MoveUnitsUp(p, STATS(ctx), tmp = ((unsigned)ctx->NumStats + 2) >> 1));
480
481
117k
  for (s = STATS(ctx) + (i = ctx->NumStats); s >= STATS(ctx); s--)
482
85.9k
    if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) < p->UnitsStart)
483
44.4k
    {
484
44.4k
      CPpmd_State *s2 = STATS(ctx) + (i--);
485
44.4k
      SetSuccessor(s, 0);
486
44.4k
      SwapStates(s, s2);
487
44.4k
    }
488
41.5k
    else if (order < p->MaxOrder)
489
40.3k
      SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
490
1.12k
    else
491
1.12k
      SetSuccessor(s, 0);
492
    
493
31.3k
  if (i != ctx->NumStats && order)
494
26.7k
  {
495
26.7k
    ctx->NumStats = (Byte)i;
496
26.7k
    s = STATS(ctx);
497
26.7k
    if (i < 0)
498
8.45k
    {
499
8.45k
      FreeUnits(p, s, tmp);
500
8.45k
      SpecialFreeUnit(p, ctx);
501
8.45k
      return 0;
502
8.45k
    }
503
18.2k
    if (i == 0)
504
12.8k
    {
505
12.8k
      ctx->Flags = (Byte)((ctx->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40));
506
12.8k
      *ONE_STATE(ctx) = *s;
507
12.8k
      FreeUnits(p, s, tmp);
508
      /* 9.31: the code was fixed. It's was not BUG, if Freq <= MAX_FREQ = 124 */
509
12.8k
      ONE_STATE(ctx)->Freq = (Byte)(((unsigned)ONE_STATE(ctx)->Freq + 11) >> 3);
510
12.8k
    }
511
5.41k
    else
512
5.41k
      Refresh(p, ctx, tmp, ctx->SummFreq > 16 * i);
513
18.2k
  }
514
22.8k
  return REF(ctx);
515
31.3k
}
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
4
{
551
4
  UInt32 v = 0;
552
4
  unsigned i;
553
156
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
554
152
    v += p->Stamps[i] * I2U(i);
555
4
  return p->Size - (UInt32)(p->HiUnit - p->LoUnit) - (UInt32)(p->UnitsStart - p->Text) - U2B(v);
556
4
}
557
558
#ifdef PPMD8_FREEZE_SUPPORT
559
  #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1, fSuccessor)
560
#else
561
64
  #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
64
{
570
64
  CTX_PTR c;
571
64
  CPpmd_State *s;
572
64
  RESET_TEXT(0);
573
336
  for (c = p->MaxContext; c != c1; c = SUFFIX(c))
574
272
    if (--(c->NumStats) == 0)
575
96
    {
576
96
      s = STATS(c);
577
96
      c->Flags = (Byte)((c->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40));
578
96
      *ONE_STATE(c) = *s;
579
96
      SpecialFreeUnit(p, s);
580
96
      ONE_STATE(c)->Freq = (Byte)(((unsigned)ONE_STATE(c)->Freq + 11) >> 3);
581
96
    }
582
176
    else
583
176
      Refresh(p, c, (c->NumStats+3) >> 1, 0);
584
 
585
238
  for (; c != p->MinContext; c = SUFFIX(c))
586
174
    if (!c->NumStats)
587
32
      ONE_STATE(c)->Freq = (Byte)(ONE_STATE(c)->Freq - (ONE_STATE(c)->Freq >> 1));
588
142
    else if ((c->SummFreq += 4) > 128 + 4 * c->NumStats)
589
34
      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
64
  if (p->RestoreMethod == PPMD8_RESTORE_METHOD_RESTART || GetUsedMemory(p) < (p->Size >> 1))
609
62
    RestartModel(p);
610
2
  else
611
2
  {
612
12
    while (p->MaxContext->Suffix)
613
10
      p->MaxContext = SUFFIX(p->MaxContext);
614
2
    do
615
2
    {
616
2
      CutOff(p, p->MaxContext, 0);
617
2
      ExpandTextArea(p);
618
2
    }
619
2
    while (GetUsedMemory(p) > 3 * (p->Size >> 2));
620
2
    p->GlueCount = 0;
621
2
    p->OrderFall = p->MaxOrder;
622
2
  }
623
64
}
624
625
static CTX_PTR CreateSuccessors(CPpmd8 *p, Bool skip, CPpmd_State *s1, CTX_PTR c)
626
2.82M
{
627
2.82M
  CPpmd_State upState;
628
2.82M
  Byte flags;
629
2.82M
  CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
630
  /* fixed over Shkarin's code. Maybe it could work without + 1 too. */
631
2.82M
  CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
632
2.82M
  unsigned numPs = 0;
633
634
#ifdef __clang_analyzer__
635
  memset(ps, 0, sizeof(ps));
636
#endif
637
638
  
639
2.82M
  if (!skip)
640
1.92M
    ps[numPs++] = p->FoundState;
641
  
642
11.5M
  while (c->Suffix)
643
11.4M
  {
644
11.4M
    CPpmd_Void_Ref successor;
645
11.4M
    CPpmd_State *s;
646
11.4M
    c = SUFFIX(c);
647
11.4M
    if (s1)
648
2.78M
    {
649
2.78M
      s = s1;
650
2.78M
      s1 = NULL;
651
2.78M
    }
652
8.67M
    else if (c->NumStats != 0)
653
2.70M
    {
654
20.2M
      for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++);
655
2.70M
      if (s->Freq < MAX_FREQ - 9)
656
2.69M
      {
657
2.69M
        s->Freq++;
658
2.69M
        c->SummFreq++;
659
2.69M
      }
660
2.70M
    }
661
5.96M
    else
662
5.96M
    {
663
5.96M
      s = ONE_STATE(c);
664
5.96M
      s->Freq = (Byte)(s->Freq + (!SUFFIX(c)->NumStats & (s->Freq < 24)));
665
5.96M
    }
666
11.4M
    successor = SUCCESSOR(s);
667
11.4M
    if (successor != upBranch)
668
2.76M
    {
669
2.76M
      c = CTX(successor);
670
2.76M
      if (numPs == 0)
671
107k
        return c;
672
2.66M
      break;
673
2.76M
    }
674
8.69M
    ps[numPs++] = s;
675
8.69M
  }
676
  
677
2.71M
  upState.Symbol = *(const Byte *)Ppmd8_GetPtr(p, upBranch);
678
2.71M
  SetSuccessor(&upState, upBranch + 1);
679
2.71M
  flags = (Byte)(0x10 * (p->FoundState->Symbol >= 0x40) + 0x08 * (upState.Symbol >= 0x40));
680
681
2.71M
  if (c->NumStats == 0)
682
1.15M
    upState.Freq = ONE_STATE(c)->Freq;
683
1.55M
  else
684
1.55M
  {
685
1.55M
    UInt32 cf, s0;
686
1.55M
    CPpmd_State *s;
687
9.61M
    for (s = STATS(c); s->Symbol != upState.Symbol; s++);
688
1.55M
    cf = s->Freq - 1;
689
1.55M
    s0 = c->SummFreq - c->NumStats - cf;
690
1.55M
    upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((cf + 2 * s0 - 3) / s0)));
691
1.55M
  }
692
693
13.3M
  while (numPs != 0)
694
10.6M
  {
695
    /* Create Child */
696
10.6M
    CTX_PTR c1; /* = AllocContext(p); */
697
10.6M
    if (p->HiUnit != p->LoUnit)
698
10.0M
      c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE);
699
608k
    else if (p->FreeList[0] != 0)
700
50.2k
      c1 = (CTX_PTR)RemoveNode(p, 0);
701
557k
    else
702
557k
    {
703
557k
      c1 = (CTX_PTR)AllocUnitsRare(p, 0);
704
557k
      if (!c1)
705
12
        return NULL;
706
557k
    }
707
10.6M
    c1->NumStats = 0;
708
10.6M
    c1->Flags = flags;
709
10.6M
    *ONE_STATE(c1) = upState;
710
10.6M
    c1->Suffix = REF(c);
711
10.6M
    SetSuccessor(ps[--numPs], REF(c1));
712
10.6M
    c = c1;
713
10.6M
  }
714
715
2.71M
  return c;
716
2.71M
}
717
718
static CTX_PTR ReduceOrder(CPpmd8 *p, CPpmd_State *s1, CTX_PTR c)
719
71.2k
{
720
71.2k
  CPpmd_State *s = NULL;
721
71.2k
  CTX_PTR c1 = c;
722
71.2k
  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
71.2k
  SetSuccessor(p->FoundState, upBranch);
732
71.2k
  p->OrderFall++;
733
734
71.2k
  for (;;)
735
71.2k
  {
736
71.2k
    if (s1)
737
40
    {
738
40
      c = SUFFIX(c);
739
40
      s = s1;
740
40
      s1 = NULL;
741
40
    }
742
71.2k
    else
743
71.2k
    {
744
71.2k
      if (!c->Suffix)
745
71.2k
      {
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
71.2k
        return c;
755
71.2k
      }
756
10
      c = SUFFIX(c);
757
10
      if (c->NumStats)
758
8
      {
759
8
        if ((s = STATS(c))->Symbol != p->FoundState->Symbol)
760
112
          do { s++; } while (s->Symbol != p->FoundState->Symbol);
761
8
        if (s->Freq < MAX_FREQ - 9)
762
8
        {
763
8
          s->Freq += 2;
764
8
          c->SummFreq += 2;
765
8
        }
766
8
      }
767
2
      else
768
2
      {
769
2
        s = ONE_STATE(c);
770
2
        s->Freq = (Byte)(s->Freq + (s->Freq < 32));
771
2
      }
772
10
    }
773
50
    if (SUCCESSOR(s))
774
40
      break;
775
    #ifdef PPMD8_FREEZE_SUPPORT
776
    ps[numPs++] = s;
777
    #endif
778
10
    SetSuccessor(s, upBranch);
779
10
    p->OrderFall++;
780
10
  }
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
40
  if (SUCCESSOR(s) <= upBranch)
794
0
  {
795
0
    CTX_PTR successor;
796
0
    CPpmd_State *s2 = p->FoundState;
797
0
    p->FoundState = s;
798
799
0
    successor = CreateSuccessors(p, False, NULL, c);
800
0
    if (successor == NULL)
801
0
      SetSuccessor(s, 0);
802
0
    else
803
0
      SetSuccessor(s, REF(successor));
804
0
    p->FoundState = s2;
805
0
  }
806
  
807
40
  if (p->OrderFall == 1 && c1 == p->MaxContext)
808
2
  {
809
2
    SetSuccessor(p->FoundState, SUCCESSOR(s));
810
2
    p->Text--;
811
2
  }
812
40
  if (SUCCESSOR(s) == 0)
813
0
    return NULL;
814
40
  return CTX(SUCCESSOR(s));
815
40
}
816
817
static void UpdateModel(CPpmd8 *p)
818
6.20M
{
819
6.20M
  CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
820
6.20M
  CTX_PTR c;
821
6.20M
  unsigned s0, ns, fFreq = p->FoundState->Freq;
822
6.20M
  Byte flag, fSymbol = p->FoundState->Symbol;
823
6.20M
  CPpmd_State *s = NULL;
824
  
825
6.20M
  if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
826
5.29M
  {
827
5.29M
    c = SUFFIX(p->MinContext);
828
    
829
5.29M
    if (c->NumStats == 0)
830
2.70M
    {
831
2.70M
      s = ONE_STATE(c);
832
2.70M
      if (s->Freq < 32)
833
2.70M
        s->Freq++;
834
2.70M
    }
835
2.59M
    else
836
2.59M
    {
837
2.59M
      s = STATS(c);
838
2.59M
      if (s->Symbol != p->FoundState->Symbol)
839
1.75M
      {
840
34.1M
        do { s++; } while (s->Symbol != p->FoundState->Symbol);
841
1.75M
        if (s[0].Freq >= s[-1].Freq)
842
817k
        {
843
817k
          SwapStates(&s[0], &s[-1]);
844
817k
          s--;
845
817k
        }
846
1.75M
      }
847
2.59M
      if (s->Freq < MAX_FREQ - 9)
848
2.55M
      {
849
2.55M
        s->Freq += 2;
850
2.55M
        c->SummFreq += 2;
851
2.55M
      }
852
2.59M
    }
853
5.29M
  }
854
  
855
6.20M
  c = p->MaxContext;
856
6.20M
  if (p->OrderFall == 0 && fSuccessor)
857
896k
  {
858
896k
    CTX_PTR cs = CreateSuccessors(p, True, s, p->MinContext);
859
896k
    if (cs == 0)
860
6
    {
861
6
      SetSuccessor(p->FoundState, 0);
862
6
      RESTORE_MODEL(c, CTX(fSuccessor));
863
6
    }
864
896k
    else
865
896k
    {
866
896k
      SetSuccessor(p->FoundState, REF(cs));
867
896k
      p->MaxContext = cs;
868
896k
    }
869
896k
    return;
870
896k
  }
871
  
872
5.30M
  *p->Text++ = p->FoundState->Symbol;
873
5.30M
  successor = REF(p->Text);
874
5.30M
  if (p->Text >= p->UnitsStart)
875
2
  {
876
2
    RESTORE_MODEL(c, CTX(fSuccessor)); /* check it */
877
2
    return;
878
2
  }
879
  
880
5.30M
  if (!fSuccessor)
881
71.2k
  {
882
71.2k
    CTX_PTR cs = ReduceOrder(p, s, p->MinContext);
883
71.2k
    if (cs == NULL)
884
0
    {
885
0
      RESTORE_MODEL(c, 0);
886
0
      return;
887
0
    }
888
71.2k
    fSuccessor = REF(cs);
889
71.2k
  }
890
5.23M
  else if ((Byte *)Ppmd8_GetPtr(p, fSuccessor) < p->UnitsStart)
891
1.92M
  {
892
1.92M
    CTX_PTR cs = CreateSuccessors(p, False, s, p->MinContext);
893
1.92M
    if (cs == NULL)
894
6
    {
895
6
      RESTORE_MODEL(c, 0);
896
6
      return;
897
6
    }
898
1.92M
    fSuccessor = REF(cs);
899
1.92M
  }
900
  
901
5.30M
  if (--p->OrderFall == 0)
902
458k
  {
903
458k
    successor = fSuccessor;
904
458k
    p->Text -= (p->MaxContext != p->MinContext);
905
458k
  }
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
5.30M
  s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - fFreq;
916
5.30M
  flag = (Byte)(0x08 * (fSymbol >= 0x40));
917
  
918
10.5M
  for (; c != p->MinContext; c = SUFFIX(c))
919
5.23M
  {
920
5.23M
    unsigned ns1;
921
5.23M
    UInt32 cf, sf;
922
5.23M
    if ((ns1 = c->NumStats) != 0)
923
2.37M
    {
924
2.37M
      if ((ns1 & 1) != 0)
925
1.51M
      {
926
        /* Expand for one UNIT */
927
1.51M
        unsigned oldNU = (ns1 + 1) >> 1;
928
1.51M
        unsigned i = U2I(oldNU);
929
1.51M
        if (i != U2I(oldNU + 1))
930
1.42M
        {
931
1.42M
          void *ptr = AllocUnits(p, i + 1);
932
1.42M
          void *oldPtr;
933
1.42M
          if (!ptr)
934
42
          {
935
42
            RESTORE_MODEL(c, CTX(fSuccessor));
936
42
            return;
937
42
          }
938
1.42M
          oldPtr = STATS(c);
939
1.42M
          MyMem12Cpy(ptr, oldPtr, oldNU);
940
1.42M
          InsertNode(p, oldPtr, i);
941
1.42M
          c->Stats = STATS_REF(ptr);
942
1.42M
        }
943
1.51M
      }
944
2.37M
      c->SummFreq = (UInt16)(c->SummFreq + (3 * ns1 + 1 < ns));
945
2.37M
    }
946
2.85M
    else
947
2.85M
    {
948
2.85M
      CPpmd_State *s2 = (CPpmd_State*)AllocUnits(p, 0);
949
2.85M
      if (!s2)
950
8
      {
951
8
        RESTORE_MODEL(c, CTX(fSuccessor));
952
8
        return;
953
8
      }
954
2.85M
      *s2 = *ONE_STATE(c);
955
2.85M
      c->Stats = REF(s2);
956
2.85M
      if (s2->Freq < MAX_FREQ / 4 - 1)
957
2.85M
        s2->Freq <<= 1;
958
2.09k
      else
959
2.09k
        s2->Freq = MAX_FREQ - 4;
960
2.85M
      c->SummFreq = (UInt16)(s2->Freq + p->InitEsc + (ns > 2));
961
2.85M
    }
962
5.23M
    cf = 2 * fFreq * (c->SummFreq + 6);
963
5.23M
    sf = (UInt32)s0 + c->SummFreq;
964
5.23M
    if (cf < 6 * sf)
965
3.08M
    {
966
3.08M
      cf = 1 + (cf > sf) + (cf >= 4 * sf);
967
3.08M
      c->SummFreq += 4;
968
3.08M
    }
969
2.14M
    else
970
2.14M
    {
971
2.14M
      cf = 4 + (cf > 9 * sf) + (cf > 12 * sf) + (cf > 15 * sf);
972
2.14M
      c->SummFreq = (UInt16)(c->SummFreq + cf);
973
2.14M
    }
974
5.23M
    {
975
5.23M
      CPpmd_State *s2 = STATS(c) + ns1 + 1;
976
5.23M
      SetSuccessor(s2, successor);
977
5.23M
      s2->Symbol = fSymbol;
978
5.23M
      s2->Freq = (Byte)cf;
979
5.23M
      c->Flags |= flag;
980
5.23M
      c->NumStats = (Byte)(ns1 + 1);
981
5.23M
    }
982
5.23M
  }
983
5.30M
  p->MaxContext = p->MinContext = CTX(fSuccessor);
984
5.30M
}
985
  
986
static void Rescale(CPpmd8 *p)
987
25.0k
{
988
25.0k
  unsigned i, adder, sumFreq, escFreq;
989
25.0k
  CPpmd_State *stats = STATS(p->MinContext);
990
25.0k
  CPpmd_State *s = p->FoundState;
991
25.0k
  {
992
25.0k
    CPpmd_State tmp = *s;
993
71.3k
    for (; s != stats; s--)
994
46.2k
      s[0] = s[-1];
995
25.0k
    *s = tmp;
996
25.0k
  }
997
25.0k
  escFreq = p->MinContext->SummFreq - s->Freq;
998
25.0k
  s->Freq += 4;
999
25.0k
  adder = (p->OrderFall != 0
1000
      #ifdef PPMD8_FREEZE_SUPPORT
1001
      || p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE
1002
      #endif
1003
25.0k
      );
1004
25.0k
  s->Freq = (Byte)((s->Freq + adder) >> 1);
1005
25.0k
  sumFreq = s->Freq;
1006
  
1007
25.0k
  i = p->MinContext->NumStats;
1008
25.0k
  do
1009
521k
  {
1010
521k
    escFreq -= (++s)->Freq;
1011
521k
    s->Freq = (Byte)((s->Freq + adder) >> 1);
1012
521k
    sumFreq += s->Freq;
1013
521k
    if (s[0].Freq > s[-1].Freq)
1014
181k
    {
1015
181k
      CPpmd_State *s1 = s;
1016
181k
      CPpmd_State tmp = *s1;
1017
181k
      do
1018
5.74M
        s1[0] = s1[-1];
1019
5.74M
      while (--s1 != stats && tmp.Freq > s1[-1].Freq);
1020
181k
      *s1 = tmp;
1021
181k
    }
1022
521k
  }
1023
521k
  while (--i);
1024
  
1025
25.0k
  if (s->Freq == 0)
1026
8.73k
  {
1027
8.73k
    unsigned numStats = p->MinContext->NumStats;
1028
8.73k
    unsigned n0, n1;
1029
16.8k
    do { i++; } while ((--s)->Freq == 0);
1030
8.73k
    escFreq += i;
1031
8.73k
    p->MinContext->NumStats = (Byte)(p->MinContext->NumStats - i);
1032
8.73k
    if (p->MinContext->NumStats == 0)
1033
1.29k
    {
1034
1.29k
      CPpmd_State tmp = *stats;
1035
1.29k
      tmp.Freq = (Byte)((2 * tmp.Freq + escFreq - 1) / escFreq);
1036
1.29k
      if (tmp.Freq > MAX_FREQ / 3)
1037
1.05k
        tmp.Freq = MAX_FREQ / 3;
1038
1.29k
      InsertNode(p, stats, U2I((numStats + 2) >> 1));
1039
1.29k
      p->MinContext->Flags = (Byte)((p->MinContext->Flags & 0x10) + 0x08 * (tmp.Symbol >= 0x40));
1040
1.29k
      *(p->FoundState = ONE_STATE(p->MinContext)) = tmp;
1041
1.29k
      return;
1042
1.29k
    }
1043
7.44k
    n0 = (numStats + 2) >> 1;
1044
7.44k
    n1 = (p->MinContext->NumStats + 2) >> 1;
1045
7.44k
    if (n0 != n1)
1046
5.77k
      p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
1047
7.44k
    p->MinContext->Flags &= ~0x08;
1048
7.44k
    p->MinContext->Flags |= 0x08 * ((s = STATS(p->MinContext))->Symbol >= 0x40);
1049
7.44k
    i = p->MinContext->NumStats;
1050
57.6k
    do { p->MinContext->Flags |= 0x08*((++s)->Symbol >= 0x40); } while (--i);
1051
7.44k
  }
1052
23.7k
  p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1));
1053
23.7k
  p->MinContext->Flags |= 0x4;
1054
23.7k
  p->FoundState = STATS(p->MinContext);
1055
23.7k
}
1056
1057
static CPpmd_See *Ppmd8_MakeEscFreq(CPpmd8 *p, unsigned numMasked1, UInt32 *escFreq)
1058
2.37M
{
1059
2.37M
  CPpmd_See *see;
1060
2.37M
  if (p->MinContext->NumStats != 0xFF)
1061
1.93M
  {
1062
1.93M
    see = p->See[(unsigned)p->NS2Indx[(unsigned)p->MinContext->NumStats + 2] - 3] +
1063
1.93M
        (p->MinContext->SummFreq > 11 * ((unsigned)p->MinContext->NumStats + 1)) +
1064
1.93M
        2 * (unsigned)(2 * (unsigned)p->MinContext->NumStats <
1065
1.93M
        ((unsigned)SUFFIX(p->MinContext)->NumStats + numMasked1)) +
1066
1.93M
        p->MinContext->Flags;
1067
1.93M
    {
1068
1.93M
      unsigned r = (see->Summ >> see->Shift);
1069
1.93M
      see->Summ = (UInt16)(see->Summ - r);
1070
1.93M
      *escFreq = r + (r == 0);
1071
1.93M
    }
1072
1.93M
  }
1073
447k
  else
1074
447k
  {
1075
447k
    see = &p->DummySee;
1076
447k
    *escFreq = 1;
1077
447k
  }
1078
2.37M
  return see;
1079
2.37M
}
1080
1081
static void NextContext(CPpmd8 *p)
1082
57.8M
{
1083
57.8M
  CTX_PTR c = CTX(SUCCESSOR(p->FoundState));
1084
57.8M
  if (p->OrderFall == 0 && (Byte *)c >= p->UnitsStart)
1085
53.3M
    p->MinContext = p->MaxContext = c;
1086
4.50M
  else
1087
4.50M
  {
1088
4.50M
    UpdateModel(p);
1089
4.50M
    p->MinContext = p->MaxContext;
1090
4.50M
  }
1091
57.8M
}
1092
1093
static void Ppmd8_Update1(CPpmd8 *p)
1094
1.08M
{
1095
1.08M
  CPpmd_State *s = p->FoundState;
1096
1.08M
  s->Freq += 4;
1097
1.08M
  p->MinContext->SummFreq += 4;
1098
1.08M
  if (s[0].Freq > s[-1].Freq)
1099
667k
  {
1100
667k
    SwapStates(&s[0], &s[-1]);
1101
667k
    p->FoundState = --s;
1102
667k
    if (s->Freq > MAX_FREQ)
1103
162
      Rescale(p);
1104
667k
  }
1105
1.08M
  NextContext(p);
1106
1.08M
}
1107
1108
static void Ppmd8_Update1_0(CPpmd8 *p)
1109
1.12M
{
1110
1.12M
  p->PrevSuccess = (2 * p->FoundState->Freq >= p->MinContext->SummFreq);
1111
1.12M
  p->RunLength += p->PrevSuccess;
1112
1.12M
  p->MinContext->SummFreq += 4;
1113
1.12M
  if ((p->FoundState->Freq += 4) > MAX_FREQ)
1114
22.1k
    Rescale(p);
1115
1.12M
  NextContext(p);
1116
1.12M
}
1117
1118
static void Ppmd8_UpdateBin(CPpmd8 *p)
1119
55.6M
{
1120
55.6M
  p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 196));
1121
55.6M
  p->PrevSuccess = 1;
1122
55.6M
  p->RunLength++;
1123
55.6M
  NextContext(p);
1124
55.6M
}
1125
1126
static void Ppmd8_Update2(CPpmd8 *p)
1127
1.69M
{
1128
1.69M
  p->MinContext->SummFreq += 4;
1129
1.69M
  if ((p->FoundState->Freq += 4) > MAX_FREQ)
1130
2.80k
    Rescale(p);
1131
1.69M
  p->RunLength = p->InitRL;
1132
1.69M
  UpdateModel(p);
1133
1.69M
  p->MinContext = p->MaxContext;
1134
1.69M
}
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
static Bool Ppmd8_RangeDec_Init(CPpmd8 *p)
1143
1.41k
{
1144
1.41k
  unsigned i;
1145
1.41k
  p->Low = 0;
1146
1.41k
  p->Range = 0xFFFFFFFF;
1147
1.41k
  p->Code = 0;
1148
7.07k
  for (i = 0; i < 4; i++)
1149
5.65k
    p->Code = (p->Code << 8) | p->Stream.In->Read(p->Stream.In);
1150
1.41k
  return (p->Code < 0xFFFFFFFF);
1151
1.41k
}
1152
1153
static UInt32 RangeDec_GetThreshold(CPpmd8 *p, UInt32 total)
1154
5.39M
{
1155
5.39M
  return p->Code / (p->Range /= total);
1156
5.39M
}
1157
1158
static void RangeDec_Decode(CPpmd8 *p, UInt32 start, UInt32 size)
1159
61.9M
{
1160
61.9M
  start *= p->Range;
1161
61.9M
  p->Low += start;
1162
61.9M
  p->Code -= start;
1163
61.9M
  p->Range *= size;
1164
1165
63.9M
  while ((p->Low ^ (p->Low + p->Range)) < kTop ||
1166
61.9M
      (p->Range < kBot && ((p->Range = (0 - p->Low) & (kBot - 1)), 1)))
1167
2.00M
  {
1168
2.00M
    p->Code = (p->Code << 8) | p->Stream.In->Read(p->Stream.In);
1169
2.00M
    p->Range <<= 8;
1170
2.00M
    p->Low <<= 8;
1171
2.00M
  }
1172
61.9M
}
1173
1174
146M
#define MASK(sym) ((signed char *)charMask)[sym]
1175
1176
static int Ppmd8_DecodeSymbol(CPpmd8 *p)
1177
59.5M
{
1178
59.5M
  size_t charMask[256 / sizeof(size_t)];
1179
59.5M
  if (p->MinContext->NumStats != 0)
1180
3.01M
  {
1181
3.01M
    CPpmd_State *s = Ppmd8_GetStats(p, p->MinContext);
1182
3.01M
    unsigned i;
1183
3.01M
    UInt32 count, hiCnt;
1184
3.01M
    if ((count = RangeDec_GetThreshold(p, p->MinContext->SummFreq)) < (hiCnt = s->Freq))
1185
1.12M
    {
1186
1.12M
      Byte symbol;
1187
1.12M
      RangeDec_Decode(p, 0, s->Freq);
1188
1.12M
      p->FoundState = s;
1189
1.12M
      symbol = s->Symbol;
1190
1.12M
      Ppmd8_Update1_0(p);
1191
1.12M
      return symbol;
1192
1.12M
    }
1193
1.89M
    p->PrevSuccess = 0;
1194
1.89M
    i = p->MinContext->NumStats;
1195
1.89M
    do
1196
14.6M
    {
1197
14.6M
      if ((hiCnt += (++s)->Freq) > count)
1198
1.08M
      {
1199
1.08M
        Byte symbol;
1200
1.08M
        RangeDec_Decode(p, hiCnt - s->Freq, s->Freq);
1201
1.08M
        p->FoundState = s;
1202
1.08M
        symbol = s->Symbol;
1203
1.08M
        Ppmd8_Update1(p);
1204
1.08M
        return symbol;
1205
1.08M
      }
1206
14.6M
    }
1207
13.5M
    while (--i);
1208
804k
    if (count >= p->MinContext->SummFreq)
1209
176
      return -2;
1210
804k
    RangeDec_Decode(p, hiCnt, p->MinContext->SummFreq - hiCnt);
1211
804k
    PPMD_SetAllBitsIn256Bytes(charMask);
1212
804k
    MASK(s->Symbol) = 0;
1213
804k
    i = p->MinContext->NumStats;
1214
3.66M
    do { MASK((--s)->Symbol) = 0; } while (--i);
1215
804k
  }
1216
56.5M
  else
1217
56.5M
  {
1218
56.5M
    UInt16 *prob = Ppmd8_GetBinSumm(p);
1219
56.5M
    if (((p->Code / (p->Range >>= 14)) < *prob))
1220
55.6M
    {
1221
55.6M
      Byte symbol;
1222
55.6M
      RangeDec_Decode(p, 0, *prob);
1223
55.6M
      *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
1224
55.6M
      symbol = (p->FoundState = Ppmd8Context_OneState(p->MinContext))->Symbol;
1225
55.6M
      Ppmd8_UpdateBin(p);
1226
55.6M
      return symbol;
1227
55.6M
    }
1228
894k
    RangeDec_Decode(p, *prob, (1 << 14) - *prob);
1229
894k
    *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
1230
894k
    p->InitEsc = PPMD8_kExpEscape[*prob >> 10];
1231
894k
    PPMD_SetAllBitsIn256Bytes(charMask);
1232
894k
    MASK(Ppmd8Context_OneState(p->MinContext)->Symbol) = 0;
1233
894k
    p->PrevSuccess = 0;
1234
894k
  }
1235
1.69M
  for (;;)
1236
2.37M
  {
1237
2.37M
    CPpmd_State *ps[256], *s;
1238
2.37M
    UInt32 freqSum, count, hiCnt;
1239
2.37M
    CPpmd_See *see;
1240
2.37M
    unsigned i, num, numMasked = p->MinContext->NumStats;
1241
2.37M
    do
1242
5.23M
    {
1243
5.23M
      p->OrderFall++;
1244
5.23M
      if (!p->MinContext->Suffix)
1245
402
        return -1;
1246
5.23M
      p->MinContext = Ppmd8_GetContext(p, p->MinContext->Suffix);
1247
5.23M
    }
1248
5.23M
    while (p->MinContext->NumStats == numMasked);
1249
2.37M
    hiCnt = 0;
1250
2.37M
    s = Ppmd8_GetStats(p, p->MinContext);
1251
2.37M
    i = 0;
1252
2.37M
    num = p->MinContext->NumStats - numMasked;
1253
2.37M
    do
1254
137M
    {
1255
137M
      int k = (int)(MASK(s->Symbol));
1256
137M
      hiCnt += (s->Freq & k);
1257
137M
      ps[i] = s++;
1258
137M
      i -= k;
1259
137M
    }
1260
137M
    while (i != num);
1261
    
1262
2.37M
    see = Ppmd8_MakeEscFreq(p, numMasked, &freqSum);
1263
2.37M
    freqSum += hiCnt;
1264
2.37M
    count = RangeDec_GetThreshold(p, freqSum);
1265
    
1266
2.37M
    if (count < hiCnt)
1267
1.69M
    {
1268
1.69M
      Byte symbol;
1269
1.69M
      CPpmd_State **pps = ps;
1270
37.8M
      for (hiCnt = 0; (hiCnt += (*pps)->Freq) <= count; pps++);
1271
1.69M
      s = *pps;
1272
1.69M
      RangeDec_Decode(p, hiCnt - s->Freq, s->Freq);
1273
1.69M
      Ppmd_See_Update(see);
1274
1.69M
      p->FoundState = s;
1275
1.69M
      symbol = s->Symbol;
1276
1.69M
      Ppmd8_Update2(p);
1277
1.69M
      return symbol;
1278
1.69M
    }
1279
681k
    if (count >= freqSum)
1280
262
      return -2;
1281
681k
    RangeDec_Decode(p, hiCnt, freqSum - hiCnt);
1282
681k
    see->Summ = (UInt16)(see->Summ + freqSum);
1283
3.33M
    do { MASK(ps[--i]->Symbol) = 0; } while (i != 0);
1284
681k
  }
1285
1.69M
}
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
};