On 01/14/14 06:42, Richard Biener wrote:
This fixes the slowness seen in LCM compute_available accounted
to RTL cprop. Currently the dataflow problem uses a "random"
basic-block order to seed the initial worklist (it wants to
visit predecessors before successors) - the following patch
makes it
This fixes the slowness seen in LCM compute_available accounted
to RTL cprop. Currently the dataflow problem uses a "random"
basic-block order to seed the initial worklist (it wants to
visit predecessors before successors) - the following patch
makes it use inverted postorder (similar to tree PRE
