Issue No. 02 - February (1992 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.121752
<p>Equations representing the execution time performance of noninlined and inlined versions of a program have been developed. The accuracy of the equations' description of inlined program execution time behavior was demonstrated on four computer systems. Using the equations, understanding of how certain factors influence the speed of inlined code was gained. Contrary to a number of published reports in the literature, the increased size of inlined code was not found to affect its execution time performance on demand-paged virtual memory machines. On such systems, neither the use of an inlining algorithm that includes program size constraints nor the substitution of interprocedural data flow analysis for inlining is warranted. A modest improvement in the caching and paging behavior of test programs' inlined versions was also observed</p>
subprogram inlining; execution time performance; inlined versions; inlined program execution time behavior; computer systems; inlined code; demand-paged virtual memory machines; inlining algorithm; program size constraints; interprocedural data flow analysis; caching; paging behavior; program testing; programming; storage allocation; virtual storage
J. Davidson and A. Hollersnm, "Subprogram Inlining: A Study of its Effects on Program Execution Time," in IEEE Transactions on Software Engineering, vol. 18, no. , pp. 89-102, 1992.