TRANSPARENT DYNAMIC CODE OPTIMIZATION

• US 20150277870A1
• Filed: 03/31/2014
• Published: 10/01/2015
• Est. Priority Date: 03/31/2014
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Gschwind, Michael K.
• Granted Patent: US 9,483,295 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 2009/45583 Memory management, e.g. access or allocation
• CPC Class Codes: G06F 9/45516 Runtime code conversion or optimisation
• CPC Class Codes: G06F 9/45525 Optimisation or modification within the same instruction set architecture, e.g. HP Dynamo
• CPC Class Codes: G06F 9/45558 Hypervisor-specific management and integration aspects

Abstract

A transparent dynamic code optimization capability natively executes code and identifies hot regions within the code or identifies code that is to otherwise be optimized; notifies an optimizer that such hot region or code has been identified enabling the optimizer to create optimized code; efficiently passes control to the newly optimized code; and transfers control back from such optimized code.

Claims

1. A computer program product for facilitating processing in a computing environment, said computer program product comprising:

a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising;

executing, by a processor, an application;

determining that a defined event has occurred; and

based on determining that the defined event has occurred, transferring control to a component of the computing environment to perform one or more modifications to provide modified code of the application, wherein the application comprises the modified code and unmodified code, the modified code being stored in separate memory regions different from the memory regions storing the unmodified code, and wherein the transferring control comprises using an event based branch to transfer to an address specified by the processor based on occurrence of the defined event, the address corresponding to an instruction to be performed by the component to perform the one or more modifications.

2. The computer program product of claim 1, wherein the method further comprises:

receiving control back at the processor from the component based on providing the modified code to continue executing the application; and

continuing to execute the application, wherein the continuing to execute the application comprises;

determining at a point in the application that modified code is to be executed;

based on determining that modified code is to be executed, fetching the modified code from memory using an address translation entry for instruction fetches, wherein a different address translation entry is used for data accesses; and

executing the modified code.

3. The computer program product of claim 2, wherein the method further comprises receiving control back at the unmodified code, wherein the receiving control comprises using a target address register that specifies an address to which control in the unmodified code is to be transferred, the target address register being a register separate from registers used for application state.

4. The computer program product of claim 1, wherein the method further comprises creating, by the component, the modified code, the creating comprising:

analyzing one or more statistics provided by a hardware performance monitor executing within the computing environment;

determining, based on the analyzing, that the application is to be modified; and

creating the modified code, based on the determining.

5. The computer program product of claim 4, wherein the analyzing comprises obtaining information from the hardware performance monitor to determine a hot region in the application and creating the modified code based on the obtained information.

6. The computer program product of claim 4, wherein the analyzing further comprises obtaining and analyzing information from a branch history rolling buffer related to one or more branches that have been taken in the application.

7. The computer program product of claim 4, wherein the method further comprises storing the modified code, wherein the modified code is stored in the separate memory regions, the separate memory regions being accessible via an instruction fetch, and wherein data accesses access the memory regions storing the unmodified code.

8. The computer program product of claim 1, wherein based on the transferring, execution of the application is stopped until execution is resumed based on completion of the modifications.

9. The computer program product of claim 1, wherein based on the transferring, execution of the application continues.

10. A computer system for facilitating processing in a computing environment, said computer program product comprising:

a memory; and

a processor in communications with the memory, wherein the computer system is configured to perform a method, said method comprising;

executing, by the processor, an application;

determining that a defined event has occurred; and

based on determining that the defined event has occurred, transferring control to a component of the computing environment to perform one or more modifications to provide modified code of the application, wherein the application comprises the modified code and unmodified code, the modified code being stored in separate memory regions different from the memory regions storing the unmodified code, and wherein the transferring control comprises using an event based branch to transfer to an address specified by the processor based on occurrence of the defined event, the address corresponding to an instruction to be performed by the component to perform the one or more modifications.

11. The computer system of claim 10, wherein the method further comprises:

receiving control back at the processor from the component based on providing the modified code to continue executing the application; and

continuing to execute the application, wherein the continuing to execute the application comprises;

determining at a point in the application that modified code is to be executed;

based on determining that modified code is to be executed, fetching the modified code from memory using an address translation entry for instruction fetches, wherein a different address translation entry is used for data accesses; and

executing the modified code.

12. The computer system of claim 11, wherein the method further comprises receiving control back at the unmodified code, wherein the receiving control comprises using a target address register that specifies an address to which control in the unmodified code is to be transferred, the target address register being a register separate from registers used for application state.

13. The computer system of claim 10, wherein the method further comprises creating, by the component, the modified code, the creating comprising:

analyzing one or more statistics provided by a hardware performance monitor executing within the computing environment;

determining, based on the analyzing, that the application is to be modified; and

creating the modified code, based on the determining.

14. The computer system of claim 13, wherein the analyzing comprises obtaining information from the hardware performance monitor to determine a hot region in the application and creating the modified code based on the obtained information.

15. The computer system of claim 13, wherein the analyzing further comprises obtaining and analyzing information from a branch history rolling buffer related to one or more branches that have been taken in the application.

16. The computer system of claim 10, wherein based on the transferring, execution of the application is stopped until execution is resumed based on completion of the modifications.

17. The computer system of claim 10, wherein based on the transferring, execution of the application continues.

18-20. -20. (canceled)