Fast and Effective Procedure Inlining
Fast and Effective Procedure Inlining
复制标题
快速有效的程序内联
DOI：
--
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
R. Dybvig
中科院分区：
文献类型：
--
作者：
Oscar Waddell;R. Dybvig
内联算法的有效性不仅取决于其识别内联机会的能力，还取决于其行使这些机会的自由裁量权。本文提出了一种新的内联算法，高阶语言，结合简单的分析技术与需求驱动的在线转换，以实现一致的，往往是戏剧性的性能增益在快速的线性时间。该算法被证明是有效的，并显着快于离线，分析密集型算法最近在文献中描述。
The effectiveness of an inlining algorithm is determined not only by its ability to recognize inlining opportunities but also by its discretion in exercising those opportunities. This paper presents a new inlining algorithm for higher-order languages that combines simple analysis techniques with demand-driven online transformation to achieve consistent and often dramatic performance gains in fast linear time. The algorithm is shown to be as effective as and significantly faster than offline, analysis-intensive algorithms recently described in the literature.