diff options
| author | Zdenek Dvorak <rakdver@atrey.karlin.mff.cuni.cz> | 2004-07-09 05:19:14 +0200 |
|---|---|---|
| committer | Zdenek Dvorak <rakdver@gcc.gnu.org> | 2004-07-09 03:19:14 +0000 |
| commit | e9eb809dec69b6280ed2f2830efd1ac8b7d9bcb8 (patch) | |
| tree | b093da742fb0c72680308c3cb8cd011bf2fbc8fc /gcc/params.def | |
| parent | dd29d26b24928bdbcbdb1e7cbe09284f76f886f7 (diff) | |
| download | gcc-e9eb809dec69b6280ed2f2830efd1ac8b7d9bcb8.zip gcc-e9eb809dec69b6280ed2f2830efd1ac8b7d9bcb8.tar.gz gcc-e9eb809dec69b6280ed2f2830efd1ac8b7d9bcb8.tar.bz2 | |
tree-scalar-evolution.c: New file.
* 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.
From-SVN: r84340
Diffstat (limited to 'gcc/params.def')
| -rw-r--r-- | gcc/params.def | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/gcc/params.def b/gcc/params.def index 72095af..56d8360 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 \ |