Static Single Assignment Form in the COINS Compiler Infrastructure
Masataka Sassa, Toshiharu Nakaya, Masaki Kohama, Takeaki Fukuoka, Masahito Takahashi · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 2003
Static single assignment (SSA) form is a program representation that is becoming increasingly popular in language processors. In SSA form, each use of a variable has a single definition point. This property facilitates program analysis and optimization in compilers. We give some preliminary results concerning the SSA form in COINS, which is a compiler infrastructure recently developed by Japanese institutions. In this paper we present (i) the current status of optimization using SSA form in COINS infrastructure, (ii) a comparison of two major algorithms for translating from normal intermediate form into SSA form, and (iii) a comparison of two major algorithms for translating back from SSA form into normal intermediate form. In this paper, we give some preliminary results concerning the SSA form in COINS. We present (i) the current status of optimization using SSA form in the COINS infrastructure, (ii) a comparison of two major algorithms for translating from normal (conventional) intermediate form into SSA form, and (iii) a comparison of two major algorithms for translating back from SSA form into normal intermediate form. A characteristic feature of the SSA module in COINS is that it provides optimization in SSA form and related utility modules as an infrastructure. This makes it easier for the compiler writer to compare and evaluate various optimization methods and to add new optimization methods and translation utilities in SSA form.