This is the mail archive of the java@gcc.gnu.org mailing list for the Java project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: [tree-ssa] Gimplifying Java

From: Diego Novillo <dnovillo at redhat dot com>
To: Andrew Haley <aph at redhat dot com>
Cc: 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: 17 Jun 2003 15:37:27 -0400
Subject: Re: [tree-ssa] Gimplifying Java
Organization: Red Hat Canada
References: <16111.24080.389462.130666@cuddles.redhat.com> <Pine.LNX.4.44.0306171454430.5597-100000@ops2.one-point.com> <16111.27323.730836.823987@cuddles.redhat.com>

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.


Diego.

Follow-Ups:
- Re: [tree-ssa] Gimplifying Java
  - From: law

References:
- Re: [tree-ssa] Gimplifying Java
  - From: Andrew Haley
- Re: [tree-ssa] Gimplifying Java
  - From: Jeff Sturm
- Re: [tree-ssa] Gimplifying Java
  - From: Andrew Haley

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]