This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC 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


law@redhat.com writes:
 > 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.

I don't see the problem: if we have natural loop discovery, we can
tranform gotos and conditional branches into loops before RTL is
generated, and then we'll have the loop notes as usual.

Andrew.


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