|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object soot.toolkits.scalar.AbstractFlowAnalysis<N,A> soot.toolkits.scalar.FlowAnalysis<N,A> soot.toolkits.scalar.BackwardFlowAnalysis soot.jimple.toolkits.scalar.pre.NotIsolatedAnalysis
public class NotIsolatedAnalysis
Performs a Not-Isolated-analysis on the given graph, which is basicly 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.
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 | |
---|---|
NotIsolatedAnalysis(DirectedGraph dg)
this constructor should not be used, and will throw a runtime-exception! |
|
NotIsolatedAnalysis(DirectedGraph dg,
LatestComputation latest,
Map equivRhsMap)
automaticly 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 dg,
LatestComputation latest,
Map equivRhsMap,
BoundedFlowSet set)
automaticly 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 | |
---|---|
protected void |
copy(Object source,
Object dest)
Creates a copy of the source flow object in dest . |
protected Object |
entryInitialFlow()
Returns the initial flow value for entry/exit graph nodes. |
protected void |
flowThrough(Object inValue,
Object unit,
Object outValue)
Given the merge of the out sets, compute the in set for s (or in to out, depending on direction). |
protected void |
merge(Object in1,
Object in2,
Object out)
Compute the merge of the in1 and in2 sets, putting the result into out . |
protected Object |
newInitialFlow()
Returns the flow object corresponding to the initial values for each graph node. |
Methods inherited from class soot.toolkits.scalar.BackwardFlowAnalysis |
---|
constructWorklist, doAnalysis, isForward |
Methods inherited from class soot.toolkits.scalar.FlowAnalysis |
---|
constructOrderer, getFlowAfter |
Methods inherited from class soot.toolkits.scalar.AbstractFlowAnalysis |
---|
getFlowBefore, merge, mergeInto, treatTrapHandlersAsEntries |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public NotIsolatedAnalysis(DirectedGraph dg)
public NotIsolatedAnalysis(DirectedGraph dg, LatestComputation latest, Map equivRhsMap)
dg
using the Latest-computation latest
.equivRhsMap
is only here to avoid doing these things
again...
dg
- a ExceptionalUnitGraphlatest
- the latest-computation of the same graph.equivRhsMap
- the rhs of each unit (if assignment-stmt).public NotIsolatedAnalysis(DirectedGraph dg, LatestComputation latest, Map equivRhsMap, BoundedFlowSet set)
dg
using the Latest-computation latest
.equivRhsMap
is only here to avoid doing these things
again...
dg
- a ExceptionalUnitGraphlatest
- the latest-computation of the same graph.equivRhsMap
- the rhs of each unit (if assignment-stmt).set
- the shared set.Method Detail |
---|
protected Object newInitialFlow()
AbstractFlowAnalysis
newInitialFlow
in class AbstractFlowAnalysis
protected Object entryInitialFlow()
AbstractFlowAnalysis
entryInitialFlow
in class AbstractFlowAnalysis
protected void flowThrough(Object inValue, Object unit, Object outValue)
FlowAnalysis
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).
flowThrough
in class FlowAnalysis
protected void merge(Object in1, Object in2, Object out)
AbstractFlowAnalysis
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.
merge
in class AbstractFlowAnalysis
protected void copy(Object source, Object dest)
AbstractFlowAnalysis
source
flow object in dest
.
copy
in class AbstractFlowAnalysis
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |