Patent ID: 7877579

Claim:
A method of scheduling execution of an instruction in a processor having at least one cascaded delayed execution pipeline unit having four or more execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other, the method comprising: receiving an issue group of instructions; determining if at least one compare instruction is in the issue group, and if so, scheduling the at least one compare instruction in one of the four or more execution pipelines based upon a first prioritization scheme; determining if there is an issue conflict for one of the four or more execution pipelines; resolving the issue conflict by scheduling all but one of the at least one compare instruction causing the issue conflict in a different execution pipeline; and scheduling execution of the issue group of instructions in the cascaded delayed execution pipeline unit; wherein the first prioritization scheme prioritizes the compare instruction dealing with a compare branch instruction that is unpredictable and not end the chain as having a highest priority, the compare instruction dealing with a compare to zero instruction that is unpredictable and not end the chain as having a second highest priority, the compare instruction dealing with a compare branch instruction that is predictable and not end the chain as having a third highest priority, the compare instruction dealing with a compare to zero instruction that is predictable and not end the chain as having a fourth highest priority, the compare instruction dealing with a compare branch that is unpredictable and end the chain as having a fifth highest priority, the compare instruction dealing with a compare to zero instruction that is unpredictable and end the chain as having a sixth highest priority, the compare instruction dealing with a compare branch instruction that is predictable and end the chain as having a seventh highest priority, and the compare instruction dealing with a compare to zero instruction that is predictable and end the chain as having a lowest priority.