Compiling with partial copy propagation

Claim 3

The method of claim 1, further comprising: (e) locating a transition point in the computer procedure where the first copy statement becomes unavailable; and wherein the first copy statement is duplicated at a location in the computer procedure prior to the transition point.

Claim 4

The method of claim 1, further comprising: (e) locating a transition arc from a first basic block to a second basic block in the computer procedure, over which the first copy statement becomes unavailable; and wherein the first copy statement is duplicated at a location in the computer procedure prior to the second basic block.

Claim 5

The method of claim 3, further comprising: (f) determining whether the first basic block has more than one successor; wherein the first copy statement is duplicated at an end of the first basic block if the first basic block has only one successor.

Claim 6

The method of claim 3, further comprising: (f) determining whether the first basic block has more than one successor; and if so inserting a new basic block between the first basic block and the second basic block in the computer procedure; wherein, if the first basic block has more than one successor, the first copy statement is duplicated in the new basic block, otherwise, the first copy statement is duplicated at an end of the first basic block.

Claim 7

The method of claim 1, wherein (a) further comprises locating transitions in the computer procedure, at which the first copy statement becomes unavailable, and (b) through (d) are performed only if the transitions meet defined criteria.

Claim 8

The method of claim 1, wherein the used operand in the first copy statement is a constant.

Claim 11

The method of claim 8, further comprising, prior to the optimizing (a), generating an intermediate representation from a source code representation of the computer procedure.

Claim 12

The method of claim 8, wherein (a)(iii) further comprises locating a transition point in the computer procedure where the first copy statement becomes unavailable; and duplicating the first copy statement at a location in the computer procedure prior to the transition point.

Claim 13

The method of claim 8, wherein (a)(iii) further comprises locating a transition arc from a first basic block to a second basic block in the computer procedure, over which the first copy statement becomes unavailable; and duplicating the first copy statement at a location in the computer procedure prior to the second basic block.

Claim 14

The method of claim 8, wherein the used operand in the first copy statement is a constant.

Claim 15

A computer system for compiling a computer procedure into a machine-readable representation, the computer procedure including at least one copy statement that includes a defined operand and a used operand, the computer system comprising: (a) an optimizer that optimizes the computer procedure into an optimized representation, the optimizer including a copy statement eliminating module that (i) identifies whether the defined operand in a first copy statement in the computer procedure has an eligible use and an additional use that is not eligible, and (ii) if so, removes the first copy statement, replaces the used operand at the eligible use with the used operand in the first copy statement, and duplicates the first copy statement prior to each use that is not eligible; and (b) a machine-readable code generator that generates a machine-readable representation of the computer procedure from the optimized representation.

Claim 16

A computer system for compiling a computer procedure into a machine-readable representation, the computer procedure including at least one copy statement that includes a defined operand and a used operand, the computer system comprising: (a) an optimizer that optimizes the computer procedure into an optimized representation, the optimizer including a copy statement eliminating module that (i) identifies whether the defined operand in a first copy statement in the computer procedure has an eligible use and an additional use that is not eligible, and (ii) if so, removes the first copy statement, replaces the used operand at the eligible use with the used operand in the first copy statement, and duplicates the first copy statement prior to each use that is not eligible; and (b) a machine-readable code generator that generates a machine-readable representation of the computer procedure from the optimized representation.

Claim 17

The computer system of claim 13, further comprising a front end module that generates an intermediate representation from a source code representation of the computer procedure, wherein the optimizer operates on the intermediate representation of the computer procedure.

Claim 18

The computer system of claim 13, wherein the optimizer locates a transition point in the computer procedure where the first copy statement becomes unavailable; and duplicates the first copy statement at a location in the computer procedure prior to the transition point.

Claim 19

The computer system of claim 13, wherein the optimizer locates a transition arc from a first basic block to a second basic block in the computer procedure, over which the first copy statement becomes unavailable; and duplicates the first copy statement at a location in the computer procedure prior to the second basic block.

Claim 20

The computer system of claim 13, wherein the used operand in the first copy statement is a constant.

Claim 21

A program product, comprising: (a) a program configured to perform a method of compiling a first computer procedure into a second computer procedure, the first computer procedure including at least one copy statement that includes a defined operand and a used operand, the method comprising: (i) identifying whether a first copy statement in the intermediate representation has an eligible use in the first computer procedure and an additional use in the first computer procedure that is not eligible; and (ii) if (i) is true, removing the first copy statement, replacing the used operand at the eligible use with the used operand in the first copy statement, and duplicating the first copy statement prior to each use that is not eligible; and (b) a signal bearing media bearing the program.

Claim 22

A program product, comprising: (a) a program configured to perform a method of compiling a first computer procedure into a second computer procedure, the first computer procedure including at least one copy statement that includes a defined operand and a used operand, the method comprising: (i) identifying whether a first copy statement in the intermediate representation has an eligible use in the first computer procedure and an additional use in the first computer procedure that is not eligible; and (ii) if (i) is true, removing the first copy statement, replacing the used operand at the eligible use with the used operand in the first copy statement, and duplicating the first copy statement prior to each use that is not eligible; and (b) a signal bearing media bearing the program.

Claim 23

The program product of claim 18, wherein the method performed by the program further comprises locating a transition point in the computer procedure where the first copy statement becomes unavailable; and duplicating the first copy statement at a location in the computer procedure prior to the transition point.

Claim 24

The program product of claim 18, wherein the method performed by the program further comprises locating a transition arc from a first basic block to a second basic block in the computer procedure, over which the first copy statement becomes unavailable; and duplicating the first copy statement at a location in the computer procedure prior to the second basic block.

Claim 25

The program product of claim 18, wherein the signal bearing media is a transmission type media.

Claim 26

The program product of claim 18, wherein the signal bearing media is a recordable media.

Claim 27

The program product of claim 18, wherein the used operand in the first copy statement is a constant.