This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/22312] New: reassoc does not handle (i+j)+(k+l) well
- 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: 5 Jul 2005 18:33:43 -0000
- Subject: [Bug tree-optimization/22312] New: reassoc does not handle (i+j)+(k+l) well
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
take the following example:
int f(int i, int j, int k, int l)
{
int r1 = (i+j)+(k+l);
int r2 = (j+k)+(l+i);
return r1 == r2;
}
This should return 1 all the time. I found this while making testcases for reassoc working fp (well I just
change one little thing to make it work really).
--
Summary: reassoc does not handle (i+j)+(k+l) well
Product: gcc
Version: 4.1.0
Status: UNCONFIRMED
Keywords: missed-optimization
Severity: enhancement
Priority: P2
Component: tree-optimization
AssignedTo: unassigned at gcc dot gnu dot org
ReportedBy: pinskia at gcc dot gnu dot org
CC: gcc-bugs at gcc dot gnu dot org
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=22312