On Tue, 27 Sep 2011, Jan Hubicka wrote:
> thanks for corrections. This is what I've comitted now.
Here is another small update I just crafted, that makes a stylistic
change here and there, introduces LTO as an abbreviation, adds some
missing articles and spaces,...
Installed.
Gerald
Index: changes.html
===================================================================
RCS file: /cvs/gcc/wwwdocs/htdocs/gcc-4.7/changes.html,v
retrieving revision 1.37
diff -u -r1.37 changes.html
--- changes.html 27 Sep 2011 16:57:02 -0000 1.37
+++ changes.html 27 Sep 2011 18:42:03 -0000
@@ -59,12 +59,13 @@
as a series of if statements and using a jump table.
</li>
- <li>Link-time optimization improvements:
+ <li>Link-time optimization (LTO) improvements:
<ul>
- <li>Improved scalability and reduced memory usage. Link time
optimization
- of Firefox now requires 3GB of RAM on a 64bit system, while over 8GB was
needed
- previously. Linking time has been improved, too. The serial stage of
linking
- Firefox binary has been sped up approximately by factor of 10.</li>
+ <li>Improved scalability and reduced memory usage. Link time
+ optimization of Firefox now requires 3GB of RAM on a 64-bit system,
+ while over 8GB was needed previously. Linking time has been improved,
+ too. The serial stage of linking Firefox has been sped up by about a
+ factor of 10.</li>
<li>Reduced size of object files and temporary storage used during
linking.</li>
<li>Streaming performance (both outbound and inbound) has been
improved.</li>
<li><code>ld -r</code> is now supported with LTO.</li>
@@ -73,8 +74,9 @@
<li>Interprocedural optimization improvements:
<ul>
- <li>Inliner heuristic can now take into account that after inlining
- code will be optimized out because of known values (or properties) of
function parameters.
+ <li>Heuristics now take into account that after inlining code will
+ be optimized out because of known values (or properties) of function
+ parameters.
For example:
<pre>
void foo(int a)
@@ -92,7 +94,7 @@
are now understood by the inliner and code size estimates are evaluated
a lot
more realistically.</li>
<li>The representation of C++ virtual thunks and aliases (both implicit
and defined
- via <code>alias</code>attribute) has been re-engineered. The aliases no
+ via the <code>alias</code> attribute) has been re-engineered. Aliases no
longer pose optimization barriers and calls to an alias can be inlined
and otherwise optimized.</li>
<li>The inter-procedural constant propagation pass has been rewritten.
