Article

Free access

Eliminating redundant object code

Authors:

Jack W. Davidson,

Christopher W. FraserAuthors Info & Claims

POPL '82: Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 128 - 132

https://doi.org/10.1145/582153.582167

Published: 25 January 1982 Publication History

PDF eReader

Abstract

Compilers usually eliminate common subexpressions in intermediate code, not object code. This reduces machine-dependence but misses the machine-dependent common subexpressions introduced by the last phases of code expansion. This paper describes a machine-independent procedure for eliminating machine-specific common subexpressions. It also identifies dead variables, defines windows for a companion peephole optimizer, and forms the basis of a retargetable register allocator. Its techniques for handling machine-specific data should generalize to other optimizations as well.

References

[1]

A. V. Aho and J. D. Ullman. Principles of Compiler Design. Addison-Wesley, 1977.

Digital Library

Google Scholar

[2]

C. G. Bell and A. Newell. Computer Structures: Readings and Examples. McGraw-Hill, 1971.

Digital Library

Google Scholar

[3]

R. G. G. Cattell. Automatic derivation of code generators from machine descriptions. ACM Transactions on Programming Languages and Systems 2(2):173--190, April 1980.

Digital Library

Google Scholar

[4]

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein. Register allocation via coloring. Computer Languages 6(1):47--57, January 1981.

Crossref

Google Scholar

[5]

J. W. Davidson and C. W. Fraser. The design and application of a retargetable peephole optimizer. ACM Transactions on Programming Languages and Systems 2(2):191--202, April 1980.

Digital Library

Google Scholar

[6]

R. A. Freiburghouse. Register allocation via usage counts. Communications of the ACM 17(11):638--642, November 1974.

Digital Library

Google Scholar

[7]

R. S. Glanville and S. L. Graham. A new method for compiler code generation. Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages:231--240, January 1978.

Digital Library

Google Scholar

[8]

D. Gries. Compiler Construction for Digital Computers. Wiley, 1971.

Digital Library

Google Scholar

[9]

D. R. Hanson. The Y programming language. SIGPLAN Notices 16(2):59--68, February 1981.

Digital Library

Google Scholar

[10]

B. W. Kernighan and D. M. Ritchie. The C Programming Language. Prentice-Hall, 1978.

Digital Library

Google Scholar

[11]

R. L. Sites. Machine-independent register allocation. SIGPLAN Notices 14(8):221--225, August 1979.

Digital Library

Google Scholar

[12]

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

Digital Library

Google Scholar

Cited By

View all

McMahon SScherson I(2007)Selection of Optimal Computing Platforms through the Suitability MeasureProceedings of the Sixth International Symposium on Parallel and Distributed Computing10.1109/ISPDC.2007.47Online publication date: 5-Jul-2007
https://dl.acm.org/doi/10.1109/ISPDC.2007.47
Hanson D(2006)Simple code optimizationsSoftware: Practice and Experience10.1002/spe.438013080813:8(745-763)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380130808
Davidson JFraser C(2004)Automatic generation of peephole optimizationsACM SIGPLAN Notices10.1145/989393.98940739:4(104-111)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989407
Show More Cited By

Eliminating redundant object code
1. Software and its engineering
  1. Software notations and tools

Recommendations

Tidy Up Your Source Code! Eliminating Wasteful Statements in Automatically Repaired Source Code
Product-Focused Software Process Improvement
Abstract
Automated program repair (APR) is a concept of automatically fixing bugs in source code to free developers from the burden of debugging. One of the issues facing search-based APR is that repaired code contains wasteful or meaningless statements ...
Speculative Code Compaction: Eliminating Dead Code via Speculative Microcode Transformations
MICRO '22: Proceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture

The computing landscape has been increasingly characterized by processor architectures with increasing core counts, while a majority of the software applications remain inherently sequential. Although state-of-the-art compilers feature sophisticated ...
Eliminating dynamic computation redundancy

Comments

Information & Contributors

Information

Published In

POPL '82: Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1982

378 pages

ISBN:0897910656

DOI:10.1145/582153

Conference Chair:
Richard DeMillo

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 January 1982

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

POPL '82 Paper Acceptance Rate 38 of 121 submissions, 31%;

Overall Acceptance Rate 860 of 4,328 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
324
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)6

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

McMahon SScherson I(2007)Selection of Optimal Computing Platforms through the Suitability MeasureProceedings of the Sixth International Symposium on Parallel and Distributed Computing10.1109/ISPDC.2007.47Online publication date: 5-Jul-2007
https://dl.acm.org/doi/10.1109/ISPDC.2007.47
Hanson D(2006)Simple code optimizationsSoftware: Practice and Experience10.1002/spe.438013080813:8(745-763)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380130808
Davidson JFraser C(2004)Automatic generation of peephole optimizationsACM SIGPLAN Notices10.1145/989393.98940739:4(104-111)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989407
Giegerich R(1988)Composition and evaluation of attribute coupled grammarsActa Informatica10.1007/BF0273710825:4(355-423)Online publication date: 1-May-1988
https://dl.acm.org/doi/10.1007/BF02737108
Acosta RKjelstrup JTorng H(1986)An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit ProcessorsIEEE Transactions on Computers10.1109/TC.1986.167684135:9(815-828)Online publication date: 1-Sep-1986
https://dl.acm.org/doi/10.1109/TC.1986.1676841
Kessler R(1984)PeepACM SIGPLAN Notices10.1145/502949.50288419:6(106-110)Online publication date: 1-Jun-1984
https://dl.acm.org/doi/10.1145/502949.502884
Kessler RVan Deusen MGraham S(1984)PeepProceedings of the 1984 SIGPLAN symposium on Compiler construction10.1145/502874.502884(106-110)Online publication date: 17-Jun-1984
https://dl.acm.org/doi/10.1145/502874.502884
Davidson JFraser C(1984)Code selection through object code optimizationACM Transactions on Programming Languages and Systems10.1145/1780.17836:4(505-526)Online publication date: 1-Oct-1984
https://dl.acm.org/doi/10.1145/1780.1783

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Recommendations

Tidy Up Your Source Code! Eliminating Wasteful Statements in Automatically Repaired Source Code

Speculative Code Compaction: Eliminating Dead Code via Speculative Microcode Transformations

Eliminating dynamic computation redundancy