Abstract: This paper describes how to construct the algorithm for inline data-structure such as function call graph, and presents the inline algorithm based on the function call graph. According to the requirements of KAP system, an inline algorithm for leaf-node is proposed. Testing results indicate that the algorithm can inline efficiently and effectively the functions of NPB testing set. After inlining, the ratio of acceleration can reach 15.78% at most.

Key words: inline, function call graph, parameter mapping, call

摘要： 从基于调用图的函数内联技术、函数参数的映射技术和内联使用的不同策略3个方面讨论基于SUIF系统的内联技术的实现。根据KAP系统需求，提出叶节点的内联算法，以满足并行性分析的需要，降低全内联引起的代码膨胀问题。测试结果表明，该算法能够有效地内联NPB测试集中的一些函数，经函数内联后，加速比最高可提高15.78%。

关键词: 内联, 函数调用图, 参数映射, 调用

CLC Number: 

• TP311.12