On Wed, Sep 6, 2017 at 11:46 PM, Luc Van Oostenryck <luc.vanoostenryck@xxxxxxxxx> wrote: >> For reducible graph that algorithm converge in constant iteration. > > Where the 'constant' is a function of the loop complexity (maximum > nesting level) ... I think we are talking different things. My iteration means one pass of the reverse postorder. In the Keith Cooper et al paper end of first page: quote " show that reverse postorder iterative scheme solves these equations in a single pass over the CFG for reducible graphs. " page 2 reference 19 also mention solved in linear time on reducible graphs. It is just linear to the size of the CFG if graph is reducible. I don't recall it is related to maximum nesting level of loops. For the Simple SSA paper, maybe. Chris -- To unsubscribe from this list: send the line "unsubscribe linux-sparse" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
