Hi, If I understand correctly LLVM computes dominator tree using Lengauer-Tarjan's algorithm in llvm <https://code.woboq.org/llvm/llvm/>/include <https://code.woboq.org/llvm/llvm/include/>/llvm <https://code.woboq.org/llvm/llvm/include/llvm/>/Support <https://code.woboq.org/llvm/llvm/include/llvm/Support/>/ GenericDomTreeConstruction.h <https://code.woboq.org/llvm/llvm/include/llvm/Support/GenericDomTreeConstruction.h.html> . (please correct if that is NOT the one frequently used in analyses) Has anyone tried experimenting around iterative version (the one which came out of Cooper et al.'s work titled "A Simple, Fast Dominance Algorithm" <https://www.cs.rice.edu/~keith/EMBED/dom.pdf>) -- *Disclaimer: Views, concerns, thoughts, questions, ideas expressed in this mail are of my own and my employer has no take in it. * Thank You. Madhur D. Amilkanthwar -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20161007/565ced08/attachment-0001.html>