On Thu, Sep 7, 2017 at 4:20 AM, Christopher Li <sparse@xxxxxxxxxxx> wrote: > > I am referring to the "A Simple, Fast Dominance Algorithm" > ... > For reducible graph that algorithm converge in constant iteration. Where the 'constant' is a function of the loop complexity (maximum nesting level) ... -- Luc Van Oostenryck -- 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
