[tree-ssa] Gimplifying Java

[Jeff Sturm]

On Tue, 17 Jun 2003, Andrew Haley wrote:
> What fun!  I'm making good progress gimplifying the bytecode compiler.

Cool!  Glad to hear it's coming together.

> try3.z(java.util.Map) (this, y)
> {
>   struct try3 * T.3;

I'd guess this is -fdump-tree-simple output?  How does
-fdump-tree-optimized look?

One interesting thing about bytecode->GIMPLE is that the trees are going
to be very flat.  You won't have LOOP_EXPR nodes, right?  And any
COND_EXPR will only take a single goto?

Jeff