A simple graph-based intermediate representation
Authors:
Open Access
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 30 (3) , 35-49
Abstract
We present a graph-based intermediate representation (IR) with simple semantics and a low-memory-cost C++ implementation. The IR uses a directed graph with labeled vertices and ordered inputs but unordered outputs. Vertices are labeled with opcodes, edges are unlabeled. We represent the CFG and basic blocks with the same vertex and edge structures. Each opcode is defined by a C++ class that encapsulates opcode-specific data and behavior. We use inheritance to abstract common opcode behavior, allowing new opcodes to be easily defined from old ones. The resulting IR is simple, fast and easy to use.Keywords
This publication has 14 references indexed in Scilit:
- Global code motion/global value numbering1995
- Analysis of pointers and structures1990
- The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages1990
- Fast allocation and deallocation of memory based on object lifetimesSoftware: Practice and Experience, 1990
- The semantics of program dependence1989
- An efficient method of computing static single assignment form1989
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”ACM Transactions on Programming Languages and Systems, 1988
- Detecting equality of variables in programs1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Code selection through object code optimizationACM Transactions on Programming Languages and Systems, 1984