[LLVMdev] Strong post-dominance in LLVM?

[James Molloy]

Hi Bjarke,

Forgive my naivety, but wouldn't that involve solving the halting problem?

Cheers,

James

On Thu, 9 Jul 2015 at 02:21 Bjarke Roune <broune at google.com> wrote:

> There is PostDominatorTree for determining post-dominance. Even if A
> post-dominates B and B is executed, that doesn't guarantee that A will be
> executed. For example, there could be an infinite loop in-between. Strong
> post-dominance makes the stronger guarantee that there will be no infinite
> loop from B to A. Do we have anything in LLVM for determining strong
> post-dominance and in general for guaranteeing that if B is executed, then
> A will also be executed?
>
> Bjarke
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20150709/2b0e1461/attachment.html>