This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug rtl-optimization/21827] unroll misses simple elimination - works with manual unroll
- From: "tlm at daimi dot au dot dk" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 31 May 2005 05:38:22 -0000
- Subject: [Bug rtl-optimization/21827] unroll misses simple elimination - works with manual unroll
- References: <20050530183749.21827.tlm@daimi.au.dk>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From tlm at daimi dot au dot dk 2005-05-31 05:38 -------
(In reply to comment #1)
The first testcase is fixed in 4.0.0. (Though there is a regression on the
mainline). I have not looked into the full testcase.
(In reply to comment #2)
> I was not goint to close this, it was accident.
Well if it works in 4.0 I guess you can close it if you want.
I made the example from the code below to give a simple example.
I am not sure, but I guess a fix on the example would do also make the
same huge improvement on the "chess-knight-code".
(I wrote 400-500% - but this is of course depending on how many knights there
are on the board. I had 5 (a bit unrealistic) with the function returing 17)
Thanks for the information ... (will download version 4.0 soon)
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=21827