Converting intermediate code to assembly code using declarative machine descriptions

Authors:
João Dias;Norman Ramsey
Affiliations:
Division of Engineering and Applied Sciences, Harvard University;Division of Engineering and Applied Sciences, Harvard University
Venue:
CC'06 Proceedings of the 15th international conference on Compiler Construction
Year:
2006

Citing 14
Cited 3

Code selection through object code optimization

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
An improvement to bottom-up tree pattern matching

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
MIPS RISC architectures

MIPS RISC architectures
BURG: fast optimal instruction selection and tree parsing

ACM SIGPLAN Notices
Simple and efficient BURS table generation

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Engineering a simple, efficient code-generator generator

ACM Letters on Programming Languages and Systems (LOPLAS)
The advantages of machine-dependent global optimization

Proceedings of the international conference on Programming languages and system architectures
Automatic checking of instruction specifications

ICSE '97 Proceedings of the 19th international conference on Software engineering
Specifying representations of machine instructions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Pattern Matching in Trees

Journal of the ACM (JACM)
A new method for compiler code generation

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Machine Descriptions to Build Tools for Embedded Systems

LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
When Do Match-compilation Heuristics Matter?

When Do Match-compilation Heuristics Matter?
C Compiler Retargeting Based on Instruction Semantics Models

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2

Generalized instruction selection using SSA-graphs

Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Automatically generating instruction selectors using declarative machine descriptions

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resourceable, retargetable, modular instruction selection using a machine-independent, type-based tiling of low-level intermediate code

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Writing an optimizing back end is expensive, in part because it requires mastery of both a target machine and a compiler's internals. We separate these concerns by isolating target-machine knowledge in declarative machine descriptions. We then analyze these descriptions to automatically generate machine-specific components of the back end. In this work, we generate a recognizer; this component, which identifies register transfers that correspond to target-machine instructions, plays a key role in instruction selection in such compilers as vpo, gcc and Quick C–. We present analyses and transformations that address the major challenge in generating a recognizer: accounting for compile-time abstractions not present in a machine description, including variables, pseudo-registers, stack slots, and labels.