soot.dava.internal.asg

Class AugmentedStmtGraph

java.lang.Object

soot.dava.internal.asg.AugmentedStmtGraph

All Implemented Interfaces:

java.lang.Iterable<AugmentedStmt>, DirectedGraph<AugmentedStmt>

public class AugmentedStmtGraph
extends java.lang.Object
implements DirectedGraph<AugmentedStmt>

Constructor Summary

Constructors

Constructor and Description
AugmentedStmtGraph()
AugmentedStmtGraph(AugmentedStmtGraph other)
AugmentedStmtGraph(BriefUnitGraph bug, TrapUnitGraph cug)

Method Summary

Modifier and Type	Method and Description
void	add_AugmentedStmt(AugmentedStmt as)
void	add_StmtBinding(Stmt s, AugmentedStmt as)
void	calculate_Reachability(AugmentedStmt source)
void	calculate_Reachability(AugmentedStmt source, AugmentedStmt dominator)
void	calculate_Reachability(AugmentedStmt source, AugmentedStmt blocker, AugmentedStmt dominator)
void	calculate_Reachability(AugmentedStmt source, java.util.Set<AugmentedStmt> blockers, AugmentedStmt dominator)
void	calculate_Reachability(java.util.Collection<AugmentedStmt> sources)
void	calculate_Reachability(java.util.Collection<AugmentedStmt> sources, AugmentedStmt dominator)
void	calculate_Reachability(java.util.Collection<AugmentedStmt> sources, AugmentedStmt blocker, AugmentedStmt dominator)
void	calculate_Reachability(java.util.Collection<AugmentedStmt> sources, java.util.Set<AugmentedStmt> blockers, AugmentedStmt dominator)
IterableSet<AugmentedStmt>	clone_Body(IterableSet<AugmentedStmt> oldBody)
java.lang.Object	clone()
boolean	contains(java.lang.Object o)
void	find_Dominators()
AugmentedStmt	get_AugStmt(Stmt s)
java.util.List<AugmentedStmt>	get_BriefHeads()
java.util.List<AugmentedStmt>	get_BriefTails()
IterableSet<AugmentedStmt>	get_ChainView()
AugmentedStmt	get_CloneOf(AugmentedStmt as)
java.util.List<AugmentedStmt>	getHeads() Returns a list of entry points for this graph.
java.util.List<AugmentedStmt>	getPredsOf(AugmentedStmt s) Returns a list of predecessors for the given node in the graph.
java.util.List<AugmentedStmt>	getPredsOf(Stmt s)
java.util.List<AugmentedStmt>	getSuccsOf(AugmentedStmt s) Returns a list of successors for the given node in the graph.
java.util.List<AugmentedStmt>	getSuccsOf(Stmt s)
java.util.List<AugmentedStmt>	getTails() Returns a list of exit points for this graph.
java.util.Iterator<AugmentedStmt>	iterator() Returns an iterator for the nodes in this graph.
boolean	remove_AugmentedStmt(AugmentedStmt toRemove)
int	size() Returns the node count for this graph.
java.lang.String	toString()

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

AugmentedStmtGraph

public AugmentedStmtGraph(AugmentedStmtGraph other)

AugmentedStmtGraph

public AugmentedStmtGraph(BriefUnitGraph bug,
                          TrapUnitGraph cug)

AugmentedStmtGraph

public AugmentedStmtGraph()

Method Detail

add_AugmentedStmt

public void add_AugmentedStmt(AugmentedStmt as)

contains

public boolean contains(java.lang.Object o)

get_CloneOf

public AugmentedStmt get_CloneOf(AugmentedStmt as)

size

public int size()

Description copied from interface: DirectedGraph

Returns the node count for this graph.

Specified by:

size in interface DirectedGraph<AugmentedStmt>

calculate_Reachability

public void calculate_Reachability(AugmentedStmt source,
                                   java.util.Set<AugmentedStmt> blockers,
                                   AugmentedStmt dominator)

calculate_Reachability

public void calculate_Reachability(java.util.Collection<AugmentedStmt> sources,
                                   java.util.Set<AugmentedStmt> blockers,
                                   AugmentedStmt dominator)

calculate_Reachability

public void calculate_Reachability(AugmentedStmt source,
                                   AugmentedStmt blocker,
                                   AugmentedStmt dominator)

calculate_Reachability

public void calculate_Reachability(java.util.Collection<AugmentedStmt> sources,
                                   AugmentedStmt blocker,
                                   AugmentedStmt dominator)

calculate_Reachability

public void calculate_Reachability(AugmentedStmt source,
                                   AugmentedStmt dominator)

calculate_Reachability

public void calculate_Reachability(java.util.Collection<AugmentedStmt> sources,
                                   AugmentedStmt dominator)

calculate_Reachability

public void calculate_Reachability(AugmentedStmt source)

calculate_Reachability

public void calculate_Reachability(java.util.Collection<AugmentedStmt> sources)

add_StmtBinding

public void add_StmtBinding(Stmt s,
                            AugmentedStmt as)

get_AugStmt

public AugmentedStmt get_AugStmt(Stmt s)

getHeads

public java.util.List<AugmentedStmt> getHeads()

Description copied from interface: DirectedGraph

Returns a list of entry points for this graph.

Specified by:

getHeads in interface DirectedGraph<AugmentedStmt>

getTails

public java.util.List<AugmentedStmt> getTails()

Description copied from interface: DirectedGraph

Returns a list of exit points for this graph.

Specified by:

getTails in interface DirectedGraph<AugmentedStmt>

iterator

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

Description copied from interface: DirectedGraph

Returns an iterator for the nodes in this graph. No specific ordering of the nodes is guaranteed.

Specified by:

iterator in interface java.lang.Iterable<AugmentedStmt>

Specified by:

iterator in interface DirectedGraph<AugmentedStmt>

getPredsOf

public java.util.List<AugmentedStmt> getPredsOf(AugmentedStmt s)

Description copied from interface: DirectedGraph

Returns a list of predecessors for the given node in the graph.

Specified by:

getPredsOf in interface DirectedGraph<AugmentedStmt>

getPredsOf

public java.util.List<AugmentedStmt> getPredsOf(Stmt s)

getSuccsOf

public java.util.List<AugmentedStmt> getSuccsOf(AugmentedStmt s)

Description copied from interface: DirectedGraph

Returns a list of successors for the given node in the graph.

Specified by:

getSuccsOf in interface DirectedGraph<AugmentedStmt>

getSuccsOf

public java.util.List<AugmentedStmt> getSuccsOf(Stmt s)

get_BriefHeads

public java.util.List<AugmentedStmt> get_BriefHeads()

get_BriefTails

public java.util.List<AugmentedStmt> get_BriefTails()

get_ChainView

public IterableSet<AugmentedStmt> get_ChainView()

clone

public java.lang.Object clone()

Overrides:

clone in class java.lang.Object

remove_AugmentedStmt

public boolean remove_AugmentedStmt(AugmentedStmt toRemove)

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

clone_Body

public IterableSet<AugmentedStmt> clone_Body(IterableSet<AugmentedStmt> oldBody)

find_Dominators

public void find_Dominators()