Re: GCC: link-time optimization
Abhisek Datta <[email protected]>
| Newsgroups | gmane.user-groups.linux.kolkata |
|---|---|
| Message-ID | <[email protected]> |
On Tue, Apr 21, 2009 at 6:04 PM, Debarshi Ray <[email protected]> wrote: > http://gcc.gnu.org/wiki/LinkTimeOptimization > > "Link Time Optimization (LTO) gives GCC the capability of dumping its > internal representation (gimple) to disk, so that all the different > compilation units that make up a single executable can be optimized as > a single module. This expands the scope of inter-procedural > optimizations to encompass the whole program (or, rather, everything > that is visible at link time)." > Yea, this and few other features introduced in GCC 4.x finally added support for "whole program analysis" to some extend. There are a lot of whole program analysis research material available which previously was not possible to implement efficiently over GCC because it previously lacked whole program as well as intra-procedural analysis. -abhisek [1] http://www.usenix.org/events/sec01/full_papers/shankar/shankar_html/ [2] http://gcc.vulncheck.org/papers/ _______________________________________________ Ilug-cal-discuss mailing list Ilug-cal-discuss-PMNjqutUrVNkNBGiPgg+Odi2O/[email protected] http://list.ilug-cal.org/mailman/listinfo/ilug-cal-discuss