[tree-ssa] Gimplifying Java

Tue Jun 17 19:26:00 GMT 2003

Jeff Sturm writes:
 > 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?
It's not enabled. I'll probably try that tomorrow.
 > 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?
That's right. To get loops and such we'll need to do natural loop
discovery.
Andrew.