Interface ISDG

All Superinterfaces:

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

All Known Implementing Classes:

CISDG, SDG

public interface ISDG
extends NumberedGraph<Statement>, IClassHierarchyDweller

Interface for an SDG (loosely defined here as a graph of Statements. This interface implies that the underlying graph is computed lazily on demand.

Method Summary

Modifier and Type	Method	Description
Slicer.ControlDependenceOptions	getCOptions()	Slicer.ControlDependenceOptions used to construct this graph.
PDG<? extends InstanceKey>	getPDG(CGNode node)	Get the program dependence graph constructed for a particular node.
Iterator<? extends Statement>	iterateLazyNodes()	Iterate over the nodes which have been discovered so far, but do NOT eagerly construct the entire graph.

Methods inherited from interface EdgeManager

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

Modifier and Type	Method	Description
void	addEdge(Statement src, Statement dst)
int	getPredNodeCount(Statement n)	Return the number of immediate predecessor nodes of n
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
Iterator<Statement>	getSuccNodes(Statement n)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(Statement src, Statement dst)
void	removeAllIncidentEdges(Statement node)
void	removeEdge(Statement src, Statement dst)
void	removeIncomingEdges(Statement node)
void	removeOutgoingEdges(Statement node)

Methods inherited from interface Graph

removeNodeAndEdges

Modifier and Type	Method	Description
void	removeNodeAndEdges(Statement n)	remove a node and all its incident edges

Methods inherited from interface IClassHierarchyDweller

getClassHierarchy

Modifier and Type	Method	Description
IClassHierarchy	getClassHierarchy()

Methods inherited from interface Iterable

forEach, spliterator

Methods inherited from interface NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Modifier and Type	Method	Description
void	addNode(Statement n)	add a node to this graph
boolean	containsNode(Statement n)
int	getNumberOfNodes()
default Iterator<Statement>	iterator()
void	removeNode(Statement n)	remove a node from this graph
Stream<Statement>	stream()

Methods inherited from interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Modifier and Type	Method	Description
IntSet	getPredNodeNumbers(Statement node)
IntSet	getSuccNodeNumbers(Statement node)

Methods inherited from interface NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Modifier and Type	Method	Description
int	getMaxNumber()
Statement	getNode(int number)
int	getNumber(Statement N)
Iterator<Statement>	iterateNodes(IntSet s)

Method Details

getCOptions

Slicer.ControlDependenceOptions getCOptions()

Slicer.ControlDependenceOptions used to construct this graph.

getPDG

PDG<? extends InstanceKey> getPDG(CGNode node)

Get the program dependence graph constructed for a particular node.

iterateLazyNodes

Iterator<? extends Statement> iterateLazyNodes()

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