Analysis on the Inlining of Recursive Calls
Zhenfeng He · Journal of Chinese Computer Systems · 2009
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.