Package com.ibm.wala.cfg.cdg

Class ControlDependenceGraph<T>

java.lang.Object

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

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

com.ibm.wala.cfg.cdg.ControlDependenceGraph<T>

All Implemented Interfaces:

EdgeManager<T>, Graph<T>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedNodeManager<T>, Iterable<T>

public class ControlDependenceGraph<T>
extends AbstractNumberedGraph<T>

Control Dependence Graph

Constructor Summary

Constructors

Constructor	Description
ControlDependenceGraph(MinimalCFG<T> cfg)
ControlDependenceGraph(MinimalCFG<T> cfg, boolean wantEdgeLabels)

Method Summary

Modifier and Type	Method	Description
boolean	controlEquivalent(T bb1, T bb2)
MinimalCFG<T>	getControlFlowGraph()
Set<? extends Object>	getEdgeLabels(T from, T to)	Return the set of edge labels for the control flow edges that cause the given edge in the CDG.
NumberedEdgeManager<T>	getEdgeManager()
NumberedNodeManager<T>	getNodeManager()
protected Object	makeEdgeLabel(T from, T to, T s)
String	toString()

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

Constructor Details

ControlDependenceGraph

public ControlDependenceGraph(MinimalCFG<T> cfg,
 boolean wantEdgeLabels)

Parameters:

cfg - governing control flow graph

wantEdgeLabels - whether to compute edge labels for CDG edges

ControlDependenceGraph

public ControlDependenceGraph(MinimalCFG<T> cfg)

Parameters:

cfg - governing control flow graph

Method Details

makeEdgeLabel

protected Object makeEdgeLabel(T from,
 T to,
 T s)

toString

public String toString()

Overrides:

toString in class AbstractGraph<T>

getControlFlowGraph

public MinimalCFG<T> getControlFlowGraph()

getEdgeLabels

public Set<? extends Object> getEdgeLabels(T from,
 T to)

Return the set of edge labels for the control flow edges that cause the given edge in the CDG. Requires that the CDG be constructed with wantEdgeLabels being true.

getNodeManager

public NumberedNodeManager<T> getNodeManager()

Specified by:

getNodeManager in class AbstractNumberedGraph<T>

Returns:

the object which manages nodes in the graph

getEdgeManager

public NumberedEdgeManager<T> getEdgeManager()

Specified by:

getEdgeManager in class AbstractNumberedGraph<T>

Returns:

the object which manages edges in the graph

controlEquivalent

public boolean controlEquivalent(T bb1,
 T bb2)