Ch8a
Example in SSA X := Y op Z in out F X := Y op Z (in) = in [ { X ! Y op Z } X := (Y,Z) in 0 out F X := (in 0, in 1 ) = (in 0 Å in 1 ) [ { X ! E |
Lecture 12 – Code Generation Eran Yahav 1 Reference: Dragon 8. MCD 4.2.4 yahave/tocs2011/compilers-lec12.pptx.
Cse322, Programming Languages and Compilers 1 6/15/2015 Lecture #12, May 15, 2007 Basic Blocks, Control flow graphs, Liveness using data flow, dataflow.
From last time: live variables Set D = 2 Vars Lattice: (D, v, ?, >, t, u ) = (2 Vars, µ, ;,Vars, [, Å ) x := y op z in out F x := y op z (out) = out –
1 Intermediate Code generation. 2 Intermediate Code Generation l Intermediate languages l Declarations l Expressions l Statements l Reference: »Chapter.
Recap Let’s do a recap of what we’ve seen so far Started with worklist algorithm for reaching definitions.
Recap from last time: live variables x := 5 y := x + 2 x := x + 1 y := x + 10... y...
Direction of analysis Although constraints are not directional, flow functions are All flow functions we have seen so far are in the forward direction.
Spring 2014Jim Hogg - UW - CSE - P501P-1 CSE P501 – Compiler Construction Register allocation constraints Local allocation Fast, but poorer code Global.
1 October 1, 2015 1 October 1, 2015October 1, 2015October 1, 2015 Azusa, CA Sheldon X. Liang Ph. D. Computer Science at Azusa Pacific University Azusa.
1 Intermediate Code Generation Part I Chapter 8 COP5621 Compiler Construction Copyright Robert van Engelen, Florida State University, 2007.
