This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: • Option 2: insert copies between SSA vars and real vars Loopinvariant code motion 3 Example Detecting loop invariants Computing loop invariants Example using def/use chains Example using def/use chains Loop invariant detection using SSA 4 Example using SSA Example using SSA and preheader Code motion Example Lesson from example: domination restriction Domination restriction in for loops 5 Domination restriction in for loops Avoiding domination restriction Another example Data dependence restriction Avoiding data restriction More advanced control representations 6 More advanced control representations The above is Click’s solution (PLDI 95) The above is Click’s solution (PLDI 95) More advanced control representations • The Click algorithm shows the need to distinguish “dependance regions” • Next lecture we’ll see how to do this....
View
Full
Document
This note was uploaded on 02/19/2008 for the course CSE 231 taught by Professor Lerner during the Fall '06 term at UCSD.
 Fall '06
 Lerner

Click to edit the document details