System and method for optimizing source code
AssigneeImec
InventorsMiguel Miranda, Francky Catthoor, Martin Janssen, Hugo De Man
Life of this patent
Estimating the term…
Abstract
One aspect of the invention includes a method of address expression optimization of source-level code. The source-level code describes the functionality of an application to be executed on a digital device. The method comprises first inputting first source-level code that describes the functionality of the application into optimization system. The optimization system then transforms the first source-level into a second source level that has fewer nonlinear operations than the first source-level code.
Claims42
A method of optimizing address expressions within source-level code, wherein the source-level code describes the functionality of an application to be executed on a digital device, the method comprising:
- inputting a first source-level code that describes the functionality of the application, the first source-level code comprising address computation code and a plurality of arrays with address expressions in at least one programming loop construct, wherein the address computation code or one of the address expressions has nonlinear operations;
- and
- transforming the first source-level code into a second source-level code that describes substantially the same functionality as the first source-level code, wherein the second source-level code has fewer nonlinear operations than the first source-level code, and wherein the second source level code has the same number of loop constructs as the first source-level code;
- and
- wherein the digital device comprises at least one programmable instruction set processor.
A system for address expression optimization of source-level code, wherein the source-level code describes the functionality of an application to be executed on a digital device, wherein the digital device comprises at least one programmable instruction set processor, the system comprising:
- means for inputting a first source-level code that describes the functionality of the application, the first source-level code comprising address computation code and a plurality of arrays with address expressions in at least one programming loop construct, wherein at least the address computation code or one of the address expressions has nonlinear operations;
- and
- means for transforming the first source-level code into a second source-level code that describes substantially the same functionality as the first source-level code, wherein the second source-level code has fewer nonlinear operations than the first source-level code,
- wherein the means for transforming comprises means for performing a linear induction analysis step on at least one piece wise linear address expression and wherein performing the induction analysis step comprises replacing the address expression with single pointer arithmetic and a single conditional, and
- wherein the second source level code has the same number of loop constructs as the first source-level code.
A system for address expression optimization of source-level code, wherein the source-level code describes the functionality of an application to be executed on a digital device, the system comprising:
- an optimizing system for receiving a first source-level code that describes the functionality of the application, wherein the first source-level code has nonlinear operations in at least one programming loop construct, and wherein the optimizing system transforms the first source-level code into a second source-level code that has fewer nonlinear operations than the first source-level code, and wherein the second source level code has the same number of loop constructs as the first source-level code, and wherein the digital device comprises at least one programmable instruction set processor,
- and wherein the optimizing system transforms the first source-level code by performing a linear induction analysis step on at least one piece wise linear address expression and wherein performing the induction analysis step comprises replacing the address expression with single pointer arithmetic and a single conditional.
Executable code that has been optimized by the method comprising:
- transforming first source-level code having at least one programming loop construct and an at least one non-linear address expression within the programming loop construct, the first source level code into a second source-level code that describes substantially the same functionality as the first source-level code, wherein the second source-level code has fewer nonlinear operations than the first source-level code, and wherein the second source-level code has the same number of loop constructs as the first source-level code and wherein the second source-level code has been compiled for subsequent execution on a programmable instruction set processor, and
- wherein transforming the first source-level code comprises performing a linear induction analysis step on at least one piece wise linear address expression and wherein performing the induction analysis step comprises replacing the address expression with single pointer arithmetic and a single conditional.
Dependencies are inferred from the claim text.