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 |
Recap from last time We were trying to do Common Subexpression Elimination Compute expressions that are available at each program point.
Course project presentations No midterm project presentation Instead of classes, next week I’ll meet with each group individually, 30 mins each Two time.
Loop invariant detection using SSA An expression is invariant in a loop L iff: (base cases) –it’s a constant –it’s a variable use, all of whose single.
Course project presentations Midterm project presentation Originally scheduled for Tuesday Nov 4 th Can move to Th Nov 6 th or Th Nov 13 th.
Example in SSA
