This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [patches] Re: make regclass to use estimated basic block frequencies
- To: Richard Henderson <rth at redhat dot com>, Jan Hubicka <jh at suse dot cz>, gcc-patches at gcc dot gnu dot org, patches at x86-64 dot org
- Subject: Re: [patches] Re: make regclass to use estimated basic block frequencies
- From: Jan Hubicka <jh at suse dot cz>
- Date: Fri, 22 Jun 2001 12:35:56 +0200
- References: <20010620173310.F28759@atrey.karlin.mff.cuni.cz> <20010621142556.C5883@redhat.com>
> On a related note, I was looking at your frequency estimation output.
> Something isn't quite right. Consider
>
> void f2(int n)
> {
> int i, j;
> for (i = 0; i < n; ++i)
> for (j = 0; j < n; ++j)
> foo();
> }
The problem is caused by bogus code to re-add to queue block that has not
been processed yet I introduced while removing recursion.
Unfortunately it seems to be dificult to do the trick w/o risc of
infinite loops. I will try what can I do.
Honza