Uses of Interface
soot.toolkits.graph.DirectedGraph

Packages that use DirectedGraph

Package	Description
soot.dava.internal.asg
soot.jbco.jimpleTransformations
soot.jbco.util
soot.jimple.toolkits.annotation.arraycheck	Classes that carry out an analysis to determine whether or not array bounds checks are necessary.
soot.jimple.toolkits.annotation.purity
soot.jimple.toolkits.callgraph
soot.jimple.toolkits.ide.icfg
soot.jimple.toolkits.infoflow
soot.jimple.toolkits.pointer
soot.jimple.toolkits.scalar	A toolkit for scalar optimization of Jimple.
soot.jimple.toolkits.scalar.pre	Particial redundency elimination.
soot.jimple.toolkits.thread.mhp
soot.jimple.toolkits.thread.mhp.pegcallgraph
soot.jimple.toolkits.thread.synchronization
soot.toolkits.graph	Toolkit to produce and manipulate various types of control flow graphs.
soot.toolkits.graph.interaction
soot.toolkits.graph.pdg
soot.toolkits.scalar	A number of scalar optimizations, and the flow analysis framework.
soot.util	Generally useful utility classes for Soot.
soot.util.cfgcmd

Uses of DirectedGraph in soot.dava.internal.asg

Classes in soot.dava.internal.asg that implement DirectedGraph

Modifier and Type	Class	Description
class	AugmentedStmtGraph

Uses of DirectedGraph in soot.jbco.jimpleTransformations

Constructors in soot.jbco.jimpleTransformations with parameters of type DirectedGraph

Constructor	Description
New2InitFlowAnalysis(DirectedGraph<Unit> graph)

Uses of DirectedGraph in soot.jbco.util

Classes in soot.jbco.util that implement DirectedGraph

Modifier and Type	Class	Description
class	SimpleExceptionalGraph

Uses of DirectedGraph in soot.jimple.toolkits.annotation.arraycheck

Classes in soot.jimple.toolkits.annotation.arraycheck that implement DirectedGraph

Modifier and Type	Class	Description
class	ExtendedHashMutableDirectedGraph<N>	add skipNode method to direct all predecessor edges to successors.

Uses of DirectedGraph in soot.jimple.toolkits.annotation.purity

Classes in soot.jimple.toolkits.annotation.purity that implement DirectedGraph

Modifier and Type	Class	Description
class	DirectedCallGraph	Builds a DirectedGraph from a CallGraph and SootMethodFilter.

Fields in soot.jimple.toolkits.annotation.purity declared as DirectedGraph

Modifier and Type	Field	Description
protected DirectedGraph<SootMethod>	AbstractInterproceduralAnalysis.dg

Uses of DirectedGraph in soot.jimple.toolkits.callgraph

Constructors in soot.jimple.toolkits.callgraph with parameters of type DirectedGraph

Constructor	Description
ConstantArrayAnalysis(DirectedGraph<Unit> graph, Body b)

Uses of DirectedGraph in soot.jimple.toolkits.ide.icfg

Fields in soot.jimple.toolkits.ide.icfg with type parameters of type DirectedGraph

Modifier and Type	Field	Description
protected com.google.common.cache.LoadingCache<Body,DirectedGraph<Unit>>	AbstractJimpleBasedICFG.bodyToUnitGraph

Methods in soot.jimple.toolkits.ide.icfg that return DirectedGraph

Modifier and Type	Method	Description
DirectedGraph<Unit>	AbstractJimpleBasedICFG.getOrCreateUnitGraph(Body body)
DirectedGraph<Unit>	AbstractJimpleBasedICFG.getOrCreateUnitGraph(SootMethod m)
DirectedGraph<Unit>	BackwardsInterproceduralCFG.getOrCreateUnitGraph(SootMethod m)
DirectedGraph<N>	BiDiInterproceduralCFG.getOrCreateUnitGraph(M body)
protected DirectedGraph<Unit>	AbstractJimpleBasedICFG.makeGraph(Body body)

Uses of DirectedGraph in soot.jimple.toolkits.infoflow

Methods in soot.jimple.toolkits.infoflow with parameters of type DirectedGraph

Modifier and Type	Method	Description
static void	InfoFlowAnalysis.printGraphToDotFile(String filename, DirectedGraph<EquivalentValue> graph, String graphname, boolean onePage)
static void	InfoFlowAnalysis.printInfoFlowSummary(DirectedGraph<EquivalentValue> g)

Uses of DirectedGraph in soot.jimple.toolkits.pointer

Constructors in soot.jimple.toolkits.pointer with parameters of type DirectedGraph

Constructor	Description
LocalMustNotAliasAnalysis(DirectedGraph<Unit> directedGraph, Body b)

Uses of DirectedGraph in soot.jimple.toolkits.scalar

Constructors in soot.jimple.toolkits.scalar with parameters of type DirectedGraph

Constructor	Description
FastAvailableExpressionsAnalysis(DirectedGraph<Unit> dg, SootMethod m, SideEffectTester st)
PessimisticAvailableExpressionsAnalysis(DirectedGraph<Unit> dg, SootMethod m, SideEffectTester st)
SlowAvailableExpressionsAnalysis(DirectedGraph<Unit> dg)

Uses of DirectedGraph in soot.jimple.toolkits.scalar.pre

Constructors in soot.jimple.toolkits.scalar.pre with parameters of type DirectedGraph

Constructor	Description
DelayabilityAnalysis(DirectedGraph<Unit> dg)	Deprecated.
DelayabilityAnalysis(DirectedGraph<Unit> dg, EarliestnessComputation earliest, Map<Unit,EquivalentValue> equivRhsMap)	Automatically performs the Delayability-analysis on the graph dg and the Earliest-computation earliest. the equivRhsMap is only here to avoid doing these things again...
DelayabilityAnalysis(DirectedGraph<Unit> dg, EarliestnessComputation earliest, Map<Unit,EquivalentValue> equivRhsMap, BoundedFlowSet<EquivalentValue> set)	Automatically performs the Delayability-analysis on the graph dg and the Earliest-computation earliest. the equivRhsMap is only here to avoid doing these things again... as set-operations are usually more efficient, if the sets come from one source, sets should be shared around analyses, if the analyses are to be combined.
DownSafetyAnalysis(DirectedGraph<Unit> dg)	Deprecated.
DownSafetyAnalysis(DirectedGraph<Unit> dg, Map<Unit,EquivalentValue> unitToGen, SideEffectTester sideEffect)	This constructor automatically performs the DownSafety-analysis. the result of the analysis is as usual in FlowBefore (getFlowBefore()) and FlowAfter (getFlowAfter()).
DownSafetyAnalysis(DirectedGraph<Unit> dg, Map<Unit,EquivalentValue> unitToGen, SideEffectTester sideEffect, BoundedFlowSet<EquivalentValue> set)	This constructor automatically performs the DownSafety-analysis. the result of the analysis is as usual in FlowBefore (getFlowBefore()) and FlowAfter (getFlowAfter()). as sets-operations are usually more efficient, if the original set comes from the same source, this allows to share sets.
NotIsolatedAnalysis(DirectedGraph<Unit> dg, LatestComputation latest, Map<Unit,EquivalentValue> equivRhsMap)	Automatically performs the Isolation-analysis on the graph dg using the Latest-computation latest. the equivRhsMap is only here to avoid doing these things again...
NotIsolatedAnalysis(DirectedGraph<Unit> dg, LatestComputation latest, Map<Unit,EquivalentValue> equivRhsMap, BoundedFlowSet<EquivalentValue> set)	Automatically performs the Isolation-analysis on the graph dg using the Latest-computation latest. the equivRhsMap is only here to avoid doing these things again... the shared set allows more efficient set-operations, when this analysis is joined with other analyses/computations.
UpSafetyAnalysis(DirectedGraph<Unit> dg)	Deprecated.
UpSafetyAnalysis(DirectedGraph<Unit> dg, Map<Unit,EquivalentValue> unitToGen, SideEffectTester sideEffect)	This constructor automatically performs the UpSafety-analysis. the result of the analysis is as usual in FlowBefore (getFlowBefore()) and FlowAfter (getFlowAfter()).
UpSafetyAnalysis(DirectedGraph<Unit> dg, Map<Unit,EquivalentValue> unitToGen, SideEffectTester sideEffect, BoundedFlowSet<EquivalentValue> set)	This constructor automatically performs the UpSafety-analysis. the result of the analysis is as usual in FlowBefore (getFlowBefore()) and FlowAfter (getFlowAfter()). As usually flowset-operations are more efficient if shared, this allows to share sets over several analyses.

Uses of DirectedGraph in soot.jimple.toolkits.thread.mhp

Classes in soot.jimple.toolkits.thread.mhp that implement DirectedGraph

Modifier and Type	Class	Description
class	PegGraph	Oct.

Methods in soot.jimple.toolkits.thread.mhp with parameters of type DirectedGraph

Modifier and Type	Method	Description
static void	PegCallGraphToDot.toDotFile(String methodname, DirectedGraph graph, String graphname)	Generates a dot format file for a DirectedGraph

Constructors in soot.jimple.toolkits.thread.mhp with parameters of type DirectedGraph

Constructor	Description
PegCallGraphToDot(DirectedGraph graph, boolean onepage, String name)
SCC(Iterator<T> it, DirectedGraph<T> g)

Uses of DirectedGraph in soot.jimple.toolkits.thread.mhp.pegcallgraph

Classes in soot.jimple.toolkits.thread.mhp.pegcallgraph that implement DirectedGraph

Modifier and Type	Class	Description
class	PegCallGraph

Uses of DirectedGraph in soot.jimple.toolkits.thread.synchronization

Methods in soot.jimple.toolkits.thread.synchronization that return DirectedGraph

Modifier and Type	Method	Description
DirectedGraph	LockAllocator.getDeadlockGraph()

Uses of DirectedGraph in soot.toolkits.graph

Subinterfaces of DirectedGraph in soot.toolkits.graph

Modifier and Type	Interface	Description
interface	DirectedBodyGraph<N>
interface	EdgeLabelledDirectedGraph<N,L>	A DirectedGraph with labels on the edges.
interface	ExceptionalGraph<N>	Defines the interface for navigating a control flow graph which distinguishes exceptional control flow.
interface	MutableDirectedGraph<N>	Defines a DirectedGraph which is modifiable.
interface	MutableEdgeLabelledDirectedGraph<N,L>	Defines a DirectedGraph which is modifiable and associates a label object with every edge.
interface	ReversibleGraph<N>	DirectedGraph which can be reversed and re-reversed.

Classes in soot.toolkits.graph that implement DirectedGraph

Modifier and Type	Class	Description
class	ArrayRefBlockGraph	A CFG where the nodes are Block instances, and where Units which include array references start new blocks.
class	BlockGraph	Represents the control flow graph of a Body at the basic block level.
class	BriefBlockGraph	Represents a CFG for a Body where the nodes are Blocks and edges are derived from control flow.
class	BriefUnitGraph	Represents a CFG where the nodes are Unit instances, and where no edges are included to account for control flow associated with exceptions.
class	ClassicCompleteBlockGraph	Represents a CFG where the nodes are Blocks and the edges are derived from control flow.
class	ClassicCompleteUnitGraph	Represents a CFG for a Body instance where the nodes are Unit instances, and where edges are a conservative indication of unexceptional and exceptional control flow.
class	CompleteBlockGraph	Represents a CFG for a Body instance where the nodes are Block instances, and where control flow associated with exceptions is taken into account.
class	CompleteUnitGraph	Represents a CFG for a Body instance where the nodes are Unit instances, and where control flow associated with exceptions is taken into account.
class	DominatorTreeAdapter<N>	This adapter provides a DirectedGraph interface to DominatorTree.
class	ExceptionalBlockGraph	Represents a CFG where the nodes are Blocks and the edges are derived from control flow.
class	ExceptionalUnitGraph	Represents a control flow graph for a Body instance where the nodes are Unit instances, and where control flow associated with exceptions is taken into account.
class	HashMutableDirectedGraph<N>	HashMap based implementation of a MutableBlockGraph.
class	HashMutableEdgeLabelledDirectedGraph<N,L>	HashMap based implementation of a MutableEdgeLabelledDirectedGraph.
class	HashReversibleGraph<N>	A reversible version of HashMutableDirectedGraph
class	InverseGraph<N>	An inverted graph of a directed graph.
class	MemoryEfficientGraph<N>	A memory efficient version of HashMutableDirectedGraph, in the sense that throw-away objects passed as arguments will not be kept in the process of adding edges.
class	TrapUnitGraph	Represents a CFG for a Body instance where the nodes are Unit instances, and where, in additional to unexceptional control flow edges, edges are added from every trapped Unit to the Trap's handler Unit, regardless of whether the trapped Units may actually throw the exception caught by the Trap.
class	UnitGraph	Represents a CFG where the nodes are Unit instances and edges represent unexceptional and (possibly) exceptional control flow between Units.
class	ZonedBlockGraph	A CFG where the nodes are Block instances, and where exception boundaries are taken into account when finding the Blocks for the provided Body.

Fields in soot.toolkits.graph declared as DirectedGraph

Modifier and Type	Field	Description
protected DirectedGraph<N>	InverseGraph.g
protected DirectedGraph<N>	StronglyConnectedComponentsFast.g
protected DirectedGraph<N>	DominatorTree.graph
protected DirectedGraph<N>	MHGDominatorsFinder.graph
protected DirectedGraph<N>	SimpleDominatorsFinder.graph

Methods in soot.toolkits.graph that return DirectedGraph

Modifier and Type	Method	Description
DirectedGraph<N>	EdgeLabelledDirectedGraph.getEdgesForLabel(L label)	Returns a DirectedGraph consisting of all edges with the given label and their nodes.
DirectedGraph<N>	DominatorsFinder.getGraph()	Returns the graph to which the analysis pertains.
DirectedGraph<N>	DominatorTree.getGraph()
DirectedGraph<N>	MHGDominatorsFinder.getGraph()
DirectedGraph<N>	SimpleDominatorsFinder.getGraph()
DirectedGraph	StronglyConnectedComponents.getSuperGraph()	Deprecated.

Methods in soot.toolkits.graph with parameters of type DirectedGraph

Modifier and Type	Method	Description
List<N>	Orderer.newList(DirectedGraph<N> g, boolean reverse)	Builds an order for a directed graph.
List<N>	PseudoTopologicalOrderer.newList(DirectedGraph<N> g)	Deprecated. use {@link #newList(DirectedGraph, boolean))} instead
List<N>	PseudoTopologicalOrderer.newList(DirectedGraph<N> g, boolean reverse)	Builds an order for a directed graph.
List<N>	SlowPseudoTopologicalOrderer.newList(DirectedGraph<N> g)	Deprecated. use {@link #newList(DirectedGraph, boolean))} instead
List<N>	SlowPseudoTopologicalOrderer.newList(DirectedGraph<N> g, boolean reverse)	Builds an order for a directed graph.

Constructors in soot.toolkits.graph with parameters of type DirectedGraph

Constructor	Description
HashReversibleGraph(DirectedGraph<N> dg)
InverseGraph(DirectedGraph<N> g)
MHGDominatorsFinder(DirectedGraph<N> graph)
MHGPostDominatorsFinder(DirectedGraph<N> graph)
SimpleDominatorsFinder(DirectedGraph<N> graph)	Compute dominators for provided singled-headed directed graph.
StronglyConnectedComponents(DirectedGraph g)	Deprecated.
StronglyConnectedComponentsFast(DirectedGraph<N> g)

Uses of DirectedGraph in soot.toolkits.graph.interaction

Methods in soot.toolkits.graph.interaction with parameters of type DirectedGraph

Modifier and Type	Method	Description
void	InteractionHandler.handleCfgEvent(DirectedGraph<?> g)

Uses of DirectedGraph in soot.toolkits.graph.pdg

Subinterfaces of DirectedGraph in soot.toolkits.graph.pdg

Modifier and Type	Interface	Description
interface	ProgramDependenceGraph	This defines the interface to a Program Dependence Graph as defined in Ferrante, J., Ottenstein, K.

Classes in soot.toolkits.graph.pdg that implement DirectedGraph

Modifier and Type	Class	Description
class	EnhancedBlockGraph
class	EnhancedUnitGraph	This class represents a control flow graph which behaves like an ExceptionalUnitGraph and BriefUnitGraph when there are no exception handling construct in the method; at the presence of such constructs, the CFG is constructed from a brief graph by adding a concise representation of the exceptional flow as well as START/STOP auxiliary nodes.
class	HashMutablePDG	This class implements a Program Dependence Graph as defined in Ferrante, J., Ottenstein, K.

Methods in soot.toolkits.graph.pdg with parameters of type DirectedGraph

Modifier and Type	Method	Description
static String	RegionAnalysis.CFGtoString(DirectedGraph<Block> cfg, boolean blockDetail)

Uses of DirectedGraph in soot.toolkits.scalar

Fields in soot.toolkits.scalar declared as DirectedGraph

Modifier and Type	Field	Description
protected DirectedGraph<N>	AbstractFlowAnalysis.graph	The graph being analysed.
protected DirectedGraph<N>	ForwardFlowAnalysisExtended.graph	The graph being analysed.

Methods in soot.toolkits.scalar with parameters of type DirectedGraph

Modifier and Type	Method	Description
protected LocalDefs	SimpleLocalDefs.init(DirectedGraph<Unit> graph, Local[] locals, SimpleLocalDefs.FlowAnalysisMode mode)

Constructors in soot.toolkits.scalar with parameters of type DirectedGraph

Constructor	Description
AbstractFlowAnalysis(DirectedGraph<N> graph)	Constructs a flow analysis on the given DirectedGraph.
BackwardFlowAnalysis(DirectedGraph<N> graph)	Construct the analysis from a DirectedGraph representation of a Body.
BetterConstantPropagator(DirectedGraph<Unit> graph)
BranchedFlowAnalysis(DirectedGraph<N> graph)
FlowAnalysis(DirectedGraph<N> graph)	Constructs a flow analysis on the given DirectedGraph.
FlowAssignment(DirectedGraph<Unit> graph, Local[] locals, List<Unit>[] unitList, int units, boolean omitSSA)
ForwardFlowAnalysis(DirectedGraph<N> graph)	Construct the analysis from a DirectedGraph representation of a Body.
ForwardFlowAnalysisExtended(DirectedGraph<N> graph)	Construct the analysis from a DirectedGraph representation of a Body.

Uses of DirectedGraph in soot.util

Methods in soot.util with parameters of type DirectedGraph

Modifier and Type	Method	Description
<N> void	PhaseDumper.dumpGraph(DirectedGraph<N> g, Body b)	Asks the PhaseDumper to dump the passed DirectedGraph if the current phase is being dumped.
<N> void	PhaseDumper.dumpGraph(DirectedGraph<N> g, Body b, boolean skipPhaseCheck)	Asks the PhaseDumper to dump the passed DirectedGraph if the current phase is being dumped or skipPhaseCheck == true.

Uses of DirectedGraph in soot.util.cfgcmd

Methods in soot.util.cfgcmd that return DirectedGraph

Modifier and Type	Method	Description
abstract DirectedGraph<?>	CFGGraphType.buildGraph(Body b)	Method that will build a graph of this type.

Methods in soot.util.cfgcmd with parameters of type DirectedGraph

Modifier and Type	Method	Description
<N> DotGraph	CFGToDotGraph.drawCFG(DirectedGraph<N> graph, Body body)	Create a DotGraph whose nodes and edges depict a control flow graph without distinguished exceptional edges.
abstract DotGraph	CFGGraphType.drawGraph(CFGToDotGraph drawer, DirectedGraph<?> g, Body b)	Method that will draw a DotGraph representation of the control flow in this type of graph.