Claims
- 1. A method of object code generation comprising the steps of:
- generating initial program code comprising successive data processing instructions;
- detecting groups of logically adjacent instructions within said initial program code which can be replaced by single instructions; and
- replacing each detected group of instructions by a respective single instruction.
- 2. A method according to claim 1, in which:
- each instruction of a detected group of instructions is a binary shift instruction; and
- the respective single instruction for that group of instructions is a bit shift instruction.
- 3. A method according to claim 1, in which:
- a detected group of instructions comprises a multiplication instruction logically adjacent to an addition instruction; and
- the respective single instruction for that group of instructions comprises a multiply-add instruction.
- 4. A method according to claim 2, in which:
- a detected group of instructions comprises a multiplication instruction logically adjacent to an addition instruction; and
- the respective single instruction for that group of instructions comprises a multiply-add instruction.
Priority Claims (1)
Number |
Date |
Country |
Kind |
9506590 |
Mar 1995 |
GBX |
|
Parent Case Info
Divisional of prior application Ser. No. 08/611,081, filed Mar. 5, 1996.
US Referenced Citations (3)
Divisions (1)
|
Number |
Date |
Country |
Parent |
611081 |
Mar 1996 |
|