초록 ▼

Scheduling instructions by eliminating COPY instructions to reduce code size and increase performance in a computer program compiler. According to one embodiment of the present invention COPY instructions are coalesced prior to preparing a ready list. The ready list is polled and instructions select

Scheduling instructions by eliminating COPY instructions to reduce code size and increase performance in a computer program compiler. According to one embodiment of the present invention COPY instructions are coalesced prior to preparing a ready list. The ready list is polled and instructions selected for scheduling. After selection of a next instruction, liveness conflicts are determined, where a live register contains a valid value that is needed at a later step. Conflicts are then resolved and instruction scheduling continues. The process is continued until the ready list is empty.

대표청구항 ▼

[ What is claimed is:] [1.] A method for scheduling instructions for a first portion of a computer program, the first portion of the computer program having a plurality of instructions, the first portion of the computer program having a first code size, the method comprising the steps of:(a) buildin

[ What is claimed is:] [1.] A method for scheduling instructions for a first portion of a computer program, the first portion of the computer program having a plurality of instructions, the first portion of the computer program having a first code size, the method comprising the steps of:(a) building a def-use chain for the portion of the computer program, wherein the def-use chain defines an input arc and an output arc for each COPY instruction;(b) coalescing a first COPY instruction, where the first COPY instruction is part of the portion of the computer program, wherein coalescing the first COPY instruction combines the input and output arcs of the first COPY instruction;(c) listing a first subset of the first portion in a ready list, the ready list for listing instructions available for scheduling;(d) selecting a next instruction from the first subset listed in the ready list;(e) determining if the next instruction has at least one liveness conflict;(f) resolving the at least one liveness conflict, if the next instruction has at least one liveness conflict;(g) scheduling the next instruction; and(h) updating the ready list after completing step (g).