DOTRepresentation

Synopsis

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

template<class NodeType>
class DOTRepresentation;

Types

Name

ContainerIndexType

TraceType

Member Functions

Name	Description
DOTRepresentation [constructor]	Default constructor
~DOTRepresentation [destructor]	Destructor
addEdge
addEmptyContainer
addNode
addNullValue
clear
containerEdgeLabel
traceFormat
writeToFile
writeToFileAsGraph

Protected Member Functions

Name

graphEnd

graphStart

nodeName

nonQuotedNodeName

nullNodeName

Protected Data Members

Name

dotout

Derived Classes

Name	Description
DOTSubgraphRepresentation	dot file representation with subgraphs
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******

Created with MrDocs