Skip to content

TFG-Alberto
TFG-Alberto
Commit ff10c667 authored by Alberto Gonzalez's avatar Alberto Gonzalez
Browse files
Options

Commit concept fork 

```--------------------------------------------------------------
Código funcionando para 4 threads
```

--------------------------------------------------------------
parent b8cc94aa
Show whitespace changes
Inline Side-by-side
Showing with 223 additions and 233 deletions
source/Lib/EncoderLib/EncCu.cpp
View file @ ff10c667
...@@ -72,64 +72,59 @@ ...@@ -72,64 +72,59 @@
//! \ingroup EncoderLib //! \ingroup EncoderLib
//! \{ //! \{
//ALBERTO CONCEPT FORK
//CONTROL CENTER
bool singleMode = false;
//COMENTAR LA SIGUIENTE DIRECTIVA PARA ELIMINAR MENSAJES DE DEBUG
//#define DEBUG_MESSAGE
#define TIME_MESSAGE
#define IGNORE_CHILD_BUFFER_WARNING
//CONTROL CENTER
//END ALBERTO CONCEPT FORK
//ALBERTO //ALBERTO
#ifdef TIME_MESSAGE
int EncCu::seconds = 0; int EncCu::seconds = 0;
int EncCu::iter = 0; int EncCu::iter = 0;
#endif
//END ALBERTO //END ALBERTO
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//CONTROL CENTER //VARIABLES GLOBALES
bool singleMode = false;
bool debugMessage = true;
//CONTROL CENTER
//GLOBAL VARIABLES
vectorModeCostStruct* vector; //VECTOR OF PROCESSING RESULTS vectorModeCostStruct* vector; //VECTOR OF PROCESSING RESULTS
bool father; //TRUE IF THE PROCESS IS NOT A CHILD bool father; //TRUE IF THE PROCESS IS NOT A CHILD
int threadNumber; //NUMBER OF THREAD IF WE ARE IN A CHILD int threadNumber; //NUMBER OF THREAD IF WE ARE IN A CHILD
int posActualNode = 0; //NODE THAT IS BEING PROCESSED int posActualNode = 0; //NODE THAT IS BEING PROCESSED
bool ignore_vector; //IGNORE THE VECTOR IF WE ARE UNDER A SPLIT THAT IS NOT QUATERNARY //bool ignore_vector; //IGNORE THE VECTOR IF WE ARE UNDER A SPLIT THAT IS NOT QUATERNARY
int NumberOfThreads = 6; //NUMBER OF THREADS CREATED //int NumberOfThreads = 4; //NUMBER OF THREADS CREATED
int repartLevelNumber = 0; //NUMBER IN WHICH THREAD REPART IS PERFORMED //int repartLevelNumber = 0; //NUMBER IN WHICH THREAD REPART IS PERFORMED
//GLOBAL VARIABLES //VARIABLES GLOBALES
//TOSTRING_VECTOR //TO_STRING VECTOR DE MODOS Y COSTE
#ifdef DEBUG_MESSAGE
void toStringVector() void toStringVector()
{ {
for (int i = 0; i < VECTOR_SIZE && debugMessage; i++) { for (int i = 0; i < VECTOR_SIZE; i++) {
std::cout << vector[i].mode << ", "; std::cout << vector[i].mode << ", ";
std::cout << vector[i].cost << std::endl; std::cout << vector[i].cost << std::endl;
} }
} }
void toStringVector(double Level) void toStringVector(int level)
{ {
int end = 0; int end = 0;
for(int i=Level-1; i>-1 && debugMessage; i--) for(int i=level-1; i>-1; i--)
{ {
end += pow(4,i); end += pow(4,i);
} }
for (int i = 0; i < end && debugMessage; i++) { for (int i = 0; i < end; i++) {
std::cout << vector[i].posFather << ", "; std::cout << vector[i].posFather << ", ";
std::cout << vector[i].threadNumber << ", "; std::cout << vector[i].threadNumber << ", ";
std::cout << vector[i].mode << ", "; std::cout << vector[i].mode << ", ";
std::cout << vector[i].cost << std::endl; std::cout << vector[i].cost << std::endl;
} }
} }
void toStringVector(int Level) #endif
{ //TO_STRING VECTOR DE MODOS Y COSTE
int end = 0;
for(int i=Level-1; i>-1 && debugMessage; i--)
{
end += pow(4,i);
}
for (int i = 0; i < end && debugMessage; i++) {
std::cout << vector[i].posFather << ", ";
std::cout << vector[i].threadNumber << std::endl;
}
}
//TOSTRING_VECTOR
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
// ==================================================================================================================== // ====================================================================================================================
...@@ -285,7 +280,6 @@ void EncCu::destroy() ...@@ -285,7 +280,6 @@ void EncCu::destroy()
} }
#endif #endif
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//sem_destroy(sem);
munmap(vector, VECTOR_BYTES); munmap(vector, VECTOR_BYTES);
shm_unlink("/myshm"); shm_unlink("/myshm");
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
...@@ -294,59 +288,20 @@ void EncCu::destroy() ...@@ -294,59 +288,20 @@ void EncCu::destroy()
EncCu::~EncCu() EncCu::~EncCu()
{ {
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//sem_destroy(sem);
munmap(vector, VECTOR_BYTES); munmap(vector, VECTOR_BYTES);
shm_unlink("/myshm"); shm_unlink("/myshm");
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
} }
/** \param pcEncLib pointer of encoder class
*/
void EncCu::init( EncLib* pcEncLib, const SPS& sps )
{
m_pcEncCfg = pcEncLib;
m_pcIntraSearch = pcEncLib->getIntraSearch();
m_pcInterSearch = pcEncLib->getInterSearch();
m_pcTrQuant = pcEncLib->getTrQuant();
m_pcRdCost = pcEncLib->getRdCost ();
m_CABACEstimator = pcEncLib->getCABACEncoder()->getCABACEstimator( &sps );
m_CABACEstimator->setEncCu(this);
m_ctxPool = pcEncLib->getCtxCache();
m_pcRateCtrl = pcEncLib->getRateCtrl();
m_pcSliceEncoder = pcEncLib->getSliceEncoder();
m_deblockingFilter = pcEncLib->getDeblockingFilter();
m_geoCostList.init(m_pcEncCfg->getMaxNumGeoCand());
m_AFFBestSATDCost = MAX_DOUBLE;
DecCu::init( m_pcTrQuant, m_pcIntraSearch, m_pcInterSearch );
m_modeCtrl->init( m_pcEncCfg, m_pcRateCtrl, m_pcRdCost );
m_modeCtrl->setBIMQPMap( m_pcEncCfg->getAdaptQPmap() );
m_pcInterSearch->setModeCtrl( m_modeCtrl );
m_modeCtrl->setInterSearch(m_pcInterSearch);
m_pcIntraSearch->setModeCtrl( m_modeCtrl );
m_pcGOPEncoder = pcEncLib->getGOPEncoder();
m_pcGOPEncoder->setModeCtrl( m_modeCtrl );
//ALBERTO CONCEPT FORK
// Crear memoria compartida para el vector
createSharedVector();
//Rellenar el vector
initStructVector();
toStringVector(5); //IMPRIMIR 5 (TODOS) LOS NIVELES
//END ALBERTO CONCEPT
}
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//FUNCIONES AUXILIARES DE init()
void EncCu::createSharedVector() void EncCu::createSharedVector()
{ {
int fd = shm_open("/myshm", O_CREAT | O_RDWR, 0666); int fd = shm_open("/myshm", O_CREAT | O_RDWR, 0666);
ftruncate(fd, VECTOR_BYTES + sizeof(sem_t)); ftruncate(fd, VECTOR_BYTES + sizeof(sem_t));
vector = (vectorModeCostStruct*) mmap(NULL, VECTOR_BYTES, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0); vector = (vectorModeCostStruct*) mmap(NULL, VECTOR_BYTES, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
} }
void EncCu::repartLevel() /*void EncCu::repartLevel()
{ {
for(int i=0; i<5; i++) for(int i=0; i<5; i++)
{ {
...@@ -357,8 +312,8 @@ void EncCu::repartLevel() ...@@ -357,8 +312,8 @@ void EncCu::repartLevel()
} }
} }
} }*/
int EncCu::repartStart() /*int EncCu::repartStart()
{ {
int repartStartNode = 0; int repartStartNode = 0;
for(int i=0; i<= repartLevelNumber-1; i++) for(int i=0; i<= repartLevelNumber-1; i++)
...@@ -366,8 +321,8 @@ int EncCu::repartStart() ...@@ -366,8 +321,8 @@ int EncCu::repartStart()
repartStartNode += levelValues[i]; repartStartNode += levelValues[i];
} }
return repartStartNode; return repartStartNode;
} }*/
int EncCu::repartEnd() /*int EncCu::repartEnd()
{ {
int repartEndNode = -1; int repartEndNode = -1;
for(int i=0; i<= repartLevelNumber; i++) for(int i=0; i<= repartLevelNumber; i++)
...@@ -375,15 +330,15 @@ int EncCu::repartEnd() ...@@ -375,15 +330,15 @@ int EncCu::repartEnd()
repartEndNode += levelValues[i]; repartEndNode += levelValues[i];
} }
return repartEndNode; return repartEndNode;
} }*/
void EncCu::initStructVectorBeforeRepartStart(int repartStartNode) /*void EncCu::initStructVectorBeforeRepartStart(int repartStartNode)
{ {
for(int i=0; i<repartStartNode; i++) for(int i=0; i<repartStartNode; i++)
{ {
vector[0].threadNumber=1; vector[0].threadNumber=1;
} }
} }*/
int EncCu::thread1NumberOfChild(int numberOfNodesPerThread) /*int EncCu::thread1NumberOfChild(int numberOfNodesPerThread)
{ {
int thread1ChildNumber = -1; int thread1ChildNumber = -1;
if(NumberOfThreads*numberOfNodesPerThread<levelValues[repartLevelNumber])//AJUSTE ACOMETIDO A FAVOR DEL THREAD 1 if(NumberOfThreads*numberOfNodesPerThread<levelValues[repartLevelNumber])//AJUSTE ACOMETIDO A FAVOR DEL THREAD 1
...@@ -391,21 +346,21 @@ int EncCu::thread1NumberOfChild(int numberOfNodesPerThread) ...@@ -391,21 +346,21 @@ int EncCu::thread1NumberOfChild(int numberOfNodesPerThread)
thread1ChildNumber = levelValues[repartLevelNumber]-NumberOfThreads*numberOfNodesPerThread; thread1ChildNumber = levelValues[repartLevelNumber]-NumberOfThreads*numberOfNodesPerThread;
} }
return thread1ChildNumber; return thread1ChildNumber;
} }*/
void EncCu::initStructVector() void EncCu::initStructVector()
{ {
vector[0].posFather=-1; vector[0].posFather=-1;
vector[0].threadNumber=1; vector[0].threadNumber=1;
//Rellenar antes de reparto //Rellenar antes de reparto
repartLevel(); //repartLevel();
int repartStartNode = repartStart(); //int repartStartNode = repartStart();
//int repartEndNode = repartEnd(); //int repartEndNode = repartEnd();
initStructVectorBeforeRepartStart(repartStartNode); //initStructVectorBeforeRepartStart(repartStartNode);
int numberOfNodesPerThread = levelValues[repartLevelNumber] / NumberOfThreads; //int numberOfNodesPerThread = levelValues[repartLevelNumber] / NumberOfThreads;
numberOfNodesPerThread = numberOfNodesPerThread==0?1:numberOfNodesPerThread; //numberOfNodesPerThread = numberOfNodesPerThread==0?1:numberOfNodesPerThread;
int thread1ChildNumber = thread1NumberOfChild(numberOfNodesPerThread); //int thread1ChildNumber = thread1NumberOfChild(numberOfNodesPerThread);
int childCounter = 1; //int childCounter = 1;
int threadNumber = 1; //int threadNumber = 1;
for (int i = 0; i < VECTOR_SIZE; i++) for (int i = 0; i < VECTOR_SIZE; i++)
{ {
vector[i].mode=-1; vector[i].mode=-1;
...@@ -413,25 +368,25 @@ void EncCu::initStructVector() ...@@ -413,25 +368,25 @@ void EncCu::initStructVector()
int posPadreActual = i; int posPadreActual = i;
if(posPadreActual==(LEVEL0-1)) //Estamos en el nivel 0, el padre realiza el reparto de threads if(posPadreActual==(LEVEL0-1)) //Estamos en el nivel 0, el padre realiza el reparto de threads
{ {
updateFatherAndThreadNumbersLevel0(posPadreActual,thread1ChildNumber,numberOfNodesPerThread); updateFatherAndThreadNumbersLevel0(posPadreActual);//,thread1ChildNumber,numberOfNodesPerThread);
} }
else if(posPadreActual>=(LEVEL0) && posPadreActual<=(LEVEL1)) //Estamos en el nivel 1 else if(posPadreActual>=(LEVEL0) && posPadreActual<=(LEVEL1)) //Estamos en el nivel 1
{ {
updateFatherAndThreadNumbers(0,1,posPadreActual,i,1,childCounter,thread1ChildNumber,threadNumber,numberOfNodesPerThread); updateFatherAndThreadNumbers(0,1,posPadreActual,i);//,1,childCounter,thread1ChildNumber,threadNumber,numberOfNodesPerThread);
} }
else if(posPadreActual>=(LEVEL1+LEVEL0) && posPadreActual<=(LEVEL2+LEVEL1)) //Estamos en el nivel 2 else if(posPadreActual>=(LEVEL1+LEVEL0) && posPadreActual<=(LEVEL2+LEVEL1)) //Estamos en el nivel 2
{ {
updateFatherAndThreadNumbers(1,2,posPadreActual,i,2,childCounter,thread1ChildNumber,threadNumber,numberOfNodesPerThread); updateFatherAndThreadNumbers(1,2,posPadreActual,i);//,2,childCounter,thread1ChildNumber,threadNumber,numberOfNodesPerThread);
} }
else if(posPadreActual>=(LEVEL2+LEVEL1+LEVEL0) && posPadreActual<=(LEVEL3+LEVEL2+LEVEL1)) //Estamos en el nivel 3 else if(posPadreActual>=(LEVEL2+LEVEL1+LEVEL0) && posPadreActual<=(LEVEL3+LEVEL2+LEVEL1)) //Estamos en el nivel 3
{ {
updateFatherAndThreadNumbers(2,3,posPadreActual,i,3,childCounter,thread1ChildNumber,threadNumber,numberOfNodesPerThread); updateFatherAndThreadNumbers(2,3,posPadreActual,i);//,3,childCounter,thread1ChildNumber,threadNumber,numberOfNodesPerThread);
} }
} }
} }
void EncCu::updateFatherAndThreadNumbersLevel0(int posPadreActual, int thread1ChildNumber, int numberOfNodesPerThread) void EncCu::updateFatherAndThreadNumbersLevel0(int posPadreActual)//, int thread1ChildNumber, int numberOfNodesPerThread)
{ {
if(repartLevelNumber==1) //Estamos en el nivel 0, el padre realiza el reparto de threads /*if(repartLevelNumber==1) //Estamos en el nivel 0, el padre realiza el reparto de threads
{ {
int salto = 1; int salto = 1;
int threadNumber = 1; int threadNumber = 1;
...@@ -456,7 +411,7 @@ void EncCu::updateFatherAndThreadNumbersLevel0(int posPadreActual, int thread1Ch ...@@ -456,7 +411,7 @@ void EncCu::updateFatherAndThreadNumbersLevel0(int posPadreActual, int thread1Ch
} }
} }
else else
{ {*/
int salto = 1; int salto = 1;
int threadNumber = 1; int threadNumber = 1;
int start = posPadreActual+salto; int start = posPadreActual+salto;
...@@ -465,12 +420,13 @@ void EncCu::updateFatherAndThreadNumbersLevel0(int posPadreActual, int thread1Ch ...@@ -465,12 +420,13 @@ void EncCu::updateFatherAndThreadNumbersLevel0(int posPadreActual, int thread1Ch
{ {
vector[j].posFather=posPadreActual; vector[j].posFather=posPadreActual;
vector[j].threadNumber=threadNumber; vector[j].threadNumber=threadNumber;
threadNumber++;
} }
} //}
} }
void EncCu::updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, int posPadreActual, int i, int LevelActualIndex, int& childCounter,int thread1ChildNumber, int& threadNumber, int numberOfNodesPerThread) void EncCu::updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, int posPadreActual, int i)//, int LevelActualIndex, int& childCounter,int thread1ChildNumber, int& threadNumber, int numberOfNodesPerThread)
{ {
if(LevelActualIndex+1 == repartLevelNumber) //SI ESTAMOS EN EL PADRE DEL NIVEL DONDE SE HACE EL REPARTO /*if(LevelActualIndex+1 == repartLevelNumber) //SI ESTAMOS EN EL PADRE DEL NIVEL DONDE SE HACE EL REPARTO
{ {
int LevelLow = 0; int LevelLow = 0;
int LevelUp = levelValues[LevelUpIndex]; int LevelUp = levelValues[LevelUpIndex];
...@@ -502,7 +458,7 @@ void EncCu::updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, in ...@@ -502,7 +458,7 @@ void EncCu::updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, in
} }
else else
{ {*/
int LevelLow = 0; int LevelLow = 0;
int LevelUp = levelValues[LevelUpIndex]; int LevelUp = levelValues[LevelUpIndex];
for(int j=LevelLowIndex; j>-1;j--) for(int j=LevelLowIndex; j>-1;j--)
...@@ -519,20 +475,98 @@ void EncCu::updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, in ...@@ -519,20 +475,98 @@ void EncCu::updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, in
vector[j].posFather=posPadreActual; vector[j].posFather=posPadreActual;
vector[j].threadNumber=threadNumber; vector[j].threadNumber=threadNumber;
} }
//}
}
//END ALBERTO CONCEPT FORK
/** \param pcEncLib pointer of encoder class
*/
void EncCu::init( EncLib* pcEncLib, const SPS& sps )
{
m_pcEncCfg = pcEncLib;
m_pcIntraSearch = pcEncLib->getIntraSearch();
m_pcInterSearch = pcEncLib->getInterSearch();
m_pcTrQuant = pcEncLib->getTrQuant();
m_pcRdCost = pcEncLib->getRdCost ();
m_CABACEstimator = pcEncLib->getCABACEncoder()->getCABACEstimator( &sps );
m_CABACEstimator->setEncCu(this);
m_ctxPool = pcEncLib->getCtxCache();
m_pcRateCtrl = pcEncLib->getRateCtrl();
m_pcSliceEncoder = pcEncLib->getSliceEncoder();
m_deblockingFilter = pcEncLib->getDeblockingFilter();
m_geoCostList.init(m_pcEncCfg->getMaxNumGeoCand());
m_AFFBestSATDCost = MAX_DOUBLE;
DecCu::init( m_pcTrQuant, m_pcIntraSearch, m_pcInterSearch );
m_modeCtrl->init( m_pcEncCfg, m_pcRateCtrl, m_pcRdCost );
m_modeCtrl->setBIMQPMap( m_pcEncCfg->getAdaptQPmap() );
m_pcInterSearch->setModeCtrl( m_modeCtrl );
m_modeCtrl->setInterSearch(m_pcInterSearch);
m_pcIntraSearch->setModeCtrl( m_modeCtrl );
m_pcGOPEncoder = pcEncLib->getGOPEncoder();
m_pcGOPEncoder->setModeCtrl( m_modeCtrl );
//ALBERTO CONCEPT FORK
// Crear memoria compartida para el vector
createSharedVector();
//Rellenar el vector
initStructVector();
#ifdef DEBUG_MESSAGE
toStringVector(5); //IMPRIMIR 5 (TODOS) LOS NIVELES
#endif //DEBUG_MESSAGE
//END ALBERTO CONCEPT
}
// ====================================================================================================================
// Public member functions
// ====================================================================================================================
//ALBERTO CONCEPT FORK
//FUNCIONES AUXILIARES compressCtuForks()
void EncCu::reduceVector()
{
for(int i=VECTOR_SIZE-1 ; (i-4)>=0 ; i=i-4)
{
int valueChild_1 = vector[i-3].cost;
int valueChild_2 = vector[i-2].cost;
int valueChild_3 = vector[i-1].cost;
int valueChild_4 = vector[i].cost;
if(valueChild_1==-1 || valueChild_2==-1 || valueChild_3==-1 || valueChild_4==-1)
{
continue;
}
else
{
int childSum = valueChild_1 + valueChild_2 + valueChild_3 + valueChild_4;
int posFather = vector[i].posFather;
int costFather = vector[posFather].cost;
int modeFather = vector[posFather].mode;
if(costFather <= childSum && modeFather!=ETM_SPLIT_QT)
{
vector[i-3].cost = vector[i-2].cost = vector[i-1].cost = vector[i].cost = -1;
vector[i-3].mode = vector[i-2].mode = vector[i-1].mode = vector[i].mode = -1;
}
else if(costFather > childSum && modeFather!=ETM_SPLIT_QT)
{
vector[posFather].cost = childSum;
vector[posFather].mode = ETM_SPLIT_QT;
}
}
} }
} }
void EncCu::cleanCostModeVector() void EncCu::cleanCostModeVector()
{ {
for(int i=0; i<VECTOR_SIZE; i++) for(int i=0; i<VECTOR_SIZE; i++)
{ {
vector[i].cost = vector[i].mode = -1; vector[i].cost = -1;
vector[i].mode = -1;
} }
} }
//END ALBERTO CONCEPT FORK
// ==================================================================================================================== //END ALBERTO CONCEPT FORK
// Public member functions
// ====================================================================================================================
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
void EncCu::compressCtuForks(CodingStructure*& tempCS, CodingStructure*& bestCS, Partitioner& partitioner) void EncCu::compressCtuForks(CodingStructure*& tempCS, CodingStructure*& bestCS, Partitioner& partitioner)
...@@ -544,24 +578,31 @@ void EncCu::compressCtuForks(CodingStructure*& tempCS, CodingStructure*& bestCS, ...@@ -544,24 +578,31 @@ void EncCu::compressCtuForks(CodingStructure*& tempCS, CodingStructure*& bestCS,
else else
{ {
cleanCostModeVector(); cleanCostModeVector();
for (int i = 0; i < NumberOfThreads ; i++) for (int i = 0; i < 4 ; i++)
{ {
pid_t pid = fork(); pid_t pid = fork();
if (pid == 0) { // proceso hijo if (pid == 0) { // proceso hijo
father = false; father = false; // no padre
threadNumber = i+1; threadNumber = i+1;
xCompressCU(tempCS, bestCS, partitioner); #ifdef IGNORE_CHILD_BUFFER_WARNING
exit(0);//proceso hijo muere int fd = open("/dev/null", O_WRONLY);
dup2(fd, STDERR_FILENO);
close(fd);
#endif //IGNORE_CHILD_BUFFER_WARNING
xCompressCU(tempCS, bestCS, partitioner); // hijo ejecuta
exit(0);//proceso hijo muere con exito
} }
} }
for(int i=0; i<4 ; i++) for(int i=0; i< 4 ; i++) // padre espera
{ {
wait(NULL); wait(NULL);
} }
father = true; father = true; //padre
reduceVector(); reduceVector(); // padre reduce
toStringVector(5.00); #ifdef DEBUG_MESSAGE
xCompressCU(tempCS, bestCS, partitioner); toStringVector(5);
#endif
xCompressCU(tempCS, bestCS, partitioner); //padre ejecuta
} }
} }
...@@ -637,16 +678,7 @@ void EncCu::compressCtu(CodingStructure &cs, const UnitArea &area, const unsigne ...@@ -637,16 +678,7 @@ void EncCu::compressCtu(CodingStructure &cs, const UnitArea &area, const unsigne
tempCS->prevQP[ChannelType::CHROMA] = bestCS->prevQP[ChannelType::CHROMA] = prevQP[ChannelType::CHROMA]; tempCS->prevQP[ChannelType::CHROMA] = bestCS->prevQP[ChannelType::CHROMA] = prevQP[ChannelType::CHROMA];
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
bool activation = false;
if(!singleMode)
{
activation = singleMode = true;
}
compressCtuForks(tempCS,bestCS,partitioner); compressCtuForks(tempCS,bestCS,partitioner);
if(activation)
{
activation = singleMode = false;
}
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
const bool copyUnsplitCTUSignals = bestCS->cus.size() == 1; const bool copyUnsplitCTUSignals = bestCS->cus.size() == 1;
...@@ -823,10 +855,13 @@ bool EncCu::xCheckBestMode( CodingStructure *&tempCS, CodingStructure *&bestCS, ...@@ -823,10 +855,13 @@ bool EncCu::xCheckBestMode( CodingStructure *&tempCS, CodingStructure *&bestCS,
void EncCu::xCompressCU( CodingStructure*& tempCS, CodingStructure*& bestCS, Partitioner& partitioner, double maxCostAllowed ) void EncCu::xCompressCU( CodingStructure*& tempCS, CodingStructure*& bestCS, Partitioner& partitioner, double maxCostAllowed )
{ {
//ALBERTO //ALBERTO
#ifdef TIME_MESSAGE
iter += 1; iter += 1;
int iterLocal = iter; int iterLocal = iter;
auto start = std::chrono::high_resolution_clock::now(); auto start = std::chrono::high_resolution_clock::now();
#endif //TIME MESSAGE
//END ALBERTO //END ALBERTO
CHECK(maxCostAllowed < 0, "Wrong value of maxCostAllowed!"); CHECK(maxCostAllowed < 0, "Wrong value of maxCostAllowed!");
uint32_t compBegin; uint32_t compBegin;
...@@ -1046,8 +1081,9 @@ void EncCu::xCompressCU( CodingStructure*& tempCS, CodingStructure*& bestCS, Par ...@@ -1046,8 +1081,9 @@ void EncCu::xCompressCU( CodingStructure*& tempCS, CodingStructure*& bestCS, Par
m_bestBcwIdx.fill(BCW_NUM); m_bestBcwIdx.fill(BCW_NUM);
} }
EncTestMode savedEncMode; EncTestMode saveMode;
bool activeIgnoreVector = false; //COMPROBAMOS SI EL MODO DEL VECTOR EN ESA POSICIÓN ES ADECUADO
bool vectorModeAvailable = posActualNode!=0 && vector[posActualNode].mode!=-1 && m_modeCtrl->vectorModeAvailable(vector[posActualNode].mode);
do do
{ {
for (int i = compBegin; i < (compBegin + numComp); i++) for (int i = compBegin; i < (compBegin + numComp); i++)
...@@ -1056,19 +1092,26 @@ bool activeIgnoreVector = false; ...@@ -1056,19 +1092,26 @@ bool activeIgnoreVector = false;
tempCS->prevPLT.curPLTSize[comID] = curLastPLTSize[comID]; tempCS->prevPLT.curPLTSize[comID] = curLastPLTSize[comID];
memcpy(tempCS->prevPLT.curPLT[i], curLastPLT[i], curLastPLTSize[comID] * sizeof(Pel)); memcpy(tempCS->prevPLT.curPLT[i], curLastPLT[i], curLastPLTSize[comID] * sizeof(Pel));
} }
EncTestMode currTestMode = savedEncMode = m_modeCtrl->currTestMode(); EncTestMode currTestMode = saveMode = m_modeCtrl->currTestMode();
currTestMode.maxCostAllowed = maxCostAllowed;
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
bool lastModeAvailable = (!singleMode && father && m_modeCtrl->lastModeAvailable(*tempCS, partitioner) && tempCS->cost == MAX_DOUBLE); //SI SOLO QUEDA UN MODO Y EL COSTE ES MÁXIMO, NO PODEMOS SKIPEAR //SI ESTAMOS EN UN THREAD HIJO INCORRECTO EN EL NIVEL DE REPARTO SE HACE SKIP
bool skipMode = (!singleMode && father && vector[posActualNode].mode!=-1 && vector[posActualNode].mode!=currTestMode.type && !ignore_vector && vector[posActualNode].mode!=ETM_RECO_CACHED && !lastModeAvailable); bool skipCU = (!singleMode && !father && 1<=posActualNode && posActualNode<=4 && vector[posActualNode].threadNumber!=threadNumber);
bool skipCU = (!singleMode && !father && /*1<=posActualNode && posActualNode<=4 &&*/ vector[posActualNode].threadNumber!=threadNumber);//SI ESTAMOS EN UN THREAD INCORRECTO SE HACE SKIP
if(debugMessage) { std::cout << "posActualNode:" << posActualNode << ", Vector:" << vector[posActualNode].mode << ", CurrMode:" << currTestMode.type << std::endl;} #ifdef DEBUG_MESSAGE
std::cout << "posActualNode:" << posActualNode << ", Vector:" << vector[posActualNode].mode << ", CurrMode:" << currTestMode.type << std::endl;
#endif
//SI EL MODO NO COINCIDE CON EL DEL VECTOR DE MODOS SKIP
bool skipMode = (!singleMode && father && vectorModeAvailable && !m_modeCtrl->lastModeAvailable() && vector[posActualNode].mode!=currTestMode.type && vector[posActualNode].mode!=ETM_RECO_CACHED);
if(skipMode) if(skipMode)
{ {
if(debugMessage) { std::cout << "skip" << std::endl; } #ifdef DEBUG_MESSAGE
std::cout << "skip" << std::endl;
#endif
continue; continue;
} }
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
currTestMode.maxCostAllowed = maxCostAllowed;
if (pps.getUseDQP() && partitioner.isSepTree(*tempCS) && isChroma( partitioner.chType )) if (pps.getUseDQP() && partitioner.isSepTree(*tempCS) && isChroma( partitioner.chType ))
{ {
...@@ -1108,7 +1151,7 @@ bool activeIgnoreVector = false; ...@@ -1108,7 +1151,7 @@ bool activeIgnoreVector = false;
} }
#endif #endif
if( currTestMode.type == ETM_INTER_ME ) if( currTestMode.type == ETM_INTER_ME && !skipCU)
{ {
if( ( currTestMode.opts & ETO_IMV ) != 0 ) if( ( currTestMode.opts & ETO_IMV ) != 0 )
{ {
...@@ -1133,14 +1176,14 @@ bool activeIgnoreVector = false; ...@@ -1133,14 +1176,14 @@ bool activeIgnoreVector = false;
} }
} }
else if (currTestMode.type == ETM_HASH_INTER) else if (currTestMode.type == ETM_HASH_INTER && !skipCU)
{ {
xCheckRDCostHashInter( tempCS, bestCS, partitioner, currTestMode ); xCheckRDCostHashInter( tempCS, bestCS, partitioner, currTestMode );
splitRdCostBest[CTU_LEVEL] = bestCS->cost; splitRdCostBest[CTU_LEVEL] = bestCS->cost;
tempCS->splitRdCostBest = splitRdCostBest; tempCS->splitRdCostBest = splitRdCostBest;
} }
#if !JVET_AC0139_UNIFIED_MERGE #if !JVET_AC0139_UNIFIED_MERGE
else if( currTestMode.type == ETM_AFFINE ) else if( currTestMode.type == ETM_AFFINE && !skipCU)
{ {
xCheckRDCostAffineMerge2Nx2N( tempCS, bestCS, partitioner, currTestMode ); xCheckRDCostAffineMerge2Nx2N( tempCS, bestCS, partitioner, currTestMode );
splitRdCostBest[CTU_LEVEL] = bestCS->cost; splitRdCostBest[CTU_LEVEL] = bestCS->cost;
...@@ -1148,14 +1191,14 @@ bool activeIgnoreVector = false; ...@@ -1148,14 +1191,14 @@ bool activeIgnoreVector = false;
} }
#endif #endif
#if REUSE_CU_RESULTS #if REUSE_CU_RESULTS
else if( currTestMode.type == ETM_RECO_CACHED ) else if( currTestMode.type == ETM_RECO_CACHED && !skipCU)
{ {
xReuseCachedResult( tempCS, bestCS, partitioner ); xReuseCachedResult( tempCS, bestCS, partitioner );
splitRdCostBest[CTU_LEVEL] = bestCS->cost; splitRdCostBest[CTU_LEVEL] = bestCS->cost;
tempCS->splitRdCostBest = splitRdCostBest; tempCS->splitRdCostBest = splitRdCostBest;
} }
#endif #endif
else if( currTestMode.type == ETM_MERGE_SKIP) else if( currTestMode.type == ETM_MERGE_SKIP && !skipCU)
{ {
#if JVET_AC0139_UNIFIED_MERGE #if JVET_AC0139_UNIFIED_MERGE
xCheckRDCostUnifiedMerge(tempCS, bestCS, partitioner, currTestMode); xCheckRDCostUnifiedMerge(tempCS, bestCS, partitioner, currTestMode);
...@@ -1171,7 +1214,7 @@ bool activeIgnoreVector = false; ...@@ -1171,7 +1214,7 @@ bool activeIgnoreVector = false;
tempCS->splitRdCostBest = splitRdCostBest; tempCS->splitRdCostBest = splitRdCostBest;
} }
#if !JVET_AC0139_UNIFIED_MERGE #if !JVET_AC0139_UNIFIED_MERGE
else if( currTestMode.type == ETM_MERGE_GEO ) else if( currTestMode.type == ETM_MERGE_GEO && !skipCU)
{ {
xCheckRDCostMergeGeo2Nx2N( tempCS, bestCS, partitioner, currTestMode ); xCheckRDCostMergeGeo2Nx2N( tempCS, bestCS, partitioner, currTestMode );
splitRdCostBest[CTU_LEVEL] = bestCS->cost; splitRdCostBest[CTU_LEVEL] = bestCS->cost;
...@@ -1236,10 +1279,6 @@ bool activeIgnoreVector = false; ...@@ -1236,10 +1279,6 @@ bool activeIgnoreVector = false;
} }
else if( isModeSplit( currTestMode ) ) else if( isModeSplit( currTestMode ) )
{ {
//ALBERTO CONCEPT FORK
if(!ignore_vector && currTestMode.type!=ETM_SPLIT_QT) { activeIgnoreVector = ignore_vector = true; }//SI ES LA PRIMERA VEZ QUE NOS ENCONTRAMOS CON UN SPLIT NO QT IGNORAMOS AL VECTOR
//END ALBERTO CONCEPT FORK
if (bestCS->cus.size() != 0) if (bestCS->cus.size() != 0)
{ {
splitmode = bestCS->cus[0]->splitSeries; splitmode = bestCS->cus[0]->splitSeries;
...@@ -1317,9 +1356,6 @@ bool activeIgnoreVector = false; ...@@ -1317,9 +1356,6 @@ bool activeIgnoreVector = false;
memcpy(bestLastPLT[i], bestCS->cus[0]->cs->prevPLT.curPLT[i], bestCS->cus[0]->cs->prevPLT.curPLTSize[comID] * sizeof(Pel)); memcpy(bestLastPLT[i], bestCS->cus[0]->cs->prevPLT.curPLT[i], bestCS->cus[0]->cs->prevPLT.curPLTSize[comID] * sizeof(Pel));
} }
} }
//ALBERTO CONCEPT FORK
if(activeIgnoreVector) { activeIgnoreVector = ignore_vector = false; }//SI SE MARCÓ EN ESTA ITERACIÓN EL IGNORAR AL VECTOR, AL REGRESAR DE DEVUELVE EL VALOR FALSO
//END ALBERTO CONCEPT FORK
} }
else else
{ {
...@@ -1332,11 +1368,13 @@ bool activeIgnoreVector = false; ...@@ -1332,11 +1368,13 @@ bool activeIgnoreVector = false;
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//PASO 5 -> AL TERMINAR EL BUCLE SE GUARDA EN EL PADRE EL VALOR DEL COSTE Y SE RETORNA //PASO 5 -> AL TERMINAR EL BUCLE SE GUARDA EN EL PADRE EL VALOR DEL COSTE Y SE RETORNA
if(debugMessage) { std::cout << "SAVING --> código bucle split " << posActualNode << " : " << " (" << tempCS->area.lheight() <<","<< tempCS->area.lwidth() << ") " << std::endl; } #ifdef DEBUG_MESSAGE
std::cout << "SAVING --> código bucle split " << posActualNode << " : " << " (" << tempCS->area.lheight() <<","<< tempCS->area.lwidth() << ") " << std::endl;
#endif
bool saveModeCost = (!singleMode && !father && vector[posActualNode].mode==-1 && vector[posActualNode].cost==-1 && vector[posActualNode].threadNumber==threadNumber); bool saveModeCost = (!singleMode && !father && vector[posActualNode].mode==-1 && vector[posActualNode].cost==-1 && vector[posActualNode].threadNumber==threadNumber);
if(saveModeCost) if(saveModeCost)
{ {
vector[posActualNode].mode=savedEncMode.type; vector[posActualNode].mode=saveMode.type;
vector[posActualNode].cost=bestCS->cost; vector[posActualNode].cost=bestCS->cost;
} }
//ALBERTO END CONCEPT FORK //ALBERTO END CONCEPT FORK
...@@ -1421,6 +1459,7 @@ bool activeIgnoreVector = false; ...@@ -1421,6 +1459,7 @@ bool activeIgnoreVector = false;
CHECK( bestCS->cost == MAX_DOUBLE , "No possible encoding found" ); CHECK( bestCS->cost == MAX_DOUBLE , "No possible encoding found" );
//ALBERTO //ALBERTO
#ifdef TIME_MESSAGE
if (iterLocal == 1) if (iterLocal == 1)
{ {
auto end = std::chrono::high_resolution_clock::now(); auto end = std::chrono::high_resolution_clock::now();
...@@ -1430,6 +1469,7 @@ bool activeIgnoreVector = false; ...@@ -1430,6 +1469,7 @@ bool activeIgnoreVector = false;
std::cout << "La func xCompressCU realiza " << iter << " iter que tardan " << static_cast<int>(duration.count() / 1000) << " + " << before << " = " << seconds << " segundos en ejecutarse." << std::endl; std::cout << "La func xCompressCU realiza " << iter << " iter que tardan " << static_cast<int>(duration.count() / 1000) << " + " << before << " = " << seconds << " segundos en ejecutarse." << std::endl;
iter = 0; iter = 0;
} }
#endif
//END ALBERTO //END ALBERTO
} }
...@@ -1483,36 +1523,7 @@ void EncCu::updateLambda(Slice *slice, const int dQP, ...@@ -1483,36 +1523,7 @@ void EncCu::updateLambda(Slice *slice, const int dQP,
#endif // SHARP_LUMA_DELTA_QP || ENABLE_QPA_SUB_CTU #endif // SHARP_LUMA_DELTA_QP || ENABLE_QPA_SUB_CTU
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
int EncCu::determinePosNodeInVector(std::string posNode) //FUNCIONES AUXILIARES PARA xCheckModeSplit()
{
int index = -1;
for(int i=0; i<posNode.length();i++)
{
if(i==posNode.length()-1 && posNode.length()>1)
{
bool childToSum = true;
for(int j=i; j-1>-1; j--)
{
int codeParent = posNode[j-1] - '0';
int codeChild = posNode[j] - '0';
int nodesParentLevel = levelValues[j-1];
int NodesOtherChild = codeParent * nodesParentLevel;
int NodesChild = 0;
if(childToSum)
{
childToSum = false;
NodesChild = (codeChild + 1);
}
index += NodesOtherChild + NodesChild;
}
}
else
{
index += levelValues[i];
}
}
return index;
}
int EncCu::searchFirstChild(int posFather) int EncCu::searchFirstChild(int posFather)
{ {
int posChild = -1; int posChild = -1;
...@@ -1525,37 +1536,6 @@ int EncCu::searchFirstChild(int posFather) ...@@ -1525,37 +1536,6 @@ int EncCu::searchFirstChild(int posFather)
} }
return posChild; return posChild;
} }
void EncCu::reduceVector()
{
for(int i=VECTOR_SIZE-1 ; (i-4)>=0 ; i=i-4)
{
int valueChild_1 = vector[i-3].cost;
int valueChild_2 = vector[i-2].cost;
int valueChild_3 = vector[i-1].cost;
int valueChild_4 = vector[i].cost;
if(valueChild_1==-1 || valueChild_2==-1 || valueChild_3==-1 || valueChild_4==-1)
{
continue;
}
else
{
int childSum = valueChild_1 + valueChild_2 + valueChild_3 + valueChild_4;
int posFather = vector[i].posFather;
int costFather = vector[posFather].cost;
int modeFather = vector[posFather].mode;
if(costFather <= childSum && modeFather!=ETM_SPLIT_QT)
{
vector[i-3].cost = vector[i-2].cost = vector[i-1].cost = vector[i].cost = -1;
vector[i-3].mode = vector[i-2].mode = vector[i-1].mode = vector[i].mode = -1;
}
else if(costFather > childSum && modeFather!=ETM_SPLIT_QT)
{
vector[posFather].cost = childSum;
vector[posFather].mode = ETM_SPLIT_QT;
}
}
}
}
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
void EncCu::xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &partitioner, const EncTestMode& encTestMode, const ModeType modeTypeParent, bool &skipInterPass, double *splitRdCostBest ) void EncCu::xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &partitioner, const EncTestMode& encTestMode, const ModeType modeTypeParent, bool &skipInterPass, double *splitRdCostBest )
...@@ -1702,13 +1682,13 @@ void EncCu::xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS, ...@@ -1702,13 +1682,13 @@ void EncCu::xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS,
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//PASO 2 -> SI EL SPLIT ES QUAD SE ACTUALIZA NODO ACTUAL //PASO 2 -> SI EL SPLIT ES QUAD SE ACTUALIZA NODO ACTUAL
if(debugMessage) #ifdef DEBUG_MESSAGE
{
std::cout << "CONTROL --> código bucle split " << posActualNode << "->" << posChild << " : " << " (" << tempCS->area.lheight() <<","<< tempCS->area.lwidth() << ") " << "->" << " (" << tempSubCS->area.lheight() <<","<< tempSubCS->area.lwidth() <<") " << std::endl; std::cout << "CONTROL --> código bucle split " << posActualNode << "->" << posChild << " : " << " (" << tempCS->area.lheight() <<","<< tempCS->area.lwidth() << ") " << "->" << " (" << tempSubCS->area.lheight() <<","<< tempSubCS->area.lwidth() <<") " << std::endl;
} #endif //DEBUG_MESSAGE
int restorePosActualNode = posActualNode; int restorePosActualNode = posActualNode;
bool fatherUpdate = ((!singleMode && !father && split == CU_QUAD_SPLIT) || (!singleMode && father && split == CU_QUAD_SPLIT && !ignore_vector)); bool updatePosActualNode = (!singleMode && split == CU_QUAD_SPLIT);
if(fatherUpdate) { posActualNode=posChild; } if(updatePosActualNode) { posActualNode=posChild; }
//END ALBERTO CONCEPT FORK
//PASO 3 -> LLAMADA RECURSIVA CON EL HIJO QUE AHORA ES EL PADRE //PASO 3 -> LLAMADA RECURSIVA CON EL HIJO QUE AHORA ES EL PADRE
xCompressCU(tempSubCS, bestSubCS, partitioner, newMaxCostAllowed); xCompressCU(tempSubCS, bestSubCS, partitioner, newMaxCostAllowed);
...@@ -1716,7 +1696,7 @@ void EncCu::xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS, ...@@ -1716,7 +1696,7 @@ void EncCu::xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS,
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
//PASO 4 -> AL REGRESAR DE LA LLAMADA SI SE HA MODIFICADO EL PADRE SE RESTAURA EL PADRE Y SE AVANZA AL SIGUIENTE HIJO DE LOS 4 //PASO 4 -> AL REGRESAR DE LA LLAMADA SI SE HA MODIFICADO EL PADRE SE RESTAURA EL PADRE Y SE AVANZA AL SIGUIENTE HIJO DE LOS 4
if(fatherUpdate) { posActualNode=restorePosActualNode; posChild++;} if(updatePosActualNode) { posActualNode=restorePosActualNode; posChild++;}
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
if( bestSubCS->cost == MAX_DOUBLE ) if( bestSubCS->cost == MAX_DOUBLE )
......
source/Lib/EncoderLib/EncCu.h
View file @ ff10c667
...@@ -320,23 +320,21 @@ private: ...@@ -320,23 +320,21 @@ private:
#endif #endif
public: public:
/// copy parameters from encoder class
void init ( EncLib* pcEncLib, const SPS& sps );
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
void createSharedVector(); void createSharedVector();
void repartLevel(); /*void repartLevel();
int repartStart(); int repartStart();
int repartEnd(); int repartEnd();
void initStructVectorBeforeRepartStart(int repartStartNode); void initStructVectorBeforeRepartStart(int repartStartNode);
int thread1NumberOfChild(int numberOfNodesPerThread); int thread1NumberOfChild(int numberOfNodesPerThread);*/
void initStructVector(); void initStructVector();
void updateFatherAndThreadNumbersLevel0(int posPadreActual,int thread1ChildNumber,int numberOfNodesPerThread); void updateFatherAndThreadNumbersLevel0(int posPadreActual);//,int thread1ChildNumber,int numberOfNodesPerThread);
void updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, int posPadreActual, int i,int LevelActualIndex,int& childCounter,int thread1ChildNumber,int& threadNumber,int numberOfNodesPerThread); void updateFatherAndThreadNumbers(int LevelLowIndex, int LevelUpIndex, int posPadreActual, int i);//,int LevelActualIndex,int& childCounter,int thread1ChildNumber,int& threadNumber,int numberOfNodesPerThread);
void cleanCostModeVector();
// END ALBERTO CONCEPT FORK // END ALBERTO CONCEPT FORK
/// copy parameters from encoder class
void init ( EncLib* pcEncLib, const SPS& sps );
void setDecCuReshaperInEncCU(EncReshape* pcReshape, ChromaFormat chromaFormatIdc) void setDecCuReshaperInEncCU(EncReshape* pcReshape, ChromaFormat chromaFormatIdc)
{ {
initDecCuReshaper((Reshape*) pcReshape, chromaFormatIdc); initDecCuReshaper((Reshape*) pcReshape, chromaFormatIdc);
...@@ -347,9 +345,10 @@ public: ...@@ -347,9 +345,10 @@ public:
/// destroy internal buffers /// destroy internal buffers
void destroy (); void destroy ();
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
void compressCtuForks(CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &partitioner); void compressCtuForks(CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &partitioner);
void reduceVector();
void cleanCostModeVector();
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
/// CTU analysis function /// CTU analysis function
...@@ -382,12 +381,7 @@ protected: ...@@ -382,12 +381,7 @@ protected:
xCheckBestMode ( CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &pm, const EncTestMode& encTestmode ); xCheckBestMode ( CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &pm, const EncTestMode& encTestmode );
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
bool digits_below_or_equal(std::string a, std::string b);
int determinePosNodeInVectorRec(std::string posNode, std::string posSearch, int index, int counter);
int determinePosNodeInVector(std::string posNode);
int searchFirstChildEmpty(int posFather);
int searchFirstChild(int posFather); int searchFirstChild(int posFather);
void reduceVector();
// END ALBERTO CONCEPT FORK // END ALBERTO CONCEPT FORK
void xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &pm, const EncTestMode &encTestMode, const ModeType modeTypeParent, bool &skipInterPass, double *splitRdCostBest); void xCheckModeSplit(CodingStructure *&tempCS, CodingStructure *&bestCS, Partitioner &pm, const EncTestMode &encTestMode, const ModeType modeTypeParent, bool &skipInterPass, double *splitRdCostBest);
......
source/Lib/EncoderLib/EncModeCtrl.cpp
View file @ ff10c667
...@@ -104,10 +104,25 @@ bool EncModeCtrl::nextMode( const CodingStructure &cs, Partitioner &partitioner ...@@ -104,10 +104,25 @@ bool EncModeCtrl::nextMode( const CodingStructure &cs, Partitioner &partitioner
} }
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
bool EncModeCtrl::lastModeAvailable( const CodingStructure &cs, Partitioner &partitioner ) bool EncModeCtrl::lastModeAvailable() const
{ {
return !m_ComprCUCtxList.empty() && !m_ComprCUCtxList.back().testModes.empty() && m_ComprCUCtxList.back().testModes.size()==1; return !m_ComprCUCtxList.empty() && !m_ComprCUCtxList.back().testModes.empty() && m_ComprCUCtxList.back().testModes.size()==1;
} }
bool EncModeCtrl::vectorModeAvailable(int objetiveModeType) const
{
bool vectorModeAvailable = false;
const auto& lastElem = m_ComprCUCtxList.back();
const auto& testModes = lastElem.testModes;
for (const auto& actualMode : testModes)
{
if(actualMode.type == objetiveModeType)
{
vectorModeAvailable = true;
}
}
return vectorModeAvailable;
}
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
EncTestMode EncModeCtrl::currTestMode() const EncTestMode EncModeCtrl::currTestMode() const
......
source/Lib/EncoderLib/EncModeCtrl.h
View file @ ff10c667
...@@ -327,7 +327,8 @@ public: ...@@ -327,7 +327,8 @@ public:
bool tryModeMaster ( const EncTestMode& encTestmode, const CodingStructure &cs, Partitioner& partitioner ); bool tryModeMaster ( const EncTestMode& encTestmode, const CodingStructure &cs, Partitioner& partitioner );
bool nextMode ( const CodingStructure &cs, Partitioner &partitioner ); bool nextMode ( const CodingStructure &cs, Partitioner &partitioner );
//ALBERTO CONCEPT FORK //ALBERTO CONCEPT FORK
bool lastModeAvailable(const CodingStructure &cs, Partitioner &partitioner); bool lastModeAvailable() const;
bool vectorModeAvailable(int modeType) const;
//END ALBERTO CONCEPT FORK //END ALBERTO CONCEPT FORK
EncTestMode currTestMode() const; EncTestMode currTestMode() const;
EncTestMode lastTestMode () const; EncTestMode lastTestMode () const;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment