From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 27859 invoked by alias); 22 Nov 2004 21:34:14 -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 27644 invoked by alias); 22 Nov 2004 21:33:59 -0000 Date: Mon, 22 Nov 2004 21:34:00 -0000 Message-ID: <20041122213359.27643.qmail@sourceware.org> From: "cvs-commit at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20041117154312.18529.pinskia@gcc.gnu.org> References: <20041117154312.18529.pinskia@gcc.gnu.org> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug tree-optimization/18529] When the lower bound of a loop is non-constant we cannot find the number of iterations X-Bugzilla-Reason: CC X-SW-Source: 2004-11/txt/msg02576.txt.bz2 List-Id: ------- Additional Comments From cvs-commit at gcc dot gnu dot org 2004-11-22 21:33 ------- Subject: Bug 18529 CVSROOT: /cvs/gcc Module name: gcc Changes by: rakdver@gcc.gnu.org 2004-11-22 21:33:48 Modified files: gcc : ChangeLog fold-const.c tree-ssa-loop-niter.c Log message: PR tree-optimization/18529 * fold-const.c (fold_to_nonsharp_ineq_using_bound): New function. (simple_operand_p): Use STRIP_NOPS. Consider SSA names simple. (fold): Call fold_to_nonsharp_ineq_using_bound. * tree-ssa-loop-niter.c (simplify_replace_tree): New function. (number_of_iterations_cond): Fold the expressions before futher processing. (tree_simplify_using_condition): Handle case when cond or expr is an EQ_EXPR specially. Patches: http://gcc.gnu.org/cgi-bin/cvsweb.cgi/gcc/gcc/ChangeLog.diff?cvsroot=gcc&r1=2.6459&r2=2.6460 http://gcc.gnu.org/cgi-bin/cvsweb.cgi/gcc/gcc/fold-const.c.diff?cvsroot=gcc&r1=1.475&r2=1.476 http://gcc.gnu.org/cgi-bin/cvsweb.cgi/gcc/gcc/tree-ssa-loop-niter.c.diff?cvsroot=gcc&r1=2.16&r2=2.17 -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18529