{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecture-10 program representation continued and Interprocedural Analysis

Lecture-10 program representation continued and Interprocedural Analysis

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 From last class The above is Click’s solution (PLDI 95) The above is Click’s solution (PLDI 95) Control Dependences A node (basic block) Y is control-dependent on another X iff X determines whether Y executes there exists a path from X to Y s.t. every node in the path other than X and Y is post-dominated by Y X is not post-dominated by Y Control Dependences A node (basic block) Y is control-dependent on another X iff X determines whether Y executes there exists a path from X to Y s.t. every node in the path other than X and Y is post-dominated by Y X is not post-dominated by Y Example
Background image of page 1

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

View Full Document Right Arrow Icon
2 Example Control Dependence Graph Control dependence graph: Y decsendent of X iff Y is control dependent on Y label each child edge with required condition group all children with same condition under region node Program dependence graph: super-impose dataflow graph (in SSA form or not) on top of the control dependence graph Example Example Another example Another example
Background image of page 2
3
Background image of page 3

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

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}