Method and system generating execution file system device

• US 8,566,813 B2
• Filed: 01/26/2010
• Issued: 10/22/2013
• Est. Priority Date: 03/03/2009
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Kwon, Ki-hyoun, Patil, Jaydeep subhash
• Primary Examiner(s): Dao, Thuy
• Assistant Examiner(s): Smith, Cheneca
• Application Number:
  US12/693,560
• Publication Number:
  US 20100229164A1
• Time in Patent Office: 1,365 Days
• Field of Search: None
• US Class Current: 717/162
• CPC Class Codes: G06F 8/443 Optimisation
• CPC Class Codes: G06F 8/4442 Reducing the number of cache misses; Data prefetching cache prefetching G06F12/0862
• CPC Class Codes: G06F 9/44557 Code layout in executable memory

Abstract

Provided is a method and system generating an execution file. The method includes determining number-of-calls information for a number of functions and then generating the execution file by locating the functions based on the number-of-calls information.

Claims

1. A method of generating an execution file for an application program comprising a plurality of functions, the method comprising:

determining a number-of-calls information value for each one of the plurality of respectively indicating a frequency with which each one of the plurality of is called by other functions in the plurality of functions; and

determining a size information value for each one of the plurality of functions;

generating a call degree for each one of the plurality of functions using the number-of-calls information values and the size information value; and

generating the execution file by locating in a first memory region of a memory, a sub-plurality of functions selected from the plurality of functions according to respective call degrees, wherein the first memory region is fully addressable by a single-word command, and the respective functions of the sub-plurality of functions are sequentially and consecutively located in the first memory region on a function by function basis beginning at a start address for the first memory region.

2. The method of claim 1, wherein determining the respective number-of-calls information for each one of the plurality of functions comprises, for each one of the plurality of functions equating as respective number-of-calls information, an actual number of calls made during execution of the application program.

3. The method of claim 1, wherein determining the respective number-of-calls information for each one of the plurality of functions comprises, for each one of the plurality of functions determining as respective number-of-calls information, an actual number of calls made during execution of the application program multiplied by at least one weighting factor.

4. The method of claim 1, further comprising:

determining size information for each one of the plurality of functions,

wherein the generating of the execution file is accomplished by locating in the first memory region each one of the plurality of functions according to its respective number-of-calls information and its size information.

5. A method of generating an execution file for an application program comprising a plurality of functions, the method comprising:

determining a number-of-calls information value for each one of the plurality of functions respectively indicating a frequency with which each one of the plurality of functions is called by other functions in the plurality of functions;

determining a size information value for each one of the plurality of functions;

generating a call degree for each one of the plurality of functions using the number-of-calls information value and the size information value; and

generating the execution file by locating in a first memory region of a memory a sub-plurality of functions selected from the plurality of functions according to respective call degrees, wherein the first memory region is fully addressable by a single-word command, and the respective functions of the sub-plurality of functions are sequentially and consecutively located in the first memory region on a function by function basis beginning at a start address for the first memory region.

6. The method of claim 5, wherein the call degree for each one of the sub-plurality of functions is defined as a ratio between its number-of-call information value and its size information value.

7. The method of claim 5, wherein the respective functions of the sub-plurality of functions have the highest respective call degrees.

8. The method of claim 5, wherein the respective functions of the sub-plurality of functions have the highest respective call degrees, except for at least one last included function of the sub-plurality of functions.

9. A method of generating an execution file for an application program comprising a plurality of functions, the method comprising:

determining respective number-of-calls information values and size information values for each one of the plurality of functions; and

generating the execution file by locating a sub-plurality of functions selected from the plurality of functions in a first memory region of a memory, wherein the first memory region is fully addressable by a single-word command and generating the execution file comprises;

(a) sequentially locating the sub-plurality of functions on a function by function basis beginning at a start address for the first memory region according to corresponding number-of-calls information values;

(b) upon sequentially locating functions selected from the plurality of functions sufficient to fill the first memory region according to corresponding number-of-calls values, identifying a last included function and a list of yet to be included functions;

(c) determining a remaining space value in the first memory region prior to locating the last included function;

(d) comparing size information for each one of the yet to be included functions with the remaining space value; and

(e) locating at least one of the yet to be included functions having size information less than the remaining space value in the first memory region before locating the last included function in the first memory value.

10. A system comprising:

a single level memory having a first memory region fully addressable by a single-word 2^N command and configured to store an execution file;

a linker configured to determine number-of-calls information values for each one of a plurality of functions in an application program, and generate the execution file by sequentially locating in the first memory region a sub-plurality of functions selected from the plurality of functions based on respective number-of-calls information values, wherein the linker is further configured to determine size information values for each one of the plurality of functions, and generate the execution file by sequentially locating in the first memory region each function in the sub-plurality of functions based on its respective number-of-calls information value and its respective size information value; and

a microprocessor configured to call at least one of the sub-plurality of functions located in the execution file using the single-word 2^N command.

11. The system of claim 10, further comprising:

a control register configured to store a start address for the execution file.