递归调用的内联策略分析  

Analysis on the Inlining of Recursive Calls

作　　者：何振峰[1] 

机构地区：[1]福州大学数学与计算机学院

出　　处：《小型微型计算机系统》2009年第9期1787-1790,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(F020103)资助;福建省青年创新基金项目(2006F3075)资助

摘　　要：基于Tang提出的全控制流图研究了递归过程内联优化问题.提出妨碍递归过程内联的关键在于局部变量的副本问题,通过变量的定义使用关系分析,提出递归过程的可内联条件是在流图中任意局部变量的定义使用路径均不穿过递归调用语句.给出了内联时出口语句的模板,它能够处理存在多处递归调用的情况.最后通过实例说明了递归过程的内联.The inlining of recursive procedures, a problem for compiler optimizing, is studied through full control flow graph （FCFG） presented by Tang. The different versions of local variables is suggested as the key for such inlining. Based upon the definition - use path analysis, the inlinable recursive procedures are suggested to be those with no definition - use path crossing the recursive call sentence for all the local variables. The template for exit sentence is also presented, which can be applied in the occasions when there are multi recursive calls. A real example is utilized to describe the inlining approaches of recursive procedures.

关 键 词：内联优化 递归消除 全控制流图 编译器优化 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]