ROSE  0.9.6a
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | Private Member Functions | Private Attributes | List of all members
DataDependenceGraph Class Reference

#include <DependenceGraph.h>

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

Public Member Functions

 DataDependenceGraph (SgNode *head, EDefUse *du, InterproceduralInfo *ii=NULL)
 
void computeInterproceduralInformation (InterproceduralInfo *ii)
 
 DataDependenceGraph (SgNode *head, EDefUse *du, InterproceduralInfo *ii=NULL)
 
void computeInterproceduralInformation (InterproceduralInfo *ii)
 
- Public Member Functions inherited from DependenceGraph
 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 >)
 
- Public Member Functions inherited from SimpleDirectedGraph
 ~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)
 

Private Member Functions

void _buildDefUseChains (SgFunctionDefinition *fD)
 
void buildDDG ()
 
void _buildDDG ()
 
void _processReturns ()
 
SgFunctionCallExp * _findArgExprFromRef (SgNode *&funcArg, SgNode *use)
 
void _buildDefUseChains (SgFunctionDefinition *fD)
 
void buildDDG ()
 
void _buildDDG ()
 
void _processReturns ()
 
SgFunctionCallExp * _findArgExprFromRef (SgNode *&funcArg, SgNode *use)
 

Private Attributes

EDefUse * defuse
 
SgFunctionDefinition * functionDef
 
SgFunctionDeclaration * functionDecl
 
SgFunctionDefinition * _head
 
DefaultDUchain _defuse
 
InterproceduralInfo * _interprocedural
 

Additional Inherited Members

- Public Types inherited from DependenceGraph
enum  EdgeType {
  CONTROL = 0x1,
  CALL = 0x4,
  CALL_RETURN = 0x5,
  DATA = 0x2,
  SUMMARY = 0x3,
  PARAMETER_IN = 0x7,
  PARAMETER_OUT = 0x8,
  SYNTACTIC = 0xe,
  DATA_HELPER = 0x9,
  CONTROL_HELPER = 0xa,
  GLOBALVAR_HELPER = 0xb,
  COMPLETENESS_HELPER =0xc,
  BELONGS_TO = 0xd,
  DO_NOT_FOLLOW = 0x10,
  CONTROL = 0x1,
  CALL = 0x4,
  CALL_RETURN = 0x5,
  DATA = 0x2,
  SUMMARY = 0x3,
  PARAMETER_IN = 0x7,
  PARAMETER_OUT = 0x8,
  SYNTACTIC = 0xe,
  DATA_HELPER = 0x9,
  CONTROL_HELPER = 0xa,
  GLOBALVAR_HELPER = 0xb,
  COMPLETENESS_HELPER =0xc,
  BELONGS_TO = 0xd,
  DO_NOT_FOLLOW = 0x10
}
 
enum  EdgeType {
  CONTROL = 0x1,
  CALL = 0x4,
  CALL_RETURN = 0x5,
  DATA = 0x2,
  SUMMARY = 0x3,
  PARAMETER_IN = 0x7,
  PARAMETER_OUT = 0x8,
  SYNTACTIC = 0xe,
  DATA_HELPER = 0x9,
  CONTROL_HELPER = 0xa,
  GLOBALVAR_HELPER = 0xb,
  COMPLETENESS_HELPER =0xc,
  BELONGS_TO = 0xd,
  DO_NOT_FOLLOW = 0x10,
  CONTROL = 0x1,
  CALL = 0x4,
  CALL_RETURN = 0x5,
  DATA = 0x2,
  SUMMARY = 0x3,
  PARAMETER_IN = 0x7,
  PARAMETER_OUT = 0x8,
  SYNTACTIC = 0xe,
  DATA_HELPER = 0x9,
  CONTROL_HELPER = 0xa,
  GLOBALVAR_HELPER = 0xb,
  COMPLETENESS_HELPER =0xc,
  BELONGS_TO = 0xd,
  DO_NOT_FOLLOW = 0x10
}
 
- Static Public Attributes inherited from DependenceGraph
static const char * edgeNameArray [8]
 
- Protected Types inherited from DependenceGraph
typedef std::pair
< DependenceNode
*, DependenceNode * > 		Edge
 *! InterproceduralInfo *_interprocedural; More...
 
typedef std::pair
< DependenceNode
*, DependenceNode * > 		Edge
 *! InterproceduralInfo *_interprocedural; More...
 
- Protected Member Functions inherited from DependenceGraph
bool isLibraryFunction (SgFunctionDeclaration *sgFD) const
 
bool isLibraryFunction (SgFunctionDeclaration *sgFD) const
 
- Protected Attributes inherited from DependenceGraph
bool debugme
 
std::map< SgNode
*, DependenceNode * > 		sgNodeToDepNodeMap
 *! std::map < DependenceNode *, DependenceNode * >_depnode_map; More...
 
std::map
< DependenceNode::NodeType,
std::map< SgNode
*, DependenceNode * > > 		nodeTypeToDepNodeMapMap
 
std::map< EdgeType, std::set
< Edge > > 		edgeTypeMap
 
std::map< Edge, std::set
< EdgeType > > 		edgeMap
 

Detailed Description

Definition at line 1016 of file DependenceGraph.h.

Constructor & Destructor Documentation

DataDependenceGraph::DataDependenceGraph ( SgNode *  head,
EDefUse *  du,
InterproceduralInfo *  ii = NULL 
)
DataDependenceGraph::DataDependenceGraph ( SgNode *  head,
EDefUse *  du,
InterproceduralInfo *  ii = NULL 
)

Member Function Documentation

void DataDependenceGraph::computeInterproceduralInformation ( InterproceduralInfo *  ii)
void DataDependenceGraph::_buildDefUseChains ( SgFunctionDefinition *  fD)
private
void DataDependenceGraph::buildDDG ( )
private
void DataDependenceGraph::_buildDDG ( )
private
void DataDependenceGraph::_processReturns ( )
private
SgFunctionCallExp* DataDependenceGraph::_findArgExprFromRef ( SgNode *&  funcArg,
SgNode *  use 
)
private
void DataDependenceGraph::computeInterproceduralInformation ( InterproceduralInfo *  ii)
void DataDependenceGraph::_buildDefUseChains ( SgFunctionDefinition *  fD)
private
void DataDependenceGraph::buildDDG ( )
private
void DataDependenceGraph::_buildDDG ( )
private
void DataDependenceGraph::_processReturns ( )
private
SgFunctionCallExp* DataDependenceGraph::_findArgExprFromRef ( SgNode *&  funcArg,
SgNode *  use 
)
private

Member Data Documentation

EDefUse * DataDependenceGraph::defuse
private

Definition at line 1047 of file DependenceGraph.h.

SgFunctionDefinition * DataDependenceGraph::functionDef
private

Definition at line 1050 of file DependenceGraph.h.

SgFunctionDeclaration * DataDependenceGraph::functionDecl
private

Definition at line 1051 of file DependenceGraph.h.

SgFunctionDefinition * DataDependenceGraph::_head
private

Definition at line 1077 of file DependenceGraph.h.

DefaultDUchain DataDependenceGraph::_defuse
private

Definition at line 1080 of file DependenceGraph.h.

InterproceduralInfo* DataDependenceGraph::_interprocedural
private

Definition at line 1051 of file NEW_DependenceGraph.h.

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