Hi Chris, On 16 August 2017 at 13:42, Christopher Li <sparse@xxxxxxxxxxx> wrote: > On Wed, Aug 16, 2017 at 8:24 AM, Dibyendu Majumdar > <mobile@xxxxxxxxxxxxxxx> wrote: >> >> The paper says that the algorithm creates correct SSA for all >> programs. Specifically quoting: >> >> <quote> >> prove that the SSA construction algorithm constructs pruned SSA form >> for all programs and minimal SSA form for programs with reducible >> control flow >> <endquote> >> >> Secondly even for irreducible control flow, it provides an algorithm >> for creating minimal SSA in section 3.2, right? > > It do provide a solution. and the price is high. The complexity is > O(B*B*V*V). Go look at page 15 of the paper. > That is only if you want a minimal SSA right? Do you need one? Again I suggest you try out Luc's implementation which appears to work fine - and it doesn't do this extra pass I believe. Regards Dibyendu -- 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
