com.ibm.wala.ipa.slicer.thin

Class CISDG

java.lang.Object

com.ibm.wala.ipa.slicer.thin.CISDG

All Implemented Interfaces:

IClassHierarchyDweller, ISDG, com.ibm.wala.util.graph.EdgeManager<Statement>, com.ibm.wala.util.graph.Graph<Statement>, com.ibm.wala.util.graph.NodeManager<Statement>, com.ibm.wala.util.graph.NumberedEdgeManager<Statement>, com.ibm.wala.util.graph.NumberedGraph<Statement>, com.ibm.wala.util.graph.NumberedNodeManager<Statement>, java.lang.Iterable<Statement>

public class CISDG
extends java.lang.Object
implements ISDG

A context-insensitive SDG. This class assumes that it is given a normal NO_HEAP SDG. It adds context-insensitive heap information directly from heap stores to corresponding loads, based on an underlying pointer analysis.

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	CISDG(SDG<InstanceKey> noHeap, java.util.Map<Statement,java.util.Set<PointerKey>> mod, java.util.Map<Statement,java.util.Set<PointerKey>> ref)

Method Summary

Modifier and Type	Method and Description
void	addEdge(Statement src, Statement dst)
void	addNode(Statement n)
boolean	containsNode(Statement N)
boolean	equals(java.lang.Object obj)
IClassHierarchy	getClassHierarchy()
Slicer.ControlDependenceOptions	getCOptions() Slicer.ControlDependenceOptions used to construct this graph.
int	getMaxNumber()
Statement	getNode(int number)
int	getNumber(Statement N)
int	getNumberOfNodes()
PDG<InstanceKey>	getPDG(CGNode node) Get the program dependence graph constructed for a particular node.
int	getPredNodeCount(Statement N)
com.ibm.wala.util.intset.IntSet	getPredNodeNumbers(Statement node)
java.util.Iterator<Statement>	getPredNodes(Statement N)
int	getSuccNodeCount(Statement N)
com.ibm.wala.util.intset.IntSet	getSuccNodeNumbers(Statement node)
java.util.Iterator<Statement>	getSuccNodes(Statement N)
boolean	hasEdge(Statement src, Statement dst)
int	hashCode()
java.util.Iterator<? extends Statement>	iterateLazyNodes() Iterate over the nodes which have been discovered so far, but do NOT eagerly construct the entire graph.
java.util.Iterator<Statement>	iterateNodes(com.ibm.wala.util.intset.IntSet s)
java.util.Iterator<Statement>	iterator()
void	removeAllIncidentEdges(Statement node)
void	removeEdge(Statement src, Statement dst)
void	removeIncomingEdges(Statement node)
void	removeNode(Statement n)
void	removeNodeAndEdges(Statement N)
void	removeOutgoingEdges(Statement node)
java.util.stream.Stream<Statement>	stream()
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

CISDG

protected CISDG(SDG<InstanceKey> noHeap,
                java.util.Map<Statement,java.util.Set<PointerKey>> mod,
                java.util.Map<Statement,java.util.Set<PointerKey>> ref)

Method Detail

addEdge

public void addEdge(Statement src,
                    Statement dst)

Specified by:

addEdge in interface com.ibm.wala.util.graph.EdgeManager<Statement>

addNode

public void addNode(Statement n)

Specified by:

addNode in interface com.ibm.wala.util.graph.NodeManager<Statement>

containsNode

public boolean containsNode(Statement N)

Specified by:

containsNode in interface com.ibm.wala.util.graph.NodeManager<Statement>

equals

public boolean equals(java.lang.Object obj)

Overrides:

equals in class java.lang.Object

getCOptions

public Slicer.ControlDependenceOptions getCOptions()

Description copied from interface: ISDG

Slicer.ControlDependenceOptions used to construct this graph.

Specified by:

getCOptions in interface ISDG

getMaxNumber

public int getMaxNumber()

Specified by:

getMaxNumber in interface com.ibm.wala.util.graph.NumberedNodeManager<Statement>

getNode

public Statement getNode(int number)

Specified by:

getNode in interface com.ibm.wala.util.graph.NumberedNodeManager<Statement>

getNumber

public int getNumber(Statement N)

Specified by:

getNumber in interface com.ibm.wala.util.graph.NumberedNodeManager<Statement>

getNumberOfNodes

public int getNumberOfNodes()

Specified by:

getNumberOfNodes in interface com.ibm.wala.util.graph.NodeManager<Statement>

getPDG

public PDG<InstanceKey> getPDG(CGNode node)

Description copied from interface: ISDG

Get the program dependence graph constructed for a particular node.

Specified by:

getPDG in interface ISDG

getPredNodeCount

public int getPredNodeCount(Statement N)

Specified by:

getPredNodeCount in interface com.ibm.wala.util.graph.EdgeManager<Statement>

getPredNodeNumbers

public com.ibm.wala.util.intset.IntSet getPredNodeNumbers(Statement node)

Specified by:

getPredNodeNumbers in interface com.ibm.wala.util.graph.NumberedEdgeManager<Statement>

getPredNodes

public java.util.Iterator<Statement> getPredNodes(Statement N)

Specified by:

getPredNodes in interface com.ibm.wala.util.graph.EdgeManager<Statement>

getSuccNodeCount

public int getSuccNodeCount(Statement N)

Specified by:

getSuccNodeCount in interface com.ibm.wala.util.graph.EdgeManager<Statement>

getSuccNodeNumbers

public com.ibm.wala.util.intset.IntSet getSuccNodeNumbers(Statement node)

Specified by:

getSuccNodeNumbers in interface com.ibm.wala.util.graph.NumberedEdgeManager<Statement>

getSuccNodes

public java.util.Iterator<Statement> getSuccNodes(Statement N)

Specified by:

getSuccNodes in interface com.ibm.wala.util.graph.EdgeManager<Statement>

hasEdge

public boolean hasEdge(Statement src,
                       Statement dst)

Specified by:

hasEdge in interface com.ibm.wala.util.graph.EdgeManager<Statement>

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

iterateLazyNodes

public java.util.Iterator<? extends Statement> iterateLazyNodes()

Description copied from interface: ISDG

Iterate over the nodes which have been discovered so far, but do NOT eagerly construct the entire graph.

Specified by:

iterateLazyNodes in interface ISDG

iterator

public java.util.Iterator<Statement> iterator()

Specified by:

iterator in interface com.ibm.wala.util.graph.NodeManager<Statement>

Specified by:

iterator in interface java.lang.Iterable<Statement>

stream

public java.util.stream.Stream<Statement> stream()

Specified by:

stream in interface com.ibm.wala.util.graph.NodeManager<Statement>

iterateNodes

public java.util.Iterator<Statement> iterateNodes(com.ibm.wala.util.intset.IntSet s)

Specified by:

iterateNodes in interface com.ibm.wala.util.graph.NumberedNodeManager<Statement>

removeAllIncidentEdges

public void removeAllIncidentEdges(Statement node)

Specified by:

removeAllIncidentEdges in interface com.ibm.wala.util.graph.EdgeManager<Statement>

removeEdge

public void removeEdge(Statement src,
                       Statement dst)

Specified by:

removeEdge in interface com.ibm.wala.util.graph.EdgeManager<Statement>

removeIncomingEdges

public void removeIncomingEdges(Statement node)

Specified by:

removeIncomingEdges in interface com.ibm.wala.util.graph.EdgeManager<Statement>

removeNode

public void removeNode(Statement n)

Specified by:

removeNode in interface com.ibm.wala.util.graph.NodeManager<Statement>

removeNodeAndEdges

public void removeNodeAndEdges(Statement N)

Specified by:

removeNodeAndEdges in interface com.ibm.wala.util.graph.Graph<Statement>

removeOutgoingEdges

public void removeOutgoingEdges(Statement node)

Specified by:

removeOutgoingEdges in interface com.ibm.wala.util.graph.EdgeManager<Statement>

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

getClassHierarchy

public IClassHierarchy getClassHierarchy()

Specified by:

getClassHierarchy in interface IClassHierarchyDweller