This is the mail archive of the
java@gcc.gnu.org
mailing list for the Java project.
Re: [tree-ssa] Gimplifying Java
- From: law at redhat dot com
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: Andrew Haley <aph at redhat dot com>, Jeff Sturm <jsturm at one-point dot com>, java at gcc dot gnu dot org, "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Date: Tue, 17 Jun 2003 14:31:04 -0600
- Subject: Re: [tree-ssa] Gimplifying Java
- Reply-to: law at redhat dot com
In message <1055878647.1541.7.camel@frodo.toronto.redhat.com>, Diego Novillo wr
ites:
>On Tue, 2003-06-17 at 15:23, Andrew Haley wrote:
>
>> That's right. To get loops and such we'll need to do natural loop
>> discovery.
>>
>We have that already. So, in theory, you need to do nothing
>java-specific. It all happens at the flowgraph level.
But if we don't generate loop notes, then the backend won't optimize
the loop. Discovery is only half the battle.
jeff