1.Previous
3.Next

in the reverse graph of the control-flow graph (CFG). Thus, one way of constructing them, would be to construct the post-dominance frontier of the CFG, and then reversing it to obtain a control dependence graph.

The following is a pseudo-code for constructing the post-dominance frontier:

for each X in a bottom-up traversal of the post-dominator tree do: PostDominanceFrontier(X) <- ? for each Y ? Predecessors(X) do: if immediatePostDominator(Y) != X: then PostDominanceFrontier(X) <- PostDominanceFrontier(X) ? {Y} done for each Z ? Children(X) do: for each Y ? PostDominanceFrontier(Z) do: if immediatePostDominator(Y) != X: then PostDominanceFrontier(X) <- PostDominanceFrontier(X) ? {Y} done done done

1.Previous
3.Next