Code selection through object code optimization
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Affix grammar driven code generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for pattern matching
Software—Practice & Experience
A retargetable instruction reorganizer
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Automatic inference and fast interpretation of peephole optimization rules
Software—Practice & Experience
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Step engineering: step development system
ACM SIGMICRO Newsletter
Bit slice software: user retargetable microcode tools
ACM SIGMICRO Newsletter
Microcode compaction with timing constraints
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Phase coupling for horizontal microcode generation
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Some Aspects of High-Level Microprogramming
ACM Computing Surveys (CSUR)
Retargetable Compiler Code Generation
ACM Computing Surveys (CSUR)
JRS: integrated design automation system (IDAS)
ACM SIGMICRO Newsletter
Automatic generation of peephole optimizations
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Compaction with General Synchronous Timing
IEEE Transactions on Software Engineering
A machine independent approach to the production of optimized horizontal microcode.
A machine independent approach to the production of optimized horizontal microcode.
Register allocation in optimizing compilers
Register allocation in optimizing compilers
Local code generation and compaction in optimizing microcode compilers
Local code generation and compaction in optimizing microcode compilers
A critical analysis of the global optimization problem for horizontal microcode (phase-coupled, compaction, code motion, compilation)
| Hi-index | 0.00 |
The term peephole optimization is used to mean the pattern matching and conditional replacement performed on small sections of the intermediate form.The circular dependence between the code generation phases implies that local optimals are rarely global optimals. There are several reactions: (1) accept the local optimal, (2) develop intermediate goals whose achievement suggest global optimality, (3) retain the choices so that the decisions can be made later, (4) optimize the object code by replacing awkward or overly constrained segments of code with improved ones. Optimizing the object code has several advantages. First, code generation is greatly simplified. The code generator is allowed to forgo case analysis and utilize only a subset of the machine's instructions and addressing modes [BD88,DF84a,DF84b,DF87]. Second, a phase ordering problem often encountered in optimizations is reduced.