Coverage Report

Created: 2025-11-24 06:24

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/lzma-fuzz/sdk/C/Ppmd7.c
Line
Count
Source
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
23.2M
#define MAX_FREQ 124
15
4.58M
#define UNIT_SIZE 12
16
17
3.12M
#define U2B(nu) ((UInt32)(nu) * UNIT_SIZE)
18
777k
#define U2I(nu) (p->Units2Indx[(size_t)(nu) - 1])
19
4.54M
#define I2U(indx) (p->Indx2Units[indx])
20
21
#ifdef PPMD_32BIT
22
  #define REF(ptr) (ptr)
23
#else
24
29.1M
  #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
25
#endif
26
27
339k
#define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr))
28
29
32.2M
#define CTX(ref) ((CPpmd7_Context *)Ppmd7_GetContext(p, ref))
30
4.51M
#define STATS(ctx) Ppmd7_GetStats(p, ctx)
31
4.67M
#define ONE_STATE(ctx) Ppmd7Context_OneState(ctx)
32
4.15M
#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
743k
  #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs)))
58
#endif
59
60
void Ppmd7_Construct(CPpmd7 *p)
61
3.51k
{
62
3.51k
  unsigned i, k, m;
63
64
3.51k
  p->Base = 0;
65
66
136k
  for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++)
67
133k
  {
68
133k
    unsigned step = (i >= 12 ? 4 : (i >> 2) + 1);
69
449k
    do { p->Units2Indx[k++] = (Byte)i; } while (--step);
70
133k
    p->Indx2Units[i] = (Byte)k;
71
133k
  }
72
73
3.51k
  p->NS2BSIndx[0] = (0 << 1);
74
3.51k
  p->NS2BSIndx[1] = (1 << 1);
75
3.51k
  memset(p->NS2BSIndx + 2, (2 << 1), 9);
76
3.51k
  memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11);
77
78
14.0k
  for (i = 0; i < 3; i++)
79
10.5k
    p->NS2Indx[i] = (Byte)i;
80
891k
  for (m = i, k = 1; i < 256; i++)
81
888k
  {
82
888k
    p->NS2Indx[i] = (Byte)m;
83
888k
    if (--k == 0)
84
77.2k
      k = (++m) - 2;
85
888k
  }
86
87
3.51k
  memset(p->HB2Flag, 0, 0x40);
88
3.51k
  memset(p->HB2Flag + 0x40, 8, 0x100 - 0x40);
89
3.51k
}
90
91
void Ppmd7_Free(CPpmd7 *p, ISzAllocPtr alloc)
92
7.02k
{
93
7.02k
  ISzAlloc_Free(alloc, p->Base);
94
7.02k
  p->Size = 0;
95
7.02k
  p->Base = 0;
96
7.02k
}
97
98
BoolInt Ppmd7_Alloc(CPpmd7 *p, UInt32 size, ISzAllocPtr alloc)
99
3.51k
{
100
3.51k
  if (!p->Base || p->Size != size)
101
3.51k
  {
102
3.51k
    size_t size2;
103
3.51k
    Ppmd7_Free(p, alloc);
104
3.51k
    size2 = 0
105
3.51k
      #ifndef PPMD_32BIT
106
3.51k
      + UNIT_SIZE
107
3.51k
      #endif
108
3.51k
      ;
109
3.51k
    p->AlignOffset =
110
      #ifdef PPMD_32BIT
111
        (4 - size) & 3;
112
      #else
113
3.51k
        4 - (size & 3);
114
3.51k
      #endif
115
3.51k
    if ((p->Base = (Byte *)ISzAlloc_Alloc(alloc, p->AlignOffset + size + size2)) == 0)
116
0
      return False;
117
3.51k
    p->Size = size;
118
3.51k
  }
119
3.51k
  return True;
120
3.51k
}
121
122
static void InsertNode(CPpmd7 *p, void *node, unsigned indx)
123
476k
{
124
476k
  *((CPpmd_Void_Ref *)node) = p->FreeList[indx];
125
476k
  p->FreeList[indx] = REF(node);
126
476k
}
127
128
static void *RemoveNode(CPpmd7 *p, unsigned indx)
129
331k
{
130
331k
  CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]);
131
331k
  p->FreeList[indx] = *node;
132
331k
  return node;
133
331k
}
134
135
static void SplitBlock(CPpmd7 *p, void *ptr, unsigned oldIndx, unsigned newIndx)
136
77.0k
{
137
77.0k
  unsigned i, nu = I2U(oldIndx) - I2U(newIndx);
138
77.0k
  ptr = (Byte *)ptr + U2B(I2U(newIndx));
139
77.0k
  if (I2U(i = U2I(nu)) != nu)
140
2.73k
  {
141
2.73k
    unsigned k = I2U(--i);
142
2.73k
    InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
143
2.73k
  }
144
77.0k
  InsertNode(p, ptr, i);
145
77.0k
}
146
147
static void GlueFreeBlocks(CPpmd7 *p)
148
112k
{
149
  #ifdef PPMD_32BIT
150
  CPpmd7_Node headItem;
151
  CPpmd7_Node_Ref head = &headItem;
152
  #else
153
112k
  CPpmd7_Node_Ref head = p->AlignOffset + p->Size;
154
112k
  #endif
155
  
156
112k
  CPpmd7_Node_Ref n = head;
157
112k
  unsigned i;
158
159
112k
  p->GlueCount = 255;
160
161
  /* create doubly-linked list of free blocks */
162
4.38M
  for (i = 0; i < PPMD_NUM_INDEXES; i++)
163
4.27M
  {
164
4.27M
    UInt16 nu = I2U(i);
165
4.27M
    CPpmd7_Node_Ref next = (CPpmd7_Node_Ref)p->FreeList[i];
166
4.27M
    p->FreeList[i] = 0;
167
4.32M
    while (next != 0)
168
53.7k
    {
169
53.7k
      CPpmd7_Node *node = NODE(next);
170
53.7k
      node->Next = n;
171
53.7k
      n = NODE(n)->Prev = next;
172
53.7k
      next = *(const CPpmd7_Node_Ref *)node;
173
53.7k
      node->Stamp = 0;
174
53.7k
      node->NU = (UInt16)nu;
175
53.7k
    }
176
4.27M
  }
177
112k
  NODE(head)->Stamp = 1;
178
112k
  NODE(head)->Next = n;
179
112k
  NODE(n)->Prev = head;
180
112k
  if (p->LoUnit != p->HiUnit)
181
10.6k
    ((CPpmd7_Node *)p->LoUnit)->Stamp = 1;
182
  
183
  /* Glue free blocks */
184
157k
  while (n != head)
185
45.2k
  {
186
45.2k
    CPpmd7_Node *node = NODE(n);
187
45.2k
    UInt32 nu = (UInt32)node->NU;
188
45.2k
    for (;;)
189
66.5k
    {
190
66.5k
      CPpmd7_Node *node2 = NODE(n) + nu;
191
66.5k
      nu += node2->NU;
192
66.5k
      if (node2->Stamp != 0 || nu >= 0x10000)
193
45.2k
        break;
194
21.3k
      NODE(node2->Prev)->Next = node2->Next;
195
21.3k
      NODE(node2->Next)->Prev = node2->Prev;
196
21.3k
      node->NU = (UInt16)nu;
197
21.3k
    }
198
45.2k
    n = node->Next;
199
45.2k
  }
200
  
201
  /* Fill lists of free blocks */
202
144k
  for (n = NODE(head)->Next; n != head;)
203
32.3k
  {
204
32.3k
    CPpmd7_Node *node = NODE(n);
205
32.3k
    unsigned nu;
206
32.3k
    CPpmd7_Node_Ref next = node->Next;
207
32.3k
    for (nu = node->NU; nu > 128; nu -= 128, node += 128)
208
0
      InsertNode(p, node, PPMD_NUM_INDEXES - 1);
209
32.3k
    if (I2U(i = U2I(nu)) != nu)
210
3.74k
    {
211
3.74k
      unsigned k = I2U(--i);
212
3.74k
      InsertNode(p, node + k, nu - k - 1);
213
3.74k
    }
214
32.3k
    InsertNode(p, node, i);
215
32.3k
    n = next;
216
32.3k
  }
217
112k
}
218
219
static void *AllocUnitsRare(CPpmd7 *p, unsigned indx)
220
1.48M
{
221
1.48M
  unsigned i;
222
1.48M
  void *retVal;
223
1.48M
  if (p->GlueCount == 0)
224
112k
  {
225
112k
    GlueFreeBlocks(p);
226
112k
    if (p->FreeList[indx] != 0)
227
6.18k
      return RemoveNode(p, indx);
228
112k
  }
229
1.47M
  i = indx;
230
1.47M
  do
231
52.9M
  {
232
52.9M
    if (++i == PPMD_NUM_INDEXES)
233
1.39M
    {
234
1.39M
      UInt32 numBytes = U2B(I2U(indx));
235
1.39M
      p->GlueCount--;
236
1.39M
      return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL);
237
1.39M
    }
238
52.9M
  }
239
51.5M
  while (p->FreeList[i] == 0);
240
75.0k
  retVal = RemoveNode(p, i);
241
75.0k
  SplitBlock(p, retVal, i, indx);
242
75.0k
  return retVal;
243
1.47M
}
244
245
static void *AllocUnits(CPpmd7 *p, unsigned indx)
246
1.66M
{
247
1.66M
  UInt32 numBytes;
248
1.66M
  if (p->FreeList[indx] != 0)
249
143k
    return RemoveNode(p, indx);
250
1.52M
  numBytes = U2B(I2U(indx));
251
1.52M
  if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit))
252
769k
  {
253
769k
    void *retVal = p->LoUnit;
254
769k
    p->LoUnit += numBytes;
255
769k
    return retVal;
256
769k
  }
257
756k
  return AllocUnitsRare(p, indx);
258
1.52M
}
259
260
#define MyMem12Cpy(dest, src, num) \
261
336k
  { UInt32 *d = (UInt32 *)dest; const UInt32 *s = (const UInt32 *)src; UInt32 n = num; \
262
505k
    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
8.36k
{
266
8.36k
  unsigned i0 = U2I(oldNU);
267
8.36k
  unsigned i1 = U2I(newNU);
268
8.36k
  if (i0 == i1)
269
192
    return oldPtr;
270
8.17k
  if (p->FreeList[i1] != 0)
271
6.20k
  {
272
6.20k
    void *ptr = RemoveNode(p, i1);
273
6.20k
    MyMem12Cpy(ptr, oldPtr, newNU);
274
6.20k
    InsertNode(p, oldPtr, i0);
275
6.20k
    return ptr;
276
6.20k
  }
277
1.97k
  SplitBlock(p, oldPtr, i0, i1);
278
1.97k
  return oldPtr;
279
8.17k
}
280
281
14.7M
#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
44.4M
{
285
44.4M
  (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF);
286
44.4M
  (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF);
287
44.4M
}
288
289
static void RestartModel(CPpmd7 *p)
290
114k
{
291
114k
  unsigned i, k, m;
292
293
114k
  memset(p->FreeList, 0, sizeof(p->FreeList));
294
114k
  p->Text = p->Base + p->AlignOffset;
295
114k
  p->HiUnit = p->Text + p->Size;
296
114k
  p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE;
297
114k
  p->GlueCount = 0;
298
299
114k
  p->OrderFall = p->MaxOrder;
300
114k
  p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1;
301
114k
  p->PrevSuccess = 0;
302
303
114k
  p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */
304
114k
  p->MinContext->Suffix = 0;
305
114k
  p->MinContext->NumStats = 256;
306
114k
  p->MinContext->SummFreq = 256 + 1;
307
114k
  p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */
308
114k
  p->LoUnit += U2B(256 / 2);
309
114k
  p->MinContext->Stats = REF(p->FoundState);
310
29.4M
  for (i = 0; i < 256; i++)
311
29.3M
  {
312
29.3M
    CPpmd_State *s = &p->FoundState[i];
313
29.3M
    s->Symbol = (Byte)i;
314
29.3M
    s->Freq = 1;
315
29.3M
    SetSuccessor(s, 0);
316
29.3M
  }
317
318
14.8M
  for (i = 0; i < 128; i++)
319
132M
    for (k = 0; k < 8; k++)
320
117M
    {
321
117M
      UInt16 *dest = p->BinSumm[i] + k;
322
117M
      UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 2));
323
1.05G
      for (m = 0; m < 64; m += 8)
324
940M
        dest[m] = val;
325
117M
    }
326
  
327
2.98M
  for (i = 0; i < 25; i++)
328
48.7M
    for (k = 0; k < 16; k++)
329
45.9M
    {
330
45.9M
      CPpmd_See *s = &p->See[i][k];
331
45.9M
      s->Summ = (UInt16)((5 * i + 10) << (s->Shift = PPMD_PERIOD_BITS - 4));
332
45.9M
      s->Count = 4;
333
45.9M
    }
334
114k
}
335
336
void Ppmd7_Init(CPpmd7 *p, unsigned maxOrder)
337
3.50k
{
338
3.50k
  p->MaxOrder = maxOrder;
339
3.50k
  RestartModel(p);
340
3.50k
  p->DummySee.Shift = PPMD_PERIOD_BITS;
341
3.50k
  p->DummySee.Summ = 0; /* unused */
342
3.50k
  p->DummySee.Count = 64; /* unused */
343
3.50k
}
344
345
static CTX_PTR CreateSuccessors(CPpmd7 *p, BoolInt skip)
346
1.60M
{
347
1.60M
  CPpmd_State upState;
348
1.60M
  CTX_PTR c = p->MinContext;
349
1.60M
  CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
350
1.60M
  CPpmd_State *ps[PPMD7_MAX_ORDER];
351
1.60M
  unsigned numPs = 0;
352
  
353
1.60M
  if (!skip)
354
1.51M
    ps[numPs++] = p->FoundState;
355
  
356
2.05M
  while (c->Suffix)
357
1.10M
  {
358
1.10M
    CPpmd_Void_Ref successor;
359
1.10M
    CPpmd_State *s;
360
1.10M
    c = SUFFIX(c);
361
1.10M
    if (c->NumStats != 1)
362
488k
    {
363
14.2M
      for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++);
364
488k
    }
365
619k
    else
366
619k
      s = ONE_STATE(c);
367
1.10M
    successor = SUCCESSOR(s);
368
1.10M
    if (successor != upBranch)
369
655k
    {
370
655k
      c = CTX(successor);
371
655k
      if (numPs == 0)
372
33.1k
        return c;
373
622k
      break;
374
655k
    }
375
451k
    ps[numPs++] = s;
376
451k
  }
377
  
378
1.57M
  upState.Symbol = *(const Byte *)Ppmd7_GetPtr(p, upBranch);
379
1.57M
  SetSuccessor(&upState, upBranch + 1);
380
  
381
1.57M
  if (c->NumStats == 1)
382
420k
    upState.Freq = ONE_STATE(c)->Freq;
383
1.15M
  else
384
1.15M
  {
385
1.15M
    UInt32 cf, s0;
386
1.15M
    CPpmd_State *s;
387
107M
    for (s = STATS(c); s->Symbol != upState.Symbol; s++);
388
1.15M
    cf = s->Freq - 1;
389
1.15M
    s0 = c->SummFreq - c->NumStats - cf;
390
1.15M
    upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((2 * cf + 3 * s0 - 1) / (2 * s0))));
391
1.15M
  }
392
393
1.57M
  do
394
1.94M
  {
395
    /* Create Child */
396
1.94M
    CTX_PTR c1; /* = AllocContext(p); */
397
1.94M
    if (p->HiUnit != p->LoUnit)
398
1.11M
      c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE);
399
824k
    else if (p->FreeList[0] != 0)
400
101k
      c1 = (CTX_PTR)RemoveNode(p, 0);
401
723k
    else
402
723k
    {
403
723k
      c1 = (CTX_PTR)AllocUnitsRare(p, 0);
404
723k
      if (!c1)
405
49.5k
        return NULL;
406
723k
    }
407
1.89M
    c1->NumStats = 1;
408
1.89M
    *ONE_STATE(c1) = upState;
409
1.89M
    c1->Suffix = REF(c);
410
1.89M
    SetSuccessor(ps[--numPs], REF(c1));
411
1.89M
    c = c1;
412
1.89M
  }
413
1.89M
  while (numPs != 0);
414
  
415
1.52M
  return c;
416
1.57M
}
417
418
static void SwapStates(CPpmd_State *t1, CPpmd_State *t2)
419
6.01M
{
420
6.01M
  CPpmd_State tmp = *t1;
421
6.01M
  *t1 = *t2;
422
6.01M
  *t2 = tmp;
423
6.01M
}
424
425
static void UpdateModel(CPpmd7 *p)
426
12.0M
{
427
12.0M
  CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
428
12.0M
  CTX_PTR c;
429
12.0M
  unsigned s0, ns;
430
  
431
12.0M
  if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
432
942k
  {
433
942k
    c = SUFFIX(p->MinContext);
434
    
435
942k
    if (c->NumStats == 1)
436
437k
    {
437
437k
      CPpmd_State *s = ONE_STATE(c);
438
437k
      if (s->Freq < 32)
439
437k
        s->Freq++;
440
437k
    }
441
504k
    else
442
504k
    {
443
504k
      CPpmd_State *s = STATS(c);
444
504k
      if (s->Symbol != p->FoundState->Symbol)
445
176k
      {
446
10.0M
        do { s++; } while (s->Symbol != p->FoundState->Symbol);
447
176k
        if (s[0].Freq >= s[-1].Freq)
448
136k
        {
449
136k
          SwapStates(&s[0], &s[-1]);
450
136k
          s--;
451
136k
        }
452
176k
      }
453
504k
      if (s->Freq < MAX_FREQ - 9)
454
504k
      {
455
504k
        s->Freq += 2;
456
504k
        c->SummFreq += 2;
457
504k
      }
458
504k
    }
459
942k
  }
460
461
12.0M
  if (p->OrderFall == 0)
462
90.7k
  {
463
90.7k
    p->MinContext = p->MaxContext = CreateSuccessors(p, True);
464
90.7k
    if (p->MinContext == 0)
465
1.41k
    {
466
1.41k
      RestartModel(p);
467
1.41k
      return;
468
1.41k
    }
469
89.3k
    SetSuccessor(p->FoundState, REF(p->MinContext));
470
89.3k
    return;
471
90.7k
  }
472
  
473
11.9M
  *p->Text++ = p->FoundState->Symbol;
474
11.9M
  successor = REF(p->Text);
475
11.9M
  if (p->Text >= p->UnitsStart)
476
5.39k
  {
477
5.39k
    RestartModel(p);
478
5.39k
    return;
479
5.39k
  }
480
  
481
11.9M
  if (fSuccessor)
482
2.25M
  {
483
2.25M
    if (fSuccessor <= successor)
484
1.51M
    {
485
1.51M
      CTX_PTR cs = CreateSuccessors(p, False);
486
1.51M
      if (cs == NULL)
487
48.0k
      {
488
48.0k
        RestartModel(p);
489
48.0k
        return;
490
48.0k
      }
491
1.46M
      fSuccessor = REF(cs);
492
1.46M
    }
493
2.20M
    if (--p->OrderFall == 0)
494
169k
    {
495
169k
      successor = fSuccessor;
496
169k
      p->Text -= (p->MaxContext != p->MinContext);
497
169k
    }
498
2.20M
  }
499
9.68M
  else
500
9.68M
  {
501
9.68M
    SetSuccessor(p->FoundState, successor);
502
9.68M
    fSuccessor = REF(p->MinContext);
503
9.68M
  }
504
  
505
11.8M
  s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - (p->FoundState->Freq - 1);
506
  
507
13.7M
  for (c = p->MaxContext; c != p->MinContext; c = SUFFIX(c))
508
1.88M
  {
509
1.88M
    unsigned ns1;
510
1.88M
    UInt32 cf, sf;
511
1.88M
    if ((ns1 = c->NumStats) != 1)
512
572k
    {
513
572k
      if ((ns1 & 1) == 0)
514
368k
      {
515
        /* Expand for one UNIT */
516
368k
        unsigned oldNU = ns1 >> 1;
517
368k
        unsigned i = U2I(oldNU);
518
368k
        if (i != U2I((size_t)oldNU + 1))
519
357k
        {
520
357k
          void *ptr = AllocUnits(p, i + 1);
521
357k
          void *oldPtr;
522
357k
          if (!ptr)
523
27.2k
          {
524
27.2k
            RestartModel(p);
525
27.2k
            return;
526
27.2k
          }
527
330k
          oldPtr = STATS(c);
528
330k
          MyMem12Cpy(ptr, oldPtr, oldNU);
529
330k
          InsertNode(p, oldPtr, i);
530
330k
          c->Stats = STATS_REF(ptr);
531
330k
        }
532
368k
      }
533
545k
      c->SummFreq = (UInt16)(c->SummFreq + (2 * ns1 < ns) + 2 * ((4 * ns1 <= ns) & (c->SummFreq <= 8 * ns1)));
534
545k
    }
535
1.31M
    else
536
1.31M
    {
537
1.31M
      CPpmd_State *s = (CPpmd_State*)AllocUnits(p, 0);
538
1.31M
      if (!s)
539
29.1k
      {
540
29.1k
        RestartModel(p);
541
29.1k
        return;
542
29.1k
      }
543
1.28M
      *s = *ONE_STATE(c);
544
1.28M
      c->Stats = REF(s);
545
1.28M
      if (s->Freq < MAX_FREQ / 4 - 1)
546
1.22M
        s->Freq <<= 1;
547
53.2k
      else
548
53.2k
        s->Freq = MAX_FREQ - 4;
549
1.28M
      c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 3));
550
1.28M
    }
551
1.82M
    cf = 2 * (UInt32)p->FoundState->Freq * (c->SummFreq + 6);
552
1.82M
    sf = (UInt32)s0 + c->SummFreq;
553
1.82M
    if (cf < 6 * sf)
554
1.22M
    {
555
1.22M
      cf = 1 + (cf > sf) + (cf >= 4 * sf);
556
1.22M
      c->SummFreq += 3;
557
1.22M
    }
558
603k
    else
559
603k
    {
560
603k
      cf = 4 + (cf >= 9 * sf) + (cf >= 12 * sf) + (cf >= 15 * sf);
561
603k
      c->SummFreq = (UInt16)(c->SummFreq + cf);
562
603k
    }
563
1.82M
    {
564
1.82M
      CPpmd_State *s = STATS(c) + ns1;
565
1.82M
      SetSuccessor(s, successor);
566
1.82M
      s->Symbol = p->FoundState->Symbol;
567
1.82M
      s->Freq = (Byte)cf;
568
1.82M
      c->NumStats = (UInt16)(ns1 + 1);
569
1.82M
    }
570
1.82M
  }
571
11.8M
  p->MaxContext = p->MinContext = CTX(fSuccessor);
572
11.8M
}
573
  
574
static void Rescale(CPpmd7 *p)
575
118k
{
576
118k
  unsigned i, adder, sumFreq, escFreq;
577
118k
  CPpmd_State *stats = STATS(p->MinContext);
578
118k
  CPpmd_State *s = p->FoundState;
579
118k
  {
580
118k
    CPpmd_State tmp = *s;
581
134k
    for (; s != stats; s--)
582
15.8k
      s[0] = s[-1];
583
118k
    *s = tmp;
584
118k
  }
585
118k
  escFreq = p->MinContext->SummFreq - s->Freq;
586
118k
  s->Freq += 4;
587
118k
  adder = (p->OrderFall != 0);
588
118k
  s->Freq = (Byte)((s->Freq + adder) >> 1);
589
118k
  sumFreq = s->Freq;
590
  
591
118k
  i = p->MinContext->NumStats - 1;
592
118k
  do
593
368k
  {
594
368k
    escFreq -= (++s)->Freq;
595
368k
    s->Freq = (Byte)((s->Freq + adder) >> 1);
596
368k
    sumFreq += s->Freq;
597
368k
    if (s[0].Freq > s[-1].Freq)
598
59.7k
    {
599
59.7k
      CPpmd_State *s1 = s;
600
59.7k
      CPpmd_State tmp = *s1;
601
59.7k
      do
602
819k
        s1[0] = s1[-1];
603
819k
      while (--s1 != stats && tmp.Freq > s1[-1].Freq);
604
59.7k
      *s1 = tmp;
605
59.7k
    }
606
368k
  }
607
368k
  while (--i);
608
  
609
118k
  if (s->Freq == 0)
610
51.5k
  {
611
51.5k
    unsigned numStats = p->MinContext->NumStats;
612
51.5k
    unsigned n0, n1;
613
81.5k
    do { i++; } while ((--s)->Freq == 0);
614
51.5k
    escFreq += i;
615
51.5k
    p->MinContext->NumStats = (UInt16)(p->MinContext->NumStats - i);
616
51.5k
    if (p->MinContext->NumStats == 1)
617
23.3k
    {
618
23.3k
      CPpmd_State tmp = *stats;
619
23.3k
      do
620
40.9k
      {
621
40.9k
        tmp.Freq = (Byte)(tmp.Freq - (tmp.Freq >> 1));
622
40.9k
        escFreq >>= 1;
623
40.9k
      }
624
40.9k
      while (escFreq > 1);
625
23.3k
      InsertNode(p, stats, U2I(((numStats + 1) >> 1)));
626
23.3k
      *(p->FoundState = ONE_STATE(p->MinContext)) = tmp;
627
23.3k
      return;
628
23.3k
    }
629
28.1k
    n0 = (numStats + 1) >> 1;
630
28.1k
    n1 = (p->MinContext->NumStats + 1) >> 1;
631
28.1k
    if (n0 != n1)
632
8.36k
      p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
633
28.1k
  }
634
95.1k
  p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1));
635
95.1k
  p->FoundState = STATS(p->MinContext);
636
95.1k
}
637
638
CPpmd_See *Ppmd7_MakeEscFreq(CPpmd7 *p, unsigned numMasked, UInt32 *escFreq)
639
1.38M
{
640
1.38M
  CPpmd_See *see;
641
1.38M
  unsigned nonMasked = p->MinContext->NumStats - numMasked;
642
1.38M
  if (p->MinContext->NumStats != 256)
643
279k
  {
644
279k
    see = p->See[(unsigned)p->NS2Indx[(size_t)nonMasked - 1]] +
645
279k
        (nonMasked < (unsigned)SUFFIX(p->MinContext)->NumStats - p->MinContext->NumStats) +
646
279k
        2 * (unsigned)(p->MinContext->SummFreq < 11 * p->MinContext->NumStats) +
647
279k
        4 * (unsigned)(numMasked > nonMasked) +
648
279k
        p->HiBitsFlag;
649
279k
    {
650
279k
      unsigned r = (see->Summ >> see->Shift);
651
279k
      see->Summ = (UInt16)(see->Summ - r);
652
279k
      *escFreq = r + (r == 0);
653
279k
    }
654
279k
  }
655
1.10M
  else
656
1.10M
  {
657
1.10M
    see = &p->DummySee;
658
1.10M
    *escFreq = 1;
659
1.10M
  }
660
1.38M
  return see;
661
1.38M
}
662
663
static void NextContext(CPpmd7 *p)
664
15.6M
{
665
15.6M
  CTX_PTR c = CTX(SUCCESSOR(p->FoundState));
666
15.6M
  if (p->OrderFall == 0 && (Byte *)c > p->Text)
667
4.80M
    p->MinContext = p->MaxContext = c;
668
10.7M
  else
669
10.7M
    UpdateModel(p);
670
15.6M
}
671
672
void Ppmd7_Update1(CPpmd7 *p)
673
10.1M
{
674
10.1M
  CPpmd_State *s = p->FoundState;
675
10.1M
  s->Freq += 4;
676
10.1M
  p->MinContext->SummFreq += 4;
677
10.1M
  if (s[0].Freq > s[-1].Freq)
678
5.87M
  {
679
5.87M
    SwapStates(&s[0], &s[-1]);
680
5.87M
    p->FoundState = --s;
681
5.87M
    if (s->Freq > MAX_FREQ)
682
1.11k
      Rescale(p);
683
5.87M
  }
684
10.1M
  NextContext(p);
685
10.1M
}
686
687
void Ppmd7_Update1_0(CPpmd7 *p)
688
2.24M
{
689
2.24M
  p->PrevSuccess = (2 * p->FoundState->Freq > p->MinContext->SummFreq);
690
2.24M
  p->RunLength += p->PrevSuccess;
691
2.24M
  p->MinContext->SummFreq += 4;
692
2.24M
  if ((p->FoundState->Freq += 4) > MAX_FREQ)
693
116k
    Rescale(p);
694
2.24M
  NextContext(p);
695
2.24M
}
696
697
void Ppmd7_UpdateBin(CPpmd7 *p)
698
3.25M
{
699
3.25M
  p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 128 ? 1: 0));
700
3.25M
  p->PrevSuccess = 1;
701
3.25M
  p->RunLength++;
702
3.25M
  NextContext(p);
703
3.25M
}
704
705
void Ppmd7_Update2(CPpmd7 *p)
706
1.23M
{
707
1.23M
  p->MinContext->SummFreq += 4;
708
1.23M
  if ((p->FoundState->Freq += 4) > MAX_FREQ)
709
938
    Rescale(p);
710
1.23M
  p->RunLength = p->InitRL;
711
1.23M
  UpdateModel(p);
712
1.23M
}