US 8,621,430 B2Granted

Method for code transformation supporting temporal abstraction of parameters

AssigneeInternational Business Machines Corporation

InventorsAharon Abadi, Jonathan Bnayahu, Ran Ettinger, Yishai Abraham Feldman

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method of code transformation supporting temporal abstraction of parameters is provided herein. The method includes the following stages: extracting a set of statements from an original code and further creating a residual code being the original code without the statements, wherein two or more of the extracted statements are not on a same loop in the original code; adding conditions from the original code to the extracted set of statements, such that the added conditions are sufficient to render the set of statements executable; adding statements from the original code to the residual code, such that the added statements are sufficient to render the residual code executable; and adding code portions and variables to the set of statements and the residual code, such that a passing of values between the enhanced set of statements and the residual code maintains a respective passing of values in the original code.

Claims21

Dependent claims

A method comprising:

extracting a set of statements from an original code, based on user selection, to yield an extracted set of statements and a residual code that includes portions of the original code, wherein two or more of the extracted statements are not on a same loop in the original code;
adding conditions from the original code to the extracted set of statements, to yield an enhanced set of statements, such that the added conditions are sufficient to render the enhanced set of statements executable while preserving semantics of the original code;
adding statements from the original code to the residual code, to yield an enhanced residual code, such that the added statements are sufficient to render the enhanced residual code executable while preserving semantics of the original code;
adding code portions and a stream of variables to the enhanced set of statements and to the enhanced residual code, such that the data flow between the enhanced set of statements and the enhanced residual code is defined by the data flow in the original code coupled with streaming of data based on the stream of variables;
generating a call to the set of statements from the enhanced residual code, the call for executing the enhanced set of statements;
and determining a location in the enhanced residual code for an insertion of the call to the enhanced set of statements, wherein at least one of:
the extracting, any of the adding, the generating, and the determining is carried out by at least one processor, wherein in the determining, the location is selected such that it satisfies all of:
(i) the location is contained in exactly a number of control cycles as a highest location in the original code that postdominates the set of statements;
(ii) the location is dominated by all sources of parameters to the enhanced extracted set of statement;
(iii) every path from the location to any of added enqueue operations pass through a lowest statement in the original code that dominates the set of statements;
and (iv) the location dominates each statements containing uninitialized variables in the residual code.

8 more elements

A system comprising:

an extractor configured to extract a set of statements from an original code, based on user selection, to yield an extracted set of statements and a residual code that includes portions of the original code, wherein two or more of the extracted statements are not on a same loop in the original code;
a statement enhancer configured to add conditions from the original code to the extracted set of statements, to yield an enhanced set of statements, such that the added conditions are sufficient to render the enhanced set of statements executable while preserving semantics of the original code;
a residual code enhancer configured to add statements from the original code to the residual code, to yield an enhanced residual code, such that the added statements are sufficient to render the residual code executable while preserving semantics of the original code;
a data flow enhancer configured to add code portions and a stream of variables to the enhanced set of statements and the enhanced residual code, such that the data flow between the enhanced set of statements and the enhanced residual code is defined by the data flow in the original code coupled with streaming of data based on the stream of variables;
a call generator for generating a call to the set of statements from the enhanced residual code, the call for executing the enhanced set of statements;
and a call locator configured to determine a location in the enhanced residual code for an insertion of the call to the enhanced set of statements, and, at least one processor programmed to operate the statements enhancer, the residual code enhancer, the data flow enhancer, the call generator, and the call locator, wherein the call locator is configured to determine the location such that it satisfies all of:
(i) the location is contained in exactly a number of control cycles as a highest location in the original code that postdominates the set of statements;
(ii) the location is dominated by all sources of parameters to the enhanced extracted set of statement;
(iii) every path from the location to any of added enqueue operations pass through a lowest statement in the original code that dominates the set of statements;
and (iv) the location dominates each statements containing uninitialized variables in the residual code.

7 more elements

A computer program product for code transformation supporting temporal abstraction of parameters, the computer program product comprising:

a non-transitory computer readable storage medium which is not a signal having computer readable program embodied therewith, the computer readable program comprising:
computer readable program code configured to extract a set of statements from an original code, based on user selection, to yield an extracted set of statements and a residual code that includes portions of the original code,
wherein two or more of the extracted statements are not on a same loop in the original code;
computer readable program code configured to add conditions from the original code to the extracted set of statements, to yield an enhanced set of statements, such that the added conditions are sufficient to render the enhanced set of statements executable while preserving semantics of the original code;
computer readable program code configured to add statements from the original code to the residual code, to yield an enhanced residual code, such that the added statements are sufficient to render the residual code executable while preserving semantics of the original code;
computer readable program code configured to add code portions and a stream of variables to the enhanced set of statements and the enhanced residual code, such that the data flow between the enhanced set of statements and the enhanced residual code is defined by the data flow in the original code coupled with streaming of data based on the stream of variables;
computer readable program code for generating a call to the set of statements from the enhanced residual code, the call for executing the enhanced set of statements;
and computer readable program configured to determine a location in the enhanced residual code for an insertion of the call to the enhanced set of statements comprising computer readable program code configured to determine the location such that it satisfies all of:
(i) the location is contained in exactly a number of control cycles as a highest location in the original code that postdominates the set of statements;
(ii) the location is dominated by all sources of parameters to the enhanced extracted set of statement;
(iii) every path from the location to any of added enqueue operations pass through a lowest statement in the original code that dominates the set of statements;
and (iv) the location dominates each statements containing uninitialized variables in the residual code.

9 more elements

Dependencies are inferred from the claim text.