mirror of
https://github.com/claunia/cuetools.net.git
synced 2025-12-16 18:14:25 +00:00
initial checkin
This commit is contained in:
chudov
408
MAC_SDK/Source/MACLib/NewPredictor.cpp
Normal file
408
MAC_SDK/Source/MACLib/NewPredictor.cpp
Normal file
@@ -0,0 +1,408 @@
|
||||
#include "All.h"
|
||||
#include "APECompress.h"
|
||||
#include "NewPredictor.h"
|
||||
|
||||
/*****************************************************************************************
|
||||
CPredictorCompressNormal
|
||||
*****************************************************************************************/
|
||||
CPredictorCompressNormal::CPredictorCompressNormal(int nCompressionLevel)
|
||||
: IPredictorCompress(nCompressionLevel)
|
||||
{
|
||||
if (nCompressionLevel == COMPRESSION_LEVEL_FAST)
|
||||
{
|
||||
m_pNNFilter = NULL;
|
||||
m_pNNFilter1 = NULL;
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_NORMAL)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(16, 11, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter1 = NULL;
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_HIGH)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(64, 11, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter1 = NULL;
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_EXTRA_HIGH)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(256, 13, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter1 = new CNNFilter(32, 10, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_INSANE)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(1024 + 256, 15, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter1 = new CNNFilter(256, 13, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter2 = new CNNFilter(16, 11, MAC_VERSION_NUMBER);
|
||||
|
||||
}
|
||||
else
|
||||
{
|
||||
throw(1);
|
||||
}
|
||||
}
|
||||
|
||||
CPredictorCompressNormal::~CPredictorCompressNormal()
|
||||
{
|
||||
SAFE_DELETE(m_pNNFilter)
|
||||
SAFE_DELETE(m_pNNFilter1)
|
||||
SAFE_DELETE(m_pNNFilter2)
|
||||
}
|
||||
|
||||
int CPredictorCompressNormal::Flush()
|
||||
{
|
||||
if (m_pNNFilter) m_pNNFilter->Flush();
|
||||
if (m_pNNFilter1) m_pNNFilter1->Flush();
|
||||
if (m_pNNFilter2) m_pNNFilter2->Flush();
|
||||
|
||||
m_rbPrediction.Flush();
|
||||
m_rbAdapt.Flush();
|
||||
m_Stage1FilterA.Flush(); m_Stage1FilterB.Flush();
|
||||
|
||||
memset(m_aryM, 0, sizeof(m_aryM));
|
||||
|
||||
int * paryM = &m_aryM[8];
|
||||
paryM[0] = 360;
|
||||
paryM[-1] = 317;
|
||||
paryM[-2] = -109;
|
||||
paryM[-3] = 98;
|
||||
|
||||
m_nCurrentIndex = 0;
|
||||
|
||||
return ERROR_SUCCESS;
|
||||
}
|
||||
|
||||
int CPredictorCompressNormal::CompressValue(int nA, int nB)
|
||||
{
|
||||
// roll the buffers if necessary
|
||||
if (m_nCurrentIndex == WINDOW_BLOCKS)
|
||||
{
|
||||
m_rbPrediction.Roll(); m_rbAdapt.Roll();
|
||||
m_nCurrentIndex = 0;
|
||||
}
|
||||
|
||||
// stage 1: simple, non-adaptive order 1 prediction
|
||||
nA = m_Stage1FilterA.Compress(nA);
|
||||
nB = m_Stage1FilterB.Compress(nB);
|
||||
|
||||
// stage 2: adaptive offset filter(s)
|
||||
m_rbPrediction[0] = nA;
|
||||
m_rbPrediction[-2] = m_rbPrediction[-1] - m_rbPrediction[-2];
|
||||
|
||||
m_rbPrediction[-5] = nB;
|
||||
m_rbPrediction[-6] = m_rbPrediction[-5] - m_rbPrediction[-6];
|
||||
|
||||
int * paryM = &m_aryM[8];
|
||||
|
||||
int nPredictionA = (m_rbPrediction[-1] * paryM[0]) + (m_rbPrediction[-2] * paryM[-1]) + (m_rbPrediction[-3] * paryM[-2]) + (m_rbPrediction[-4] * paryM[-3]);
|
||||
int nPredictionB = (m_rbPrediction[-5] * paryM[-4]) + (m_rbPrediction[-6] * paryM[-5]) + (m_rbPrediction[-7] * paryM[-6]) + (m_rbPrediction[-8] * paryM[-7]) + (m_rbPrediction[-9] * paryM[-8]);
|
||||
|
||||
int nOutput = nA - ((nPredictionA + (nPredictionB >> 1)) >> 10);
|
||||
|
||||
// adapt
|
||||
m_rbAdapt[0] = (m_rbPrediction[-1]) ? ((m_rbPrediction[-1] >> 30) & 2) - 1 : 0;
|
||||
m_rbAdapt[-1] = (m_rbPrediction[-2]) ? ((m_rbPrediction[-2] >> 30) & 2) - 1 : 0;
|
||||
m_rbAdapt[-4] = (m_rbPrediction[-5]) ? ((m_rbPrediction[-5] >> 30) & 2) - 1 : 0;
|
||||
m_rbAdapt[-5] = (m_rbPrediction[-6]) ? ((m_rbPrediction[-6] >> 30) & 2) - 1 : 0;
|
||||
|
||||
if (nOutput > 0)
|
||||
{
|
||||
int * pM = &paryM[-8]; int * pAdapt = &m_rbAdapt[-8];
|
||||
EXPAND_9_TIMES(*pM++ -= *pAdapt++;)
|
||||
}
|
||||
else if (nOutput < 0)
|
||||
{
|
||||
int * pM = &paryM[-8]; int * pAdapt = &m_rbAdapt[-8];
|
||||
EXPAND_9_TIMES(*pM++ += *pAdapt++;)
|
||||
}
|
||||
|
||||
// stage 3: NNFilters
|
||||
if (m_pNNFilter)
|
||||
{
|
||||
nOutput = m_pNNFilter->Compress(nOutput);
|
||||
|
||||
if (m_pNNFilter1)
|
||||
{
|
||||
nOutput = m_pNNFilter1->Compress(nOutput);
|
||||
|
||||
if (m_pNNFilter2)
|
||||
nOutput = m_pNNFilter2->Compress(nOutput);
|
||||
}
|
||||
}
|
||||
|
||||
m_rbPrediction.IncrementFast(); m_rbAdapt.IncrementFast();
|
||||
m_nCurrentIndex++;
|
||||
|
||||
return nOutput;
|
||||
}
|
||||
|
||||
/*****************************************************************************************
|
||||
CPredictorDecompressNormal3930to3950
|
||||
*****************************************************************************************/
|
||||
CPredictorDecompressNormal3930to3950::CPredictorDecompressNormal3930to3950(int nCompressionLevel, int nVersion)
|
||||
: IPredictorDecompress(nCompressionLevel, nVersion)
|
||||
{
|
||||
m_pBuffer[0] = new int [HISTORY_ELEMENTS + WINDOW_BLOCKS];
|
||||
|
||||
if (nCompressionLevel == COMPRESSION_LEVEL_FAST)
|
||||
{
|
||||
m_pNNFilter = NULL;
|
||||
m_pNNFilter1 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_NORMAL)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(16, 11, nVersion);
|
||||
m_pNNFilter1 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_HIGH)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(64, 11, nVersion);
|
||||
m_pNNFilter1 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_EXTRA_HIGH)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(256, 13, nVersion);
|
||||
m_pNNFilter1 = new CNNFilter(32, 10, nVersion);
|
||||
}
|
||||
else
|
||||
{
|
||||
throw(1);
|
||||
}
|
||||
}
|
||||
|
||||
CPredictorDecompressNormal3930to3950::~CPredictorDecompressNormal3930to3950()
|
||||
{
|
||||
SAFE_DELETE(m_pNNFilter)
|
||||
SAFE_DELETE(m_pNNFilter1)
|
||||
SAFE_ARRAY_DELETE(m_pBuffer[0])
|
||||
}
|
||||
|
||||
int CPredictorDecompressNormal3930to3950::Flush()
|
||||
{
|
||||
if (m_pNNFilter) m_pNNFilter->Flush();
|
||||
if (m_pNNFilter1) m_pNNFilter1->Flush();
|
||||
|
||||
ZeroMemory(m_pBuffer[0], (HISTORY_ELEMENTS + 1) * sizeof(int));
|
||||
ZeroMemory(&m_aryM[0], M_COUNT * sizeof(int));
|
||||
|
||||
m_aryM[0] = 360;
|
||||
m_aryM[1] = 317;
|
||||
m_aryM[2] = -109;
|
||||
m_aryM[3] = 98;
|
||||
|
||||
m_pInputBuffer = &m_pBuffer[0][HISTORY_ELEMENTS];
|
||||
|
||||
m_nLastValue = 0;
|
||||
m_nCurrentIndex = 0;
|
||||
|
||||
return ERROR_SUCCESS;
|
||||
}
|
||||
|
||||
int CPredictorDecompressNormal3930to3950::DecompressValue(int nInput, int)
|
||||
{
|
||||
if (m_nCurrentIndex == WINDOW_BLOCKS)
|
||||
{
|
||||
// copy forward and adjust pointers
|
||||
memcpy(&m_pBuffer[0][0], &m_pBuffer[0][WINDOW_BLOCKS], HISTORY_ELEMENTS * sizeof(int));
|
||||
m_pInputBuffer = &m_pBuffer[0][HISTORY_ELEMENTS];
|
||||
|
||||
m_nCurrentIndex = 0;
|
||||
}
|
||||
|
||||
// stage 2: NNFilter
|
||||
if (m_pNNFilter1)
|
||||
nInput = m_pNNFilter1->Decompress(nInput);
|
||||
if (m_pNNFilter)
|
||||
nInput = m_pNNFilter->Decompress(nInput);
|
||||
|
||||
// stage 1: multiple predictors (order 2 and offset 1)
|
||||
|
||||
int p1 = m_pInputBuffer[-1];
|
||||
int p2 = m_pInputBuffer[-1] - m_pInputBuffer[-2];
|
||||
int p3 = m_pInputBuffer[-2] - m_pInputBuffer[-3];
|
||||
int p4 = m_pInputBuffer[-3] - m_pInputBuffer[-4];
|
||||
|
||||
m_pInputBuffer[0] = nInput + (((p1 * m_aryM[0]) + (p2 * m_aryM[1]) + (p3 * m_aryM[2]) + (p4 * m_aryM[3])) >> 9);
|
||||
|
||||
if (nInput > 0)
|
||||
{
|
||||
m_aryM[0] -= ((p1 >> 30) & 2) - 1;
|
||||
m_aryM[1] -= ((p2 >> 30) & 2) - 1;
|
||||
m_aryM[2] -= ((p3 >> 30) & 2) - 1;
|
||||
m_aryM[3] -= ((p4 >> 30) & 2) - 1;
|
||||
}
|
||||
else if (nInput < 0)
|
||||
{
|
||||
m_aryM[0] += ((p1 >> 30) & 2) - 1;
|
||||
m_aryM[1] += ((p2 >> 30) & 2) - 1;
|
||||
m_aryM[2] += ((p3 >> 30) & 2) - 1;
|
||||
m_aryM[3] += ((p4 >> 30) & 2) - 1;
|
||||
}
|
||||
|
||||
int nRetVal = m_pInputBuffer[0] + ((m_nLastValue * 31) >> 5);
|
||||
m_nLastValue = nRetVal;
|
||||
|
||||
m_nCurrentIndex++;
|
||||
m_pInputBuffer++;
|
||||
|
||||
return nRetVal;
|
||||
}
|
||||
|
||||
/*****************************************************************************************
|
||||
CPredictorDecompress3950toCurrent
|
||||
*****************************************************************************************/
|
||||
CPredictorDecompress3950toCurrent::CPredictorDecompress3950toCurrent(int nCompressionLevel, int nVersion)
|
||||
: IPredictorDecompress(nCompressionLevel, nVersion)
|
||||
{
|
||||
m_nVersion = nVersion;
|
||||
|
||||
if (nCompressionLevel == COMPRESSION_LEVEL_FAST)
|
||||
{
|
||||
m_pNNFilter = NULL;
|
||||
m_pNNFilter1 = NULL;
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_NORMAL)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(16, 11, nVersion);
|
||||
m_pNNFilter1 = NULL;
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_HIGH)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(64, 11, nVersion);
|
||||
m_pNNFilter1 = NULL;
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_EXTRA_HIGH)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(256, 13, nVersion);
|
||||
m_pNNFilter1 = new CNNFilter(32, 10, nVersion);
|
||||
m_pNNFilter2 = NULL;
|
||||
}
|
||||
else if (nCompressionLevel == COMPRESSION_LEVEL_INSANE)
|
||||
{
|
||||
m_pNNFilter = new CNNFilter(1024 + 256, 15, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter1 = new CNNFilter(256, 13, MAC_VERSION_NUMBER);
|
||||
m_pNNFilter2 = new CNNFilter(16, 11, MAC_VERSION_NUMBER);
|
||||
|
||||
}
|
||||
else
|
||||
{
|
||||
throw(1);
|
||||
}
|
||||
}
|
||||
|
||||
CPredictorDecompress3950toCurrent::~CPredictorDecompress3950toCurrent()
|
||||
{
|
||||
SAFE_DELETE(m_pNNFilter)
|
||||
SAFE_DELETE(m_pNNFilter1)
|
||||
SAFE_DELETE(m_pNNFilter2)
|
||||
}
|
||||
|
||||
int CPredictorDecompress3950toCurrent::Flush()
|
||||
{
|
||||
if (m_pNNFilter) m_pNNFilter->Flush();
|
||||
if (m_pNNFilter1) m_pNNFilter1->Flush();
|
||||
if (m_pNNFilter2) m_pNNFilter2->Flush();
|
||||
|
||||
ZeroMemory(m_aryMA, sizeof(m_aryMA));
|
||||
ZeroMemory(m_aryMB, sizeof(m_aryMB));
|
||||
|
||||
m_rbPredictionA.Flush();
|
||||
m_rbPredictionB.Flush();
|
||||
m_rbAdaptA.Flush();
|
||||
m_rbAdaptB.Flush();
|
||||
|
||||
m_aryMA[0] = 360;
|
||||
m_aryMA[1] = 317;
|
||||
m_aryMA[2] = -109;
|
||||
m_aryMA[3] = 98;
|
||||
|
||||
m_Stage1FilterA.Flush();
|
||||
m_Stage1FilterB.Flush();
|
||||
|
||||
m_nLastValueA = 0;
|
||||
|
||||
m_nCurrentIndex = 0;
|
||||
|
||||
return ERROR_SUCCESS;
|
||||
}
|
||||
|
||||
int CPredictorDecompress3950toCurrent::DecompressValue(int nA, int nB)
|
||||
{
|
||||
if (m_nCurrentIndex == WINDOW_BLOCKS)
|
||||
{
|
||||
// copy forward and adjust pointers
|
||||
m_rbPredictionA.Roll(); m_rbPredictionB.Roll();
|
||||
m_rbAdaptA.Roll(); m_rbAdaptB.Roll();
|
||||
|
||||
m_nCurrentIndex = 0;
|
||||
}
|
||||
|
||||
// stage 2: NNFilter
|
||||
if (m_pNNFilter2)
|
||||
nA = m_pNNFilter2->Decompress(nA);
|
||||
if (m_pNNFilter1)
|
||||
nA = m_pNNFilter1->Decompress(nA);
|
||||
if (m_pNNFilter)
|
||||
nA = m_pNNFilter->Decompress(nA);
|
||||
|
||||
// stage 1: multiple predictors (order 2 and offset 1)
|
||||
m_rbPredictionA[0] = m_nLastValueA;
|
||||
m_rbPredictionA[-1] = m_rbPredictionA[0] - m_rbPredictionA[-1];
|
||||
|
||||
m_rbPredictionB[0] = m_Stage1FilterB.Compress(nB);
|
||||
m_rbPredictionB[-1] = m_rbPredictionB[0] - m_rbPredictionB[-1];
|
||||
|
||||
int nPredictionA = (m_rbPredictionA[0] * m_aryMA[0]) + (m_rbPredictionA[-1] * m_aryMA[1]) + (m_rbPredictionA[-2] * m_aryMA[2]) + (m_rbPredictionA[-3] * m_aryMA[3]);
|
||||
int nPredictionB = (m_rbPredictionB[0] * m_aryMB[0]) + (m_rbPredictionB[-1] * m_aryMB[1]) + (m_rbPredictionB[-2] * m_aryMB[2]) + (m_rbPredictionB[-3] * m_aryMB[3]) + (m_rbPredictionB[-4] * m_aryMB[4]);
|
||||
|
||||
int nCurrentA = nA + ((nPredictionA + (nPredictionB >> 1)) >> 10);
|
||||
|
||||
m_rbAdaptA[0] = (m_rbPredictionA[0]) ? ((m_rbPredictionA[0] >> 30) & 2) - 1 : 0;
|
||||
m_rbAdaptA[-1] = (m_rbPredictionA[-1]) ? ((m_rbPredictionA[-1] >> 30) & 2) - 1 : 0;
|
||||
|
||||
m_rbAdaptB[0] = (m_rbPredictionB[0]) ? ((m_rbPredictionB[0] >> 30) & 2) - 1 : 0;
|
||||
m_rbAdaptB[-1] = (m_rbPredictionB[-1]) ? ((m_rbPredictionB[-1] >> 30) & 2) - 1 : 0;
|
||||
|
||||
if (nA > 0)
|
||||
{
|
||||
m_aryMA[0] -= m_rbAdaptA[0];
|
||||
m_aryMA[1] -= m_rbAdaptA[-1];
|
||||
m_aryMA[2] -= m_rbAdaptA[-2];
|
||||
m_aryMA[3] -= m_rbAdaptA[-3];
|
||||
|
||||
m_aryMB[0] -= m_rbAdaptB[0];
|
||||
m_aryMB[1] -= m_rbAdaptB[-1];
|
||||
m_aryMB[2] -= m_rbAdaptB[-2];
|
||||
m_aryMB[3] -= m_rbAdaptB[-3];
|
||||
m_aryMB[4] -= m_rbAdaptB[-4];
|
||||
}
|
||||
else if (nA < 0)
|
||||
{
|
||||
m_aryMA[0] += m_rbAdaptA[0];
|
||||
m_aryMA[1] += m_rbAdaptA[-1];
|
||||
m_aryMA[2] += m_rbAdaptA[-2];
|
||||
m_aryMA[3] += m_rbAdaptA[-3];
|
||||
|
||||
m_aryMB[0] += m_rbAdaptB[0];
|
||||
m_aryMB[1] += m_rbAdaptB[-1];
|
||||
m_aryMB[2] += m_rbAdaptB[-2];
|
||||
m_aryMB[3] += m_rbAdaptB[-3];
|
||||
m_aryMB[4] += m_rbAdaptB[-4];
|
||||
}
|
||||
|
||||
int nRetVal = m_Stage1FilterA.Decompress(nCurrentA);
|
||||
m_nLastValueA = nCurrentA;
|
||||
|
||||
m_rbPredictionA.IncrementFast(); m_rbPredictionB.IncrementFast();
|
||||
m_rbAdaptA.IncrementFast(); m_rbAdaptB.IncrementFast();
|
||||
|
||||
m_nCurrentIndex++;
|
||||
|
||||
return nRetVal;
|
||||
}
|
||||
Reference in New Issue
Block a user