PageRenderTime 50ms CodeModel.GetById 18ms RepoModel.GetById 1ms app.codeStats 0ms

/External/7z/C/Ppmd8.c

https://bitbucket.org/gongminmin/klayge/
C | 1120 lines | 1000 code | 97 blank | 23 comment | 236 complexity | 4518d640102f71c2624128b1214f2a48 MD5 | raw file
Possible License(s): LGPL-2.1, Unlicense, GPL-2.0, BSD-3-Clause, MIT
  1. /* Ppmd8.c -- PPMdI codec
  2. 2010-03-24 : Igor Pavlov : Public domain
  3. This code is based on PPMd var.I (2002): Dmitry Shkarin : Public domain */
  4. #include <memory.h>
  5. #include "Ppmd8.h"
  6. const Byte PPMD8_kExpEscape[16] = { 25, 14, 9, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2 };
  7. static const UInt16 kInitBinEsc[] = { 0x3CDD, 0x1F3F, 0x59BF, 0x48F3, 0x64A1, 0x5ABC, 0x6632, 0x6051};
  8. #define MAX_FREQ 124
  9. #define UNIT_SIZE 12
  10. #define U2B(nu) ((UInt32)(nu) * UNIT_SIZE)
  11. #define U2I(nu) (p->Units2Indx[(nu) - 1])
  12. #define I2U(indx) (p->Indx2Units[indx])
  13. #ifdef PPMD_32BIT
  14. #define REF(ptr) (ptr)
  15. #else
  16. #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
  17. #endif
  18. #define STATS_REF(ptr) ((CPpmd_State_Ref)REF(ptr))
  19. #define CTX(ref) ((CPpmd8_Context *)Ppmd8_GetContext(p, ref))
  20. #define STATS(ctx) Ppmd8_GetStats(p, ctx)
  21. #define ONE_STATE(ctx) Ppmd8Context_OneState(ctx)
  22. #define SUFFIX(ctx) CTX((ctx)->Suffix)
  23. typedef CPpmd8_Context * CTX_PTR;
  24. struct CPpmd8_Node_;
  25. typedef
  26. #ifdef PPMD_32BIT
  27. struct CPpmd8_Node_ *
  28. #else
  29. UInt32
  30. #endif
  31. CPpmd8_Node_Ref;
  32. typedef struct CPpmd8_Node_
  33. {
  34. UInt32 Stamp;
  35. CPpmd8_Node_Ref Next;
  36. UInt32 NU;
  37. } CPpmd8_Node;
  38. #ifdef PPMD_32BIT
  39. #define NODE(ptr) (ptr)
  40. #else
  41. #define NODE(offs) ((CPpmd8_Node *)(p->Base + (offs)))
  42. #endif
  43. #define EMPTY_NODE 0xFFFFFFFF
  44. void Ppmd8_Construct(CPpmd8 *p)
  45. {
  46. unsigned i, k, m;
  47. p->Base = 0;
  48. for (i = 0, k = 0; i < PPMD_NUM_INDEXES; i++)
  49. {
  50. unsigned step = (i >= 12 ? 4 : (i >> 2) + 1);
  51. do { p->Units2Indx[k++] = (Byte)i; } while(--step);
  52. p->Indx2Units[i] = (Byte)k;
  53. }
  54. p->NS2BSIndx[0] = (0 << 1);
  55. p->NS2BSIndx[1] = (1 << 1);
  56. memset(p->NS2BSIndx + 2, (2 << 1), 9);
  57. memset(p->NS2BSIndx + 11, (3 << 1), 256 - 11);
  58. for (i = 0; i < 5; i++)
  59. p->NS2Indx[i] = (Byte)i;
  60. for (m = i, k = 1; i < 260; i++)
  61. {
  62. p->NS2Indx[i] = (Byte)m;
  63. if (--k == 0)
  64. k = (++m) - 4;
  65. }
  66. }
  67. void Ppmd8_Free(CPpmd8 *p, ISzAlloc *alloc)
  68. {
  69. alloc->Free(alloc, p->Base);
  70. p->Size = 0;
  71. p->Base = 0;
  72. }
  73. Bool Ppmd8_Alloc(CPpmd8 *p, UInt32 size, ISzAlloc *alloc)
  74. {
  75. if (p->Base == 0 || p->Size != size)
  76. {
  77. Ppmd8_Free(p, alloc);
  78. p->AlignOffset =
  79. #ifdef PPMD_32BIT
  80. (4 - size) & 3;
  81. #else
  82. 4 - (size & 3);
  83. #endif
  84. if ((p->Base = (Byte *)alloc->Alloc(alloc, p->AlignOffset + size)) == 0)
  85. return False;
  86. p->Size = size;
  87. }
  88. return True;
  89. }
  90. static void InsertNode(CPpmd8 *p, void *node, unsigned indx)
  91. {
  92. ((CPpmd8_Node *)node)->Stamp = EMPTY_NODE;
  93. ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx];
  94. ((CPpmd8_Node *)node)->NU = I2U(indx);
  95. p->FreeList[indx] = REF(node);
  96. p->Stamps[indx]++;
  97. }
  98. static void *RemoveNode(CPpmd8 *p, unsigned indx)
  99. {
  100. CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]);
  101. p->FreeList[indx] = node->Next;
  102. p->Stamps[indx]--;
  103. return node;
  104. }
  105. static void SplitBlock(CPpmd8 *p, void *ptr, unsigned oldIndx, unsigned newIndx)
  106. {
  107. unsigned i, nu = I2U(oldIndx) - I2U(newIndx);
  108. ptr = (Byte *)ptr + U2B(I2U(newIndx));
  109. if (I2U(i = U2I(nu)) != nu)
  110. {
  111. unsigned k = I2U(--i);
  112. InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
  113. }
  114. InsertNode(p, ptr, i);
  115. }
  116. static void GlueFreeBlocks(CPpmd8 *p)
  117. {
  118. CPpmd8_Node_Ref head = 0;
  119. CPpmd8_Node_Ref *prev = &head;
  120. unsigned i;
  121. p->GlueCount = 1 << 13;
  122. memset(p->Stamps, 0, sizeof(p->Stamps));
  123. /* Order-0 context is always at top UNIT, so we don't need guard NODE at the end.
  124. All blocks up to p->LoUnit can be free, so we need guard NODE at LoUnit. */
  125. if (p->LoUnit != p->HiUnit)
  126. ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
  127. /* Glue free blocks */
  128. for (i = 0; i < PPMD_NUM_INDEXES; i++)
  129. {
  130. CPpmd8_Node_Ref next = (CPpmd8_Node_Ref)p->FreeList[i];
  131. p->FreeList[i] = 0;
  132. while (next != 0)
  133. {
  134. CPpmd8_Node *node = NODE(next);
  135. if (node->NU != 0)
  136. {
  137. CPpmd8_Node *node2;
  138. *prev = next;
  139. prev = &(node->Next);
  140. while ((node2 = node + node->NU)->Stamp == EMPTY_NODE)
  141. {
  142. node->NU += node2->NU;
  143. node2->NU = 0;
  144. }
  145. }
  146. next = node->Next;
  147. }
  148. }
  149. *prev = 0;
  150. /* Fill lists of free blocks */
  151. while (head != 0)
  152. {
  153. CPpmd8_Node *node = NODE(head);
  154. unsigned nu;
  155. head = node->Next;
  156. nu = node->NU;
  157. if (nu == 0)
  158. continue;
  159. for (; nu > 128; nu -= 128, node += 128)
  160. InsertNode(p, node, PPMD_NUM_INDEXES - 1);
  161. if (I2U(i = U2I(nu)) != nu)
  162. {
  163. unsigned k = I2U(--i);
  164. InsertNode(p, node + k, nu - k - 1);
  165. }
  166. InsertNode(p, node, i);
  167. }
  168. }
  169. static void *AllocUnitsRare(CPpmd8 *p, unsigned indx)
  170. {
  171. unsigned i;
  172. void *retVal;
  173. if (p->GlueCount == 0)
  174. {
  175. GlueFreeBlocks(p);
  176. if (p->FreeList[indx] != 0)
  177. return RemoveNode(p, indx);
  178. }
  179. i = indx;
  180. do
  181. {
  182. if (++i == PPMD_NUM_INDEXES)
  183. {
  184. UInt32 numBytes = U2B(I2U(indx));
  185. p->GlueCount--;
  186. return ((UInt32)(p->UnitsStart - p->Text) > numBytes) ? (p->UnitsStart -= numBytes) : (NULL);
  187. }
  188. }
  189. while (p->FreeList[i] == 0);
  190. retVal = RemoveNode(p, i);
  191. SplitBlock(p, retVal, i, indx);
  192. return retVal;
  193. }
  194. static void *AllocUnits(CPpmd8 *p, unsigned indx)
  195. {
  196. UInt32 numBytes;
  197. if (p->FreeList[indx] != 0)
  198. return RemoveNode(p, indx);
  199. numBytes = U2B(I2U(indx));
  200. if (numBytes <= (UInt32)(p->HiUnit - p->LoUnit))
  201. {
  202. void *retVal = p->LoUnit;
  203. p->LoUnit += numBytes;
  204. return retVal;
  205. }
  206. return AllocUnitsRare(p, indx);
  207. }
  208. #define MyMem12Cpy(dest, src, num) \
  209. { UInt32 *d = (UInt32 *)dest; const UInt32 *s = (const UInt32 *)src; UInt32 n = num; \
  210. do { d[0] = s[0]; d[1] = s[1]; d[2] = s[2]; s += 3; d += 3; } while(--n); }
  211. static void *ShrinkUnits(CPpmd8 *p, void *oldPtr, unsigned oldNU, unsigned newNU)
  212. {
  213. unsigned i0 = U2I(oldNU);
  214. unsigned i1 = U2I(newNU);
  215. if (i0 == i1)
  216. return oldPtr;
  217. if (p->FreeList[i1] != 0)
  218. {
  219. void *ptr = RemoveNode(p, i1);
  220. MyMem12Cpy(ptr, oldPtr, newNU);
  221. InsertNode(p, oldPtr, i0);
  222. return ptr;
  223. }
  224. SplitBlock(p, oldPtr, i0, i1);
  225. return oldPtr;
  226. }
  227. static void FreeUnits(CPpmd8 *p, void *ptr, unsigned nu)
  228. {
  229. InsertNode(p, ptr, U2I(nu));
  230. }
  231. static void SpecialFreeUnit(CPpmd8 *p, void *ptr)
  232. {
  233. if ((Byte *)ptr != p->UnitsStart)
  234. InsertNode(p, ptr, 0);
  235. else
  236. {
  237. #ifdef PPMD8_FREEZE_SUPPORT
  238. *(UInt32 *)ptr = EMPTY_NODE; /* it's used for (Flags == 0xFF) check in RemoveBinContexts */
  239. #endif
  240. p->UnitsStart += UNIT_SIZE;
  241. }
  242. }
  243. static void *MoveUnitsUp(CPpmd8 *p, void *oldPtr, unsigned nu)
  244. {
  245. unsigned indx = U2I(nu);
  246. void *ptr;
  247. if ((Byte *)oldPtr > p->UnitsStart + 16 * 1024 || REF(oldPtr) > p->FreeList[indx])
  248. return oldPtr;
  249. ptr = RemoveNode(p, indx);
  250. MyMem12Cpy(ptr, oldPtr, nu);
  251. if ((Byte*)oldPtr != p->UnitsStart)
  252. InsertNode(p, oldPtr, indx);
  253. else
  254. p->UnitsStart += U2B(I2U(indx));
  255. return ptr;
  256. }
  257. static void ExpandTextArea(CPpmd8 *p)
  258. {
  259. UInt32 count[PPMD_NUM_INDEXES];
  260. unsigned i;
  261. memset(count, 0, sizeof(count));
  262. if (p->LoUnit != p->HiUnit)
  263. ((CPpmd8_Node *)p->LoUnit)->Stamp = 0;
  264. {
  265. CPpmd8_Node *node = (CPpmd8_Node *)p->UnitsStart;
  266. for (; node->Stamp == EMPTY_NODE; node += node->NU)
  267. {
  268. node->Stamp = 0;
  269. count[U2I(node->NU)]++;
  270. }
  271. p->UnitsStart = (Byte *)node;
  272. }
  273. for (i = 0; i < PPMD_NUM_INDEXES; i++)
  274. {
  275. CPpmd8_Node_Ref *next = (CPpmd8_Node_Ref *)&p->FreeList[i];
  276. while (count[i] != 0)
  277. {
  278. CPpmd8_Node *node = NODE(*next);
  279. while (node->Stamp == 0)
  280. {
  281. *next = node->Next;
  282. node = NODE(*next);
  283. p->Stamps[i]--;
  284. if (--count[i] == 0)
  285. break;
  286. }
  287. next = &node->Next;
  288. }
  289. }
  290. }
  291. #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
  292. static void SetSuccessor(CPpmd_State *p, CPpmd_Void_Ref v)
  293. {
  294. (p)->SuccessorLow = (UInt16)((UInt32)(v) & 0xFFFF);
  295. (p)->SuccessorHigh = (UInt16)(((UInt32)(v) >> 16) & 0xFFFF);
  296. }
  297. #define RESET_TEXT(offs) { p->Text = p->Base + p->AlignOffset + (offs); }
  298. static void RestartModel(CPpmd8 *p)
  299. {
  300. unsigned i, k, m, r;
  301. memset(p->FreeList, 0, sizeof(p->FreeList));
  302. memset(p->Stamps, 0, sizeof(p->Stamps));
  303. RESET_TEXT(0);
  304. p->HiUnit = p->Text + p->Size;
  305. p->LoUnit = p->UnitsStart = p->HiUnit - p->Size / 8 / UNIT_SIZE * 7 * UNIT_SIZE;
  306. p->GlueCount = 0;
  307. p->OrderFall = p->MaxOrder;
  308. p->RunLength = p->InitRL = -(Int32)((p->MaxOrder < 12) ? p->MaxOrder : 12) - 1;
  309. p->PrevSuccess = 0;
  310. p->MinContext = p->MaxContext = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); /* AllocContext(p); */
  311. p->MinContext->Suffix = 0;
  312. p->MinContext->NumStats = 255;
  313. p->MinContext->Flags = 0;
  314. p->MinContext->SummFreq = 256 + 1;
  315. p->FoundState = (CPpmd_State *)p->LoUnit; /* AllocUnits(p, PPMD_NUM_INDEXES - 1); */
  316. p->LoUnit += U2B(256 / 2);
  317. p->MinContext->Stats = REF(p->FoundState);
  318. for (i = 0; i < 256; i++)
  319. {
  320. CPpmd_State *s = &p->FoundState[i];
  321. s->Symbol = (Byte)i;
  322. s->Freq = 1;
  323. SetSuccessor(s, 0);
  324. }
  325. for (i = m = 0; m < 25; m++)
  326. {
  327. while (p->NS2Indx[i] == m)
  328. i++;
  329. for (k = 0; k < 8; k++)
  330. {
  331. UInt16 val = (UInt16)(PPMD_BIN_SCALE - kInitBinEsc[k] / (i + 1));
  332. UInt16 *dest = p->BinSumm[m] + k;
  333. for (r = 0; r < 64; r += 8)
  334. dest[r] = val;
  335. }
  336. }
  337. for (i = m = 0; m < 24; m++)
  338. {
  339. while (p->NS2Indx[i + 3] == m + 3)
  340. i++;
  341. for (k = 0; k < 32; k++)
  342. {
  343. CPpmd_See *s = &p->See[m][k];
  344. s->Summ = (UInt16)((2 * i + 5) << (s->Shift = PPMD_PERIOD_BITS - 4));
  345. s->Count = 7;
  346. }
  347. }
  348. }
  349. void Ppmd8_Init(CPpmd8 *p, unsigned maxOrder, unsigned restoreMethod)
  350. {
  351. p->MaxOrder = maxOrder;
  352. p->RestoreMethod = restoreMethod;
  353. RestartModel(p);
  354. p->DummySee.Shift = PPMD_PERIOD_BITS;
  355. p->DummySee.Summ = 0; /* unused */
  356. p->DummySee.Count = 64; /* unused */
  357. }
  358. static void Refresh(CPpmd8 *p, CTX_PTR ctx, unsigned oldNU, unsigned scale)
  359. {
  360. unsigned i = ctx->NumStats, escFreq, sumFreq, flags;
  361. CPpmd_State *s = (CPpmd_State *)ShrinkUnits(p, STATS(ctx), oldNU, (i + 2) >> 1);
  362. ctx->Stats = REF(s);
  363. #ifdef PPMD8_FREEZE_SUPPORT
  364. /* fixed over Shkarin's code. Fixed code is not compatible with original code for some files in FREEZE mode. */
  365. scale |= (ctx->SummFreq >= ((UInt32)1 << 15));
  366. #endif
  367. flags = (ctx->Flags & (0x10 + 0x04 * scale)) + 0x08 * (s->Symbol >= 0x40);
  368. escFreq = ctx->SummFreq - s->Freq;
  369. sumFreq = (s->Freq = (Byte)((s->Freq + scale) >> scale));
  370. do
  371. {
  372. escFreq -= (++s)->Freq;
  373. sumFreq += (s->Freq = (Byte)((s->Freq + scale) >> scale));
  374. flags |= 0x08 * (s->Symbol >= 0x40);
  375. }
  376. while (--i);
  377. ctx->SummFreq = (UInt16)(sumFreq + ((escFreq + scale) >> scale));
  378. ctx->Flags = (Byte)flags;
  379. }
  380. static void SwapStates(CPpmd_State *t1, CPpmd_State *t2)
  381. {
  382. CPpmd_State tmp = *t1;
  383. *t1 = *t2;
  384. *t2 = tmp;
  385. }
  386. static CPpmd_Void_Ref CutOff(CPpmd8 *p, CTX_PTR ctx, unsigned order)
  387. {
  388. int i;
  389. unsigned tmp;
  390. CPpmd_State *s;
  391. if (!ctx->NumStats)
  392. {
  393. s = ONE_STATE(ctx);
  394. if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart)
  395. {
  396. if (order < p->MaxOrder)
  397. SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
  398. else
  399. SetSuccessor(s, 0);
  400. if (SUCCESSOR(s) || order <= 9) /* O_BOUND */
  401. return REF(ctx);
  402. }
  403. SpecialFreeUnit(p, ctx);
  404. return 0;
  405. }
  406. ctx->Stats = STATS_REF(MoveUnitsUp(p, STATS(ctx), tmp = ((unsigned)ctx->NumStats + 2) >> 1));
  407. for (s = STATS(ctx) + (i = ctx->NumStats); s >= STATS(ctx); s--)
  408. if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) < p->UnitsStart)
  409. {
  410. CPpmd_State *s2 = STATS(ctx) + (i--);
  411. SetSuccessor(s, 0);
  412. SwapStates(s, s2);
  413. }
  414. else if (order < p->MaxOrder)
  415. SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
  416. else
  417. SetSuccessor(s, 0);
  418. if (i != ctx->NumStats && order)
  419. {
  420. ctx->NumStats = (Byte)i;
  421. s = STATS(ctx);
  422. if (i < 0)
  423. {
  424. FreeUnits(p, s, tmp);
  425. SpecialFreeUnit(p, ctx);
  426. return 0;
  427. }
  428. if (i == 0)
  429. {
  430. ctx->Flags = (ctx->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40);
  431. *ONE_STATE(ctx) = *s;
  432. FreeUnits(p, s, tmp);
  433. ONE_STATE(ctx)->Freq = (Byte)((unsigned)ONE_STATE(ctx)->Freq + 11) >> 3;
  434. }
  435. else
  436. Refresh(p, ctx, tmp, ctx->SummFreq > 16 * i);
  437. }
  438. return REF(ctx);
  439. }
  440. #ifdef PPMD8_FREEZE_SUPPORT
  441. static CPpmd_Void_Ref RemoveBinContexts(CPpmd8 *p, CTX_PTR ctx, unsigned order)
  442. {
  443. CPpmd_State *s;
  444. if (!ctx->NumStats)
  445. {
  446. s = ONE_STATE(ctx);
  447. if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
  448. SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
  449. else
  450. SetSuccessor(s, 0);
  451. /* Suffix context can be removed already, since different (high-order)
  452. Successors may refer to same context. So we check Flags == 0xFF (Stamp == EMPTY_NODE) */
  453. if (!SUCCESSOR(s) && (!SUFFIX(ctx)->NumStats || SUFFIX(ctx)->Flags == 0xFF))
  454. {
  455. FreeUnits(p, ctx, 1);
  456. return 0;
  457. }
  458. else
  459. return REF(ctx);
  460. }
  461. for (s = STATS(ctx) + ctx->NumStats; s >= STATS(ctx); s--)
  462. if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
  463. SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
  464. else
  465. SetSuccessor(s, 0);
  466. return REF(ctx);
  467. }
  468. #endif
  469. static UInt32 GetUsedMemory(const CPpmd8 *p)
  470. {
  471. UInt32 v = 0;
  472. unsigned i;
  473. for (i = 0; i < PPMD_NUM_INDEXES; i++)
  474. v += p->Stamps[i] * I2U(i);
  475. return p->Size - (UInt32)(p->HiUnit - p->LoUnit) - (UInt32)(p->UnitsStart - p->Text) - U2B(v);
  476. }
  477. #ifdef PPMD8_FREEZE_SUPPORT
  478. #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1, fSuccessor)
  479. #else
  480. #define RESTORE_MODEL(c1, fSuccessor) RestoreModel(p, c1)
  481. #endif
  482. static void RestoreModel(CPpmd8 *p, CTX_PTR c1
  483. #ifdef PPMD8_FREEZE_SUPPORT
  484. , CTX_PTR fSuccessor
  485. #endif
  486. )
  487. {
  488. CTX_PTR c;
  489. CPpmd_State *s;
  490. RESET_TEXT(0);
  491. for (c = p->MaxContext; c != c1; c = SUFFIX(c))
  492. if (--(c->NumStats) == 0)
  493. {
  494. s = STATS(c);
  495. c->Flags = (c->Flags & 0x10) + 0x08 * (s->Symbol >= 0x40);
  496. *ONE_STATE(c) = *s;
  497. SpecialFreeUnit(p, s);
  498. ONE_STATE(c)->Freq = (ONE_STATE(c)->Freq + 11) >> 3;
  499. }
  500. else
  501. Refresh(p, c, (c->NumStats+3) >> 1, 0);
  502. for (; c != p->MinContext; c = SUFFIX(c))
  503. if (!c->NumStats)
  504. ONE_STATE(c)->Freq -= ONE_STATE(c)->Freq >> 1;
  505. else if ((c->SummFreq += 4) > 128 + 4 * c->NumStats)
  506. Refresh(p, c, (c->NumStats + 2) >> 1, 1);
  507. #ifdef PPMD8_FREEZE_SUPPORT
  508. if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
  509. {
  510. p->MaxContext = fSuccessor;
  511. p->GlueCount += !(p->Stamps[1] & 1);
  512. }
  513. else if (p->RestoreMethod == PPMD8_RESTORE_METHOD_FREEZE)
  514. {
  515. while (p->MaxContext->Suffix)
  516. p->MaxContext = SUFFIX(p->MaxContext);
  517. RemoveBinContexts(p, p->MaxContext, 0);
  518. p->RestoreMethod++;
  519. p->GlueCount = 0;
  520. p->OrderFall = p->MaxOrder;
  521. }
  522. else
  523. #endif
  524. if (p->RestoreMethod == PPMD8_RESTORE_METHOD_RESTART || GetUsedMemory(p) < (p->Size >> 1))
  525. RestartModel(p);
  526. else
  527. {
  528. while (p->MaxContext->Suffix)
  529. p->MaxContext = SUFFIX(p->MaxContext);
  530. do
  531. {
  532. CutOff(p, p->MaxContext, 0);
  533. ExpandTextArea(p);
  534. }
  535. while (GetUsedMemory(p) > 3 * (p->Size >> 2));
  536. p->GlueCount = 0;
  537. p->OrderFall = p->MaxOrder;
  538. }
  539. }
  540. static CTX_PTR CreateSuccessors(CPpmd8 *p, Bool skip, CPpmd_State *s1, CTX_PTR c)
  541. {
  542. CPpmd_State upState;
  543. Byte flags;
  544. CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
  545. /* fixed over Shkarin's code. Maybe it could work without + 1 too. */
  546. CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
  547. unsigned numPs = 0;
  548. if (!skip)
  549. ps[numPs++] = p->FoundState;
  550. while (c->Suffix)
  551. {
  552. CPpmd_Void_Ref successor;
  553. CPpmd_State *s;
  554. c = SUFFIX(c);
  555. if (s1)
  556. {
  557. s = s1;
  558. s1 = NULL;
  559. }
  560. else if (c->NumStats != 0)
  561. {
  562. for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++);
  563. if (s->Freq < MAX_FREQ - 9)
  564. {
  565. s->Freq++;
  566. c->SummFreq++;
  567. }
  568. }
  569. else
  570. {
  571. s = ONE_STATE(c);
  572. s->Freq += (!SUFFIX(c)->NumStats & (s->Freq < 24));
  573. }
  574. successor = SUCCESSOR(s);
  575. if (successor != upBranch)
  576. {
  577. c = CTX(successor);
  578. if (numPs == 0)
  579. return c;
  580. break;
  581. }
  582. ps[numPs++] = s;
  583. }
  584. upState.Symbol = *(const Byte *)Ppmd8_GetPtr(p, upBranch);
  585. SetSuccessor(&upState, upBranch + 1);
  586. flags = 0x10 * (p->FoundState->Symbol >= 0x40) + 0x08 * (upState.Symbol >= 0x40);
  587. if (c->NumStats == 0)
  588. upState.Freq = ONE_STATE(c)->Freq;
  589. else
  590. {
  591. UInt32 cf, s0;
  592. CPpmd_State *s;
  593. for (s = STATS(c); s->Symbol != upState.Symbol; s++);
  594. cf = s->Freq - 1;
  595. s0 = c->SummFreq - c->NumStats - cf;
  596. upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((cf + 2 * s0 - 3) / s0)));
  597. }
  598. do
  599. {
  600. /* Create Child */
  601. CTX_PTR c1; /* = AllocContext(p); */
  602. if (p->HiUnit != p->LoUnit)
  603. c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE);
  604. else if (p->FreeList[0] != 0)
  605. c1 = (CTX_PTR)RemoveNode(p, 0);
  606. else
  607. {
  608. c1 = (CTX_PTR)AllocUnitsRare(p, 0);
  609. if (!c1)
  610. return NULL;
  611. }
  612. c1->NumStats = 0;
  613. c1->Flags = flags;
  614. *ONE_STATE(c1) = upState;
  615. c1->Suffix = REF(c);
  616. SetSuccessor(ps[--numPs], REF(c1));
  617. c = c1;
  618. }
  619. while (numPs != 0);
  620. return c;
  621. }
  622. static CTX_PTR ReduceOrder(CPpmd8 *p, CPpmd_State *s1, CTX_PTR c)
  623. {
  624. CPpmd_State *s = NULL;
  625. CTX_PTR c1 = c;
  626. CPpmd_Void_Ref upBranch = REF(p->Text);
  627. #ifdef PPMD8_FREEZE_SUPPORT
  628. /* The BUG in Shkarin's code was fixed: ps could overflow in CUT_OFF mode. */
  629. CPpmd_State *ps[PPMD8_MAX_ORDER + 1];
  630. unsigned numPs = 0;
  631. ps[numPs++] = p->FoundState;
  632. #endif
  633. SetSuccessor(p->FoundState, upBranch);
  634. p->OrderFall++;
  635. for (;;)
  636. {
  637. if (s1)
  638. {
  639. c = SUFFIX(c);
  640. s = s1;
  641. s1 = NULL;
  642. }
  643. else
  644. {
  645. if (!c->Suffix)
  646. {
  647. #ifdef PPMD8_FREEZE_SUPPORT
  648. if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
  649. {
  650. do { SetSuccessor(ps[--numPs], REF(c)); } while (numPs);
  651. RESET_TEXT(1);
  652. p->OrderFall = 1;
  653. }
  654. #endif
  655. return c;
  656. }
  657. c = SUFFIX(c);
  658. if (c->NumStats)
  659. {
  660. if ((s = STATS(c))->Symbol != p->FoundState->Symbol)
  661. do { s++; } while (s->Symbol != p->FoundState->Symbol);
  662. if (s->Freq < MAX_FREQ - 9)
  663. {
  664. s->Freq += 2;
  665. c->SummFreq += 2;
  666. }
  667. }
  668. else
  669. {
  670. s = ONE_STATE(c);
  671. s->Freq += (s->Freq < 32);
  672. }
  673. }
  674. if (SUCCESSOR(s))
  675. break;
  676. #ifdef PPMD8_FREEZE_SUPPORT
  677. ps[numPs++] = s;
  678. #endif
  679. SetSuccessor(s, upBranch);
  680. p->OrderFall++;
  681. }
  682. #ifdef PPMD8_FREEZE_SUPPORT
  683. if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
  684. {
  685. c = CTX(SUCCESSOR(s));
  686. do { SetSuccessor(ps[--numPs], REF(c)); } while (numPs);
  687. RESET_TEXT(1);
  688. p->OrderFall = 1;
  689. return c;
  690. }
  691. else
  692. #endif
  693. if (SUCCESSOR(s) <= upBranch)
  694. {
  695. CTX_PTR successor;
  696. CPpmd_State *s1 = p->FoundState;
  697. p->FoundState = s;
  698. successor = CreateSuccessors(p, False, NULL, c);
  699. if (successor == NULL)
  700. SetSuccessor(s, 0);
  701. else
  702. SetSuccessor(s, REF(successor));
  703. p->FoundState = s1;
  704. }
  705. if (p->OrderFall == 1 && c1 == p->MaxContext)
  706. {
  707. SetSuccessor(p->FoundState, SUCCESSOR(s));
  708. p->Text--;
  709. }
  710. if (SUCCESSOR(s) == 0)
  711. return NULL;
  712. return CTX(SUCCESSOR(s));
  713. }
  714. static void UpdateModel(CPpmd8 *p)
  715. {
  716. CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
  717. CTX_PTR c;
  718. unsigned s0, ns, fFreq = p->FoundState->Freq;
  719. Byte flag, fSymbol = p->FoundState->Symbol;
  720. CPpmd_State *s = NULL;
  721. if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
  722. {
  723. c = SUFFIX(p->MinContext);
  724. if (c->NumStats == 0)
  725. {
  726. s = ONE_STATE(c);
  727. if (s->Freq < 32)
  728. s->Freq++;
  729. }
  730. else
  731. {
  732. s = STATS(c);
  733. if (s->Symbol != p->FoundState->Symbol)
  734. {
  735. do { s++; } while (s->Symbol != p->FoundState->Symbol);
  736. if (s[0].Freq >= s[-1].Freq)
  737. {
  738. SwapStates(&s[0], &s[-1]);
  739. s--;
  740. }
  741. }
  742. if (s->Freq < MAX_FREQ - 9)
  743. {
  744. s->Freq += 2;
  745. c->SummFreq += 2;
  746. }
  747. }
  748. }
  749. c = p->MaxContext;
  750. if (p->OrderFall == 0 && fSuccessor)
  751. {
  752. CTX_PTR cs = CreateSuccessors(p, True, s, p->MinContext);
  753. if (cs == 0)
  754. {
  755. SetSuccessor(p->FoundState, 0);
  756. RESTORE_MODEL(c, CTX(fSuccessor));
  757. }
  758. else
  759. {
  760. SetSuccessor(p->FoundState, REF(cs));
  761. p->MaxContext = cs;
  762. }
  763. return;
  764. }
  765. *p->Text++ = p->FoundState->Symbol;
  766. successor = REF(p->Text);
  767. if (p->Text >= p->UnitsStart)
  768. {
  769. RESTORE_MODEL(c, CTX(fSuccessor)); /* check it */
  770. return;
  771. }
  772. if (!fSuccessor)
  773. {
  774. CTX_PTR cs = ReduceOrder(p, s, p->MinContext);
  775. if (cs == NULL)
  776. {
  777. RESTORE_MODEL(c, 0);
  778. return;
  779. }
  780. fSuccessor = REF(cs);
  781. }
  782. else if ((Byte *)Ppmd8_GetPtr(p, fSuccessor) < p->UnitsStart)
  783. {
  784. CTX_PTR cs = CreateSuccessors(p, False, s, p->MinContext);
  785. if (cs == NULL)
  786. {
  787. RESTORE_MODEL(c, 0);
  788. return;
  789. }
  790. fSuccessor = REF(cs);
  791. }
  792. if (--p->OrderFall == 0)
  793. {
  794. successor = fSuccessor;
  795. p->Text -= (p->MaxContext != p->MinContext);
  796. }
  797. #ifdef PPMD8_FREEZE_SUPPORT
  798. else if (p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE)
  799. {
  800. successor = fSuccessor;
  801. RESET_TEXT(0);
  802. p->OrderFall = 0;
  803. }
  804. #endif
  805. s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - fFreq;
  806. flag = 0x08 * (fSymbol >= 0x40);
  807. for (; c != p->MinContext; c = SUFFIX(c))
  808. {
  809. unsigned ns1;
  810. UInt32 cf, sf;
  811. if ((ns1 = c->NumStats) != 0)
  812. {
  813. if ((ns1 & 1) != 0)
  814. {
  815. /* Expand for one UNIT */
  816. unsigned oldNU = (ns1 + 1) >> 1;
  817. unsigned i = U2I(oldNU);
  818. if (i != U2I(oldNU + 1))
  819. {
  820. void *ptr = AllocUnits(p, i + 1);
  821. void *oldPtr;
  822. if (!ptr)
  823. {
  824. RESTORE_MODEL(c, CTX(fSuccessor));
  825. return;
  826. }
  827. oldPtr = STATS(c);
  828. MyMem12Cpy(ptr, oldPtr, oldNU);
  829. InsertNode(p, oldPtr, i);
  830. c->Stats = STATS_REF(ptr);
  831. }
  832. }
  833. c->SummFreq = (UInt16)(c->SummFreq + (3 * ns1 + 1 < ns));
  834. }
  835. else
  836. {
  837. CPpmd_State *s = (CPpmd_State*)AllocUnits(p, 0);
  838. if (!s)
  839. {
  840. RESTORE_MODEL(c, CTX(fSuccessor));
  841. return;
  842. }
  843. *s = *ONE_STATE(c);
  844. c->Stats = REF(s);
  845. if (s->Freq < MAX_FREQ / 4 - 1)
  846. s->Freq <<= 1;
  847. else
  848. s->Freq = MAX_FREQ - 4;
  849. c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 2));
  850. }
  851. cf = 2 * fFreq * (c->SummFreq + 6);
  852. sf = (UInt32)s0 + c->SummFreq;
  853. if (cf < 6 * sf)
  854. {
  855. cf = 1 + (cf > sf) + (cf >= 4 * sf);
  856. c->SummFreq += 4;
  857. }
  858. else
  859. {
  860. cf = 4 + (cf > 9 * sf) + (cf > 12 * sf) + (cf > 15 * sf);
  861. c->SummFreq = (UInt16)(c->SummFreq + cf);
  862. }
  863. {
  864. CPpmd_State *s = STATS(c) + ns1 + 1;
  865. SetSuccessor(s, successor);
  866. s->Symbol = fSymbol;
  867. s->Freq = (Byte)cf;
  868. c->Flags |= flag;
  869. c->NumStats = (Byte)(ns1 + 1);
  870. }
  871. }
  872. p->MaxContext = p->MinContext = CTX(fSuccessor);
  873. }
  874. static void Rescale(CPpmd8 *p)
  875. {
  876. unsigned i, adder, sumFreq, escFreq;
  877. CPpmd_State *stats = STATS(p->MinContext);
  878. CPpmd_State *s = p->FoundState;
  879. {
  880. CPpmd_State tmp = *s;
  881. for (; s != stats; s--)
  882. s[0] = s[-1];
  883. *s = tmp;
  884. }
  885. escFreq = p->MinContext->SummFreq - s->Freq;
  886. s->Freq += 4;
  887. adder = (p->OrderFall != 0
  888. #ifdef PPMD8_FREEZE_SUPPORT
  889. || p->RestoreMethod > PPMD8_RESTORE_METHOD_FREEZE
  890. #endif
  891. );
  892. s->Freq = (Byte)((s->Freq + adder) >> 1);
  893. sumFreq = s->Freq;
  894. i = p->MinContext->NumStats;
  895. do
  896. {
  897. escFreq -= (++s)->Freq;
  898. s->Freq = (Byte)((s->Freq + adder) >> 1);
  899. sumFreq += s->Freq;
  900. if (s[0].Freq > s[-1].Freq)
  901. {
  902. CPpmd_State *s1 = s;
  903. CPpmd_State tmp = *s1;
  904. do
  905. s1[0] = s1[-1];
  906. while (--s1 != stats && tmp.Freq > s1[-1].Freq);
  907. *s1 = tmp;
  908. }
  909. }
  910. while (--i);
  911. if (s->Freq == 0)
  912. {
  913. unsigned numStats = p->MinContext->NumStats;
  914. unsigned n0, n1;
  915. do { i++; } while ((--s)->Freq == 0);
  916. escFreq += i;
  917. p->MinContext->NumStats = (Byte)(p->MinContext->NumStats - i);
  918. if (p->MinContext->NumStats == 0)
  919. {
  920. CPpmd_State tmp = *stats;
  921. tmp.Freq = (Byte)((2 * tmp.Freq + escFreq - 1) / escFreq);
  922. if (tmp.Freq > MAX_FREQ / 3)
  923. tmp.Freq = MAX_FREQ / 3;
  924. InsertNode(p, stats, U2I((numStats + 2) >> 1));
  925. p->MinContext->Flags = (p->MinContext->Flags & 0x10) + 0x08 * (tmp.Symbol >= 0x40);
  926. *(p->FoundState = ONE_STATE(p->MinContext)) = tmp;
  927. return;
  928. }
  929. n0 = (numStats + 2) >> 1;
  930. n1 = (p->MinContext->NumStats + 2) >> 1;
  931. if (n0 != n1)
  932. p->MinContext->Stats = STATS_REF(ShrinkUnits(p, stats, n0, n1));
  933. p->MinContext->Flags &= ~0x08;
  934. p->MinContext->Flags |= 0x08 * ((s = STATS(p->MinContext))->Symbol >= 0x40);
  935. i = p->MinContext->NumStats;
  936. do { p->MinContext->Flags |= 0x08*((++s)->Symbol >= 0x40); } while (--i);
  937. }
  938. p->MinContext->SummFreq = (UInt16)(sumFreq + escFreq - (escFreq >> 1));
  939. p->MinContext->Flags |= 0x4;
  940. p->FoundState = STATS(p->MinContext);
  941. }
  942. CPpmd_See *Ppmd8_MakeEscFreq(CPpmd8 *p, unsigned numMasked1, UInt32 *escFreq)
  943. {
  944. CPpmd_See *see;
  945. if (p->MinContext->NumStats != 0xFF)
  946. {
  947. see = p->See[p->NS2Indx[p->MinContext->NumStats + 2] - 3] +
  948. (p->MinContext->SummFreq > 11 * ((unsigned)p->MinContext->NumStats + 1)) +
  949. 2 * (2 * (unsigned)p->MinContext->NumStats <
  950. ((unsigned)SUFFIX(p->MinContext)->NumStats + numMasked1)) +
  951. p->MinContext->Flags;
  952. {
  953. unsigned r = (see->Summ >> see->Shift);
  954. see->Summ = (UInt16)(see->Summ - r);
  955. *escFreq = r + (r == 0);
  956. }
  957. }
  958. else
  959. {
  960. see = &p->DummySee;
  961. *escFreq = 1;
  962. }
  963. return see;
  964. }
  965. static void NextContext(CPpmd8 *p)
  966. {
  967. CTX_PTR c = CTX(SUCCESSOR(p->FoundState));
  968. if (p->OrderFall == 0 && (Byte *)c >= p->UnitsStart)
  969. p->MinContext = p->MaxContext = c;
  970. else
  971. {
  972. UpdateModel(p);
  973. p->MinContext = p->MaxContext;
  974. }
  975. }
  976. void Ppmd8_Update1(CPpmd8 *p)
  977. {
  978. CPpmd_State *s = p->FoundState;
  979. s->Freq += 4;
  980. p->MinContext->SummFreq += 4;
  981. if (s[0].Freq > s[-1].Freq)
  982. {
  983. SwapStates(&s[0], &s[-1]);
  984. p->FoundState = --s;
  985. if (s->Freq > MAX_FREQ)
  986. Rescale(p);
  987. }
  988. NextContext(p);
  989. }
  990. void Ppmd8_Update1_0(CPpmd8 *p)
  991. {
  992. p->PrevSuccess = (2 * p->FoundState->Freq >= p->MinContext->SummFreq);
  993. p->RunLength += p->PrevSuccess;
  994. p->MinContext->SummFreq += 4;
  995. if ((p->FoundState->Freq += 4) > MAX_FREQ)
  996. Rescale(p);
  997. NextContext(p);
  998. }
  999. void Ppmd8_UpdateBin(CPpmd8 *p)
  1000. {
  1001. p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 196));
  1002. p->PrevSuccess = 1;
  1003. p->RunLength++;
  1004. NextContext(p);
  1005. }
  1006. void Ppmd8_Update2(CPpmd8 *p)
  1007. {
  1008. p->MinContext->SummFreq += 4;
  1009. if ((p->FoundState->Freq += 4) > MAX_FREQ)
  1010. Rescale(p);
  1011. p->RunLength = p->InitRL;
  1012. UpdateModel(p);
  1013. p->MinContext = p->MaxContext;
  1014. }
  1015. /* H->I changes:
  1016. NS2Indx
  1017. GlewCount, and Glue method
  1018. BinSum
  1019. See / EscFreq
  1020. CreateSuccessors updates more suffix contexts
  1021. UpdateModel consts.
  1022. PrevSuccess Update
  1023. */