DescriptionCompute preorder as well as postorder basic block orderings.
The Lengauer-Tarjan dominator/dominance frontier algorithm needs to
visit the blocks in reverse preorder (in the first pass) and preorder
(in the second). Compute that at the same time as postorder (e.g.,
using the same spanning tree).
Take this chance to make the flow graph visitors always operate on a
forward block ordering.
R=srdjan@google.com
BUG=
TEST=
Committed: https://code.google.com/p/dart/source/detail?r=5598
Patch Set 1 #
Total comments: 2
Messages
Total messages: 3 (0 generated)
|