This is the mail archive of the
java-patches@gcc.gnu.org
mailing list for the Java project.
Re: [tree-ssa] Gimplifying Java
- From: Jeff Sturm <jsturm at one-point dot com>
- To: law at redhat dot com
- Cc: java-patches at gcc dot gnu dot org, <gcc-patches at gcc dot gnu dot org>
- Date: Thu, 12 Jun 2003 08:43:47 -0400 (EDT)
- Subject: Re: [tree-ssa] Gimplifying Java
On Wed, 11 Jun 2003 law@redhat.com wrote:
> while (1)
> {
> {
> i.2 = i;
> i = i - 1;
> retval.1 = i.2
> };
> if (retval.1 == 0)
> {
> goto <ULb690>;
> };
> (void)0
> };
>
> Which sounds like the same loop you've run into.
Yes, that looks like it. Gcj would _always_ build a trailing empty
statement node for loops like
for (int n = 0; n < m; ) {
...
}
Currently my patch strips as many of these as it can before optimizing.
> Thanks a ton for working on this....
Thanks you you, Diego, Jason, Andrew, others for tree-ssa. What a cool
project. (And I hardly knew it existed before the summit.)
Jeff