cetus.analysis

Class IPAGraph

java.lang.Object

cetus.analysis.DFAGraph

cetus.analysis.IPAGraph

public class IPAGraph
extends DFAGraph

Class IPAGraph provides a call graph for interprocedural analysis.

Nested Class Summary

Nested classes/interfaces inherited from class cetus.analysis.DFAGraph

DFAGraph.TopIterator

Constructor Summary

Constructors

Constructor and Description
IPAGraph(Program prog) Constructs a new IPAGraph with the given program and performs topological ordering of the graph.

Method Summary

Methods

Modifier and Type	Method and Description
void	clean() Cleans up the data stored in the graph.
boolean	containsCycle()
boolean	containsFunctionPointer()
IPANode	getFirstNode() Returns the firs node in the ordered list.
IPANode	getLastNode() Returns the last node in the ordered list.
int	getLastOrder() Returns the last order in the ordered list.
IPANode	getNode(int order) Returns the node having the given order.
IPANode	getNode(Procedure procedure) Returns the node representing the given procedure.
Program	getProgram() Returns the program associated with this graph.
java.lang.String	getReport() Returns statisitcs of the graph
IPANode	getRoot() Returns the root node of the graph.
java.lang.Integer	getTopOrder(IPANode node) Returns the ordered node number for the given node.
java.util.Iterator<IPANode>	topiterator()
java.lang.String	toString() Returns a string dump of the call graph.
java.lang.String	toString(java.lang.String tag) Returns a string dump of the call graph with the given tag.

Methods inherited from class cetus.analysis.DFAGraph

absorb, addEdge, addNode, getEntryNodes, getExitNodes, getFirst, getLast, getNode, getNodeWith, getSCC, isEmpty, isReachable, iterator, removeEdge, removeNode, removeNodes, size, toDot, topologicalSort, topologicalSortOptimized

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

IPAGraph

public IPAGraph(Program prog)

Constructs a new IPAGraph with the given program and performs topological ordering of the graph.

Method Detail

toString

public java.lang.String toString()

Returns a string dump of the call graph.

Overrides:

toString in class DFAGraph

Returns:

the contents of the graph in string.

toString

public java.lang.String toString(java.lang.String tag)

Returns a string dump of the call graph with the given tag.

Parameters:

tag - the keyword being printed for each node -- usually the name of the analysis pass using this graph).

Returns:

the string dump.

getTopOrder

public java.lang.Integer getTopOrder(IPANode node)

Returns the ordered node number for the given node.

getNode

public IPANode getNode(int order)

Returns the node having the given order.

Overrides:

getNode in class DFAGraph

Parameters:

order - the index of the node.

Returns:

the node indexed by id.

getNode

public IPANode getNode(Procedure procedure)

Returns the node representing the given procedure.

getFirstNode

public IPANode getFirstNode()

Returns the firs node in the ordered list.

getRoot

public IPANode getRoot()

Returns the root node of the graph.

getLastNode

public IPANode getLastNode()

Returns the last node in the ordered list.

getLastOrder

public int getLastOrder()

Returns the last order in the ordered list.

topiterator

public java.util.Iterator<IPANode> topiterator()

getProgram

public Program getProgram()

Returns the program associated with this graph.

clean

public void clean()

Cleans up the data stored in the graph.

containsFunctionPointer

public boolean containsFunctionPointer()

containsCycle

public boolean containsCycle()

getReport

public java.lang.String getReport()

Returns statisitcs of the graph