Package com.ibm.wala.ipa.slicer.thin

Class CISDG

java.lang.Object

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

All Implemented Interfaces:

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

public class CISDG
extends 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	Description
protected	CISDG(SDG<InstanceKey> noHeap, Map<Statement,Set<PointerKey>> mod, Map<Statement,Set<PointerKey>> ref)

Method Summary

Modifier and Type	Method	Description
void	addEdge(Statement src, Statement dst)
void	addNode(Statement n)	add a node to this graph
boolean	containsNode(Statement N)
boolean	equals(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)	Return the number of immediate predecessor nodes of n
IntSet	getPredNodeNumbers(Statement node)
Iterator<Statement>	getPredNodes(Statement N)	Return an Iterator over the immediate predecessor nodes of n
int	getSuccNodeCount(Statement N)	Return the number of immediate successor nodes of this Node in the Graph
IntSet	getSuccNodeNumbers(Statement node)
Iterator<Statement>	getSuccNodes(Statement N)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(Statement src, Statement dst)
int	hashCode()
Iterator<? extends Statement>	iterateLazyNodes()	Iterate over the nodes which have been discovered so far, but do NOT eagerly construct the entire graph.
Iterator<Statement>	iterateNodes(IntSet s)
Iterator<Statement>	iterator()
void	removeAllIncidentEdges(Statement node)
void	removeEdge(Statement src, Statement dst)
void	removeIncomingEdges(Statement node)
void	removeNode(Statement n)	remove a node from this graph
void	removeNodeAndEdges(Statement N)	remove a node and all its incident edges
void	removeOutgoingEdges(Statement node)
Stream<Statement>	stream()
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 Details

CISDG

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

Method Details

addEdge

public void addEdge(Statement src,
 Statement dst)

Specified by:

addEdge in interface EdgeManager<Statement>

addNode

public void addNode(Statement n)

Description copied from interface: NodeManager

add a node to this graph

Specified by:

addNode in interface NodeManager<Statement>

containsNode

public boolean containsNode(Statement N)

Specified by:

containsNode in interface NodeManager<Statement>

Returns:

true iff the graph contains the specified node

equals

public boolean equals(Object obj)

Overrides:

equals in class 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 NumberedNodeManager<Statement>

getNode

public Statement getNode(int number)

Specified by:

getNode in interface NumberedNodeManager<Statement>

getNumber

public int getNumber(Statement N)

Specified by:

getNumber in interface NumberedNodeManager<Statement>

getNumberOfNodes

public int getNumberOfNodes()

Specified by:

getNumberOfNodes in interface NodeManager<Statement>

Returns:

the number of nodes in this graph

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)

Description copied from interface: EdgeManager

Return the number of immediate predecessor nodes of n

Specified by:

getPredNodeCount in interface EdgeManager<Statement>

Returns:

the number of immediate predecessors of n.

getPredNodeNumbers

public IntSet getPredNodeNumbers(Statement node)

Specified by:

getPredNodeNumbers in interface NumberedEdgeManager<Statement>

Returns:

the numbers identifying the immediate predecessors of node

getPredNodes

public Iterator<Statement> getPredNodes(Statement N)

Description copied from interface: EdgeManager

Return an Iterator over the immediate predecessor nodes of n

This method never returns null.

Specified by:

getPredNodes in interface EdgeManager<Statement>

Returns:

an Iterator over the immediate predecessor nodes of this Node.

getSuccNodeCount

public int getSuccNodeCount(Statement N)

Description copied from interface: EdgeManager

Return the number of immediate successor nodes of this Node in the Graph

Specified by:

getSuccNodeCount in interface EdgeManager<Statement>

Returns:

the number of immediate successor Nodes of this Node in the Graph.

getSuccNodeNumbers

public IntSet getSuccNodeNumbers(Statement node)

Specified by:

getSuccNodeNumbers in interface NumberedEdgeManager<Statement>

Returns:

the numbers identifying the immediate successors of node

getSuccNodes

public Iterator<Statement> getSuccNodes(Statement N)

Description copied from interface: EdgeManager

Return an Iterator over the immediate successor nodes of n

This method never returns null.

Specified by:

getSuccNodes in interface EdgeManager<Statement>

Returns:

an Iterator over the immediate successor nodes of n

hasEdge

public boolean hasEdge(Statement src,
 Statement dst)

Specified by:

hasEdge in interface EdgeManager<Statement>

hashCode

public int hashCode()

Overrides:

hashCode in class Object

iterateLazyNodes

public 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 Iterator<Statement> iterator()

Specified by:

iterator in interface Iterable<Statement>

Specified by:

iterator in interface NodeManager<Statement>

Returns:

an Iterator of the nodes in this graph

stream

public Stream<Statement> stream()

Specified by:

stream in interface NodeManager<Statement>

Returns:

a Stream of the nodes in this graph

iterateNodes

public Iterator<Statement> iterateNodes(IntSet s)

Specified by:

iterateNodes in interface NumberedNodeManager<Statement>

Returns:

iterator of nodes with the numbers in set s

removeAllIncidentEdges

public void removeAllIncidentEdges(Statement node)

Specified by:

removeAllIncidentEdges in interface EdgeManager<Statement>

removeEdge

public void removeEdge(Statement src,
 Statement dst)

Specified by:

removeEdge in interface EdgeManager<Statement>

removeIncomingEdges

public void removeIncomingEdges(Statement node)

Specified by:

removeIncomingEdges in interface EdgeManager<Statement>

removeNode

public void removeNode(Statement n)

Description copied from interface: NodeManager

remove a node from this graph

Specified by:

removeNode in interface NodeManager<Statement>

removeNodeAndEdges

public void removeNodeAndEdges(Statement N)

Description copied from interface: Graph

remove a node and all its incident edges

Specified by:

removeNodeAndEdges in interface Graph<Statement>

removeOutgoingEdges

public void removeOutgoingEdges(Statement node)

Specified by:

removeOutgoingEdges in interface EdgeManager<Statement>

toString

public String toString()

Overrides:

toString in class Object

getClassHierarchy

public IClassHierarchy getClassHierarchy()

Specified by:

getClassHierarchy in interface IClassHierarchyDweller