| analyzePath(std::vector< VertexID > &pth) | visitorTraversal | |
| SgGraphTraversal< CFGforT >::analyzePath(std::vector< Vertex > &pth)=0 | SgGraphTraversal< CFGforT > | pure virtual |
| cfg | visitorTraversal | |
| checkednodes | SgGraphTraversal< CFGforT > | |
| constructPathAnalyzer(CFGforT *g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns=true) | SgGraphTraversal< CFGforT > | |
| defaultSynthesizedAttribute(InheritedAttributeType) | SgGraphTraversal< CFGforT > | protected |
| done | SgGraphTraversal< CFGforT > | |
| downed | SgGraphTraversal< CFGforT > | |
| Edge typedef | SgGraphTraversal< CFGforT > | |
| edgeintmap | SgGraphTraversal< CFGforT > | |
| evaluateInheritedAttribute(SgGraphNode *n, std::vector< InheritedAttributeType > inheritedValues)=0 | SgGraphTraversal< CFGforT > | protectedpure virtual |
| evaluateSynthesizedAttribute(SgGraphNode *n, InheritedAttributeType in, SynthesizedAttributesList l)=0 | SgGraphTraversal< CFGforT > | protectedpure virtual |
| firstPrepGraph(CFGforT *&g) | SgGraphTraversal< CFGforT > | |
| g | visitorTraversal | |
| getInEdges(int &node, CFGforT *&g) | SgGraphTraversal< CFGforT > | |
| getOutEdges(int &node, CFGforT *&g) | SgGraphTraversal< CFGforT > | |
| getSource(int &n, CFGforT *&g) | SgGraphTraversal< CFGforT > | |
| getTarget(int &n, CFGforT *&g) | SgGraphTraversal< CFGforT > | |
| ifstatements | SgGraphTraversal< CFGforT > | |
| iLoops | SgGraphTraversal< CFGforT > | |
| intedgemap | SgGraphTraversal< CFGforT > | |
| intvertmap | SgGraphTraversal< CFGforT > | |
| knownNodes | visitorTraversal | |
| loopNum | SgGraphTraversal< CFGforT > | |
| loopNumMap | SgGraphTraversal< CFGforT > | |
| looppaths | SgGraphTraversal< CFGforT > | |
| loopSet | SgGraphTraversal< CFGforT > | |
| lstN | SgGraphTraversal< CFGforT > | |
| lstordmap | SgGraphTraversal< CFGforT > | |
| nullEdgesOrdered | SgGraphTraversal< CFGforT > | |
| nullEdgesPaths | SgGraphTraversal< CFGforT > | |
| nullInherit | SgGraphTraversal< CFGforT > | |
| nullloops | SgGraphTraversal< CFGforT > | |
| nullnode | SgGraphTraversal< CFGforT > | |
| nullNum | SgGraphTraversal< CFGforT > | |
| numnodes | SgGraphTraversal< CFGforT > | |
| operator=(SgGraphTraversal &) | SgGraphTraversal< CFGforT > | |
| operator=(const SgGraphTraversal &) | SgGraphTraversal< CFGforT > | |
| orig | visitorTraversal | |
| pathAnalyze(std::vector< SgGraphNode * > &pth, bool loop=false, std::set< std::vector< SgGraphNode * > > &incloops=NULL)=0 | SgGraphTraversal< CFGforT > | protectedpure virtual |
| pathnum | SgGraphTraversal< CFGforT > | |
| pathnumber | visitorTraversal | |
| pathValMap | SgGraphTraversal< CFGforT > | |
| primenode | SgGraphTraversal< CFGforT > | |
| SgGraphTraversal() | SgGraphTraversal< CFGforT > | |
| SgGraphTraversal(SgGraphTraversal &) | SgGraphTraversal< CFGforT > | |
| SgGraphTraversal() | SgGraphTraversal< CFGforT > | |
| SgGraphTraversal(const SgGraphTraversal &) | SgGraphTraversal< CFGforT > | |
| solvedLoops | SgGraphTraversal< CFGforT > | |
| subpathmap | SgGraphTraversal< CFGforT > | |
| SynthesizedAttributesList typedef | SgGraphTraversal< CFGforT > | |
| tltnodes | visitorTraversal | |
| traverse(SgGraphNode *basenode, SgIncidenceDirectedGraph *g, InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit, SgGraphNode *endnode, bool insep=false, bool pcHk=false) | SgGraphTraversal< CFGforT > | |
| turns | SgGraphTraversal< CFGforT > | |
| Vertex typedef | SgGraphTraversal< CFGforT > | |
| vertintmap | SgGraphTraversal< CFGforT > | |
| ~SgGraphTraversal() | SgGraphTraversal< CFGforT > | virtual |
| ~SgGraphTraversal() | SgGraphTraversal< CFGforT > | virtual |
1.8.4 
