[Mono-bugs] [Bug 61641][Wis] Changed - Suboptimal register allocation with `if' statements
Sat, 17 Jul 2004 13:53:32 -0400 (EDT)
Please do not reply to this email- if you want to comment on the bug, go to the
URL shown below and enter your comments there.
Changed by email@example.com.
--- shadow/61641 2004-07-17 13:32:19.000000000 -0400
+++ shadow/61641.tmp.10564 2004-07-17 13:53:32.000000000 -0400
@@ -618,6 +618,13 @@
In order to reach (the best possible) O(N+2) with N == maximal number of
backedges in a acyclic path, one needs to use reverse completion order
(the second argument of flow_depth_first_order_compute), _not_ DFS order.
So using a (correct ;-) reverse completion order would make liveness
faster as well as more precise.
+------- Additional Comments From firstname.lastname@example.org 2004-07-17 13:53 -------
+So, apprarently, I got the reverse completion order right (I checked
+by using the simpler recursive version from Aho et al). It does help
+with the liveness speed (I got a 14% reduction in the number of
+iterations with it!), however, it does not seem like a good order for