# 06 - Program Representation Dominator Relationships Last...

This preview shows pages 1–3. Sign up to view the full content.

Program Representation Last Time Live variable analysis Constant propagation leads us to SSA and how to connect uses and def Today Finish constants Goal: understand control ±ow more deeply to build SSA Dominator relationships DOM, IDOM, DOM - 1 , DOM!, post-dominators Control Dependence CS 380C Lecture 6 1 Program Representation Dominator Relationships Dominators x dominates y , x DOM y ,ina CFG if paths from Entry to y include x . DOM ( v ) = the set of all vertices that dominate v . All vertices dominate themselves, v DOM ( v ) . Entry dominates every vertex in the graph, v Entry DOM ( v ) . DOM is re±exive, antisymmetric, and transitive. Strict Dominators DOM! ( v ) =DOM ( v ) - { v } , strictly dominates v antisymmetric and transitive Immediate Dominator IDOM ( v ) = the closest, strict dominator of v . d IDOM v if d DOM! v and ( w w DOM! v ) [ w DOM d ] antisymmetric CS 380C Lecture 6 2 Program Representation

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Dominator Example B CD E F A - entry G - exit v DOM ( v ) DOM! (Strict) IDOM(v) A B C D E F G CS 380C Lecture 6 3
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/09/2012 for the course CS 380 taught by Professor Shmat during the Fall '08 term at University of Texas at Austin.

### Page1 / 8

06 - Program Representation Dominator Relationships Last...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online