Code optimization across interfaces

• US 8,214,813 B2
• Filed: 01/12/2007
• Issued: 07/03/2012
• Est. Priority Date: 01/12/2007
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Harris, Timothy, Isaacs, Rebecca, Koskinen, Eric, Mortier, Richard
• Primary Examiner(s): Kang, Insun
• Application Number:
  US11/622,796
• Publication Number:
  US 20080172662A1
• Time in Patent Office: 1,999 Days
• Field of Search: None
• US Class Current: 717/151
• CPC Class Codes: G06F 8/443 Optimisation

Abstract

A method of optimizing code which invokes methods on a system across an interface is described. High level information relating to the system is accessed and this information is used in performing code transformations in order to optimize the code.

Claims

1. A method comprising:

under control of a processor configured with computer-executable instructions, accessing code for optimization, the code for optimization including at least one method call associated with a fact in a system;

accessing interface code and abstract implementation data;

using the abstract implementation data to manipulate an abstract state, the abstract state including one or more facts representing the system called by the code for optimization across an interface associated with the interface code; and

performing code transformations on the code for optimization based at least in part on the abstract implementation data and at least one of the one or more facts included in the abstract state, wherein performing code transformations on the code for optimization comprises;

determining if the fact in the system is a known fact represented in the abstract state;

in an event the fact in the system is a known fact represented in the abstract state, retrieving the known fact while not issuing a call to the system across the interface; and

in an event the fact in the system is not a known fact represented in the abstract state, issuing a call to the system across the interface.

2. A method according to claim 1, wherein the interface code includes the abstract implementation data.

3. A method according to claim 1, wherein the abstract implementation data comprises at least one statement defining an effect of the at least one method call on the fact in the system.

4. A method according to claim 3, wherein the abstract implementation data further comprises a type definition for the fact.

5. A method according to claim 3, further comprising:

storing data relating to the fact; and

updating the stored data relating to the fact upon invocation of the at least one method call based on a corresponding statement.

6. A method according to claim 1, wherein performing code transformations on the code for optimization further comprises:

buffering a plurality of method calls that meet predefined criteria in a queue; and

performing the code transformations based at least in part on the abstract implementation data over the plurality of method calls in the queue.

7. A method according to claim 5, wherein performing code transformations on the code for optimization further comprises:

selecting the at least one method call from the code for optimization;

determining if the at least one method call meets predefined criteria;

if the predefined criteria are met, placing the at least one method call in a queue; and

if the predefined criteria are not met, issuing the at least one method call and any earlier method calls in the queue that do not have a commutative effect on the stored data relating to the fact.

8. A method according to claim 1, wherein the code transformations comprise generation of proxy code.

9. A method according to claim 1, wherein the code transformations comprise at least one of:

dead code elimination and common sub-expression elimination.

10. A method according to claim 1, wherein the system comprises a library.

11. A method according to claim 1, wherein the abstract state is a representation one or more data elements corresponding to an actual state of the system.

12. A method according to claim 1, wherein the abstract implementation data describes how the abstract state is affected by subsequent method calls initiated when performing the code transformations.

13. One or more device-readable media with device-executable instructions for performing operations comprising:

accessing code for optimization, the code for optimization including at least one method call associated with a fact in a system;

accessing interface code and abstract implementation data;

using the abstract implementation data to manipulate an abstract state, the abstract state maintaining one or more facts known to be true to the system called by the code for optimization across an interface associated with the interface code; and

performing code transformations on the code for optimization based at least in part on the abstract implementation data and at least one of the one or more facts maintained in the abstract state, wherein performing code transformations on the code for optimization comprises;

determining if the fact in the system is a known fact represented in the abstract state;

in an event the fact in the system is a known fact represented in the abstract state, retrieving the known fact while not issuing a call to the system across the interface; and

in an event the fact in the system is not a known fact represented in the abstract state, issuing a call to the system across the interface.

14. One or more device-readable media according to claim 13, wherein the interface code includes the abstract implementation data.

15. One or more device-readable media according to claim 13, wherein the abstract implementation data comprises at least one statement defining an effect of the at least one method call on the fact in the system.

16. One or more device-readable media according to claim 15, wherein the abstract implementation data further comprises a type definition for the fact.

17. A method comprising:

under control of a processor configured with computer-executable instructions,

identifying a plurality of method calls in computer program code which are available for invocation across an interface between an application and a system;

generating abstract implementation data and an abstract state such that invocation across the interface for one or more of the plurality of method calls is eliminated, wherein the abstract state represents one or more known data elements in the system;

identifying, in the abstract implementation data, at least one statement defining an effect of one of the plurality of method calls on a fact in the system;

determining if the fact in the system is a known data element represented in the abstract state;

in an event the fact in the system is a known data element represented in the abstract state, retrieving the known data element while not issuing a call to the system across the interface; and

in an event the fact in the system is absent as a known data element represented in the abstract state, issuing a call to the system across the interface.

18. A method according to claim 17, wherein the abstract implementation data maintains a type definition for the fact.