Package soot.jimple.toolkits.scalar.pre

Class NotIsolatedAnalysis

java.lang.Object

soot.toolkits.scalar.AbstractFlowAnalysis<N,A>

soot.toolkits.scalar.FlowAnalysis<N,A>

soot.toolkits.scalar.BackwardFlowAnalysis<Unit,FlowSet<EquivalentValue>>

soot.jimple.toolkits.scalar.pre.NotIsolatedAnalysis

public class NotIsolatedAnalysis
extends BackwardFlowAnalysis<Unit,FlowSet<EquivalentValue>>

Performs a Not-Isolated-analysis on the given graph, which is basically the same as an Isolated-analysis (we just return the complement, as it's easier to calculate it). A computation is isolated, if it can only be used at the current computation-point. In other words: if the result of the computation will not be used later on the computation is isolated.
The Latest-analysis helps us in finding isolated computations, as they show us points, where a precedent computation can't be used anymore. In completely other words: we search the interval "latest"-"computation". a computation in this interval would not be isolated.

Nested Class Summary

Nested classes/interfaces inherited from class soot.toolkits.scalar.FlowAnalysis

FlowAnalysis.Flow

Field Summary

Fields inherited from class soot.toolkits.scalar.FlowAnalysis

filterUnitToAfterFlow, unitToAfterFlow

Fields inherited from class soot.toolkits.scalar.AbstractFlowAnalysis

filterUnitToBeforeFlow, graph, unitToBeforeFlow

Constructor Summary

Constructors

Constructor	Description
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.

Method Summary

Modifier and Type	Method	Description
protected void	copy(FlowSet<EquivalentValue> sourceSet, FlowSet<EquivalentValue> destSet)	Creates a copy of the source flow object in dest.
protected FlowSet<EquivalentValue>	entryInitialFlow()	Returns the initial flow value for entry/exit graph nodes.
protected void	flowThrough(FlowSet<EquivalentValue> in, Unit unit, FlowSet<EquivalentValue> out)	Given the merge of the out sets, compute the in set for s (or in to out, depending on direction).
protected void	merge(FlowSet<EquivalentValue> inSet1, FlowSet<EquivalentValue> inSet2, FlowSet<EquivalentValue> outSet)	Compute the merge of the in1 and in2 sets, putting the result into out.
protected FlowSet<EquivalentValue>	newInitialFlow()	Returns the flow object corresponding to the initial values for each graph node.

Methods inherited from class soot.toolkits.scalar.BackwardFlowAnalysis

doAnalysis, isForward

Methods inherited from class soot.toolkits.scalar.FlowAnalysis

copyFreshToExisting, getFlow, getFlowAfter, getFlowBefore, omissible

Methods inherited from class soot.toolkits.scalar.AbstractFlowAnalysis

merge, mergeInto, treatTrapHandlersAsEntries

Methods inherited from class java.lang.Object

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

Constructor Detail

NotIsolatedAnalysis

public 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...

Parameters:

dg - a ExceptionalUnitGraph

latest - the latest-computation of the same graph.

equivRhsMap - the rhs of each unit (if assignment-stmt).

NotIsolatedAnalysis

public 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.

Parameters:

dg - a ExceptionalUnitGraph

latest - the latest-computation of the same graph.

equivRhsMap - the rhs of each unit (if assignment-stmt).

set - the shared set.

Method Detail

newInitialFlow

protected FlowSet<EquivalentValue> newInitialFlow()

Description copied from class: AbstractFlowAnalysis

Returns the flow object corresponding to the initial values for each graph node.

Specified by:

newInitialFlow in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>

entryInitialFlow

protected FlowSet<EquivalentValue> entryInitialFlow()

Description copied from class: AbstractFlowAnalysis

Returns the initial flow value for entry/exit graph nodes. This is equal to AbstractFlowAnalysis.newInitialFlow()

Overrides:

entryInitialFlow in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>

flowThrough

protected void flowThrough(FlowSet<EquivalentValue> in,
                           Unit unit,
                           FlowSet<EquivalentValue> out)

Description copied from class: FlowAnalysis

Given the merge of the out sets, compute the in set for s (or in to out, depending on direction). This function often causes confusion, because the same interface is used for both forward and backward flow analyses. The first parameter is always the argument to the flow function (i.e. it is the "in" set in a forward analysis and the "out" set in a backward analysis), and the third parameter is always the result of the flow function (i.e. it is the "out" set in a forward analysis and the "in" set in a backward analysis).

Specified by:

flowThrough in class FlowAnalysis<Unit,FlowSet<EquivalentValue>>

Parameters:

in - the input flow

unit - the current node

out - the returned flow

merge

protected void merge(FlowSet<EquivalentValue> inSet1,
                     FlowSet<EquivalentValue> inSet2,
                     FlowSet<EquivalentValue> outSet)

Description copied from class: AbstractFlowAnalysis

Compute the merge of the in1 and in2 sets, putting the result into out. The behavior of this function depends on the implementation ( it may be necessary to check whether in1 and in2 are equal or aliased ). Used by the doAnalysis method.

Specified by:

merge in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>

copy

protected void copy(FlowSet<EquivalentValue> sourceSet,
                    FlowSet<EquivalentValue> destSet)

Description copied from class: AbstractFlowAnalysis

Creates a copy of the source flow object in dest.

Specified by:

copy in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>