This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug target/27855] [4.3 regression] reassociation pass produces ~30% slower matrix multiplication code
- From: "rguenth at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 10 Dec 2007 10:39:49 -0000
- Subject: [Bug target/27855] [4.3 regression] 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 #18 from rguenth at gcc dot gnu dot org 2007-12-10 10:39 -------
I see no difference wrt -fno-tree-reassoc on x86_64 for the mmbenchv.tar.gz
benchmark. So, which is the testcase exhibiting the problem, what is the
exact architecture and optimization flags? (Yes, I enabled -ffast-math)
--
rguenth at gcc dot gnu dot org changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|NEW |WAITING
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=27855