From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 23935 invoked by alias); 2 Dec 2005 03:17:11 -0000 Received: (qmail 23925 invoked by uid 48); 2 Dec 2005 03:17:09 -0000 Date: Fri, 02 Dec 2005 03:17:00 -0000 Message-ID: <20051202031709.23924.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug middle-end/23673] fold does not fold (a^b) != 0 to a != b In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "pinskia at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2005-12/txt/msg00147.txt.bz2 List-Id: ------- Comment #3 from pinskia at gcc dot gnu dot org 2005-12-02 03:17 ------- Hmm, this is getting harder (unless I just want to do (a^CST) == CST and (a^b) == 0. I am still deciding if I want to fix fold_binary from stoping from returning a new tree if it does nothing except for switch the order of the operands). -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23673