aboutsummaryrefslogtreecommitdiff
path: root/gcc/doc
diff options
context:
space:
mode:
authorAndrew MacLeod <amacleod@redhat.com>2001-07-26 13:59:22 +0000
committerAndrew Macleod <amacleod@gcc.gnu.org>2001-07-26 13:59:22 +0000
commit4a121cc34cd8153380aee3246979b8fb35e2a88f (patch)
treed529585912a27f24d918c1691b52427ec3a93d8a /gcc/doc
parentdb3ef87b8a1858f77998a9e8a5275cc5755350d7 (diff)
downloadgcc-4a121cc34cd8153380aee3246979b8fb35e2a88f.zip
gcc-4a121cc34cd8153380aee3246979b8fb35e2a88f.tar.gz
gcc-4a121cc34cd8153380aee3246979b8fb35e2a88f.tar.bz2
params.def (PARAM_MAX_PENDING_LIST_LENGTH): Add parameter to limit length of dependancy flush list.
2001-07-26 Andrew MacLeod <amacleod@redhat.com> * params.def (PARAM_MAX_PENDING_LIST_LENGTH): Add parameter to limit length of dependancy flush list. * params.h (MAX_PENDING_LIST_LENGTH): Define. * sched-int.h (struct deps): Add pending_flush_length field. * sched-deps.c (flush_pending_lists): Last_pending_memory_flush now has 1 element in it. (sched_analyze_1): Use MAX_PENDING_LIST_LENGTH. (sched_analyze): After a jump, if the pending memory flush list is too large, flush the pending lists. (init_deps): Initialize pending_flush_length to 0. * doc/invoke.texi (max_pending_list_length): Document parameter. From-SVN: r44398
Diffstat (limited to 'gcc/doc')
-rw-r--r--gcc/doc/invoke.texi6
1 files changed, 6 insertions, 0 deletions
diff --git a/gcc/doc/invoke.texi b/gcc/doc/invoke.texi
index 3b13ad8..f3b3e8e 100644
--- a/gcc/doc/invoke.texi
+++ b/gcc/doc/invoke.texi
@@ -3808,6 +3808,12 @@ optimization will not be done.
@item max-gcse-passes
The maximum number of passes of GCSE to run.
+@item max-pending-list-length
+The maximum number of pending dependancies scheduling will allow
+before flushing the current state and starting over. Large functions
+with few branches or calls can create excessively large lists which
+needlessly consume memory and resources.
+
@item max-inline-insns
If an function contains more than this many instructions, it
will not be inlined. This option is precisely equivalent to