Subject: Publishing compose analysis framework
From: Sorin Lerner (lerns@cs.washington.edu)
Date: Fri Mar 02 2001 - 12:27:10 PST
I am publishing the compose analysis framework:
*) Added the compose analysis framework, whose main components are:
- The ComposedAnalysis object. The compose analysis framework just
consists of a special kind of analysis. This analysis can be created
by providing a list of ComposableAnalyses. See whirlind-compile.cecil
for sample usage.
- The ComposedAnalysisGraph object: This graph allows several analysis
graphs to be merged into one.
*) Added SimpleAnalysis (extends Analysis), which factors out some common
code for invoking analyses. See comments in simple-analysis.cecil for more
details.
*) Added ComposableAnalysis (extends SimpleAnalysis), which is the kind of
analysis the compose framework expects.
*) Factored the code in the (forward and backward) CFG, DFG and CDFG graph
views into two slice view objects: ForwardSliceAnalysisGraph, and
BackwardSliceAnalysisGraph. For convenience, you'll also find objects that
have the same names as the old views, and inherit from these two slices.
*) Removed the AnalysisPriority abstract object, and the corresponding
type parameter of AnalysisGraph.
*) Changed the way topological numbering is done. Topological numbering
used to be done on a per-slice basis, whereas now it is done on the
AnalysisGraph. As a result, WindNumberedCFG, WindNumberedDFG and
WindNumberedCDFG have been removed. Instead we now have a special kind of
AnalysisGraph, TopoSortedAnalysisGraph, which knows how to number its
nodes.
*) Modified the way the roots abstraction in WindIRGraphSlice is
implemented. The roots method still returns the same thing, except that
now there are two kinds of roots: nodes without predecessors (called
heads), and nodes which have an incoming edge as a predecessor (we don't
store these explicitly, as they are easy to retrieve). Similarly, we now
have tails (nodes without successors), and backward_roots (union of the
tails and the nodes which have an outgoing edges as successor). Unlike
forward roots, starting a backward traversal with the backward roots DOES
NOT GUARANTEE that all nodes will be visited. For example, a CFG for an
infinite loop has no backward roots. The graph replacement code keeps all
this information up-to-date.
_______________________________________________
Cecil mailing list
Cecil@cs.washington.edu
http://majordomo.cs.washington.edu/mailman/listinfo/cecil
This archive was generated by hypermail 2b25 : Fri Mar 02 2001 - 12:28:03 PST