Method and system of adaptive dynamic compiler resolution

• US 7,543,285 B2
• Filed: 07/26/2005
• Issued: 06/02/2009
• Est. Priority Date: 07/27/2004
• Status: Active Grant

• Current Assignee: Texas Instruments, Inc.
• Original Assignee: Texas Instruments, Inc.
• Inventors: Cabillic, Gilbert, Lesot, Jean-Philippe
• Primary Examiner(s): Zhen; Wei Y
• Assistant Examiner(s): Coyer; Ryan D.
• Application Number:
  US11/189,410
• Publication Number:
  US 20060026575A1
• Time in Patent Office: 1,407 Days
• Field of Search: 717/145, 717146-148, 717/151, 717153-159
• US Class Current: 717/158
• CPC Class Codes: G06F 12/0802 Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
• CPC Class Codes: G06F 12/1081 for peripheral access to main memory, e.g. direct memory access [DMA]
• CPC Class Codes: G06F 2212/6012 of operating mode, e.g. cache mode or local memory mode
• CPC Class Codes: G06F 9/30174 for non-native instruction set, e.g. Javabyte, legacy code
• CPC Class Codes: G06F 9/45504 Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
• CPC Class Codes: Y02D 10/00 Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A method and system of adaptive dynamic compiler resolution. At least some of the illustrative embodiments are a computer-implemented method comprising compiling a source file containing an application program (the application program comprising a method, and wherein the compiling creates a destination file containing a compiled version of the application program), and inserting in the compiled version of the application program a series of commands that (when executed at run time of the application program) generate a first optimized version of the method using a first value available at run time, and generate a second optimized version of the method using a second value available at run time.

Claims

1. A computer-implemented method comprising:

identifying during compilation a code portion in source code of an application, wherein the code portion requires a dynamic data value, wherein a dynamic data value is a data value that changes based on execution behavior of the application;

generating a compiled version of the code portion optimized for a general value of the dynamic data value;

generating a series of instructions to be executed when the application is executed, wherein the series of instructions is configured

to monitor a plurality of executions of the compiled version of the code portion to determine a first frequently occurring value of the dynamic data value,

to generate a first optimized code portion corresponding to the code portion using the first frequently occurring value, wherein subsequent execution flow is directed to the first optimized code portion when the first frequently occurring value is used;

to monitor the ongoing execution of the compiled version of the code portion to determine one or more additional frequently occurring values of the dynamic data value, and

to generate new optimized code portions using the additional frequently occurring values, wherein subsequent execution flow is directed to the new optimized code portions when the corresponding new frequently occurring value is used and wherein one of the new optimized code portions replaces the first optimized code code portion; and

inserting the series of instructions in a compiled version of the source code.

2. The computer-implemented method as defined in claim 1, wherein the series of instructions is further configured to generate glue code to cause the subsequent execution flow to be directed to the first optimized code portion when the first frequently occurring value is used.

3. The computer-implemented method as defined in claim 1, wherein the series of instructions is further comfigured to monitor values of the dynamic data value to determine that the first frequently occurring value is no longer used and to replace the first optimized code portion with a second optimized code portion generated using a new frequency occurring value.

4. The computer-implemented method as defined in claim 1, wherein the compiled version of the source file compromises Java bytecodes that are directly executable by a precursor.

5. The computer-implemented method as defined in claim 1, wherein the soure file comprises Java bytecodes.

6. The computer-implemented method as defined in claim 1, wherein the series of instructions comprises a micro-sequence.

7. A computer readable medium storing a computer program that when executed by a processor, performs a method comprising:

identifying during compilation a code portion in source code of an application, wherein a dynamic data value is a data value that changes based on execution behavior of the application;

generating a compiled version of the code portion optimitzed for a general value of the dynamic data value;

generating a series of instructions to be executed when the application is executed, wherein the series of instructions is configured

to monitor a plurality of executions of the compiled version of the code portion to determine a first frequently occurring value of the dynamic data value, and

to generate a first optimized code portion corresponding to the code portion using the first frequently occurring value of the dynamic data value, and

to generate a first optimized code portion corresponding to the code portion using the first frequently occurring value, wherein subsequent execution flow is directed to the first optimized code portion when the first frequently occurring value is used;

to monitor the ongoing execution of the compiled version of the code portion to determine one or more additional frequently occurring values of the dynamic data value, and

to generate new optimized code portions using the additional frequently occurring values, wherein subsequent execution flow is directed in the new optimized code portions when the corresponding new frequently occurring value is used and wherein one of the new optimized code portions replaces the first optimized code code portion; and

inserting the series of instructions in a compiled version of the source code file.

8. The computer readable medium as defined in claim 7, wherein the series of instructions is further configured to generate glue code to cause the subsequent execution flow to be directed to the first optimized code portion when the first frequently occurring value is used.

9. The computer readable medium as defined in claim 7, wherein the compiled version of the source file comprises Java bytecodes that are directly executable by a processor.

10. The computer readable medium as defined in claim 7, wherein the source file comprises Java bytecodes.

11. The computer readable medium as defined in claim 7, wherein the series of instructions is further configured to monitor values of the dynamic data value to determine that the first frequently occurring value is no longer used and to replace the first optimized code portion with a second optimized code portion generated using a new frequently occurring value.

12. The computer readable medium as defined in claim 7, wherein the series of instructions comprises a micro-sequence.

13. A system comprising;

a memory configured to store a source code of an application;

a processor coupled to the memory; and

a compiler configured to execute on the processor to compile the source code, wherein compiling the source code portion of the source code, wherein the code portion requires a dynamic data value, wherein a dynamic data value is a data that changes based on execution behavior of the application;

generating a compiled version of the code portion optimized for a general value of the dynamic data value;

generating a series of instructions to be executed when the application is executed wherein the series of instructions is configured

to monitor a plurality of executions of the compiled version of the code portion to determine a first frequently occurring value of the dynamic data value,

to generate a first optimized code portion corresponding to the code portion using the first frequently occurring value, wherein subsequent execution flow is directed to the first optimized code portion when the first frequently occurring value is used,

to monitor the ongoing execution of the compiled version of the code portion to determine one or more additional frequently occurring values of the dynamic data value and

to generate new optimized code portions using the additional frequently occurring values wherein subsequent execution flow is directed to the new optimized code portions when the corresponding new frequently occurring value is used and wherein one of the new optimized code portions replaces the first optimized code code portion; and

inserting a call to the series of instructions in a compiled version of the source code file.

14. The system as defined in claim 13 wherein the series of instructions is further configured to generate glue code to cause the subsequent execution flow to be directed to the first optimized code portion when the first frequently occurring value is used.

15. The system as defined in claim 13 wherein the source file comprises Java bytecodes.

16. The system as defined in claim 13 wherein the compiled version of the source file comprises Java bytecodes that are directly executable by the processor.

17. The system as defined in claim 13 wherein the series of instructions is further configured to monitor values of the dynamic data value to determine that the first frequently executing value is no longer used and to replace the first optimized code portion with a second optimized code portion generated using a new freqeuntly occurring value.