Synopsis Base Classes Member Functions Private Member Functions Private Data Members
TemplatedDominatorTree constructs a dominator/postdominator tree for a cfg. For the template parameter any cfg following Jeremias interface may be used
Synopsis Declared in <src/midend/programAnalysis/dominanceAnalysis/DominatorTree.h >
template<typename CFGFilterFunction>
class TemplatedDominatorTree
: public DominatorForwardBackwardWrapperClass <CFGFilterFunction> Base Classes Name Description DominatorForwardBackwardWrapperClass <CFGFilterFunction> This class provides a uniform view of the CFG dissregarding the direction of the CFG-traversal (forward/backward)
Member Functions Name Description TemplatedDominatorTreeTemplatedDominatorTree( SgNode* head, Direction d = DominatorForwardBackwardWrapperClass< CFGFilterFunction>::PRE_DOMINATOR); [constructor] constructor for the DT. Head is the start point for the DT construction. DT works for SgFunctionDefintion nodes, unexpected behaviour for non-SgFunctionDefinition!!! dominatesbool dominates( int a, int b); dominates overloads getCFGNodeFromIDVirtualCFG::FilteredCFGNode<CFGFilterFunction> getCFGNodeFromID(unsigned int id); getDirectDominatedSetstd::set<int> getDirectDominatedSet(int nodeID); returns the set of nodes directly dominated by nodeID getIDint getID(VirtualCFG::FilteredCFGNode<CFGFilterFunction> node); getImDomIDint getImDomID(int i); get the ImDomID for given SgNode, returns negative for non-cfg-node getSizeint getSize(); writeDotvoid writeDot(char const* filename); writes the DT in DOT-notation to the file given in filename
Private Member Functions Name Description calculateImmediateDominatorsvoid calculateImmediateDominators(); calculate immediate dominators depthFirstSearchvoid depthFirstSearch(); create the dfs-order of the cfg evalint eval(int node); helperfunction according to lingauer&tarjan linkvoid link( int source, int target); create the forrest of parents
Private Data Members Created with MrDocs