[LLVMdev] Strong post-dominance in LLVM? (original) (raw)
Bjarke Roune broune at google.com
Wed Jul 8 18:01:34 PDT 2015
- Previous message: [LLVMdev] llvm bay area social, july edition!
- Next message: [LLVMdev] Strong post-dominance in LLVM?
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
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 -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20150708/ac55c312/attachment.html>
- Previous message: [LLVMdev] llvm bay area social, july edition!
- Next message: [LLVMdev] Strong post-dominance in LLVM?
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]