This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/16656] [lno] huge amounts of time spent in find_best_candidate
- From: "cvs-commit at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 23 Jul 2004 14:03:39 -0000
- Subject: [Bug tree-optimization/16656] [lno] huge amounts of time spent in find_best_candidate
- References: <20040721113912.16656.falk@debian.org>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From cvs-commit at gcc dot gnu dot org 2004-07-23 14:03 -------
Subject: Bug 16656
CVSROOT: /cvs/gcc
Module name: gcc
Branch: lno-branch
Changes by: rakdver@gcc.gnu.org 2004-07-23 14:03:25
Modified files:
gcc : ChangeLog.lno tree-ssa-loop-ivopts.c
Log message:
PR tree-optimization/16656
* tree-ssa-loop-ivopts.c (CONSIDER_ALL_CANDIDATES_BOUND): Increase
to 30.
(MAX_CONSIDERED_USES): New.
(set_cost_up_to, try_add_cand_for): New functions.
(set_cost): Use set_cost_up_to.
(find_best_candidate, get_initial_solution): Improve efficiency.
(tree_ssa_iv_optimize_loop): Fail if there are more than
MAX_CONSIDERED_USES iv uses in the loop.
Patches:
http://gcc.gnu.org/cgi-bin/cvsweb.cgi/gcc/gcc/ChangeLog.lno.diff?cvsroot=gcc&only_with_tag=lno-branch&r1=1.1.2.232&r2=1.1.2.233
http://gcc.gnu.org/cgi-bin/cvsweb.cgi/gcc/gcc/tree-ssa-loop-ivopts.c.diff?cvsroot=gcc&only_with_tag=lno-branch&r1=1.1.2.47&r2=1.1.2.48
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=16656