Cross-file inlining by using summaries and global worklist

Details Cross-file inlining by using summaries and global worklist Cross-file inlining by using summaries and global worklist

2011-08-09

2011-08-09

Zhen, Wei (Department: 2191)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

Reexamination Certificate

active

07996825

ABSTRACT:
One embodiment disclosed relates to a method of compiling a computer program. A plurality of modules of source code is received, and intermediate representations corresponding to the modules are generated. A set of data from the intermediate representations is extracted to create an inliner summary for each module. Using the inliner summaries and a globally-sorted working-list based order, an inline analysis phase determines which call sites in the modules are to be inlined by substituting code from a called module. The propagation of summaries may be done elaborately, potentially throughout the call-graph. The goodness of call sites may be computed with a view to comparing them and ordering them in a descending order of goodness. Applicants believe the compile-time effectiveness lies in the ability to work consistently with summary information in the inline analysis phase without having to touch the intermediate representation, while maintaining a high degree of run-time performance by continuously updating the summary information.

REFERENCES:
patent: 5428793 (1995-06-01), Odnert et al.
patent: 5555417 (1996-09-01), Odnert et al.
patent: 5671419 (1997-09-01), Carini et al.
patent: 5740443 (1998-04-01), Carini
patent: 5920723 (1999-07-01), Peyton, Jr. et al.
patent: 6195793 (2001-02-01), Schmidt
patent: 6971091 (2005-11-01), Arnold et al.
Aggressive Inlining, Ayers et al., 1997 ACM pp. 134-145.
Ayers et al., “Aggressive Inlining”, 1997, ACM, pp. 134-145.
Andrew Ayers, et al., “Aggressive InLining”, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1997, pp. 134-145.
Andrew Ayers, et al., “Scalable Cross-Module Optimization”, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI),1998, pp. 301-312.
Pohua P. Chang, et al., “Profile-guided Automatic InLine Expansion for C Programs”, 1992, Software-Practice and Experience vol. 22 (5), pp. 349-369.
J. Eugene Ball, “Predicting the Effects of Optimization on a Procedure Body”, ACM SIGPLAN, 1979, pp. 214-220.
Owen Kaser, et al., “Evaluating InLining Techniques”, Aug. 14, 1996, pp. 1-15.
Matthew Arnold, et al.; “A Comparative Study of Static and Profile-Based Heuristics for InLining”, ACM, 2000, pp. 52-64.
Peng Zhao, et al., “To InLine or Not to Inline? Enhanced InLining Decisions”, to appear at the 16th Workshop on Language and Compilers for Parallel Computing (LCPC03), Oct. 2003.
Toshio Suganuma, et al., “An Empirical Study of Method InLining for a Java Just-In-Time Compiler”, Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium, Aug. 2002.

Affiliated with

Also associated with

Rating

Cross-file inlining by using summaries and global worklist does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cross-file inlining by using summaries and global worklist, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cross-file inlining by using summaries and global worklist will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2754386