eresi
eresi copied to clipboard
Libmjollnir should compute the dominator tree
A requirement for optimal translation into SSA form is to compute the dominator tree of the control flow graph.
There are many algorithms to compute that tree. An example is following the algorithm of the "Program Structure Tree". Another is fix-point based and described on the wikipedia page for the dominator tree.
Ticket: 95 Reported by: may on Sat Nov 29 20:17:49 2008