[LLVMdev] Strong post-dominance in LLVM?

[Sanjoy Das]

On Wed, Jul 8, 2015 at 6:01 PM, 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?

The closest thing to this I can think of is `isGuaranteedToExecute` in
LICM.cpp.  Perhaps that mechanism can be generalized?

>
> Bjarke
>
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
>