Searched refs:NormalDest (Results 1 - 3 of 3) sorted by relevance
/external/llvm/lib/IR/ |
H A D | Dominators.cpp | 157 BasicBlock *NormalDest = II->getNormalDest(); 158 BasicBlockEdge E(DefBB, NormalDest); 193 // . NormalDest 196 // Given the definition of dominance, NormalDest is dominated by X iff X 197 // dominates all of NormalDest's predecessors (X, B, C in the example). X 199 // other predecessors. Since the only way out of X is via NormalDest, X can 200 // only properly dominate a node if NormalDest dominates that node too. 265 BasicBlock *NormalDest = II->getNormalDest(); local 266 BasicBlockEdge E(DefBB, NormalDest);
|
/external/llvm/include/llvm/IR/ |
H A D | IRBuilder.h | 512 InvokeInst *CreateInvoke(Value *Callee, BasicBlock *NormalDest, argument 514 return Insert(InvokeInst::Create(Callee, NormalDest, UnwindDest, 518 InvokeInst *CreateInvoke(Value *Callee, BasicBlock *NormalDest, argument 521 return Insert(InvokeInst::Create(Callee, NormalDest, UnwindDest, Arg1), 524 InvokeInst *CreateInvoke3(Value *Callee, BasicBlock *NormalDest, argument 529 return Insert(InvokeInst::Create(Callee, NormalDest, UnwindDest, Args), 533 InvokeInst *CreateInvoke(Value *Callee, BasicBlock *NormalDest, argument 536 return Insert(InvokeInst::Create(Callee, NormalDest, UnwindDest, Args),
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | MemorySanitizer.cpp | 1665 BasicBlock *NormalDest = cast<InvokeInst>(&I)->getNormalDest(); local 1666 if (!NormalDest->getSinglePredecessor()) { 1668 // Perhaps we need to split the edge between this BB and NormalDest, 1674 NextInsn = NormalDest->getFirstInsertionPt();
|
Completed in 106 milliseconds