GCC 4.8 Has More Optimizations
Written by Michael Larabel in Compiler on 14 November 2012 at 01:21 AM EST. 4 Comments
The GCC 4.8 compiler when released in early 2013 will have a number of new optimizations.

GCC 4.8 features improvements to link-time optimizations (LTO) with the LTO partitioning having been re-written for improved reliability and maintainability while fixing some link failures (see our GCC 4.7 LTO benchmarks). Aside from improving LTO, there's also improved inter-procedural optimizations. The interprocedural optimization improvements come from a new symbol table, improvements to the inline heuristicsm and better inlining decisions.

GCC 4.8 has also addressed some scalability bottlenecks within GCC's optimization passes that will benefit extremely large functions. There's also a new -ftree-partial-pre option for controlling partial redundancy elimination (PRE) optimizations.

Last but not least there is a new general optimization level for fast compilation but with superior debugging capabilities and still reasonable run-time performance.

Other new features to version 4.8 of the GNU Compiler Collection are talked about in this article.
About The Author
Author picture

Michael Larabel is the principal author of Phoronix.com and founded the site in 2004 with a focus on enriching the Linux hardware experience. Michael has written more than 10,000 articles covering the state of Linux hardware support, Linux performance, graphics drivers, and other topics. Michael is also the lead developer of the Phoronix Test Suite, Phoromatic, and OpenBenchmarking.org automated benchmarking software. He can be followed via Twitter or contacted via MichaelLarabel.com.

Related Compiler News
Popular News
Trending Reviews & Featured Articles