|
| ControlDependenceGraph (SgFunctionDefinition *head, InterproceduralInfo *ii=NULL) |
|
void | computeInterproceduralInformation (InterproceduralInfo *ii) |
|
void | computeAdditionalFunctioncallDepencencies () |
|
| ControlDependenceGraph (SgFunctionDefinition *head, InterproceduralInfo *ii=NULL) |
|
void | computeInterproceduralInformation (InterproceduralInfo *ii) |
|
void | computeAdditionalFunctioncallDepencencies () |
|
| DependenceGraph () |
|
virtual | ~DependenceGraph () |
|
void | debugCoutNodeList () |
|
const char * | getEdgeName (EdgeType type) |
|
DependenceNode * | createNode (DependenceNode::NodeType type, SgNode *identifyingNode) |
|
DependenceNode * | createNode (SgNode *node) |
|
void | deleteNode (DependenceNode *node) |
|
DependenceNode * | getNode (SgNode *node) |
|
DependenceNode * | getNode (DependenceNode::NodeType type, SgNode *identifyingNode) |
|
DependenceNode * | getExistingNode (SgNode *node) |
|
DependenceNode * | getExistingNode (DependenceNode::NodeType type, SgNode *identifyingNode) |
|
InterproceduralInfo * | getInterprocedural () |
|
virtual void | establishEdge (DependenceNode *from, DependenceNode *to, EdgeType e=CONTROL) |
|
virtual void | removeEdge (DependenceNode *from, DependenceNode *to, EdgeType e=CONTROL) |
|
bool | edgeExists (DependenceNode *from, DependenceNode *to, EdgeType e) |
|
bool | hasOutgingEdge (DependenceNode *src, EdgeType compare) |
|
std::set< EdgeType > | edgeType (DependenceNode *from, DependenceNode *to) |
|
virtual void | writeDot (char *filename) |
|
| DependenceGraph () |
|
virtual | ~DependenceGraph () |
|
void | debugCoutNodeList () |
|
const char * | getEdgeName (EdgeType type) |
|
DependenceNode * | createNode (DependenceNode::NodeType type, SgNode *identifyingNode) |
|
DependenceNode * | createNode (SgNode *node) |
|
void | deleteNode (DependenceNode *node) |
|
DependenceNode * | getNode (SgNode *node) |
|
DependenceNode * | getNode (DependenceNode::NodeType type, SgNode *identifyingNode) |
|
DependenceNode * | getExistingNode (SgNode *node) |
|
DependenceNode * | getExistingNode (DependenceNode::NodeType type, SgNode *identifyingNode) |
|
InterproceduralInfo * | getInterprocedural () |
|
virtual void | establishEdge (DependenceNode *from, DependenceNode *to, EdgeType e=CONTROL) |
|
virtual void | removeEdge (DependenceNode *from, DependenceNode *to, EdgeType e=CONTROL) |
|
bool | edgeExists (DependenceNode *from, DependenceNode *to, EdgeType e) |
|
bool | hasOutgingEdge (DependenceNode *src, EdgeType compare) |
|
std::set< EdgeType > | edgeType (DependenceNode *from, DependenceNode *to) |
|
virtual void | writeDot (char *filename) |
|
virtual void | writeDotAndHighlightAllowedEdgesOnly (char *filename, std::set< DependenceGraph::EdgeType >) |
|
| ~SimpleDirectedGraph () |
|
std::set
< SimpleDirectedGraphNode * > | getNodes () |
| get all the nodes in the graph More...
|
|
virtual void | addNode (SimpleDirectedGraphNode *node) |
| Add a node to the graph. More...
|
|
virtual void | addLink (SimpleDirectedGraphNode *from, SimpleDirectedGraphNode *to) |
| Add a link to the graph between "from" and to "to". More...
|
|
bool | nodeExists (SimpleDirectedGraphNode *node) |
| Check if a node containing data is in the graph. More...
|
|
bool | linkExists (SimpleDirectedGraphNode *from, SimpleDirectedGraphNode *to) |
| Check if a dependence is in the graph. More...
|
|
void | printGraph () |
|
std::set
< SimpleDirectedGraphNode * > | getReachable (SimpleDirectedGraphNode *start, TraverseDirection dir) |
|
| SimpleDirectedGraph () |
|
virtual | ~SimpleDirectedGraph () |
|
std::set
< SimpleDirectedGraphNode * > | getNodes () |
| get all the nodes in the graph More...
|
|
virtual void | addNode (SimpleDirectedGraphNode *node) |
| Add a node to the graph. More...
|
|
virtual void | removeNode (SimpleDirectedGraphNode *node) |
|
virtual void | removeLink (SimpleDirectedGraphNode *from, SimpleDirectedGraphNode *to) |
| Remove a linkt between "from" and "to". More...
|
|
virtual void | addLink (SimpleDirectedGraphNode *from, SimpleDirectedGraphNode *to) |
| Add a link to the graph between "from" and to "to". More...
|
|
bool | nodeExists (SimpleDirectedGraphNode *node) |
| Check if a node containing data is in the graph. More...
|
|
bool | linkExists (SimpleDirectedGraphNode *from, SimpleDirectedGraphNode *to) |
| Check if a dependence is in the graph. More...
|
|
void | printGraph () |
|
std::set
< SimpleDirectedGraphNode * > | getReachable (SimpleDirectedGraphNode *start, TraverseDirection dir) |
|