summaryrefslogtreecommitdiff
path: root/gcc/params.def
diff options
context:
space:
mode:
authorrakdver <rakdver@138bc75d-0d04-0410-961f-82ee72b054a4>2004-07-09 03:19:14 +0000
committerrakdver <rakdver@138bc75d-0d04-0410-961f-82ee72b054a4>2004-07-09 03:19:14 +0000
commitb9d73ea676ed871b449afe0f971d883293999a69 (patch)
treeb093da742fb0c72680308c3cb8cd011bf2fbc8fc /gcc/params.def
parentbd04d3e4eb99f27e3ac53bcd38810a861c3e7ebf (diff)
downloadgcc-b9d73ea676ed871b449afe0f971d883293999a69.tar.gz
* tree-scalar-evolution.c: New file.
* tree-scalar-evolution.h: New file. * tree-ssa-loop-niter.c: New file. * Makefile.in (SCEV_H): New. (tree-scalar-evolution.o, tree-ssa-loop-niter.o): Add new files. * cfgloop.h (struct loop): Add bounds field. * tree-flow.h (struct tree_niter_desc): New type. (number_of_iterations_cond, number_of_iterations_exit, loop_niter_by_eval, find_loop_niter_by_eval, estimate_numbers_of_iterations, can_count_iv_in_wider_type, free_numbers_of_iterations_estimates): Declare. * tree.h (lower_bound_in_type, upper_bound_in_type): Declare. * params.def (PARAM_MAX_ITERATIONS_TO_TRACK): New parameter. * doc/invoke.texi (max-iterations-to-track): Document. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@84340 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/params.def')
-rw-r--r--gcc/params.def8
1 files changed, 8 insertions, 0 deletions
diff --git a/gcc/params.def b/gcc/params.def
index 72095affd4f..56d83609a29 100644
--- a/gcc/params.def
+++ b/gcc/params.def
@@ -229,6 +229,14 @@ DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL,
"The maximum number of unswitchings in a single loop",
3)
+/* The maximum number of iterations of a loop the brute force algorithm
+ for analysis of # of iterations of the loop tries to evaluate. */
+DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK,
+ "max-iterations-to-track",
+ "Bound on the number of iterations the brute force # of iterations \
+ analysis algorithm evaluates",
+ 1000)
+
DEFPARAM(PARAM_MAX_SMS_LOOP_NUMBER,
"max-sms-loop-number",
"Maximum number of loops to perform swing modulo scheduling on \