This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug target/27855] reassociation pass produces ~30% slower matrix multiplication code
- From: "pinskia at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 2 Mar 2007 17:42:44 -0000
- Subject: [Bug target/27855] reassociation pass produces ~30% slower matrix multiplication code
- References: <bug-27855-1649@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #14 from pinskia at gcc dot gnu dot org 2007-03-02 17:42 -------
> Please consider the fact that all benchmarks are using -ffast-math nowadays. ;)
Please also consider the fact that the register allocator has been broken since
20 years ago :) :) :) :).
And I repeat again, this has nothing to do with -ffast-math, see my comment #6
and #7 where I prove -ffast-math is not the issue and it is just the register
allocator going wrong. If anyone disables reassociation at the tree level, I
am going to object loudly.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=27855