From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugs-return-149039-listarch-gcc-bugs=gcc.gnu.org@gcc.gnu.org>
Received: (qmail 21046 invoked by alias); 5 Jul 2005 18:33:47 -0000
Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm
Precedence: bulk
List-Archive: <http://gcc.gnu.org/ml/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-help@gcc.gnu.org>
Sender: gcc-bugs-owner@gcc.gnu.org
Received: (qmail 21026 invoked by uid 48); 5 Jul 2005 18:33:43 -0000
Date: Tue, 05 Jul 2005 18:33:00 -0000
From: "pinskia at gcc dot gnu dot org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Message-ID: <20050705183341.22312.pinskia@gcc.gnu.org>
Reply-To: gcc-bugzilla@gcc.gnu.org
Subject: [Bug tree-optimization/22312] New: reassoc does not handle (i+j)+(k+l) well
X-Bugzilla-Reason: CC
X-SW-Source: 2005-07/txt/msg00462.txt.bz2
List-Id: <gcc-bugs.sourceware.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