Commit 67135ef4 by Zdenek Dvorak Committed by Zdenek Dvorak

* doc/trouble.texi: Update section on handling of empty loops.

From-SVN: r102190
parent fdda361d
2005-07-20 Zdenek Dvorak <dvorakz@suse.cz>
* doc/trouble.texi: Update section on handling of empty loops.
2005-07-20 Kazu Hirata <kazu@codesourcery.com> 2005-07-20 Kazu Hirata <kazu@codesourcery.com>
* config.gcc: Remove support for sparc-*-openbsd*, * config.gcc: Remove support for sparc-*-openbsd*,
......
...@@ -1220,14 +1220,10 @@ However, the rationale here is that optimization of a nonempty loop ...@@ -1220,14 +1220,10 @@ However, the rationale here is that optimization of a nonempty loop
cannot produce an empty one. This held for carefully written C compiled cannot produce an empty one. This held for carefully written C compiled
with less powerful optimizers but is not always the case for carefully with less powerful optimizers but is not always the case for carefully
written C++ or with more powerful optimizers. written C++ or with more powerful optimizers.
@opindex funroll-loops
Thus GCC will remove operations from loops whenever it can determine Thus GCC will remove operations from loops whenever it can determine
those operations are not externally visible (apart from the time taken those operations are not externally visible (apart from the time taken
to execute them, of course). As GCC improves, it will remove the loop to execute them, of course). In case the loop can be proved to be finite,
itself. Indeed, with @option{-funroll-loops} small loops can already be GCC will also remove the loop itself.
removed, so leaving an empty non-unrolled loop is both sub-optimal and
inconsistent.
Be aware of this when performing timing tests, for instance the Be aware of this when performing timing tests, for instance the
following loop can be completely removed, provided following loop can be completely removed, provided
......
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