b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#include <string.h>

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#if defined(SHOW_STAT) || defined(SHOW_STAT2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#include <stdio.h>

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#include "LzmaEnc.h"

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#include "LzFind.h"

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#ifdef COMPRESS_MF_MT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#include "LzFindMt.h"

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#ifdef SHOW_STAT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic int ttt = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kBlockSizeMax ((1 << LZMA_NUM_BLOCK_SIZE_BITS) - 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kBlockSize (9 << 10)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kUnpackBlockSize (1 << 18)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kMatchArraySize (1 << 21)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kMatchRecordMaxSize ((LZMA_MATCH_LEN_MAX * 2 + 3) * LZMA_MATCH_LEN_MAX)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumMaxDirectBits (31)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumTopBits 24

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kTopValue ((UInt32)1 << kNumTopBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumBitModelTotalBits 11

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kBitModelTotal (1 << kNumBitModelTotalBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumMoveBits 5

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kProbInitValue (kBitModelTotal >> 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumMoveReducingBits 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumBitPriceShiftBits 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kBitPrice (1 << kNumBitPriceShiftBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalvoid LzmaEncProps_Init(CLzmaEncProps *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->level = 5;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->dictSize = p->mc = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->lc = p->lp = p->pb = p->algo = p->fb = p->btMode = p->numHashBytes = p->numThreads = -1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->writeEndMark = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalvoid LzmaEncProps_Normalize(CLzmaEncProps *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int level = p->level;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (level < 0) level = 5;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->level = level;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->dictSize == 0) p->dictSize = (level <= 5 ? (1 << (level * 2 + 14)) : (level == 6 ? (1 << 25) : (1 << 26)));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->lc < 0) p->lc = 3;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->lp < 0) p->lp = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->pb < 0) p->pb = 2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->algo < 0) p->algo = (level < 5 ? 0 : 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->fb < 0) p->fb = (level < 7 ? 32 : 64);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->btMode < 0) p->btMode = (p->algo == 0 ? 0 : 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->numHashBytes < 0) p->numHashBytes = 4;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->mc == 0) p->mc = (16 + (p->fb >> 1)) >> (p->btMode ? 0 : 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->numThreads < 0) p->numThreads = ((p->btMode && p->algo) ? 2 : 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok AggarwalUInt32 LzmaEncProps_GetDictSize(const CLzmaEncProps *props2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaEncProps props = *props2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LzmaEncProps_Normalize(&props);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return props.dictSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#ifdef LZMA_LOG_BSR

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kDicLogSizeMaxCompress 30

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define BSR2_RET(pos, res) { unsigned long i; _BitScanReverse(&i, (pos)); res = (i + i) + ((pos >> (i - 1)) & 1); }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok AggarwalUInt32 GetPosSlot1(UInt32 pos)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 res;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal BSR2_RET(pos, res);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return res;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GetPosSlot2(pos, res) { BSR2_RET(pos, res); }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GetPosSlot(pos, res) { if (pos < 2) res = pos; else BSR2_RET(pos, res); }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumLogBits (9 + (int)sizeof(size_t) / 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kDicLogSizeMaxCompress ((kNumLogBits - 1) * 2 + 7)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalvoid LzmaEnc_FastPosInit(Byte *g_FastPos)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int c = 2, slotFast;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal g_FastPos[0] = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal g_FastPos[1] = 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (slotFast = 2; slotFast < kNumLogBits * 2; slotFast++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 k = (1 << ((slotFast >> 1) - 1));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 j;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (j = 0; j < k; j++, c++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal g_FastPos[c] = (Byte)slotFast;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define BSR2_RET(pos, res) { UInt32 i = 6 + ((kNumLogBits - 1) & \

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal (0 - (((((UInt32)1 << (kNumLogBits + 6)) - 1) - pos) >> 31))); \

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal res = p->g_FastPos[pos >> i] + (i * 2); }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GetPosSlot1(pos) p->g_FastPos[pos]

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GetPosSlot2(pos, res) { BSR2_RET(pos, res); }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GetPosSlot(pos, res) { if (pos < kNumFullDistances) res = p->g_FastPos[pos]; else BSR2_RET(pos, res); }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_NUM_REPS 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef unsigned CState;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct _COptimal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CState state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int prev1IsChar;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int prev2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 posPrev2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 backPrev2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 backPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 backs[LZMA_NUM_REPS];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} COptimal;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumOpts (1 << 12)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumLenToPosStates 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumPosSlotBits 6

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kDicLogSizeMin 0

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kDicLogSizeMax 32

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kDistTableSizeMax (kDicLogSizeMax * 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumAlignBits 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kAlignTableSize (1 << kNumAlignBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kAlignMask (kAlignTableSize - 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kStartPosModelIndex 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kEndPosModelIndex 14

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumPosModels (kEndPosModelIndex - kStartPosModelIndex)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumFullDistances (1 << (kEndPosModelIndex / 2))

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#ifdef _LZMA_PROB32

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define CLzmaProb UInt32

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define CLzmaProb UInt16

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_PB_MAX 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_LC_MAX 8

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_LP_MAX 4

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_NUM_PB_STATES_MAX (1 << LZMA_PB_MAX)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumLowBits 3

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumLowSymbols (1 << kLenNumLowBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumMidBits 3

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumMidSymbols (1 << kLenNumMidBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumHighBits 8

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumHighSymbols (1 << kLenNumHighBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kLenNumSymbolsTotal (kLenNumLowSymbols + kLenNumMidSymbols + kLenNumHighSymbols)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_MATCH_LEN_MIN 2

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LZMA_MATCH_LEN_MAX (LZMA_MATCH_LEN_MIN + kLenNumSymbolsTotal - 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kNumStates 12

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb choice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb choice2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb low[LZMA_NUM_PB_STATES_MAX << kLenNumLowBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb mid[LZMA_NUM_PB_STATES_MAX << kLenNumMidBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb high[kLenNumHighSymbols];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} CLenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLenEnc p;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 prices[LZMA_NUM_PB_STATES_MAX][kLenNumSymbolsTotal];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 tableSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 counters[LZMA_NUM_PB_STATES_MAX];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} CLenPriceEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct _CRangeEnc

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 range;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte cache;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt64 low;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt64 cacheSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte *buf;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte *bufLim;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte *bufBase;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ISeqOutStream *outStream;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt64 processed;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal SRes res;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} CRangeEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct _CSeqInStreamBuf

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ISeqInStream funcTable;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const Byte *data;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal SizeT rem;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} CSeqInStreamBuf;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic SRes MyRead(void *pp, void *data, size_t *size)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal size_t curSize = *size;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CSeqInStreamBuf *p = (CSeqInStreamBuf *)pp;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->rem < curSize)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal curSize = p->rem;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(data, p->data, curSize);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->rem -= curSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->data += curSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *size = curSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return SZ_OK;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb *litProbs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRep[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRepG0[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRepG1[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRepG2[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb posSlotEncoder[kNumLenToPosStates][1 << kNumPosSlotBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb posEncoders[kNumFullDistances - kEndPosModelIndex];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb posAlignEncoder[1 << kNumAlignBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLenPriceEnc lenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLenPriceEnc repLenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 reps[LZMA_NUM_REPS];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} CSaveState;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwaltypedef struct _CLzmaEnc

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal IMatchFinder matchFinder;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal void *matchFinderObj;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifdef COMPRESS_MF_MT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Bool mtMode;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CMatchFinderMt matchFinderMt;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CMatchFinder matchFinderBase;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifdef COMPRESS_MF_MT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte pad[128];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 optimumEndIndex;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 optimumCurrentIndex;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 longestMatchLength;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numPairs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numAvail;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal COptimal opt[kNumOpts];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifndef LZMA_LOG_BSR

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte g_FastPos[1 << kNumLogBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 matches[LZMA_MATCH_LEN_MAX * 2 + 2 + 1];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numFastBytes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 additionalOffset;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 reps[LZMA_NUM_REPS];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 posSlotPrices[kNumLenToPosStates][kDistTableSizeMax];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 distancesPrices[kNumLenToPosStates][kNumFullDistances];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 alignPrices[kAlignTableSize];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 alignPriceCount;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 distTableSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal unsigned lc, lp, pb;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal unsigned lpMask, pbMask;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb *litProbs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRep[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRepG0[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRepG1[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRepG2[kNumStates];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb posSlotEncoder[kNumLenToPosStates][1 << kNumPosSlotBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb posEncoders[kNumFullDistances - kEndPosModelIndex];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaProb posAlignEncoder[1 << kNumAlignBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLenPriceEnc lenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLenPriceEnc repLenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal unsigned lclp;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Bool fastMode;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CRangeEnc rc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Bool writeEndMark;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt64 nowPos64;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 matchPriceCount;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Bool finished;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Bool multiThread;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal SRes result;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 dictSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 matchFinderCycles;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ISeqInStream *inStream;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CSeqInStreamBuf seqBufInStream;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CSaveState saveState;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal} CLzmaEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalvoid LzmaEnc_SaveState(CLzmaEncHandle pp)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaEnc *p = (CLzmaEnc *)pp;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CSaveState *dest = &p->saveState;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal dest->lenEnc = p->lenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal dest->repLenEnc = p->repLenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal dest->state = p->state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < kNumStates; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isMatch[i], p->isMatch[i], sizeof(p->isMatch[i]));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRep0Long[i], p->isRep0Long[i], sizeof(p->isRep0Long[i]));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < kNumLenToPosStates; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->posSlotEncoder[i], p->posSlotEncoder[i], sizeof(p->posSlotEncoder[i]));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRep, p->isRep, sizeof(p->isRep));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRepG0, p->isRepG0, sizeof(p->isRepG0));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRepG1, p->isRepG1, sizeof(p->isRepG1));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRepG2, p->isRepG2, sizeof(p->isRepG2));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->posEncoders, p->posEncoders, sizeof(p->posEncoders));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->posAlignEncoder, p->posAlignEncoder, sizeof(p->posAlignEncoder));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->reps, p->reps, sizeof(p->reps));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->litProbs, p->litProbs, (0x300 << p->lclp) * sizeof(CLzmaProb));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalvoid LzmaEnc_RestoreState(CLzmaEncHandle pp)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaEnc *dest = (CLzmaEnc *)pp;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const CSaveState *p = &dest->saveState;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal dest->lenEnc = p->lenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal dest->repLenEnc = p->repLenEnc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal dest->state = p->state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < kNumStates; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isMatch[i], p->isMatch[i], sizeof(p->isMatch[i]));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRep0Long[i], p->isRep0Long[i], sizeof(p->isRep0Long[i]));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < kNumLenToPosStates; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->posSlotEncoder[i], p->posSlotEncoder[i], sizeof(p->posSlotEncoder[i]));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRep, p->isRep, sizeof(p->isRep));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRepG0, p->isRepG0, sizeof(p->isRepG0));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRepG1, p->isRepG1, sizeof(p->isRepG1));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->isRepG2, p->isRepG2, sizeof(p->isRepG2));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->posEncoders, p->posEncoders, sizeof(p->posEncoders));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->posAlignEncoder, p->posAlignEncoder, sizeof(p->posAlignEncoder));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->reps, p->reps, sizeof(p->reps));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal memcpy(dest->litProbs, p->litProbs, (0x300 << dest->lclp) * sizeof(CLzmaProb));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok AggarwalSRes LzmaEnc_SetProps(CLzmaEncHandle pp, const CLzmaEncProps *props2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaEnc *p = (CLzmaEnc *)pp;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal CLzmaEncProps props = *props2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LzmaEncProps_Normalize(&props);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (props.lc > LZMA_LC_MAX || props.lp > LZMA_LP_MAX || props.pb > LZMA_PB_MAX ||

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal props.dictSize > (1 << kDicLogSizeMaxCompress) || props.dictSize > (1 << 30))

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return SZ_ERROR_PARAM;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->dictSize = props.dictSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->matchFinderCycles = props.mc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal unsigned fb = props.fb;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (fb < 5)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal fb = 5;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (fb > LZMA_MATCH_LEN_MAX)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal fb = LZMA_MATCH_LEN_MAX;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->numFastBytes = fb;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->lc = props.lc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->lp = props.lp;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->pb = props.pb;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->fastMode = (props.algo == 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->matchFinderBase.btMode = props.btMode;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numHashBytes = 4;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (props.btMode)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (props.numHashBytes < 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numHashBytes = 2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else if (props.numHashBytes < 4)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numHashBytes = props.numHashBytes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->matchFinderBase.numHashBytes = numHashBytes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->matchFinderBase.cutValue = props.mc;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->writeEndMark = props.writeEndMark;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifdef COMPRESS_MF_MT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal /*

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->multiThread = (props.numThreads > 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return SZ_OK;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic const int kLiteralNextStates[kNumStates] = {0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5};

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic const int kMatchNextStates[kNumStates] = {7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10};

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic const int kRepNextStates[kNumStates] = {8, 8, 8, 8, 8, 8, 8, 11, 11, 11, 11, 11};

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic const int kShortRepNextStates[kNumStates]= {9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11};

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define IsCharState(s) ((s) < 7)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GetLenToPosState(len) (((len) < kNumLenToPosStates + 1) ? (len) - 2 : kNumLenToPosStates - 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define kInfinityPrice (1 << 30)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_Construct(CRangeEnc *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->outStream = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->bufBase = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define RangeEnc_GetProcessed(p) ((p)->processed + ((p)->buf - (p)->bufBase) + (p)->cacheSize)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define RC_BUF_SIZE (1 << 16)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic int RangeEnc_Alloc(CRangeEnc *p, ISzAlloc *alloc)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->bufBase == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->bufBase = (Byte *)alloc->Alloc(alloc, RC_BUF_SIZE);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->bufBase == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->bufLim = p->bufBase + RC_BUF_SIZE;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_Free(CRangeEnc *p, ISzAlloc *alloc)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal alloc->Free(alloc, p->bufBase, 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->bufBase = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_Init(CRangeEnc *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal /* Stream.Init(); */

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->low = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->range = 0xFFFFFFFF;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->cacheSize = 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->cache = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->buf = p->bufBase;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->processed = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->res = SZ_OK;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_FlushStream(CRangeEnc *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal size_t num;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->res != SZ_OK)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal num = p->buf - p->bufBase;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (num != p->outStream->Write(p->outStream, p->bufBase, num))

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->res = SZ_ERROR_WRITE;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->processed += num;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->buf = p->bufBase;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void MY_FAST_CALL RangeEnc_ShiftLow(CRangeEnc *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if ((UInt32)p->low < (UInt32)0xFF000000 || (int)(p->low >> 32) != 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte temp = p->cache;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte *buf = p->buf;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *buf++ = (Byte)(temp + (Byte)(p->low >> 32));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->buf = buf;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (buf == p->bufLim)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_FlushStream(p);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal temp = 0xFF;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (--p->cacheSize != 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->cache = (Byte)((UInt32)p->low >> 24);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->cacheSize++;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->low = (UInt32)p->low << 8;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_FlushData(CRangeEnc *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < 5; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_ShiftLow(p);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_EncodeDirectBits(CRangeEnc *p, UInt32 value, int numBits)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->range >>= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->low += p->range & (0 - ((value >> --numBits) & 1));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->range < kTopValue)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->range <<= 8;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_ShiftLow(p);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (numBits != 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RangeEnc_EncodeBit(CRangeEnc *p, CLzmaProb *prob, UInt32 symbol)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 ttt = *prob;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 newBound = (p->range >> kNumBitModelTotalBits) * ttt;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (symbol == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->range = newBound;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ttt += (kBitModelTotal - ttt) >> kNumMoveBits;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->low += newBound;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->range -= newBound;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ttt -= ttt >> kNumMoveBits;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *prob = (CLzmaProb)ttt;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->range < kTopValue)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->range <<= 8;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_ShiftLow(p);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol |= 0x100;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (symbol < 0x10000);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 offs = 0x100;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol |= 0x100;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal matchByte <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal offs &= ~(matchByte ^ symbol);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (symbol < 0x10000);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalvoid LzmaEnc_InitPriceTables(UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits))

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const int kCyclesBits = kNumBitPriceShiftBits;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 w = i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 bitCount = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int j;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (j = 0; j < kCyclesBits; j++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal w = w * w;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal bitCount <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (w >= ((UInt32)1 << 16))

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal w >>= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal bitCount++;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ProbPrices[i >> kNumMoveReducingBits] = ((kNumBitModelTotalBits << kCyclesBits) - 15 - bitCount);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GET_PRICE(prob, symbol) \

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GET_PRICEa(prob, symbol) \

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GET_PRICE_0(prob) p->ProbPrices[(prob) >> kNumMoveReducingBits]

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GET_PRICE_0a(prob) ProbPrices[(prob) >> kNumMoveReducingBits]

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol |= 0x100;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (symbol < 0x10000);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 offs = 0x100;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol |= 0x100;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal matchByte <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol <<= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal offs &= ~(matchByte ^ symbol);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (symbol < 0x10000);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 m = 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = numBitLevels; i != 0;)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 bit;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal i--;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal bit = (symbol >> i) & 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(rc, probs + m, bit);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal m = (m << 1) | bit;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void RcTree_ReverseEncode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 m = 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < numBitLevels; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 bit = symbol & 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(rc, probs + m, bit);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal m = (m << 1) | bit;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol >>= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 RcTree_GetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol |= (1 << numBitLevels);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (symbol != 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICEa(probs[symbol >> 1], symbol & 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol >>= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 RcTree_ReverseGetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 m = 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal int i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = numBitLevels; i != 0; i--)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 bit = symbol & 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal symbol >>= 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICEa(probs[m], bit);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal m = (m << 1) | bit;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LenEnc_Init(CLenEnc *p)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal unsigned i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->choice = p->choice2 = kProbInitValue;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < (LZMA_NUM_PB_STATES_MAX << kLenNumLowBits); i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->low[i] = kProbInitValue;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < (LZMA_NUM_PB_STATES_MAX << kLenNumMidBits); i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->mid[i] = kProbInitValue;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < kLenNumHighSymbols; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->high[i] = kProbInitValue;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LenEnc_Encode(CLenEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (symbol < kLenNumLowSymbols)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(rc, &p->choice, 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RcTree_Encode(rc, p->low + (posState << kLenNumLowBits), kLenNumLowBits, symbol);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(rc, &p->choice, 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (symbol < kLenNumLowSymbols + kLenNumMidSymbols)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(rc, &p->choice2, 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RcTree_Encode(rc, p->mid + (posState << kLenNumMidBits), kLenNumMidBits, symbol - kLenNumLowSymbols);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RangeEnc_EncodeBit(rc, &p->choice2, 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal RcTree_Encode(rc, p->high, kLenNumHighBits, symbol - kLenNumLowSymbols - kLenNumMidSymbols);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LenEnc_SetPrices(CLenEnc *p, UInt32 posState, UInt32 numSymbols, UInt32 *prices, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 a0 = GET_PRICE_0a(p->choice);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 a1 = GET_PRICE_1a(p->choice);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 b0 = a1 + GET_PRICE_0a(p->choice2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 b1 = a1 + GET_PRICE_1a(p->choice2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 i = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < kLenNumLowSymbols; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (i >= numSymbols)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal prices[i] = a0 + RcTree_GetPrice(p->low + (posState << kLenNumLowBits), kLenNumLowBits, i, ProbPrices);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (; i < kLenNumLowSymbols + kLenNumMidSymbols; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (i >= numSymbols)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal prices[i] = b0 + RcTree_GetPrice(p->mid + (posState << kLenNumMidBits), kLenNumMidBits, i - kLenNumLowSymbols, ProbPrices);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (; i < numSymbols; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal prices[i] = b1 + RcTree_GetPrice(p->high, kLenNumHighBits, i - kLenNumLowSymbols - kLenNumMidSymbols, ProbPrices);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void MY_FAST_CALL LenPriceEnc_UpdateTable(CLenPriceEnc *p, UInt32 posState, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LenEnc_SetPrices(&p->p, posState, p->tableSize, p->prices[posState], ProbPrices);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->counters[posState] = p->tableSize;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LenPriceEnc_UpdateTables(CLenPriceEnc *p, UInt32 numPosStates, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 posState;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (posState = 0; posState < numPosStates; posState++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LenPriceEnc_UpdateTable(p, posState, ProbPrices);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void LenEnc_Encode2(CLenPriceEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState, Bool updatePrice, UInt32 *ProbPrices)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LenEnc_Encode(&p->p, rc, symbol, posState);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (updatePrice)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (--p->counters[posState] == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LenPriceEnc_UpdateTable(p, posState, ProbPrices);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic void MovePos(CLzmaEnc *p, UInt32 num)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifdef SHOW_STAT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ttt += num;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal printf("\n MovePos %d", num);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (num != 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->additionalOffset += num;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->matchFinder.Skip(p->matchFinderObj, num);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 ReadMatchDistances(CLzmaEnc *p, UInt32 *numDistancePairsRes)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 lenRes = 0, numPairs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->numAvail = p->matchFinder.GetNumAvailableBytes(p->matchFinderObj);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numPairs = p->matchFinder.GetMatches(p->matchFinderObj, p->matches);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifdef SHOW_STAT

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal printf("\n i = %d numPairs = %d ", ttt, numPairs / 2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal ttt++;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < numPairs; i += 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal printf("%2d %6d | ", p->matches[i], p->matches[i + 1]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (numPairs > 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal lenRes = p->matches[numPairs - 2];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (lenRes == p->numFastBytes)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const Byte *pby = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 distance = p->matches[numPairs - 1] + 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numAvail = p->numAvail;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (numAvail > LZMA_MATCH_LEN_MAX)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numAvail = LZMA_MATCH_LEN_MAX;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const Byte *pby2 = pby - distance;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (; lenRes < numAvail && pby[lenRes] == pby2[lenRes]; lenRes++);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->additionalOffset++;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *numDistancePairsRes = numPairs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return lenRes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define MakeAsChar(p) (p)->backPrev = (UInt32)(-1); (p)->prev1IsChar = False;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define MakeAsShortRep(p) (p)->backPrev = 0; (p)->prev1IsChar = False;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define IsShortRep(p) ((p)->backPrev == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 GetRepLen1Price(CLzmaEnc *p, UInt32 state, UInt32 posState)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal GET_PRICE_0(p->isRepG0[state]) +

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal GET_PRICE_0(p->isRep0Long[state][posState]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 GetPureRepPrice(CLzmaEnc *p, UInt32 repIndex, UInt32 state, UInt32 posState)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (repIndex == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price = GET_PRICE_0(p->isRepG0[state]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICE_1(p->isRep0Long[state][posState]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price = GET_PRICE_1(p->isRepG0[state]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (repIndex == 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICE_0(p->isRepG1[state]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICE_1(p->isRepG1[state]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price += GET_PRICE(p->isRepG2[state], repIndex - 2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 GetRepPrice(CLzmaEnc *p, UInt32 repIndex, UInt32 len, UInt32 state, UInt32 posState)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return p->repLenEnc.prices[posState][len - LZMA_MATCH_LEN_MIN] +

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal GetPureRepPrice(p, repIndex, state, posState);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 Backward(CLzmaEnc *p, UInt32 *backRes, UInt32 cur)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 posMem = p->opt[cur].posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 backMem = p->opt[cur].backPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->optimumEndIndex = cur;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->opt[cur].prev1IsChar)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal MakeAsChar(&p->opt[posMem])

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[posMem].posPrev = posMem - 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->opt[cur].prev2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[posMem - 1].prev1IsChar = False;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[posMem - 1].posPrev = p->opt[cur].posPrev2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[posMem - 1].backPrev = p->opt[cur].backPrev2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 posPrev = posMem;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 backCur = backMem;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal backMem = p->opt[posPrev].backPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal posMem = p->opt[posPrev].posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[posPrev].backPrev = backCur;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[posPrev].posPrev = cur;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal cur = posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (cur != 0);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = p->opt[0].backPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->optimumCurrentIndex = p->opt[0].posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return p->optimumCurrentIndex;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal}

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal#define LIT_PROBS(pos, prevByte) (p->litProbs + ((((pos) & p->lpMask) << p->lc) + ((prevByte) >> (8 - p->lc))) * 0x300)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwalstatic UInt32 GetOptimum(CLzmaEnc *p, UInt32 position, UInt32 *backRes)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal{

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 matchPrice, repMatchPrice, normalMatchPrice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 reps[LZMA_NUM_REPS], repLens[LZMA_NUM_REPS];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 *matches;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const Byte *data;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte curByte, matchByte;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->optimumEndIndex != p->optimumCurrentIndex)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const COptimal *opt = &p->opt[p->optimumCurrentIndex];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 lenRes = opt->posPrev - p->optimumCurrentIndex;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = opt->backPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->optimumCurrentIndex = opt->posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return lenRes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->optimumCurrentIndex = p->optimumEndIndex = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (p->additionalOffset == 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal mainLen = ReadMatchDistances(p, &numPairs);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal mainLen = p->longestMatchLength;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numPairs = p->numPairs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numAvail = p->numAvail;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (numAvail < 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = (UInt32)(-1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (numAvail > LZMA_MATCH_LEN_MAX)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal numAvail = LZMA_MATCH_LEN_MAX;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal repMaxIndex = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < LZMA_NUM_REPS; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 lenTest;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const Byte *data2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal reps[i] = p->reps[i];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal data2 = data - (reps[i] + 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (data[0] != data2[0] || data[1] != data2[1])

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal repLens[i] = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal continue;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal repLens[i] = lenTest;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (lenTest > repLens[repMaxIndex])

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal repMaxIndex = i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (repLens[repMaxIndex] >= p->numFastBytes)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 lenRes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = repMaxIndex;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal lenRes = repLens[repMaxIndex];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal MovePos(p, lenRes - 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return lenRes;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal matches = p->matches;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (mainLen >= p->numFastBytes)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = matches[numPairs - 1] + LZMA_NUM_REPS;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal MovePos(p, mainLen - 1);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return mainLen;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal curByte = *data;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal matchByte = *(data - (reps[0] + 1));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (mainLen < 2 && curByte != matchByte && repLens[repMaxIndex] < 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = (UInt32)-1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[0].state = (CState)p->state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal posState = (position & p->pbMask);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const CLzmaProb *probs = LIT_PROBS(position, *(data - 1));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) +

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal (!IsCharState(p->state) ?

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LitEnc_GetPriceMatched(probs, curByte, matchByte, p->ProbPrices) :

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal LitEnc_GetPrice(probs, curByte, p->ProbPrices));

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal MakeAsChar(&p->opt[1]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal matchPrice = GET_PRICE_1(p->isMatch[p->state][posState]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal repMatchPrice = matchPrice + GET_PRICE_1(p->isRep[p->state]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (matchByte == curByte)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 shortRepPrice = repMatchPrice + GetRepLen1Price(p, p->state, posState);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (shortRepPrice < p->opt[1].price)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[1].price = shortRepPrice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal MakeAsShortRep(&p->opt[1]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (lenEnd < 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal *backRes = p->opt[1].backPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return 1;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[1].posPrev = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < LZMA_NUM_REPS; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[0].backs[i] = reps[i];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal len = lenEnd;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->opt[len--].price = kInfinityPrice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (len >= 2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = 0; i < LZMA_NUM_REPS; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 repLen = repLens[i];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 price;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (repLen < 2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal continue;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal price = repMatchPrice + GetPureRepPrice(p, i, p->state, posState);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal do

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][repLen - 2];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal COptimal *opt = &p->opt[repLen];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (curAndLenPrice < opt->price)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->price = curAndLenPrice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->posPrev = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->backPrev = i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->prev1IsChar = False;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (--repLen >= 2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal normalMatchPrice = matchPrice + GET_PRICE_0(p->isRep[p->state]);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal len = ((repLens[0] >= 2) ? repLens[0] + 1 : 2);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (len <= mainLen)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 offs = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal while (len > matches[offs])

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal offs += 2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (; ; len++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal COptimal *opt;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 distance = matches[offs + 1];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 curAndLenPrice = normalMatchPrice + p->lenEnc.prices[posState][len - LZMA_MATCH_LEN_MIN];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 lenToPosState = GetLenToPosState(len);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (distance < kNumFullDistances)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal curAndLenPrice += p->distancesPrices[lenToPosState][distance];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 slot;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal GetPosSlot2(distance, slot);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal curAndLenPrice += p->alignPrices[distance & kAlignMask] + p->posSlotPrices[lenToPosState][slot];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt = &p->opt[len];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (curAndLenPrice < opt->price)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->price = curAndLenPrice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->posPrev = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->backPrev = distance + LZMA_NUM_REPS;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal opt->prev1IsChar = False;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (len == matches[offs])

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal offs += 2;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (offs == numPairs)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal break;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal cur = 0;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #ifdef SHOW_STAT2

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (position >= 0)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal unsigned i;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal printf("\n pos = %4X", position);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (i = cur; i <= lenEnd; i++)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal printf("\nprice[%4X] = %d", position - cur + i, p->opt[i].price);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal #endif

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal for (;;)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 curPrice, curAnd1Price, matchPrice, repMatchPrice;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Bool nextIsChar;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal Byte curByte, matchByte;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const Byte *data;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal COptimal *curOpt;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal COptimal *nextOpt;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal cur++;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (cur == lenEnd)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return Backward(p, backRes, cur);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal newLen = ReadMatchDistances(p, &numPairs);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (newLen >= p->numFastBytes)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->numPairs = numPairs;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal p->longestMatchLength = newLen;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal return Backward(p, backRes, cur);

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal position++;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal curOpt = &p->opt[cur];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal posPrev = curOpt->posPrev;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (curOpt->prev1IsChar)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal posPrev--;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (curOpt->prev2)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = p->opt[curOpt->posPrev2].state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (curOpt->backPrev2 < LZMA_NUM_REPS)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = kRepNextStates[state];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = kMatchNextStates[state];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = p->opt[posPrev].state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = kLiteralNextStates[state];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = p->opt[posPrev].state;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (posPrev == cur - 1)

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal if (IsShortRep(curOpt))

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = kShortRepNextStates[state];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal state = kLiteralNextStates[state];

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal }

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal else

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal {

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal UInt32 pos;

b1efbcd6740f24e4bce347c64e48d9b74b472c67Alok Aggarwal const COptimal *prevOpt;