GCC 4.8 Has More Optimizations

Posted by Michael Larabel on November 14, 2012

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.

Discuss this article in our forums, IRC channel, or email the author. You can also follow our content via RSS and on social networks like Facebook, Identi.ca, and Twitter (@Phoronix and @MichaelLarabel). Subscribe to Phoronix Premium to view our content without advertisements, view entire articles on a single page, and experience other benefits.
  1. Computers
  2. Display Drivers
  3. Graphics Cards
  4. Motherboards
  5. Peripherals
  6. Processors
  7. Software
  8. Operating Systems
  9. All Articles
  1. Linux Benchmarking
  2. OpenBenchmarking.org
  3. Phoronix Test Suite