This is the mail archive of the
java@gcc.gnu.org
mailing list for the Java project.
Re: [tree-ssa] Gimplifying Java
- From: Jeff Sturm <jsturm at one-point dot com>
- To: Andrew Haley <aph at redhat dot com>
- Cc: java at gcc dot gnu dot org, <gcc at gcc dot gnu dot org>
- Date: Tue, 17 Jun 2003 15:01:13 -0400 (EDT)
- Subject: Re: [tree-ssa] Gimplifying Java
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