public class DelayabilityAnalysis extends ForwardFlowAnalysis<Unit,FlowSet<EquivalentValue>>
FlowAnalysis.FlowfilterUnitToAfterFlow, unitToAfterFlowfilterUnitToBeforeFlow, graph, unitToBeforeFlow| Constructor and Description |
|---|
DelayabilityAnalysis(DirectedGraph<Unit> dg)
this constructor should not be used, and will throw a runtime-exception!
|
DelayabilityAnalysis(DirectedGraph<Unit> dg,
EarliestnessComputation earliest,
java.util.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,
java.util.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. |
| Modifier and Type | Method and 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 u,
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.
|
doAnalysis, isForwardgetFlow, getFlowAfter, getFlowBefore, omissiblemerge, mergeInto, treatTrapHandlersAsEntriespublic DelayabilityAnalysis(DirectedGraph<Unit> dg)
public DelayabilityAnalysis(DirectedGraph<Unit> dg, EarliestnessComputation earliest, java.util.Map<Unit,EquivalentValue> equivRhsMap)
dg and the Earliest-computation earliest.equivRhsMap is only here to avoid doing these things
again...dg - a ExceptionalUnitGraphearliest - the earliest-computation of the same graph.equivRhsMap - the rhs of each unit (if assignment-stmt).public DelayabilityAnalysis(DirectedGraph<Unit> dg, EarliestnessComputation earliest, java.util.Map<Unit,EquivalentValue> equivRhsMap, BoundedFlowSet<EquivalentValue> set)
dg and the Earliest-computation earliest.equivRhsMap is only here to avoid doing these things
again...dg - a ExceptionalUnitGraphearliest - the earliest-computation of the same graph.equivRhsMap - the rhs of each unit (if assignment-stmt).set - the shared set.protected FlowSet<EquivalentValue> newInitialFlow()
AbstractFlowAnalysisnewInitialFlow in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>protected FlowSet<EquivalentValue> entryInitialFlow()
AbstractFlowAnalysisAbstractFlowAnalysis.newInitialFlow()entryInitialFlow in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>protected void flowThrough(FlowSet<EquivalentValue> in, Unit u, FlowSet<EquivalentValue> out)
FlowAnalysisout 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<Unit,FlowSet<EquivalentValue>>in - the input flowu - the current nodeout - the returned flowprotected void merge(FlowSet<EquivalentValue> inSet1, FlowSet<EquivalentValue> inSet2, FlowSet<EquivalentValue> outSet)
AbstractFlowAnalysisin1 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<Unit,FlowSet<EquivalentValue>>protected void copy(FlowSet<EquivalentValue> sourceSet, FlowSet<EquivalentValue> destSet)
AbstractFlowAnalysissource flow object in dest.copy in class AbstractFlowAnalysis<Unit,FlowSet<EquivalentValue>>