PR tree-optimization/18800

[pf3gnuchains/gcc-fork.git] / gcc / doc / invoke.texi

diff --git a/gcc/doc/invoke.texi b/gcc/doc/invoke.texi
index 8316bec..5ba632e 100644 (file)
--- a/gcc/doc/invoke.texi
+++ b/gcc/doc/invoke.texi
@@ -5478,6 +5478,11 @@ if there are more candidates, to avoid quadratic time complexity.
 The induction variable optimizations give up on loops that contain more
 induction variable uses.
 
+@item iv-always-prune-cand-set-bound
+If number of candidates in the set is smaller than this value,
+we always try to remove unnecessary ivs from the set during its
+optimization when a new iv is added to the set.
+
 @item max-iterations-to-track
 
 The maximum number of iterations of a loop the brute force algorithm