Method and apparatus for profile-based reordering of program portions in a computer program

• US 5,950,009 A
• Filed: 03/10/1997
• Issued: 09/07/1999
• Est. Priority Date: 03/10/1997
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bortnikov, Vita, Schmidt, William Jon, Mendelson, Bilha, Shavit-Lottem, Inbal, Novick, Mark
• Primary Examiner(s): Hafiz, Tariq R.
• Assistant Examiner(s): DAM, TUAN QUANG
• Application Number:
  US08/814,527
• Time in Patent Office: 911 Days
• Field of Search: 395/709, 395/704, 395/183.14, 395/183.01, 395/390, 395/392, 395/380, 395/588, 395/580, 714/38, 714/37, 714/35, 712/214, 712/241, 712/233, 712/216, 712/204
• US Class Current: 717/158
• CPC Class Codes: G06F 8/445 Exploiting fine grain parallelism, i.e. parallelism at instruction level run-time instruction scheduling G06F9/3836

Abstract

An apparatus and several methods provide for a more optimized computer program that will have a faster execution time than was possible using the prior art reordering technique that adds to a trace until it finds no more predecessors or successors to add. The apparatus and methods disclosed herein use a variety of methods to reorder the program portions in a more intelligent manner that will improve its run-time performance. Each of these methods involves constructing traces in the control flow graph of the computer program. In a first embodiment, a basic block is only added to a trace if it is not negligible within predetermined limits. This negligibility test results in traces that are not extended for infrequently executed basic blocks. In a second embodiment, a basic block is only added to a trace if it is a perfect partner with the last basic block added to the trace. The concept of a "perfect partner" helps to match basic blocks together in a trace that have the greatest affinity for each other. In a third embodiment, a basic block is only added to a trace if it satisfies "should follow" flags and predetermined negligibility criteria. The "should follow" flags and negligibility criteria provide a complex criteria for adding basic blocks to a trace, criteria that create more efficient code in some specific circumstances.

Claims

1. An apparatus comprising:

at least one processor;

a memory coupled to the at least one processor;

a computer program residing in the memory comprising a plurality of portions joined by a plurality of program paths;

profile data residing in the memory representing the execution frequency of at least one of the plurality of program paths within the computer program;

a reordering mechanism residing in the memory and executed by the at least one processor for determining an order for the plurality of portions of the computer program by constructing a plurality of traces, each trace comprising a possible execution path along the plurality of program paths through at least one of the plurality of portions, the reordering mechanism placing the at least one portion in the trace in an order determined by (1) the profile data and (2) at least one reordering method that does not necessarily add to the trace any predecessor portion to the at least one portion in the trace when at least one predecessor portion exists, and that does not necessarily add to the trace any successor portion to the at least one portion in the trace when at least one successor portion exists.

2. The apparatus of claim 1 wherein the reordering mechanism orders the plurality of traces, the reordering mechanism determining the order for the plurality of portions of the computer program from the order of creation of the plurality of traces and the order of the plurality of portions within the plurality of traces.

3. The apparatus of claim 1 wherein each of the plurality of portions of the computer program comprises a basic block.

4. A method for improving execution speed of a computer program on a computer apparatus by reordering a plurality of program portions in a computer program, the method comprising the step of:

constructing a plurality of traces, each trace comprising at least one of the plurality of portions, the step of constructing each trace comprising the steps of;

adding a portion to the trace in an order determined by;

(1) profile data; and

(2) at least one reordering method that does not necessarily add to the trace any predecessor portion to the at least one portion in the trace when at least one predecessor portion exists, and that does not necessarily add to the trace any successor portion to the at least one portion in the trace when at least one successor portion exists;

ordering the plurality of traces according to their order of creation; and

reordering the plurality of portions of the computer program from the order of the plurality of traces and the order of the plurality of portions within the plurality of traces.

5. The method of claim 4 wherein the at least one reordering method comprises the steps of adding predecessor and successor portions to the trace if they are negligible within predetermined limits compared to at least one of the portions in the trace.

6. The method of claim 4 wherein the at least one reordering method comprises not adding a candidate portion to the trace unless the candidate portion is a perfect partner with at least one of the portions in the trace.

7. The method of claim 4 wherein the at least one reordering method comprises not adding an unreordered successor portion to the trace if the unreordered successor portion should follow a portion of the computer program that is different than a portion of the computer program in the trace that identifies the unreordered successor portion as a candidate for reordering and that precedes the unreordered successor portion.

8. The method of claim 7 wherein the unreordered successor portion should follow a portion of the computer program that is different than the portion of the computer program in the trace if the unreordered successor portion is not negligible within predetermined limits compared to the different portion.

9. The method of claim 4 wherein the at least one reordering method comprises not adding an unreordered successor portion to the trace if the portion of the computer program in the trace that identifies the unreordered successor portion as a candidate for reordering and that precedes the unreordered successor portion has a different portion that should follow the portion in the trace, and the different portion is not negligible within predetermined limits compared to the portion in the trace.

10. The method of claim 4 wherein the at least one reordering method does not add an unreordered predecessor portion to the trace if the portion in the trace that identifies the unreordered predecessor as a candidate for reordering and that succeeds the unreordered predecessor portion should follow a different portion of the computer program.

11. The method of claim 10 wherein the different portion should follow the unreordered predecessor portion if the unreordered successor portion is not negligible within predetermined limits compared to the different portion.

12. The method of claim 4 wherein the at least one reordering method does not add an unreordered predecessor portion to the trace if a portion different from the portion in the trace that identifies the unreordered predecessor as a candidate for reordering and that succeeds the unreordered predecessor portion should follow the unreordered predecessor portion and is not negligible within predetermined limits compared to the unreordered predecessor portion.

13. A program product comprising:

(A) an optimizer, the optimizer reordering a plurality of program portions in a computer program according to profile data, the optimizer comprising;

a reordering mechanism for determining an order for the plurality of portions of the computer program by constructing a plurality of traces, each trace comprising a possible execution path along a plurality of program paths through at least one of the plurality of portions, the reordering mechanism placing the at least one portion in the trace in an order determined by (1) the profile data and (2) at least one reordering method that does not necessarily add to the trace any predecessor portion to the at least one portion in the trace when at least one predecessor portion exists, and that does not necessarily add to the trace any successor portion to the at least one portion in the trace when at least one successor portion exists; and

(B) signal bearing media bearing the optimizer.

14. The program product of claim 13 wherein the signal bearing media comprises recordable media.

15. The program product of claim 13 wherein the signal bearing media comprises transmission media.

16. The program product of claim 13 wherein each of the plurality of portions of the computer program comprises a basic block.

17. An apparatus comprising:

at least one processor;

a memory coupled to the at least one processor;

a computer program residing in the memory comprising a plurality of basic blocks joined by a plurality of program paths;

profile data residing in the memory representing the execution frequency of at least one of the plurality of program paths within the computer program;

a reordering mechanism residing in the memory and executed by the at least one processor for determining an order for the plurality of basic blocks of the computer program by constructing a plurality of traces, each trace comprising a possible execution path along the plurality of program paths through at least one of the plurality of basic blocks, the reordering mechanism placing the at least one basic block in the trace in an order determined by (1) the profile data and (2) at least one reordering method that does not necessarily add to the trace any predecessor basic block to the at least one basic block in the trace when at least one predecessor basic block exists, and that does not necessarily add to the trace any successor basic block to the at least one basic block in the trace when at least one successor basic block exists;

the reordering mechanism ordering the plurality of traces according to their order of creation;

the reordering mechanism determining the order for the plurality of basic blocks of the computer program from the order of the plurality of traces and the order of the plurality of basic blocks within the plurality of traces.

18. A method for improving execution speed of a computer program on a computer apparatus by reordering a plurality of basic blocks in a computer program, the method comprising the step of:

constructing a plurality of traces, each trace comprising at least one of the plurality of basic blocks, the step of constructing each trace comprising the steps of;

(A) adding a basic block to the trace in an order determined by;

(1) profile data; and

(2) at least one reordering method that does not necessarily add to the trace any predecessor basic block to the basic block in the trace when at least one predecessor basic block exists, and that does not necessarily add to the trace any successor basic block to the basic block in the trace when at least one successor basic block exists;

(B) ordering the plurality of traces according to their order of creation;

(C) reordering the plurality of basic blocks of the computer program from the order of the plurality of traces and the order of the plurality of basic blocks within the plurality of traces.

19. The method of claim 18 wherein the at least one reordering method comprises the steps of adding predecessor and successor basic blocks to the trace if they are negligible within predetermined limits compared to at least one of the basic blocks in the trace.

20. The method of claim 18 wherein the at least one reordering method comprises not adding a candidate basic block to the trace unless the candidate basic block is a perfect partner with at least one of the basic blocks in the trace.

21. The method of claim 18 wherein the at least one reordering method comprises not adding an unreordered successor basic block to the trace if the unreordered successor basic block should follow a basic block of the computer program that is different than a basic block of the computer program in the trace that identifies the unreordered successor basic block as a candidate for reordering and that precedes the unreordered successor basic block.

22. The method of claim 21 wherein the unreordered successor basic block should follow a basic block of the computer program that is different than the basic block in the trace if the unreordered successor basic block is not negligible within predetermined limits compared to the different basic block.

23. The method of claim 18 wherein the at least one reordering method comprises not adding an unreordered successor portion to the trace if the portion of the computer program in the trace that identifies the unreordered successor portion as a candidate for reordering and that precedes the unreordered successor portion has a different portion that should follow the portion in the trace, and the different portion is not negligible within predetermined limits compared to the portion in the trace.

24. The method of claim 18 wherein the at least one reordering method does not add an unreordered predecessor basic block to the trace if the basic block in the trace that identifies the unreordered predecessor basic block as a candidate for reordering and that succeeds the unreordered predecessor basic block should follow a different basic block of the computer program.

25. The method of claim 24 wherein the different basic block should follow the unreordered predecessor basic block if the unreordered successor basic block is not negligible within predetermined limits compared to the different basic block.

26. The method of claim 18 wherein the at least one reordering method does not add an unreordered predecessor portion to the trace if a portion different from the portion in the trace that identifies the unreordered predecessor as a candidate for reordering and that succeeds the unreordered predecessor portion should follow the unreordered predecessor portion and is not negligible within predetermined limits compared to the unreordered predecessor portion.