Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

Computer Engineering ›› 2006, Vol. 32 ›› Issue (1): 25-27.

• Degree Paper • Previous Articles     Next Articles

Multi-registers Operands Handle Based on Chain for Intermediate Representation Design

LIU Zhanglin1,2, SHI Xuelin1,2, FENG Xiaobing1,2, ZHANG Zhaoqing1,2   

  1. 1.Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080;2.Graduate School of Chinese Academy of Sciences, Beijing 100039
  • Online:2006-01-05 Published:2006-01-05

中间表示设计中基于链表的多寄存器操作数处理

刘章林1,2,石学林1,2,冯晓兵1,2,张兆庆1,2   

  1. 1. 中国科学院计算技术研究所体系结构室,北京 100080;2. 中国科学院研究生院,北京 100039

Abstract: This paper focuses on the design of intermediate representation and puts forward an intermediate representation for pair register based on chain. First, it analyzes the points that IR design should handle when adapts to pair registers. Then, it puts forward a chain-based IR when considering the demand of data flow analysis, instruction scheduling and register allocation. At last, an algorithm is given. Retarget is another important phase and the paper tries to figure out a common IR for the chips with multi-register operands.

Key words: Intermediate representation; Multi-register operands; Pair registers; Chain

摘要: 以简单但具有代表性的配对寄存器为例,分析了编译器中间表示设计中使用配对信息所需包含的要点。结合编译器中数据流分析,指令调度和寄存器分配的需求,进一步提出了一种基于链表结构的中间表示及构造算法。所提出的表示方法同时考虑到编译器的可移植性,以便于在不同编译器中实现。

关键词: 中间表示;多寄存器操作数;配对寄存器;链表