A SIMPLE GRAPH-BASED INTERMEDIATE REPRESENTATION

被引:1
作者
CLICK, C [1 ]
PALECZNY, M [1 ]
机构
[1] RICE UNIV,CITI,CRPC,HOUSTON,TX 77005
来源
SIGPLAN NOTICES | 1995年 / 30卷 / 03期
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a graph-based intermediate representation CIR) 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.
引用
收藏
页码:35 / 49
页数:15
相关论文
共 23 条
[1]  
ALPERN B, 1988, 15TH C REC ACM S PRI
[2]  
BALA V, 1994, COMMUNICATION DEC
[3]  
BALLANCE RA, 1990, P SIGPLAN 90 C PROGR
[4]  
BRIGGS P, 1993, CRPCTR93323 RIC U TE
[5]  
CARTWRIGHT R, 1989, JUN P SIGPLAN 89 C P
[6]  
CHASE D, 1990, JUN P SIGPLAN 90 C P
[7]  
CLICK C, UNPUB PLDI 95
[8]  
Click Clifford Noel, 1995, THESIS RICE U
[9]  
CYTRON R, 1989, 6TH C REC ACM S PRIN
[10]  
DAVIDSON JW, 1984, ACM T PROGR LANG SYS, V6, P505, DOI 10.1145/1780.1783