| abnormals | SgGraphTraversal< CFG > | private |
| analyzePath(std::vector< Vertex > &pth)=0 | SgGraphTraversal< CFG > | pure virtual |
| badloop | SgGraphTraversal< CFG > | private |
| badpaths | SgGraphTraversal< CFG > | private |
| bfsTraversePath(int begin, int end, CFG *&g, bool loop=false) | SgGraphTraversal< CFG > | private |
| borrowed | SgGraphTraversal< CFG > | private |
| bound | SgGraphTraversal< CFG > | private |
| canEval(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| canSolve(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| checkedfound | SgGraphTraversal< CFG > | private |
| checkednodes | SgGraphTraversal< CFG > | |
| clglobal | SgGraphTraversal< CFG > | private |
| closures | SgGraphTraversal< CFG > | private |
| closuresVec | SgGraphTraversal< CFG > | private |
| clsT | SgGraphTraversal< CFG > | private |
| compChild | SgGraphTraversal< CFG > | private |
| completedEdges | SgGraphTraversal< CFG > | private |
| completedEdgesOut | SgGraphTraversal< CFG > | private |
| completedEdgesPath | SgGraphTraversal< CFG > | private |
| completedNodesPath | SgGraphTraversal< CFG > | private |
| compPar | SgGraphTraversal< CFG > | private |
| computable(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| computedNodes | SgGraphTraversal< CFG > | private |
| computeInheritedOrdered(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| computeOrder(CFG *&g, const int &begin) | SgGraphTraversal< CFG > | private |
| computeOrder(SgIncidenceDirectedGraph *g, SgGraphNode *n, SgGraphNode *endnode) | SgGraphTraversal< CFG > | private |
| computeSubGraphs(const int &begin, const int &end, CFG *&g, int depthDifferential) | SgGraphTraversal< CFG > | private |
| connectNodes | SgGraphTraversal< CFG > | private |
| constructPathAnalyzer(CFG *g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns=true) | SgGraphTraversal< CFG > | |
| currm | SgGraphTraversal< CFG > | private |
| currprime | SgGraphTraversal< CFG > | private |
| defaultSynthesizedAttribute(InheritedAttributeType) | SgGraphTraversal< CFG > | protected |
| disjoint(std::vector< SgGraphNode * > &path, std::vector< SgGraphNode * > &vec2) const | SgGraphTraversal< CFG > | private |
| distime | SgGraphTraversal< CFG > | private |
| done | SgGraphTraversal< CFG > | |
| downed | SgGraphTraversal< CFG > | |
| dpMax | SgGraphTraversal< CFG > | private |
| Edge typedef | SgGraphTraversal< CFG > | |
| edge_iterator typedef | SgGraphTraversal< CFG > | private |
| edgeintmap | SgGraphTraversal< CFG > | |
| en | SgGraphTraversal< CFG > | private |
| endnodefakes | SgGraphTraversal< CFG > | private |
| evaledpaths | SgGraphTraversal< CFG > | private |
| evalNodeOrdered(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| evaluateInheritedAttribute(SgGraphNode *n, std::vector< InheritedAttributeType > inheritedValues)=0 | SgGraphTraversal< CFG > | protectedpure virtual |
| evaluatePaths(SgIncidenceDirectedGraph *g, SgGraphNode *realstartnode, SgGraphNode *endnode) | SgGraphTraversal< CFG > | private |
| evaluatePathsPar(SgIncidenceDirectedGraph *g, SgGraphNode *realstartnode, SgGraphNode *endnode) | SgGraphTraversal< CFG > | private |
| evaluateSynthesizedAttribute(SgGraphNode *n, InheritedAttributeType in, SynthesizedAttributesList l)=0 | SgGraphTraversal< CFG > | protectedpure virtual |
| findClosuresAndMarkersAndEnumerate(CFG *&g) | SgGraphTraversal< CFG > | private |
| firstPrepGraph(CFG *&g) | SgGraphTraversal< CFG > | |
| flatpaths | SgGraphTraversal< CFG > | private |
| fllp | SgGraphTraversal< CFG > | private |
| frksLeft | SgGraphTraversal< CFG > | private |
| getInEdges(int &node, CFG *&g) | SgGraphTraversal< CFG > | |
| getNextChild(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| getNextPar(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| getOutEdges(int &node, CFG *&g) | SgGraphTraversal< CFG > | |
| getSource(int &n, CFG *&g) | SgGraphTraversal< CFG > | inline |
| getTarget(int &n, CFG *&g) | SgGraphTraversal< CFG > | inline |
| getVertexPath(std::vector< int > path, CFG *&g, std::vector< Vertex > &vertexPath) | SgGraphTraversal< CFG > | private |
| GraphSubGraphMap | SgGraphTraversal< CFG > | private |
| ifstatements | SgGraphTraversal< CFG > | |
| iLoops | SgGraphTraversal< CFG > | |
| in_edge_iterator typedef | SgGraphTraversal< CFG > | private |
| inhVals | SgGraphTraversal< CFG > | private |
| inseparable | SgGraphTraversal< CFG > | private |
| intedgemap | SgGraphTraversal< CFG > | |
| intvertmap | SgGraphTraversal< CFG > | |
| iVals | SgGraphTraversal< CFG > | private |
| known | SgGraphTraversal< CFG > | private |
| loopNum | SgGraphTraversal< CFG > | |
| loopnum | SgGraphTraversal< CFG > | private |
| loopNumMap | SgGraphTraversal< CFG > | |
| looppaths | SgGraphTraversal< CFG > | |
| loopSet | SgGraphTraversal< CFG > | |
| loopStore | SgGraphTraversal< CFG > | private |
| lpbegins | SgGraphTraversal< CFG > | private |
| lstN | SgGraphTraversal< CFG > | |
| lstordmap | SgGraphTraversal< CFG > | |
| markerIndex | SgGraphTraversal< CFG > | private |
| markers | SgGraphTraversal< CFG > | private |
| mkglobal | SgGraphTraversal< CFG > | private |
| mkloopmap | SgGraphTraversal< CFG > | private |
| mkloops | SgGraphTraversal< CFG > | private |
| needssafety | SgGraphTraversal< CFG > | private |
| nextEdge | SgGraphTraversal< CFG > | private |
| nextNode | SgGraphTraversal< CFG > | private |
| nextsubpath | SgGraphTraversal< CFG > | private |
| nodeInEdgesNum | SgGraphTraversal< CFG > | private |
| nodeStrings | SgGraphTraversal< CFG > | private |
| normals | SgGraphTraversal< CFG > | private |
| nullEdges | SgGraphTraversal< CFG > | private |
| nullEdgesOrdered | SgGraphTraversal< CFG > | |
| nullEdgesOrderedOut | SgGraphTraversal< CFG > | private |
| nullEdgesPaths | SgGraphTraversal< CFG > | |
| nullInherit | SgGraphTraversal< CFG > | |
| nullloops | SgGraphTraversal< CFG > | |
| nullnode | SgGraphTraversal< CFG > | |
| nullNum | SgGraphTraversal< CFG > | |
| numnodes | SgGraphTraversal< CFG > | |
| operator=(SgGraphTraversal &) | SgGraphTraversal< CFG > | |
| operator=(const SgGraphTraversal &) | SgGraphTraversal< CFG > | |
| orderOfNodes | SgGraphTraversal< CFG > | private |
| out_edge_iterator typedef | SgGraphTraversal< CFG > | private |
| oVals | SgGraphTraversal< CFG > | private |
| pathAnalyze(std::vector< SgGraphNode * > &pth, bool loop=false, std::set< std::vector< SgGraphNode * > > &incloops=NULL)=0 | SgGraphTraversal< CFG > | protectedpure virtual |
| pathCheck | SgGraphTraversal< CFG > | private |
| pathnum | SgGraphTraversal< CFG > | |
| pathsAtMarkers | SgGraphTraversal< CFG > | private |
| pathsAtMk | SgGraphTraversal< CFG > | private |
| pathsSize | SgGraphTraversal< CFG > | private |
| pathStore | SgGraphTraversal< CFG > | private |
| pathValMap | SgGraphTraversal< CFG > | |
| ploops | SgGraphTraversal< CFG > | private |
| prepareGraph(CFG *&g) | SgGraphTraversal< CFG > | private |
| primenode | SgGraphTraversal< CFG > | |
| printCFGEdge(int &cf, CFG *&cfg, std::ofstream &o) | SgGraphTraversal< CFG > | private |
| printCFGNode(int &cf, std::ofstream &o) | SgGraphTraversal< CFG > | private |
| printCFGNodeGeneric(int &cf, std::string prop, std::ofstream &o) | SgGraphTraversal< CFG > | private |
| printEdgeForAnalysis(SgDirectedGraphEdge *e, bool isNullEdge, std::ofstream &ss) | SgGraphTraversal< CFG > | private |
| printEdgeForAnalysisPath(SgGraphNode *g1, SgGraphNode *g2, std::ofstream &ss) | SgGraphTraversal< CFG > | private |
| printHotness(CFG *&g) | SgGraphTraversal< CFG > | private |
| printNodeForAnalysis(SgGraphNode *n, int loopNum, int pathNum, std::ofstream &ss) | SgGraphTraversal< CFG > | private |
| printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph *g, SgGraphNode *n, int loopNum, int pathVal, std::ofstream &ss) | SgGraphTraversal< CFG > | private |
| printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph *g, std::vector< SgGraphNode * > n, int loopNum, int pathVal, std::ofstream &ss) | SgGraphTraversal< CFG > | private |
| printPathDot(CFG *&g) | SgGraphTraversal< CFG > | private |
| ptsNum | SgGraphTraversal< CFG > | private |
| recursed | SgGraphTraversal< CFG > | private |
| recurses | SgGraphTraversal< CFG > | private |
| recursiveLoops | SgGraphTraversal< CFG > | private |
| repEval | SgGraphTraversal< CFG > | private |
| seenEdges | SgGraphTraversal< CFG > | private |
| setPathVal(SgIncidenceDirectedGraph *g, SgGraphNode *n) | SgGraphTraversal< CFG > | private |
| SgGraphTraversal() | SgGraphTraversal< CFG > | |
| SgGraphTraversal(SgGraphTraversal &) | SgGraphTraversal< CFG > | |
| SgGraphTraversal() | SgGraphTraversal< CFG > | |
| SgGraphTraversal(const SgGraphTraversal &) | SgGraphTraversal< CFG > | |
| sinks | SgGraphTraversal< CFG > | private |
| solved | SgGraphTraversal< CFG > | private |
| solvedLoops | SgGraphTraversal< CFG > | |
| solvedset | SgGraphTraversal< CFG > | private |
| solvePaths(SgIncidenceDirectedGraph *g, SgGraphNode *n, SgGraphNode *endnode) | SgGraphTraversal< CFG > | private |
| sourcenum | SgGraphTraversal< CFG > | private |
| sources | SgGraphTraversal< CFG > | private |
| st | SgGraphTraversal< CFG > | private |
| stoppedpaths | SgGraphTraversal< CFG > | private |
| storeCompact(std::vector< int > path) | SgGraphTraversal< CFG > | private |
| SubGraphGraphMap | SgGraphTraversal< CFG > | private |
| subGraphVector | SgGraphTraversal< CFG > | private |
| subpathglobal | SgGraphTraversal< CFG > | private |
| subpathglobalinv | SgGraphTraversal< CFG > | private |
| subpathmap | SgGraphTraversal< CFG > | |
| subPathsAtMk | SgGraphTraversal< CFG > | private |
| synthesizedAttributes | SgGraphTraversal< CFG > | private |
| SynthesizedAttributesList typedef | SgGraphTraversal< CFG > | |
| totalLoops | SgGraphTraversal< CFG > | private |
| traversalResult() | SgGraphTraversal< CFG > | private |
| traverse(SgGraphNode *basenode, SgIncidenceDirectedGraph *g, InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit, SgGraphNode *endnode, bool insep=false, bool pcHk=false) | SgGraphTraversal< CFG > | |
| traversePath(int begin, int end, CFG *&g, bool loop=false) | SgGraphTraversal< CFG > | private |
| turns | SgGraphTraversal< CFG > | |
| unzipPath(std::vector< int > &path, CFG *&g, int start, int end) | SgGraphTraversal< CFG > | private |
| uTraversePath(int begin, int end, CFG *&g, bool loop, std::map< int, std::vector< std::vector< int > > > &localLoops) | SgGraphTraversal< CFG > | private |
| Vertex typedef | SgGraphTraversal< CFG > | |
| vertex_iterator typedef | SgGraphTraversal< CFG > | private |
| vertintmap | SgGraphTraversal< CFG > | |
| workingthread | SgGraphTraversal< CFG > | private |
| workingthreadnum | SgGraphTraversal< CFG > | private |
| zipPath(std::vector< int > &path, CFG *&g, int start, int end) | SgGraphTraversal< CFG > | private |
| zipPath2(std::vector< int > &path, CFG *&g) | SgGraphTraversal< CFG > | inlineprivate |
| ~SgGraphTraversal() | SgGraphTraversal< CFG > | virtual |
| ~SgGraphTraversal() | SgGraphTraversal< CFG > | virtual |
1.8.4 
