A framework for unrestricted whole-program optimization
A framework for unrestricted whole-program optimization
复制标题
无限制的全程序优化框架
DOI:
--
复制
发表时间:
2006
期刊:
影响因子:
--
通讯作者:
David I. August
中科院分区:
文献类型:
--
作者:
Spyridon Triantafyllis;Matthew J. Bridges;Easwaran Raman;Guilherme Ottoni;David I. August
Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather than optimization goals, arbitrarily constraining code transformations. Techniques, such as aggressive inlining and interprocedural optimization, have been developed to alleviate this problem, but, due to code growth and compile time issues, these can be applied only sparingly.This paper introduces the Procedure Boundary Elimination (PBE) compilation framework, which allows unrestricted whole-program optimization. PBE allows all intra-procedural optimizations and analyses to operate on arbitrary subgraphs of the program, regardless of the original procedure boundaries and without resorting to inlining. In order to control compilation time, PBE also introduces novel extensions of region formation and encapsulation. PBE enables targeted code specialization, which recovers the specialization benefits of inlining while keeping code growth in check. This paper shows that PBE attains better performance than inlining with half the code growth.