<div dir="ltr">Hi,<br><br><div>If I understand correctly LLVM computes dominator tree using Lengauer-Tarjan's algorithm in <a href="https://code.woboq.org/llvm/llvm/" style="font-family:helvetica,sans-serif;font-size:inherit;color:rgb(0,51,119);border:none">llvm</a><span style="color:rgb(0,0,0);font-family:helvetica,sans-serif;font-size:inherit">/</span><a href="https://code.woboq.org/llvm/llvm/include/" style="font-family:helvetica,sans-serif;font-size:inherit;color:rgb(0,51,119);border:none;text-decoration:none">include</a><span style="color:rgb(0,0,0);font-family:helvetica,sans-serif;font-size:inherit">/</span><a href="https://code.woboq.org/llvm/llvm/include/llvm/" style="font-family:helvetica,sans-serif;font-size:inherit;color:rgb(0,51,119);border:none;text-decoration:none">llvm</a><span style="color:rgb(0,0,0);font-family:helvetica,sans-serif;font-size:inherit">/</span><a href="https://code.woboq.org/llvm/llvm/include/llvm/Support/" style="font-family:helvetica,sans-serif;font-size:inherit;color:rgb(0,51,119);border:none;text-decoration:none">Support</a><span style="color:rgb(0,0,0);font-family:helvetica,sans-serif;font-size:inherit">/</span><a href="https://code.woboq.org/llvm/llvm/include/llvm/Support/GenericDomTreeConstruction.h.html" style="font-family:helvetica,sans-serif;font-size:inherit;color:rgb(0,51,119);border:none;text-decoration:none">GenericDomTreeConstruction.h</a>.</div><div>(please correct if that is NOT the one frequently used in analyses)</div><div><br></div><div>Has anyone tried experimenting around iterative version (the one which came out of Cooper et al.'s work titled <a href="https://www.cs.rice.edu/~keith/EMBED/dom.pdf">"A Simple, Fast Dominance Algorithm"</a>)</div><div><br>-- <br><div class="gmail_signature"><div dir="ltr"><div><i style="font-size:12.8px">Disclaimer: Views, concerns, thoughts, questions, ideas expressed in this mail are of my own and my employer has no take in it. </i><br></div><div>Thank You.<br>Madhur D. Amilkanthwar<br><br></div></div></div>
</div></div>