Package sootup.core.graph

Class BackwardsStmtGraph

java.lang.Object

sootup.core.graph.StmtGraph<V>

sootup.core.graph.ForwardingStmtGraph

sootup.core.graph.BackwardsStmtGraph

All Implemented Interfaces:

Iterable

public class BackwardsStmtGraph
extends ForwardingStmtGraph

Author:

Zun Wang

Nested Class Summary

Nested classes/interfaces inherited from class sootup.core.graph.StmtGraph

StmtGraph.BlockGraphIterator, StmtGraph.BlockGraphIteratorAndTrapAggregator

Field Summary

Fields inherited from class sootup.core.graph.ForwardingStmtGraph

backingGraph

Constructor Summary

Constructors

Constructor	Description
BackwardsStmtGraph(StmtGraph<?> stmtGraph)

Method Summary

Modifier and Type	Method	Description
List<? extends BasicBlock<?>>	getBlocksSorted()
Collection<Stmt>	getNodes()	returns the nodes in this graph in a non-deterministic order (->Set) to get the nodes in linearized, ordered manner use iterator() or getStmts.
Stmt	getStartingStmt()
List<Stmt>	getStartingStmts()
boolean	hasEdgeConnecting(Stmt source, Stmt target)	returns true if there is a flow between source and target throws an Exception if at least one of the parameters is not contained in the graph.
int	inDegree(Stmt node)	returns the amount of ingoing flows into node
int	outDegree(Stmt node)	returns the amount of flows that start from node
List<Stmt>	predecessors(Stmt node)	returns the ingoing flows to node as an List with no reliable/specific order and possibly duplicate entries i.e.
List<Stmt>	successors(Stmt node)	returns the outgoing flows of node as ordered List.

Methods inherited from class sootup.core.graph.ForwardingStmtGraph

buildTraps, containsNode, degree, exceptionalPredecessors, exceptionalSuccessors, getBlockOf, getBlocks, getStartingStmtBlock, iterator, removeExceptionalFlowFromAllBlocks

Methods inherited from class sootup.core.graph.StmtGraph

equals, getAllSuccessors, getBlockIterator, getBranchTargetsOf, getEntrypoints, getExtendedBasicBlockPathBetween, getLabeledStmts, getStmts, getTails, isStmtBranchTarget, toString, validateStmtConnectionsInGraph

Methods inherited from class java.lang.Object

clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Details

BackwardsStmtGraph

public BackwardsStmtGraph(@Nonnull
 StmtGraph<?> stmtGraph)

Method Details

getStartingStmt

public Stmt getStartingStmt()

Overrides:

getStartingStmt in class ForwardingStmtGraph

getStartingStmts

@Nonnull
public List<Stmt> getStartingStmts()

getNodes

@Nonnull
public Collection<Stmt> getNodes()

Description copied from class: StmtGraph

returns the nodes in this graph in a non-deterministic order (->Set) to get the nodes in linearized, ordered manner use iterator() or getStmts.

Overrides:

getNodes in class ForwardingStmtGraph

getBlocksSorted

@Nonnull
public List<? extends BasicBlock<?>> getBlocksSorted()

Overrides:

getBlocksSorted in class ForwardingStmtGraph

predecessors

@Nonnull
public List<Stmt> predecessors(@Nonnull
 Stmt node)

Description copied from class: StmtGraph

returns the ingoing flows to node as an List with no reliable/specific order and possibly duplicate entries i.e. if a JSwitchStmt has multiple cases that brnach to `node`

Overrides:

predecessors in class ForwardingStmtGraph

successors

@Nonnull
public List<Stmt> successors(@Nonnull
 Stmt node)

Description copied from class: StmtGraph

returns the outgoing flows of node as ordered List. The List can have duplicate entries!

Overrides:

successors in class ForwardingStmtGraph

inDegree

public int inDegree(@Nonnull
 Stmt node)

Description copied from class: StmtGraph

returns the amount of ingoing flows into node

Overrides:

inDegree in class ForwardingStmtGraph

outDegree

public int outDegree(@Nonnull
 Stmt node)

Description copied from class: StmtGraph

returns the amount of flows that start from node

Overrides:

outDegree in class ForwardingStmtGraph

hasEdgeConnecting

public boolean hasEdgeConnecting(@Nonnull
 Stmt source,
 @Nonnull
 Stmt target)

Description copied from class: StmtGraph

returns true if there is a flow between source and target throws an Exception if at least one of the parameters is not contained in the graph.

Overrides:

hasEdgeConnecting in class ForwardingStmtGraph