AST_Graph::DataMemberPointersToIR

* The class class DataMemberPointersToIR implements two different ways of constructing a graph from the AST. * The memory pool traversal which is why the class inherits fromROSE_VisitTraversal * Whole AST traversal through traversing on nodes This design decision is peculiar out from a inheritance perspective, butmakes sence to bridge between the iheritance style of Marcus and an STLalgorithm style. Caveats: * one member functions is only used by the memory pool traversal ‐visit(..) The member function generateGraphFromMemoryPool(..) is required toachieve STL style algorithms where the bace‐class uses implemenatation byvirtual functions. Great things: * avoid duplicate implementation * allows a very simple implementation******

Synopsis

Declared in <src/midend/astDump/astGraph.h>

template<
    typename Functional1,
    typename Functional2>
class DataMemberPointersToIR
    : public DOTRepresentation<SgNode*>

Base Classes

Name	Description
DOTRepresentation<SgNode*>

Member Functions

Name	Description
DataMemberPointersToIR [constructor]
~DataMemberPointersToIR [destructor] [virtual]	Destructor
generateGraph

Private Member Functions

Name	Description
visit [virtual]	* The function AST_Graph::DataMemberPointersToIR<Functional1, Functional2>::visit(SgNode* node) is an implementation of the virtual visit member function in theAST memory pool traversal. This implementation does not affect the tailoredwhole AST traversal.**

Private Data Members

Name

NodeExists

edgeFunctional

graphNull

nodeFunctional

whichTraversal

Created with MrDocs