class NstRDGVar : public NstGraph

Reduced dependence graph by variable.

Inheritance:

Public Fields

string petit_input_file

Petit input file

string petit_output_file

Petit result file

Public Methods

bool built()

The field built is null if the creation of the graph failed because of dependence analysis problems Returns -1 if the creation of the graph failed

NstRDGVar(const NstStatement &s)

Builds a reduced dependence graph

Inherited from NstGraph:

Public Fields

NstEdgeList edges

NstVertexList vertices

Public Methods

NstGraph* clone(int deep = 0)

void copy(const NstGraph& s, int deep = 0)

void exec_vcg()

int graph_cc()

NstGraphList* graph_color()

int graph_scc()

NstGraph* merge_color()

virtual void output_vcg(ostream &s)

void system_vcg()

int topological_sort()

Private Methods

friend ostream& operator << (ostream&, const NstGraph&)

friend ostream& operator << (ostream& s, const NstGraphList& glist)

Prints the list of graphs.

NstRDGVar(const NstStatement &s)

Builds a reduced dependence graph. Each vertex is a Nst_Vertex_Variable and corresponds to one array reference.

Parameters:

s - only dependences that involve statements surrounded by the parameter s (typically a loop, or a region) are computed and stored.

bool built()

The field built is null if the creation of the graph failed because of dependence analysis problems Returns -1 if the creation of the graph failed

string petit_input_file

Petit input file. File given to Petit to analyze the code.

string petit_output_file

Petit result file. File produced by Petit.

alphabetic index hierarchy of classes

this page has been generated automatically by doc++

(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de