Article

Free access

Automatic generation of peephole optimizations

Authors:

Jack W. Davidson,

Christopher W. FraserAuthors Info & Claims

SIGPLAN '84: Proceedings of the 1984 SIGPLAN symposium on Compiler construction

Pages 111 - 116

https://doi.org/10.1145/502874.502885

Published: 01 June 1984 Publication History

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]

J. T. Bagwell, Jr., Local Optimizations, SIGPLANNotices 5, 7 (July 1970), 52-66.

Digital Library

[2]

T. Crowley, Combining Table-driven Effect Selection and Description-Driven Peephole Optimization for Automatic Code Generation, MS thesis, MIT, September 1982.

[3]

J. W. Davidson and C. W. Fraser, The Design and Application of a Retargetable Peephole Optimizer, A CM Trans. Prog. Lang. and Systems 2, 2 (April 1980), 191-202.

Digital Library

[4]

J. W. Davidson, Simplifying Code Generation Through Peephole Optimization, PhD dissertation, University of Arizona, December 1981.

Digital Library

[5]

J. W. Davidson and C. W. Fraser, Code Selection Through Object Code Optimization, A CM Trans. Prog. Lang. and Systems, to appear.

Digital Library

[6]

M. Ganapathi, C. N. Fischer and J. L. Hennessy, Retargetable Compiler Code Generation, Computing Surveys 14, 4 (December 1982), 573-592.

Digital Library

[7]

R. Giegerich, A Formal Framework for the Derivation of Machine-Specific Optimizers, A CM Trans. Prog. Lang. and Systems 5, 3 (July 1983), 478-498.

Digital Library

[8]

D.R. Hanson, The Y Programming Language, SIG PLAN Notices 16, 2 ( Feb. 1981), 59-68.

Digital Library

[9]

W. Harrison, A New Strategy for Code Generation - The General Purpose Optimizing Compiler, Conf. Rec. 4th ACM Syrup. on Prin. of Programming Languages, January 1977, 29-37.

Digital Library

[10]

S.C. Johnson, A Portable Compiler: Theory and Practice, Conf. Rec. 5th A CM Syrup. on Prin. of Programming Languages, Jan. 1978, 97-104.

Digital Library

[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, Comm. ACMS, 7 (July 1965), 443-444.

Digital Library

[16]

A.S. Tanenbaum, H. van Staveren and J. W. Stevenson, Using Peephole Optimization on Intermediate Code, A CM Trans. Prog. Lang. and Systems 4, I (January 1982), 21-36.

Digital Library

[17]

W. Wulf, R. K. Johnsson, C. B. Weinstock, S. O. Hobbs and C. M. Geschke, The Design of an Optimizing Compiler, North Holland, 1975.

Digital Library

Cited By

Mukherjee MRegehr J(2024)Hydra: Generalizing Peephole Optimizations with Program SynthesisProceedings of the ACM on Programming Languages10.1145/36498378:OOPSLA1(725-753)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649837
Lopes NMenendez DNagarakatte SRegehr J(2018)Practical verification of peephole optimizations with AliveCommunications of the ACM10.1145/316606461:2(84-91)Online publication date: 23-Jan-2018
https://dl.acm.org/doi/10.1145/3166064
Watson DWatson D(2017)Code GenerationA Practical Approach to Compiler Construction10.1007/978-3-319-52789-5_8(205-234)Online publication date: 23-Mar-2017
https://doi.org/10.1007/978-3-319-52789-5_8
Show More Cited By

Automatic generation of peephole optimizations
1. Applied computing
  1. Enterprise computing
2. Software and its engineering
  1. Software notations and tools

Recommendations

Automatic generation of peephole optimizations
20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection

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 ...
Automatic generation of peephole optimizations
Proceedings of the SIGPLAN '84 symposium on compiler construction

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 ...
Automatic generation of peephole superoptimizers
Proceedings of the 2006 ASPLOS Conference

Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at exploiting all opportunities for optimization. We explore fully automatic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGPLAN '84: Proceedings of the 1984 SIGPLAN symposium on Compiler construction

June 1984

328 pages

ISBN:0897911393

DOI:10.1145/502874

General Chair:
Mary Van Deusen
IBM
,
Program Chair:
Susan L. Graham
University of California, Berkeley

ACM SIGPLAN Notices Volume 19, Issue 6
Proceedings of the SIGPLAN '84 symposium on compiler construction
June 1984
318 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/502949
Issue’s Table of Contents

Copyright © 1984 Authors.

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
930
Total Downloads

Downloads (Last 12 months)183
Downloads (Last 6 weeks)18

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mukherjee MRegehr J(2024)Hydra: Generalizing Peephole Optimizations with Program SynthesisProceedings of the ACM on Programming Languages10.1145/36498378:OOPSLA1(725-753)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649837
Lopes NMenendez DNagarakatte SRegehr J(2018)Practical verification of peephole optimizations with AliveCommunications of the ACM10.1145/316606461:2(84-91)Online publication date: 23-Jan-2018
https://dl.acm.org/doi/10.1145/3166064
Watson DWatson D(2017)Code GenerationA Practical Approach to Compiler Construction10.1007/978-3-319-52789-5_8(205-234)Online publication date: 23-Mar-2017
https://doi.org/10.1007/978-3-319-52789-5_8
Lopes NMenendez DNagarakatte SRegehr J(2015)Provably correct peephole optimizations with aliveACM SIGPLAN Notices10.1145/2813885.273796550:6(22-32)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737965
Lopes NMenendez DNagarakatte SRegehr JGrove DBlackburn S(2015)Provably correct peephole optimizations with aliveProceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2737924.2737965(22-32)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2737924.2737965
Paleri V(2010)Automatic Generation of Code Optimizers from Formal SpecificationsThe Compiler Design Handbook10.1201/9781420040579.ch2Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch2
Du WTeng ZWang R(2007)SEEDACM SIGCSE Bulletin10.1145/1227504.122747439:1(486-490)Online publication date: 7-Mar-2007
https://dl.acm.org/doi/10.1145/1227504.1227474
Wong KWolf TGorinsky STurner J(2007)Teaching experiences with a virtual network laboratoryACM SIGCSE Bulletin10.1145/1227504.122747339:1(481-485)Online publication date: 7-Mar-2007
https://dl.acm.org/doi/10.1145/1227504.1227473
Lincke S(2007)Network security auditing as a community-based learning projectACM SIGCSE Bulletin10.1145/1227504.122747239:1(476-480)Online publication date: 7-Mar-2007
https://dl.acm.org/doi/10.1145/1227504.1227472
Chase JOakes ERamsey S(2007)Using live projects without painACM SIGCSE Bulletin10.1145/1227504.122746839:1(469-473)Online publication date: 7-Mar-2007
https://dl.acm.org/doi/10.1145/1227504.1227468
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents