Annotations to executable images for improved dynamic optimization functions

• US 6,993,754 B2
• Filed: 11/13/2001
• Issued: 01/31/2006
• Est. Priority Date: 11/13/2001
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Duesterwald, Evelyn, Freudenberger, Stefan M.
• Primary Examiner(s): Chaki, Kakali
• Assistant Examiner(s): SHRADER, LAWRENCE J
• Application Number:
  US09/992,642
• Publication Number:
  US 20030093780A1
• Time in Patent Office: 1,540 Days
• Field of Search: 717/136, 717151-161, 717140-148
• US Class Current: 717/153
• CPC Class Codes: G06F 8/443 Optimisation

Abstract

A method of optimizing a computer program includes generating annotation information about the computer program, storing the annotation information with the computer program, and dynamically optimizing the computer program based on the annotation information while the computer program is being executed.

Claims

1. A method of enabling dynamic optimization of a computer program, comprising:

generating annotation information about said computer program, said annotation information being derived from information held by a compiler about references to individual memory locations; and

storing said annotation information with said computer program, said annotation information enabling a dynamic optimizer to optimize said computer program during execution.

2. The method of claim 1, wherein generating annotation information comprises generating annotation information enabling replacement of subroutine calls with inline program code in said computer program while said computer program is being executed.

3. The method of claim 1, wherein generating annotation information comprises a compiler generating said annotation information.

4. The method of claim 1, wherein said computer program comprises at least one executable file.

5. The method of claim 1, wherein said computer program comprises at least one source file.

6. The method of claim 1, wherein said generating annotation information comprises generating annotation information derived from runtime architecture and software conventions.

7. The method of claim 1, wherein said generating annotation information comprises generating annotation information identifying a unique stack pointer register to be used by said computer program.

8. The method of claim 1, wherein said generating annotation information comprises generating annotation information comprising a list of non-ambiguous memory locations.

9. The method of claim 8, wherein said annotation information enables said dynamic optimizer to obtain canonical names for said non-ambiguous memory locations.

10. The method of claim 8, wherein said non-ambiguous memory locations comprise stack frame locations.

11. The method of claim 1, wherein said generating annotation information comprises generating annotation information comprising a mapping of memory references to all non-ambiguous locations which are referenced.

12. The method of claim 1, wherein said generating annotation information comprises generating annotation information comprising a list of canonical names of stack frame locations that are promotable.

13. The method of claim 1, wherein said generating annotation information comprises generating annotation information comprising a guarantee that no stack frame location is live beyond the scope of the stack frame.

14. The method of claim 1, wherein said generating annotation information comprises generating annotation information comprising a format and a location of stack unwinding information.

15. A method of dynamically optimizing a computer program, comprising:

reading annotation information derived from runtime architecture and software conventions used to compile said computer program, said annotation information also being derived from information held by compiler about references to individual memory locations, said annotation information being stored with said computer program; and

dynamically optimizing said computer program based on said annotation information while said computer program is being executed.

16. The method of claim 15, wherein said dynamically optimizing said computer program comprises a binary translator optimizing said computer program.

17. The method of claim 15, wherein said dynamically optimizing said computer program comprises replacing subroutine calls in said computer program with inline program code.

18. The method of claim 15, wherein said dynamically optimizing said computer program comprises removing redundant callee-save register restores.

19. The method of claim 15, wherein said dynamically optimizing said computer program comprises propagating constant arguments within said computer program.

20. The method of claim 15, wherein said dynastically optimizing said computer program comprises promoting local data from a stack frame location to a register.

21. The method of claim 15, wherein said dynamically optimizing said computer program comprises removing redundant callee register saves.

22. The method of claim 15, wherein said dynamically optimizing said computer program comprises removing stack frame allocation.

23. Apparatus for enabling dynamic optimization of a computer program, the apparatus comprising:

one or more computer readable storage media; and

computer executable instructions stored in the one or more computer readable storage media, the computer executable instructions comprising;

instructions for generating annotation information about said computer program, wherein said annotation information enables a dynamic optimizer to optimize said computer program during execution, said annotation information being derived from information held by a compiler about references to individual memory locations; and

instructions for storing said annotation information with said computer program.