LCS Namespace Reference

Longest common subsequence algorithm used for BinaryDiff. More...


Classes

class  vector_start_at_one

Functions

std::string unparseInstrFast (SgAsmInstruction *iA)
bool isEqual (SgNode *A, SgNode *B)
void LCSLength (scoped_array< scoped_array< size_t > > &C, vector_start_at_one< SgNode * > &A, vector_start_at_one< SgNode * > &B)
void printDiff (vector_start_at_one< SgNode * > &A, vector_start_at_one< SgNode * > &B, std::vector< int > &addInstr, std::vector< int > &minusInst)
void getDiff (const vector< SgNode * > &A, const vector< SgNode * > &B, vector< pair< SgNode *, SgNode * > > &result)
void LCSLength (boost::scoped_array< boost::scoped_array< size_t > > &C, vector_start_at_one< SgNode * > &A, vector_start_at_one< SgNode * > &B)
void getDiff (const std::vector< SgNode * > &A, const std::vector< SgNode * > &B, std::vector< std::pair< SgNode *, SgNode * > > &result)


Detailed Description

Longest common subsequence algorithm used for BinaryDiff.

Function Documentation

std::string LCS::unparseInstrFast ( SgAsmInstruction *  iA  ) 

Definition at line 48 of file LCS.cpp.

Referenced by isEqual(), and printDiff().

Here is the caller graph for this function:

bool LCS::isEqual ( SgNode *  A,
SgNode *  B 
)

Definition at line 71 of file LCS.cpp.

Referenced by getDiff(), LCSLength(), and printDiff().

Here is the call graph for this function:

Here is the caller graph for this function:

void LCS::LCSLength ( scoped_array< scoped_array< size_t > > &  C,
vector_start_at_one< SgNode * > &  A,
vector_start_at_one< SgNode * > &  B 
)

Definition at line 89 of file LCS.cpp.

Referenced by getDiff(), and printDiff().

Here is the call graph for this function:

Here is the caller graph for this function:

void LCS::printDiff ( vector_start_at_one< SgNode * > &  A,
vector_start_at_one< SgNode * > &  B,
std::vector< int > &  addInstr,
std::vector< int > &  minusInst 
)

Definition at line 148 of file LCS.cpp.

Here is the call graph for this function:

void LCS::getDiff ( const vector< SgNode * > &  A,
const vector< SgNode * > &  B,
vector< pair< SgNode *, SgNode * > > &  result 
)

Definition at line 186 of file LCS.cpp.

Referenced by buildAsmTreeDiff().

Here is the call graph for this function:

Here is the caller graph for this function:

void LCS::LCSLength ( boost::scoped_array< boost::scoped_array< size_t > > &  C,
vector_start_at_one< SgNode * > &  A,
vector_start_at_one< SgNode * > &  B 
)

void LCS::getDiff ( const std::vector< SgNode * > &  A,
const std::vector< SgNode * > &  B,
std::vector< std::pair< SgNode *, SgNode * > > &  result 
)


Generated on Tue Sep 15 14:48:50 2009 for RoseQtWidgets by  doxygen 1.4.7