From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 31258 invoked by alias); 9 Feb 2007 13:29:39 -0000 Received: (qmail 31213 invoked by alias); 9 Feb 2007 13:29:28 -0000 Date: Fri, 09 Feb 2007 13:29:00 -0000 Message-ID: <20070209132928.31212.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug tree-optimization/23361] Can't eliminate empty loops with power of two step and variable bounds In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "rguenth at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2007-02/txt/msg01016.txt.bz2 ------- Comment #12 from rguenth at gcc dot gnu dot org 2007-02-09 13:29 ------- Subject: Bug 23361 Author: rguenth Date: Fri Feb 9 13:29:11 2007 New Revision: 121742 URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=121742 Log: 2007-02-09 Zdenek Dvorak Richard Guenther PR middle-end/23361 * fold-const.c (fold_comparison): Handle obfuscated comparisons against INT_MIN/INT_MAX. * tree-ssa-loop-ivcanon.c (remove_empty_loop): Print to dump file if a loop is removed. * gcc.dg/fold-compare-3.c: New testcase. * gcc.dg/tree-ssa/loop-24.c: Likewise. Added: trunk/gcc/testsuite/gcc.dg/fold-compare-3.c trunk/gcc/testsuite/gcc.dg/tree-ssa/loop-24.c Modified: trunk/gcc/ChangeLog trunk/gcc/fold-const.c trunk/gcc/testsuite/ChangeLog trunk/gcc/tree-ssa-loop-ivcanon.c -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23361