Partitioning optimizations in an optimizing compiler

• US 5,193,190 A
• Filed: 06/26/1989
• Issued: 03/09/1993
• Est. Priority Date: 06/26/1989
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Janczyn, Joyce M., Markstein, Peter W.
• Primary Examiner(s): Clark, David L.
• Assistant Examiner(s): Fagan, Matthew C.
• Application Number:
  US07/371,487
• Time in Patent Office: 1,352 Days
• Field of Search: 364/200, 364/900, 364/DIG. 1, 364/DIG. 2, 395/700
• US Class Current: 717/156
• CPC Class Codes: G06F 8/443 Optimisation

Abstract

A computer program to be compiled is optimized prior to carrying out the final compilation. Subgraphs within the program are identified and examined for optimization beginning with the entire program as the largest subgraph. The number of entities in each subgraph which are relevant to each dimension of arrays used to represent data flow equations is determined. Next, the amount of memory required to contain the arrays is determined. If that memory requirement is within a predefined memory usage limit for the compilation, then a specified procedure of the compilation process is applied. If the memory requirement to contain the arrays exceeds the predefined memory usage limit for the compilation, the process is repeated for successively smaller subgraphs within the program in an attempt to find a subgraph to which the memory limits allow application of the specified procedure.

Claims

1. A method for operating a compiler program in a computer system, said computer system utilizing said compiler program to execute a specified procedure for improving an intermediate language version of a computer program under development, comprising the steps of:

a) developing a control flowgraph representing a largest strongly connected region in said program under development;

b) by examining code sequences in said strongly connected region, determining an amount of memory of said computer system required to perform said specified procedure to said strongly connected region;

c) comparing said amount of memory determined in step b) to a predetermined computer system memory usage limit to determine if said amount of memory determined in step b) exceeds said predetermined computer system memory usage limit, thereby denoting an incapability of said computer system of applying said specified procedure to said strongly connected region;

d) if said amount of memory determined in step b) does not exceed said predetermined limit, applying said specified procedure to said strongly connected region examined in step b);

otherwise

e) if said amount of memory determined in step b) exceeds said predetermined limit, executing steps b)-d) to a next largest previously unselected strongly connected region in said control flowgraph.

2. A method as claimed in claim 1, in which said specified procedure is for performing code motion in said intermediate language version of said development computer program.

3. A method as claimed in claim 1, in which said specified procedure is for performing store motion in said intermediate language version of said development computer program.

4. A method as claimed in claim 1, in which said specified procedure is for removing redundant code sequences in said intermediate language version of said development computer program.

5. A method as claimed in claim 1, in which said specified procedure is for removing useless code sequences in said intermediate language version of said development computer program.

6. A method as claimed in claim 1, in which said specified procedure is for simplifying expressions in said intermediate language version of said development computer program.

7. A method for operating a compiler program in a computer system, said computer system utilizing said compiler program to execute a specified procedure for improving an intermediate language version of a computer program under development, comprising the steps of:

a) developing a control flowgraph representing a largest strongly connected region in said program under development, said largest strongly connected region being a parent strongly connected region and including one or more nested strongly connected regions;

b) defining said largest strongly connected region as a first strongly connected region;

c) by examining code sequences in said first strongly connected region, determining an amount of memory of said computer system required to perform said specified procedure to said first strongly connected region;

d) comparing said amount of memory determined in step c) to a predetermined computer system memory usage limit to determine if said amount of memory determined in step c) is less than said predetermined computer system memory usage limit, thereby denoting a capability of said computer system of applying said specified procedure to said first strongly connected region;

e) if said amount of memory determined in step c) is less than said predetermined limit, applying said specified procedure to said first strongly connected region examined in step c) and determining if said first strongly connected region is nested within a first parent strongly connected region in said control flowgraph, and if so;

f) determining if said first strongly connected region is nested within a first parent strongly connected region in said control flowgraph, and if so;

f) defining said first parent strongly connected region as said first strongly connected region and repeating steps c)-e); and

g) if said amount of memory determined in step c) is greater than said predetermined limit, defining a next largest previously unselected strongly connected region in said control flowgraph as said first strongly connected region and repeating steps c)-f).