|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectsoot.toolkits.graph.UnitGraph
Represents a CFG where the nodes are Unit
instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units.
This is an abstract class, providing the facilities used to build CFGs for specific purposes.
Field Summary | |
protected Body |
body
|
protected SootMethod |
method
|
protected Chain |
unitChain
|
protected Map |
unitToPreds
|
protected Map |
unitToSuccs
|
Constructor Summary | |
protected |
UnitGraph(Body body)
Performs the work that is required to construct any sort of UnitGraph. |
Method Summary | |
protected void |
addEdge(Map unitToSuccs,
Map unitToPreds,
Unit head,
Unit tail)
Utility method for adding an edge to maps representing the CFG. |
protected void |
buildHeadsAndTails()
Utility method used in the construction of UnitGraph s, to be
called only after the unitToPreds and unitToSuccs maps have
been built. |
protected void |
buildUnexceptionalEdges(Map unitToSuccs,
Map unitToPreds)
Utility method for UnitGraph constructors. |
protected Map |
combineMapValues(Map mapA,
Map mapB)
Utility method that produces a new map from the Unit s
of this graph's body to the union of the values stored in the
two argument Map s, used to combine the maps of
exceptional and unexceptional predecessors and successors into
maps of all predecessors and successors. |
Body |
getBody()
|
List |
getExtendedBasicBlockPathBetween(Unit from,
Unit to)
Look for a path in graph, from def to use. |
List |
getHeads()
Returns a list of entry points for this graph. |
List |
getPredsOf(Object u)
Returns a list of predecessors for the given node in the graph. |
List |
getSuccsOf(Object u)
Returns a list of successors for the given node in the graph. |
List |
getTails()
Returns a list of exit points for this graph. |
Iterator |
iterator()
Returns an iterator for the nodes in this graph. |
protected static void |
makeMappedListsUnmodifiable(Map map)
Utility method that replaces the values of a Map ,
which must be instances of List , with unmodifiable
equivalents. |
int |
size()
Returns the node count for this graph. |
String |
toString()
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Field Detail |
protected Map unitToSuccs
protected Map unitToPreds
protected SootMethod method
protected Body body
protected Chain unitChain
Constructor Detail |
protected UnitGraph(Body body)
body
- The body of the method for which to construct a
control flow graph.Method Detail |
protected void buildUnexceptionalEdges(Map unitToSuccs, Map unitToPreds)
unitToSuccs
- A Map
from Unit
s to
List
s of Unit
s. This is
an ``out parameter''; callers must pass an empty
Map
. buildUnexceptionalEdges will
add a mapping for every Unit in the
body to a list of its unexceptional successors.unitToPreds
- A Map
from Unit
s to
List
s of Unit
s. This is an
``out parameter''; callers must pass an empty
Map
. buildUnexceptionalEdges will
add a mapping for every Unit in the body
to a list of its unexceptional predecessors.protected void buildHeadsAndTails()
Utility method used in the construction of UnitGraph
s, to be
called only after the unitToPreds and unitToSuccs maps have
been built.
UnitGraph
provides an implementation of
buildHeadsAndTails()
which defines the graph's set
of heads to include the first Unit
in the graph's body,
together with any other Unit which has no predecessors.
It defines the graph's set of tails to include all
Units with no successors. Subclasses of
UnitGraph
may override this method to change the
criteria for classifying a node as a head or tail.
protected static void makeMappedListsUnmodifiable(Map map)
Map
,
which must be instances of List
, with unmodifiable
equivalents.
map
- The map whose values are to be made unmodifiable.protected Map combineMapValues(Map mapA, Map mapB)
Unit
s
of this graph's body to the union of the values stored in the
two argument Map
s, used to combine the maps of
exceptional and unexceptional predecessors and successors into
maps of all predecessors and successors. The values stored in
both argument maps must be List
s of Unit
s,
which are assumed not to contain any duplicate Units.
mapA
- The first map to be combined.mapB
- The second map to be combined.protected void addEdge(Map unitToSuccs, Map unitToPreds, Unit head, Unit tail)
unitToSuccs
- The Map
from Unit
s to List
s
of their successors.unitToPreds
- The Map
from Unit
s to List
s
of their successors.head
- The Unit
from which the edge starts.tail
- The Unit
to which the edge flows.public Body getBody()
Body
public List getExtendedBasicBlockPathBetween(Unit from, Unit to)
from
- start point for the path.to
- end point for the path.
public List getHeads()
DirectedGraph
getHeads
in interface DirectedGraph
public List getTails()
DirectedGraph
getTails
in interface DirectedGraph
public List getPredsOf(Object u)
DirectedGraph
getPredsOf
in interface DirectedGraph
public List getSuccsOf(Object u)
DirectedGraph
getSuccsOf
in interface DirectedGraph
public int size()
DirectedGraph
size
in interface DirectedGraph
public Iterator iterator()
DirectedGraph
iterator
in interface DirectedGraph
public String toString()
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |