Subject: publishing
From: Craig Chambers (chambers@cs.washington.edu)
Date: Fri Aug 16 2002 - 12:47:35 PDT
I'm publishing some additions to Whirlwind. I've tested this by
successfully compiling & running all our Java benchmarks w/
optimization.
*) I added intraprocedural flow-sensitive class analysis. It's a
subset of Vortex's, missing a bunch of sophistication, but it is able
to fold most kinds of instanceof and subclass tests, and it can
replace GF applications with direct function calls if there is no
dispatching going on (!). This is enough to enable a lot more
inlining and other optimization in the Java benchmarks. And it's an
initial placeholder framework in which more sophisticated kinds of
analyses and transformations can be added. I added some tests for
subclass test folding to the regression test suite. I modified the
Java front-end to avoid generating dispatch predicates on method
declarations for default methods.
*) I improved the representation typechecking code for unary and
binary operators. It now treats integer variables of different sizes
as being incomparable, rather than smaller integer vars being
subtypes of larger integer vars, ensuring that the size of integer
operands matches that expected by the operator, and each other. I
also improved how representations are computed for char and string
literals (relating to ascii vs. unicode, and abstract char
vs. concrete 1- or 2-byte ints). I made some small changes to the
Java front-end and the test code to be compatible with the new
stricter checking, and regenerated all the Java .wil code.
*) I fixed a bug in constant-folding of switch statements. I added
some tests to the regression test suite.
*) I fixed a scanning bug that had lain undetected in Whirlwind for
ages.
*) I fixed a problem with rep checking of exn handlers that fall
through into the regular control flow. I added some tests to the
regression test suite.
*) I fixed a small problem with CFG construction of prim blocks that
are known not to fall through.
*) I refined the phi-placement pass, mainly to speed it up. In
particular, I replaced the old Analysis-based approach with a simpler
approach that just iterates through all the phi nodes in the DFG and
inserts assignments for them.
*) I modified the DFG construction pass to leave out
non-value-producing nodes with no dataflow operands.
*) I moved the code that inserts enter_ and exit_scope_nodes from the
scope-building pass (which modified the AST) to the CFG building
pass, which enables me to put exit_scope_nodes on all the right
control flow paths that exit a scope.
*) I created a ResolvedIDExprNode as a special kind of IDExprNode (a
variable reference) that had already been resolved to a particular
declaration. Such nodes are useful in replacement graphs where
references to known declarations are being constructed.
*) I added some extra verification code to check some properties of
the merge_node_map (the map from merge_nodes to its phi_nodes) in the
DFG.
*) I added some extra verification code to check that nodes have the
expected number of CFG and DFG predecessors and successors.
*) I added an option to warn if a variable without any reaching
definition is referenced, since such a reference often indicates a
bug in the compiler.
*) I refactored the hierarchy for IRs that represent function bodies.
*) I changed some code to clarify that the scope associated with a
Whirlwind IR is the scope of the initial IR node. Some other code
was mistakenly assuming that there was only one scope that applied to
all nodes in an IR. There are still some lingering remnants of this
assumption, which are not non-fatal; in the future I plan to
incrementally remove these assumptions.
*) Several other small bug fixes, clean-ups, renamings, and
improvements.
-- Craig
_______________________________________________
Cecil mailing list
Cecil@cs.washington.edu
http://majordomo.cs.washington.edu/mailman/listinfo/cecil
This archive was generated by hypermail 2b25 : Fri Aug 16 2002 - 12:47:42 PDT