|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object
|
+--soot.toolkits.graph.HashMutableDirectedGraph
|
+--soot.toolkits.graph.MemoryEfficientGraph
|
+--soot.jimple.toolkits.invoke.VTATypeGraph
A graph where the nodes are types in the analysed program; edges indicate that there is assignment between two types.
| Field Summary |
| Fields inherited from class soot.toolkits.graph.HashMutableDirectedGraph |
heads, nodeToPreds, nodeToSuccs, tails |
| Constructor Summary | |
VTATypeGraph(InvokeGraph ig)
|
|
| Method Summary | |
void |
addEdge(java.lang.Object o,
java.lang.Object p)
Adds an edge to the graph between 2 nodes. |
void |
addNode(java.lang.Object o)
Adds a node to the graph. |
static boolean |
isRefLikeType(Type t)
Returns true if t is RefType or ArrayType. |
int |
numEdges()
|
| Methods inherited from class soot.toolkits.graph.MemoryEfficientGraph |
removeEdge, removeNode |
| Methods inherited from class soot.toolkits.graph.HashMutableDirectedGraph |
clearAll, clone, containsEdge, containsNode, getHeads, getNodes, getPredsOf, getSuccsOf, getTails, iterator, printGraph, size |
| Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Methods inherited from interface soot.toolkits.graph.MutableDirectedGraph |
containsEdge, containsNode, getNodes, removeEdge, removeNode |
| Methods inherited from interface soot.toolkits.graph.DirectedGraph |
getHeads, getPredsOf, getSuccsOf, getTails, iterator, size |
| Constructor Detail |
public VTATypeGraph(InvokeGraph ig)
| Method Detail |
public void addNode(java.lang.Object o)
MutableDirectedGraph
addNode in interface MutableDirectedGraphaddNode in class MemoryEfficientGrapho - a node to add to the graph.DirectedGraph.getHeads(),
DirectedGraph.getTails()
public void addEdge(java.lang.Object o,
java.lang.Object p)
MutableDirectedGraph
addEdge in interface MutableDirectedGraphaddEdge in class MemoryEfficientGrapho - out node for the edge.p - in node for the edge.public int numEdges()
public static boolean isRefLikeType(Type t)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||