Static single-assignment form: Difference between revisions

Revision as of 16:10, 21 April 2005

Revision as of 16:42, 21 April 2005

Line 67:

One algorithm for computing the dominance frontier set is

{{wikicode}}

for all nodes, b

if the number of predecessors of b >= 2

'''for each''' node b

for all predecessors, p, of b

'''if''' the number of predecessors of b >=≥ 2

runner = p

'''for each''' p '''in''' predecessors of b

while runner != doms(b)

add b to runner’s dominancerunner frontier:= setp

'''while''' runner =≠ doms(runnerb)

add b to runner’s dominance frontier set

runner := pdoms(runner)

There is an efficient algorithm for finding dominance frontiers of each node. This algorithm was originally described in the paper "Efficiently computing static single assignment form and the