An abstract class providing a framework for carrying out dataflow analysis.
Subclassing either BackwardFlowAnalysis or ForwardFlowAnalysis and providing
implementations for the abstract methods will allow Soot to compute the
corresponding flow analysis.
Maps graph nodes to OUT sets.
Filtered: Maps graph nodes to OUT sets.
Constructs a flow analysis on the given
Given the merge of the
sets, compute the
(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).
Accessor function returning value of OUT set for s.
Default implementation constructing a PseudoTopologicalOrderer.
- an Orderer to order the nodes for the fixed-point iteration