Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
204 words
A method of unrolling/optimizing a repetitive loop, in which a program compiler in a computer system unrolls and optimizes a repetitive loop instruction, comprising the steps of: (a) checking during compilation whether the number of times that a loop in an input source program is repeated is one of an even number or an odd number; (b) checking whether there are a definition and a reference which span the respective repetitions of the loop, if it is determined that the number of times of repetition is an even number in step (a); (c) unrolling an instruction string in the loop a plurality of times in response to the loop instruction, if it is determined that there are neither definition nor reference spanning repetitions of the loop in step (b); (d) updating an index value of the newly unrolled instruction string by a first calculation based on an initial value, a terminal value, and an incrementation values of the loop; (e) updating the terminal value of the loop by a second calculation based on the initial, terminal, and incrementation values of the loop; and (f) repeating steps (a)-(e) until the number of times that the loop is repeated is an odd number in step (a).
Claim 2
Independent Claim
204 words
A method of unrolling/optimizing a repetitive loop, in which a program compiler in a computer system unrolls and optimizes a repetitive loop instruction, comprising the steps of: (a) checking during compilation whether the number of times that a loop in an input source program is repeated is one of an even number or an odd number; (b) checking whether there are a definition and a reference which span the respective repetitions of the loop, if it is determined that the number of times of repetition is an even number in step (a); (c) unrolling an instruction string in the loop a plurality of times in response to the loop instruction, if it is determined that there are neither definition nor reference spanning repetitions of the loop in step (b); (d) updating an index value of the newly unrolled instruction string by a first calculation based on an initial value, a terminal value, and an incrementation values of the loop; (e) updating the terminal value of the loop by a second calculation based on the initial, terminal, and incrementation values of the loop; and (f) repeating steps (a)-(e) until the number of times that the loop is repeated is an odd number in step (a).
Claim 3
Dependent Claim
31 words
A method according to claim 1, wherein in response to the loop instruction in which neither definition nor reference are present, the instruction string in the loop is unrolled two times.
Claim 4
Dependent Claim
34 words
A method according to claim 1, wherein the index variable of the newly unrolled instruction string is updated according to the first calculation to become (the index variable+(the terminal value-the initial value+the incrementation value)/2).
Claim 5
Dependent Claim
29 words
A method according to claim 1, wherein the terminal value of the loop is updated according to the second calculation to become ((the terminal value+the initial value-the incrementation value)/2).
Claim 6
Dependent Claim
56 words
A method according to claim 1, wherein if it is determined that the number of times of repetition is not an even number, and if it is determined that there are definition and reference which span the respective repetitions of the loop, unrolling/optimizing of the loop is terminated, and control is transferred to normal compile processing.
Claim 7
Dependent Claim
72 words
A method according to claim 1, further comprising the steps of: receiving a source program from a source program file into the program compiler and checking whether the program satisfies predetermined conditions using a loop unrolling permission determining section; performing an unrolling operation of a loop which satisfies the predetermined conditions for optimization in a loop unrolling section; and outputting a resultant program as a target program to a target program file.