lecture-10 program representation continued and Interprocedural Analysis

Lecture-10 program representation continued and Interprocedural Analysis

Info iconThis preview shows pages 1–3. 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 DocumentRight 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
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Lecture-10 program representation continued and Interprocedural Analysis

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online