From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 646 invoked by alias); 7 May 2005 19:30:15 -0000 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 Received: (qmail 618 invoked by uid 48); 7 May 2005 19:30:09 -0000 Date: Sat, 07 May 2005 19:30:00 -0000 Message-ID: <20050507193009.617.qmail@sourceware.org> From: "pinskia at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20040229062941.14341.pinskia@gcc.gnu.org> References: <20040229062941.14341.pinskia@gcc.gnu.org> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug tree-optimization/14341] Missed comparison optimization (VRP) X-Bugzilla-Reason: CC X-SW-Source: 2005-05/txt/msg00971.txt.bz2 List-Id: ------- Additional Comments From pinskia at gcc dot gnu dot org 2005-05-07 19:30 ------- Huh, I don't understand why VRP does not take care of this: i_13: [-2147483648, 99999999] D.1236_4 = i_13 <= 99999999; i_13 = ASSERT_EXPR ; D.1236_4 = i_13 <= 99999999; The following is the testcase which I used with -O2 -fno-tree-dominator-opts, otherwise VRP is not run: void f(int); int h(int, int); void t(int *ttt) { int i; int x; *ttt = 1; if (ttt== 0) f(0); for( i = 0; i < 100000000; i++ ){ f(i < 100000000); } } -- What |Removed |Added ---------------------------------------------------------------------------- CC| |dnovillo at gcc dot gnu dot | |org Summary|Missed comparison |Missed comparison |optimization (jump threading|optimization (VRP) |related) | http://gcc.gnu.org/bugzilla/show_bug.cgi?id=14341