ROSE  0.11.145.0
Public Member Functions | Public Attributes | List of all members
visitorTraversal2 Class Reference

Description

Definition at line 273 of file yicesParserLib.h.

Inheritance diagram for visitorTraversal2:
Inheritance graph
[legend]
Collaboration diagram for visitorTraversal2:
Collaboration graph
[legend]

Public Member Functions

void analyzePath (std::vector< VertexID > &pth)
 
- Public Member Functions inherited from SgGraphTraversal< newGraph >
void constructPathAnalyzer (newGraph *g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns=true)
 This is the function that is used by the user directly to start the algorithm. More...
 
virtual void analyzePath (std::vector< Vertex > &pth)=0
 
std::vector< int > getInEdges (int &node, newGraph *&g)
 Gets out edges with integer inputs, internal use only SgGraphTraversal::getInEdges Input: More...
 
std::vector< int > getOutEdges (int &node, newGraph *&g)
 Gets out edges with integer inputs, internal use only SgGraphTraversal::getOutEdges Input: More...
 
int getTarget (int &n, newGraph *&g)
 Gets the target of an edge SgGraphTraversal::getTarget Input: More...
 
int getSource (int &n, newGraph *&g)
 Gets the source of an edge SgGraphTraversal::getSource Input: More...
 
 SgGraphTraversal (SgGraphTraversal &)
 
 SgGraphTraversal (const SgGraphTraversal &)
 
SgGraphTraversaloperator= (SgGraphTraversal &)
 
const SgGraphTraversaloperator= (const SgGraphTraversal &)
 
void firstPrepGraph (newGraph *&g)
 DEPRECATED This is the function that preps the graph for traversal, currently this one isn't used but for many traversals on one visitor may necessitate. More...
 
InheritedAttributeType traverse (SgGraphNode *basenode, SgIncidenceDirectedGraph *g, InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit, SgGraphNode *endnode, bool insep=false, bool pcHk=false)
 This is the function that is used by the user directly to start the algorithm. More...
 

Public Attributes

int tltnodes
 
int paths
 
- Public Attributes inherited from SgGraphTraversal< newGraph >
std::map< Vertex, int > vertintmap
 
std::map< Edge, int > edgeintmap
 
std::map< int, Vertexintvertmap
 
std::map< int, Edgeintedgemap
 
int pathnum
 
std::set< std::map< int, std::set< int > > > subpathmap
 
int loopNum
 
int nullNum
 
std::set< SgDirectedGraphEdge * > nullEdgesOrdered
 
std::map< SgGraphNode *, int > loopNumMap
 
std::map< SgGraphNode *, int > pathValMap
 
int nullloops
 
std::vector< std::vector< SgGraphNode * > > looppaths
 
std::vector< std::vector< SgGraphNode * > > iLoops
 
std::vector< SgGraphNode * > ifstatements
 
int nullEdgesPaths
 
int turns
 
int numnodes
 
SgGraphNodenullnode
 
std::map< SgGraphNode *, int > primenode
 
bool done
 
std::set< SgGraphNode * > lstN
 
std::map< SgGraphNode *, std::vector< std::set< int > > > lstordmap
 
std::set< SgGraphNode * > solvedLoops
 
std::map< SgGraphNode *, std::vector< SgGraphNode * > > checkednodes
 
std::map< SgGraphNode *, std::set< SgGraphNode * > > downed
 
InheritedAttributeType nullInherit
 
std::set< SgGraphNode * > loopSet
 

Additional Inherited Members

- Public Types inherited from SgGraphTraversal< newGraph >
typedef boost::graph_traits< newGraph >::vertex_descriptor Vertex
 
typedef boost::graph_traits< newGraph >::edge_descriptor Edge
 
typedef StackFrameVector< SynthesizedAttributeType > SynthesizedAttributesList
 
- Protected Member Functions inherited from SgGraphTraversal< newGraph >
virtual InheritedAttributeType evaluateInheritedAttribute (SgGraphNode *n, std::vector< InheritedAttributeType > inheritedValues)=0
 
virtual SynthesizedAttributeType evaluateSynthesizedAttribute (SgGraphNode *n, InheritedAttributeType in, SynthesizedAttributesList l)=0
 
virtual void pathAnalyze (std::vector< SgGraphNode * > &pth, bool loop=false, std::set< std::vector< SgGraphNode * > > &incloops=NULL)=0
 
SynthesizedAttributeType defaultSynthesizedAttribute (InheritedAttributeType)
 

The documentation for this class was generated from the following file: