Automatic generation of peephole optimizations

ABSTRACT

This paper describes a system that automatically generates peephole optimizations. A general peephole optimizer driven by a machine description produces optimizations at compile-compile time for a fast, pattern-directed, compile-time optimizer. They form part of a compiler that simplifies retargeting by substituting peephole optimization for case analysis.

REFERENCES

• 1: John T. Bagwell, Jr., Local optimizations, ACM SIGPLAN Notices, v.5 n.7, p.52-66, July 1970
• 2: T. Crowley, Combining Table-driven Effect Selection and Description-Driven Peephole Optimization for Automatic Code Generation, MS thesis, MIT, September 1982.
• 3: Jack W. Davidson , Christopher W. Fraser, The Design and Application of a Retargetable Peephole Optimizer, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.2, p.191-202, April 1980 [doi>10.1145/357094.357098]
• 4: Jack Winfred Davidson, Simplifying code generation through peephole optimization, 1981
• 5: Jack W. Davidson , Christopher W. Fraser, Code selection through object code optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.4, p.505-526, Oct. 1984 [doi>10.1145/1780.1783]
• 6: Mahadevan Ganapathi , Charles N. Fischer , John L. Hennessy, Retargetable Compiler Code Generation, ACM Computing Surveys (CSUR), v.14 n.4, p.573-592, Dec. 1982 [doi>10.1145/356893.356897]
• 7: Robert Giegerich, A Formal Framework for the Derivation of Machine-Specific Optimizers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.3, p.478-498, July 1983 [doi>10.1145/2166.357219]
• 8: David R. Hanson, The Y programming language, ACM SIGPLAN Notices, v.16 n.2, p.59-68, February 1981 [doi>10.1145/954269.954278]
• 9: William Harrison, A new strategy for code generation: the general purpose optimizing compiler, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.29-37, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512954]
• 10: S. C. Johnson, A portable compiler: theory and practice, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-104, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512771]
• 11: P. B. Kessler, Machine Dependencies in Retargetable Compiler Construction, Dissertation proposal, Department of Electrical Engineering and Computer Science, University of California, Berkeley, May 1982.
• 12: R.R. Kessler, Peephole Optimization in COG, Operating Note 76, Utah Symbolic Computation Group, Computer Science Department, University of Utah, June 1983.
• 13: D.E. Knuth, An Empirical Study of Fortran Programs, Software--Practice & Experience 1, 2 (April-June 1971), 105-133.
• 14: D. A. Lamb, Construction of a Peephole Optimizer, Software--Practice & Experience 11(1981), 638-647.
• 15: W. M. McKeeman, Peephole optimization, Communications of the ACM, v.8 n.7, p.443-444, July 1965 [doi>10.1145/364995.365000]
• 16: Andrew S. Tanenbaum , Hans van Staveren , Johan W. Stevenson, Using Peephole Optimization on Intermediate Code, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.21-36, Jan. 1982 [doi>10.1145/357153.357155]
• 17: William Allan Wulf , Richard K. Johnsson , Charles B. Weinstock , Steven O. Hobbs , Charles M. Geschke, The Design of an Optimizing Compiler, Elsevier Science Inc., New York, NY, 1975