Package com.ibm.wala.ipa.slicer

Class SDG<T extends InstanceKey>

java.lang.Object

com.ibm.wala.util.graph.AbstractGraph<T>

com.ibm.wala.util.graph.AbstractNumberedGraph<Statement>

com.ibm.wala.ipa.slicer.SDG<T>

All Implemented Interfaces:

IClassHierarchyDweller, ISDG, EdgeManager<Statement>, Graph<Statement>, NodeManager<Statement>, NumberedEdgeManager<Statement>, NumberedGraph<Statement>, NumberedNodeManager<Statement>, Iterable<Statement>

public class SDG<T extends InstanceKey>
extends AbstractNumberedGraph<Statement>
implements ISDG

System dependence graph.

An SDG comprises a set of PDGs, one for each method. We compute these lazily.

Prototype implementation. Not efficient.

Constructor Summary

Constructors

Constructor	Description
SDG(CallGraph cg, PointerAnalysis<T> pa, ModRef<T> modRef, Slicer.DataDependenceOptions dOptions, Slicer.ControlDependenceOptions cOptions)
SDG(CallGraph cg, PointerAnalysis<T> pa, ModRef<T> modRef, Slicer.DataDependenceOptions dOptions, Slicer.ControlDependenceOptions cOptions, HeapExclusions heapExclude)
SDG(CallGraph cg, PointerAnalysis<T> pa, Slicer.DataDependenceOptions dOptions, Slicer.ControlDependenceOptions cOptions)

Method Summary

Modifier and Type	Method	Description
CallGraph	getCallGraph()
IClassHierarchy	getClassHierarchy()
Slicer.ControlDependenceOptions	getCOptions()	Slicer.ControlDependenceOptions used to construct this graph.
Slicer.DataDependenceOptions	getDOptions()
Set<? extends Dependency>	getEdgeLabels(Statement src, Statement dst)
protected NumberedEdgeManager<Statement>	getEdgeManager()
NumberedNodeManager<Statement>	getNodeManager()
PDG<T>	getPDG(CGNode node)	Get the program dependence graph constructed for a particular node.
PointerAnalysis<T>	getPointerAnalysis()
Iterator<? extends Statement>	iterateLazyNodes()	iterate over the nodes without constructing any new ones.
String	toString()	Use this with care.

Methods inherited from class com.ibm.wala.util.graph.AbstractNumberedGraph

getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

Methods inherited from class com.ibm.wala.util.graph.AbstractGraph

addEdge, addNode, containsNode, edgeString, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, nodeString, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.ibm.wala.util.graph.EdgeManager

addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Methods inherited from interface com.ibm.wala.util.graph.Graph

removeNodeAndEdges

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface com.ibm.wala.util.graph.NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Methods inherited from interface com.ibm.wala.util.graph.NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Constructor Details

SDG

public SDG(CallGraph cg,
 PointerAnalysis<T> pa,
 Slicer.DataDependenceOptions dOptions,
 Slicer.ControlDependenceOptions cOptions)

SDG

public SDG(CallGraph cg,
 PointerAnalysis<T> pa,
 ModRef<T> modRef,
 Slicer.DataDependenceOptions dOptions,
 Slicer.ControlDependenceOptions cOptions)

SDG

public SDG(CallGraph cg,
 PointerAnalysis<T> pa,
 ModRef<T> modRef,
 Slicer.DataDependenceOptions dOptions,
 Slicer.ControlDependenceOptions cOptions,
 HeapExclusions heapExclude)
    throws IllegalArgumentException

Throws:

IllegalArgumentException

Method Details

toString

public String toString()

Use this with care. This forces eager construction of the SDG, and SDGs can be big.

Overrides:

toString in class AbstractGraph<Statement>

See Also:

• AbstractGraph.toString()

iterateLazyNodes

public Iterator<? extends Statement> iterateLazyNodes()

iterate over the nodes without constructing any new ones. Use with extreme care. May break graph traversals that lazily add more nodes.

Specified by:

iterateLazyNodes in interface ISDG

getEdgeManager

protected NumberedEdgeManager<Statement> getEdgeManager()

Specified by:

getEdgeManager in class AbstractNumberedGraph<Statement>

Returns:

the object which manages edges in the graph

getNodeManager

public NumberedNodeManager<Statement> getNodeManager()

Specified by:

getNodeManager in class AbstractNumberedGraph<Statement>

Returns:

the object which manages nodes in the graph

getPDG

public PDG<T> getPDG(CGNode node)

Description copied from interface: ISDG

Get the program dependence graph constructed for a particular node.

Specified by:

getPDG in interface ISDG

getCOptions

public Slicer.ControlDependenceOptions getCOptions()

Description copied from interface: ISDG

Slicer.ControlDependenceOptions used to construct this graph.

Specified by:

getCOptions in interface ISDG

getDOptions

public Slicer.DataDependenceOptions getDOptions()

getCallGraph

public CallGraph getCallGraph()

getClassHierarchy

public IClassHierarchy getClassHierarchy()

Specified by:

getClassHierarchy in interface IClassHierarchyDweller

getPointerAnalysis

public PointerAnalysis<T> getPointerAnalysis()

getEdgeLabels

public Set<? extends Dependency> getEdgeLabels(Statement src,
 Statement dst)