2.2 Choosing Φ-function Operands................... 3.pdfVIP

Interpreting Programs in Static Single Assignment Form Jeffery von Ronne Ning Wang Michael Franz Technical Report 03-12 School of Information and Computer Science University of California, Irvine, CA 92697-3425 April 2, 2003 Abstract Static Single Assignment Form is a common intermediate representation for optimizing compilers but several of its features are difficult to implement in a traditional imperative interpreter. An interpreter for Static Single Assignment would enable mixed-mode (interpreting and compiling) virtual machines to be developed around program representations in Static Single Assignment Form. We propose an extension to Static Single Assignment Form, Interpretable Static Single Assignment (ISSA). Each of Interpretable Static Single Assignment’s instructions, including the phi instruction, has self-contained operational semantics. In addition, we describe a prototype interpreter of Interpretable Static Single Assignment and report on its performance. Contents 1 Introduction 1 2 Interpretable SSA Form 1 2.1 Unique Naming . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Choosing Φ-function Operands . . . . . . . . . . . . . . . . . . . 3 2.3 Simultaneous Execution of Φ-functions . . . . . . . . . . . . . . 5 2.4 Arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3 Discussion