<div dir="ltr"><div class="gmail_default" style="font-family:arial,helvetica,sans-serif">Hello to all LLVM Developers.<br><br></div><div class="gmail_default" style="font-family:arial,helvetica,sans-serif">The LLVM IR is in strict SSA form (i.e. every variable is defined before it is used along every path from the entry to exit point)?<div id="gt-src-p"><span id="result_box" class="" lang="en"><span class="">According to the</span> <span class="">documentation</span><span class="">,</span> <span class="">currently the</span> <span class="">LLVM</span> <span class="">IR</span> <span class="">is</span> <span class="">in the</span> <span class="">SSA</span><span> form, but I don't see</span> additional <span class="">information</span> <span class="">about <b>strict</b> SSA form</span><span>.<br><br></span></span></div><div id="gt-src-p"><span id="result_box" class="" lang="en"><span>The strict SSA form provide opportunities of optimization in register allocation, because is proved that all interference graphs of the IR in <b>strict</b> SSA form are chordal and</span></span><span id="result_box" class="" lang="en"><span class=""> for those</span><span class="">, there are</span> <span class="">polynomial algorithms</span> <span class="">for the</span> <span class="">graph coloring</span><span class=""> (<a href="http://web.cs.ucla.edu/~palsberg/paper/aplas05.pdf">http://web.cs.ucla.edu/~palsberg/paper/aplas05.pdf</a>).</span></span><span id="result_box" class="" lang="en"><span></span></span></div></div><br>-- <br><div class="gmail_signature">Natanael Ramos <br>Membro do corpo discente de Ciência da Computação pelo Instituto Federal de <br>Minas Gerais - Campus Formiga<br><br></div>
</div>