106 lines
2.8 KiB
C++
106 lines
2.8 KiB
C++
/*****************************************************************************
|
|
* dcc project Universal Decompilation Module
|
|
* This is supposedly a machine independant and language independant module
|
|
* that just plays with abstract cfg's and intervals and such like.
|
|
* (C) Cristina Cifuentes
|
|
****************************************************************************/
|
|
#include <list>
|
|
#include <cassert>
|
|
#include <stdio.h>
|
|
#include "dcc.h"
|
|
|
|
static void displayCFG(Function * pProc);
|
|
static void displayDfs(BB * pBB);
|
|
|
|
/****************************************************************************
|
|
* udm
|
|
****************************************************************************/
|
|
void Function::buildCFG()
|
|
{
|
|
if(flg & PROC_ISLIB)
|
|
return; /* Ignore library functions */
|
|
createCFG();
|
|
if (option.VeryVerbose)
|
|
displayCFG();
|
|
/* Remove redundancies and add in-edge information */
|
|
compressCFG();
|
|
|
|
/* Print 2nd pass assembler listing */
|
|
if (option.asm2)
|
|
disassem(2, this);
|
|
|
|
/* Idiom analysis and propagation of long type */
|
|
lowLevelAnalysis();
|
|
|
|
/* Generate HIGH_LEVEL icodes whenever possible */
|
|
highLevelGen();
|
|
}
|
|
void Function::controlFlowAnalysis()
|
|
{
|
|
if (flg & PROC_ISLIB)
|
|
return; /* Ignore library functions */
|
|
derSeq *derivedG=0;
|
|
|
|
/* Make cfg reducible and build derived sequences */
|
|
derivedG=checkReducibility();
|
|
|
|
if (option.VeryVerbose)
|
|
derivedG->display();
|
|
|
|
/* Structure the graph */
|
|
structure(derivedG);
|
|
|
|
/* Check for compound conditions */
|
|
compoundCond ();
|
|
|
|
if (option.verbose)
|
|
{
|
|
printf("\nDepth first traversal - Proc %s\n", name);
|
|
cfg.front()->displayDfs();
|
|
}
|
|
|
|
/* Free storage occupied by this procedure */
|
|
freeDerivedSeq(*derivedG);
|
|
|
|
}
|
|
void udm(void)
|
|
{
|
|
|
|
/* Build the control flow graph, find idioms, and convert low-level
|
|
* icodes to high-level ones */
|
|
for (auto iter = pProcList.rbegin(); iter!=pProcList.rend(); ++iter)
|
|
{
|
|
iter->buildCFG();
|
|
}
|
|
|
|
/* Data flow analysis - eliminate condition codes, extraneous registers
|
|
* and intermediate instructions. Find expressions by forward
|
|
* substitution algorithm */
|
|
pProcList.front().dataFlow (0);
|
|
|
|
/* Control flow analysis - structuring algorithm */
|
|
for (auto iter = pProcList.rbegin(); iter!=pProcList.rend(); ++iter)
|
|
{
|
|
iter->controlFlowAnalysis();
|
|
}
|
|
}
|
|
|
|
/****************************************************************************
|
|
* displayCFG - Displays the Basic Block list
|
|
***************************************************************************/
|
|
void Function::displayCFG()
|
|
{
|
|
Int i;
|
|
BB * pBB;
|
|
|
|
printf("\nBasic Block List - Proc %s", name);
|
|
|
|
for (auto iter = cfg.begin(); iter!=cfg.end(); ++iter)
|
|
{
|
|
pBB = *iter;
|
|
(*iter)->display();
|
|
}
|
|
}
|
|
|
|
|