Commit d6a64b9d by Janis Johnson Committed by Janis Johnson

invoke.texi (Optimize Options): Under -fcse-follow-jumps, show that CSE means…

invoke.texi (Optimize Options): Under -fcse-follow-jumps, show that CSE means common subexpression elimination.

	* doc/invoke.texi (Optimize Options): Under -fcse-follow-jumps,
	show that CSE means common subexpression elimination.  Change wording
	for -fsee and define LCM.  Remove capitalization of optimizations
	for -ftree-reassoc, -ftree-pre, and -ftree-fre.

From-SVN: r129824
parent fdaea7e2
2007-11-01 Janis Johnson <janis187@us.ibm.com> 2007-11-01 Janis Johnson <janis187@us.ibm.com>
* doc/invoke.texi (Optimize Options): Under -fcse-follow-jumps,
show that CSE means common subexpression elimination. Change wording
for -fsee and define LCM. Remove capitalization of optimizations
for -ftree-reassoc, -ftree-pre, and -ftree-fre.
2007-11-01 Janis Johnson <janis187@us.ibm.com>
PR testsuite/25352 PR testsuite/25352
* doc/sourcebuild.texi (Test Directives): Document that xfail * doc/sourcebuild.texi (Test Directives): Document that xfail
has no effect for dg-do except when dg-do-what is "run". has no effect for dg-do except when dg-do-what is "run".
...@@ -5399,7 +5399,7 @@ Enabled at levels @option{-O}, @option{-O2}, @option{-O3}, ...@@ -5399,7 +5399,7 @@ Enabled at levels @option{-O}, @option{-O2}, @option{-O3},
@item -fcse-follow-jumps @item -fcse-follow-jumps
@opindex fcse-follow-jumps @opindex fcse-follow-jumps
In common subexpression elimination, scan through jump instructions In common subexpression elimination (CSE), scan through jump instructions
when the target of the jump is not reached by any other path. For when the target of the jump is not reached by any other path. For
example, when CSE encounters an @code{if} statement with an example, when CSE encounters an @code{if} statement with an
@code{else} clause, CSE will follow the jump when the condition @code{else} clause, CSE will follow the jump when the condition
...@@ -5644,8 +5644,8 @@ sense when scheduling after register allocation, i.e.@: with ...@@ -5644,8 +5644,8 @@ sense when scheduling after register allocation, i.e.@: with
@item -fsee @item -fsee
@opindex fsee @opindex fsee
Eliminates redundant extension instructions and move the non redundant Eliminate redundant sign extension instructions and move the non-redundant
ones to optimal placement using LCM. ones to optimal placement using lazy code motion (LCM).
@item -freschedule-modulo-scheduled-loops @item -freschedule-modulo-scheduled-loops
@opindex freschedule-modulo-scheduled-loops @opindex freschedule-modulo-scheduled-loops
...@@ -5667,17 +5667,17 @@ Enabled at levels @option{-O2}, @option{-O3}, @option{-Os}. ...@@ -5667,17 +5667,17 @@ Enabled at levels @option{-O2}, @option{-O3}, @option{-Os}.
@item -ftree-reassoc @item -ftree-reassoc
@opindex ftree-reassoc @opindex ftree-reassoc
Perform Reassociation on trees This flag is enabled by default Perform reassociation on trees. This flag is enabled by default
at @option{-O} and higher. at @option{-O} and higher.
@item -ftree-pre @item -ftree-pre
@opindex ftree-pre @opindex ftree-pre
Perform Partial Redundancy Elimination (PRE) on trees. This flag is Perform partial redundancy elimination (PRE) on trees. This flag is
enabled by default at @option{-O2} and @option{-O3}. enabled by default at @option{-O2} and @option{-O3}.
@item -ftree-fre @item -ftree-fre
@opindex ftree-fre @opindex ftree-fre
Perform Full Redundancy Elimination (FRE) on trees. The difference Perform full redundancy elimination (FRE) on trees. The difference
between FRE and PRE is that FRE only considers expressions between FRE and PRE is that FRE only considers expressions
that are computed on all paths leading to the redundant computation. that are computed on all paths leading to the redundant computation.
This analysis is faster than PRE, though it exposes fewer redundancies. This analysis is faster than PRE, though it exposes fewer redundancies.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment