초록 ▼

A method for improving the quality of code generated by a compiler in terms of execution time, object code space, or both. The method is applicable to computers that have a redundancy of instructions, in that the same operation exists in forms that operate between registers, between main storage loc

A method for improving the quality of code generated by a compiler in terms of execution time, object code space, or both. The method is applicable to computers that have a redundancy of instructions, in that the same operation exists in forms that operate between registers, between main storage locations, and between registers and main storage. The method selects the best form of each such instruction to use, for the context in which the instruction lies.

대표청구항 ▼

A method for use in an optimizing compiler for generating code for subsequent machine execution which is more efficient in terms of storage references, said method comprising, first generating intermediate code that completely avoids the SR, RS and SS instructions for arithmetic-like data, said code

A method for use in an optimizing compiler for generating code for subsequent machine execution which is more efficient in terms of storage references, said method comprising, first generating intermediate code that completely avoids the SR, RS and SS instructions for arithmetic-like data, said code referring to main memory only via “load”and “store”instructions, and wherein all computations are done in registers (register ops) using symbolic RR instructions, optimizing the program by standard techniques including commoning, code motion out of loops, strength reduction, dead code elimination, and locating predetermined patterns in the code, comprising a ‘load’op followed by a ‘register’op or a ‘store’op referring to the same object(s) and replacing these patterns with a shorter instruction sequence of SR, RS or SS instructions if said predetermined patterns exist.