Coverage Report

Created: 2025-08-29 06:07

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