[tree-ssa] Gimplifying Java

Tue Jun 17 19:06:00 GMT 2003

On 2003年6月17日, 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