1 //===-- WinEHPrepare - Prepare exception handling for code generation ---===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass lowers LLVM IR exception handling into something closer to what the
11 // backend wants. It snifs the personality function to see which kind of
12 // preparation is necessary. If the personality function uses the Itanium LSDA,
13 // this pass delegates to the DWARF EH preparation pass.
15 //===----------------------------------------------------------------------===//
17 #include "llvm/CodeGen/Passes.h"
18 #include "llvm/ADT/MapVector.h"
19 #include "llvm/ADT/STLExtras.h"
20 #include "llvm/ADT/SmallSet.h"
21 #include "llvm/ADT/SetVector.h"
22 #include "llvm/ADT/TinyPtrVector.h"
23 #include "llvm/Analysis/LibCallSemantics.h"
24 #include "llvm/CodeGen/WinEHFuncInfo.h"
25 #include "llvm/IR/Dominators.h"
26 #include "llvm/IR/Function.h"
27 #include "llvm/IR/IRBuilder.h"
28 #include "llvm/IR/Instructions.h"
29 #include "llvm/IR/IntrinsicInst.h"
30 #include "llvm/IR/Module.h"
31 #include "llvm/IR/PatternMatch.h"
32 #include "llvm/Pass.h"
33 #include "llvm/Support/CommandLine.h"
34 #include "llvm/Support/Debug.h"
35 #include "llvm/Support/raw_ostream.h"
36 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
37 #include "llvm/Transforms/Utils/Cloning.h"
38 #include "llvm/Transforms/Utils/Local.h"
39 #include "llvm/Transforms/Utils/PromoteMemToReg.h"
43 using namespace llvm::PatternMatch;
45 #define DEBUG_TYPE "winehprepare"
49 // This map is used to model frame variable usage during outlining, to
50 // construct a structure type to hold the frame variables in a frame
51 // allocation block, and to remap the frame variable allocas (including
52 // spill locations as needed) to GEPs that get the variable from the
53 // frame allocation structure.
54 typedef MapVector<Value *, TinyPtrVector<AllocaInst *>> FrameVarInfoMap;
56 // TinyPtrVector cannot hold nullptr, so we need our own sentinel that isn't
58 AllocaInst *getCatchObjectSentinel() {
59 return static_cast<AllocaInst *>(nullptr) + 1;
62 typedef SmallSet<BasicBlock *, 4> VisitedBlockSet;
64 class LandingPadActions;
67 typedef DenseMap<const BasicBlock *, CatchHandler *> CatchHandlerMapTy;
68 typedef DenseMap<const BasicBlock *, CleanupHandler *> CleanupHandlerMapTy;
70 class WinEHPrepare : public FunctionPass {
72 static char ID; // Pass identification, replacement for typeid.
73 WinEHPrepare(const TargetMachine *TM = nullptr)
74 : FunctionPass(ID), DT(nullptr) {}
76 bool runOnFunction(Function &Fn) override;
78 bool doFinalization(Module &M) override;
80 void getAnalysisUsage(AnalysisUsage &AU) const override;
82 const char *getPassName() const override {
83 return "Windows exception handling preparation";
87 bool prepareExceptionHandlers(Function &F,
88 SmallVectorImpl<LandingPadInst *> &LPads);
89 void promoteLandingPadValues(LandingPadInst *LPad);
90 void demoteValuesLiveAcrossHandlers(Function &F,
91 SmallVectorImpl<LandingPadInst *> &LPads);
92 void completeNestedLandingPad(Function *ParentFn,
93 LandingPadInst *OutlinedLPad,
94 const LandingPadInst *OriginalLPad,
95 FrameVarInfoMap &VarInfo);
96 bool outlineHandler(ActionHandler *Action, Function *SrcFn,
97 LandingPadInst *LPad, BasicBlock *StartBB,
98 FrameVarInfoMap &VarInfo);
99 void addStubInvokeToHandlerIfNeeded(Function *Handler, Value *PersonalityFn);
101 void mapLandingPadBlocks(LandingPadInst *LPad, LandingPadActions &Actions);
102 CatchHandler *findCatchHandler(BasicBlock *BB, BasicBlock *&NextBB,
103 VisitedBlockSet &VisitedBlocks);
104 void findCleanupHandlers(LandingPadActions &Actions, BasicBlock *StartBB,
107 void processSEHCatchHandler(CatchHandler *Handler, BasicBlock *StartBB);
109 // All fields are reset by runOnFunction.
111 EHPersonality Personality;
112 CatchHandlerMapTy CatchHandlerMap;
113 CleanupHandlerMapTy CleanupHandlerMap;
114 DenseMap<const LandingPadInst *, LandingPadMap> LPadMaps;
116 // This maps landing pad instructions found in outlined handlers to
117 // the landing pad instruction in the parent function from which they
118 // were cloned. The cloned/nested landing pad is used as the key
119 // because the landing pad may be cloned into multiple handlers.
120 // This map will be used to add the llvm.eh.actions call to the nested
121 // landing pads after all handlers have been outlined.
122 DenseMap<LandingPadInst *, const LandingPadInst *> NestedLPtoOriginalLP;
124 // This maps blocks in the parent function which are destinations of
125 // catch handlers to cloned blocks in (other) outlined handlers. This
126 // handles the case where a nested landing pads has a catch handler that
127 // returns to a handler function rather than the parent function.
128 // The original block is used as the key here because there should only
129 // ever be one handler function from which the cloned block is not pruned.
130 // The original block will be pruned from the parent function after all
131 // handlers have been outlined. This map will be used to adjust the
132 // return instructions of handlers which return to the block that was
133 // outlined into a handler. This is done after all handlers have been
134 // outlined but before the outlined code is pruned from the parent function.
135 DenseMap<const BasicBlock *, BasicBlock *> LPadTargetBlocks;
138 class WinEHFrameVariableMaterializer : public ValueMaterializer {
140 WinEHFrameVariableMaterializer(Function *OutlinedFn,
141 FrameVarInfoMap &FrameVarInfo);
142 ~WinEHFrameVariableMaterializer() override {}
144 Value *materializeValueFor(Value *V) override;
146 void escapeCatchObject(Value *V);
149 FrameVarInfoMap &FrameVarInfo;
153 class LandingPadMap {
155 LandingPadMap() : OriginLPad(nullptr) {}
156 void mapLandingPad(const LandingPadInst *LPad);
158 bool isInitialized() { return OriginLPad != nullptr; }
160 bool isOriginLandingPadBlock(const BasicBlock *BB) const;
161 bool isLandingPadSpecificInst(const Instruction *Inst) const;
163 void remapEHValues(ValueToValueMapTy &VMap, Value *EHPtrValue,
164 Value *SelectorValue) const;
167 const LandingPadInst *OriginLPad;
168 // We will normally only see one of each of these instructions, but
169 // if more than one occurs for some reason we can handle that.
170 TinyPtrVector<const ExtractValueInst *> ExtractedEHPtrs;
171 TinyPtrVector<const ExtractValueInst *> ExtractedSelectors;
174 class WinEHCloningDirectorBase : public CloningDirector {
176 WinEHCloningDirectorBase(Function *HandlerFn, FrameVarInfoMap &VarInfo,
177 LandingPadMap &LPadMap)
178 : Materializer(HandlerFn, VarInfo),
179 SelectorIDType(Type::getInt32Ty(HandlerFn->getContext())),
180 Int8PtrType(Type::getInt8PtrTy(HandlerFn->getContext())),
182 auto AI = HandlerFn->getArgumentList().begin();
184 EstablisherFrame = AI;
187 CloningAction handleInstruction(ValueToValueMapTy &VMap,
188 const Instruction *Inst,
189 BasicBlock *NewBB) override;
191 virtual CloningAction handleBeginCatch(ValueToValueMapTy &VMap,
192 const Instruction *Inst,
193 BasicBlock *NewBB) = 0;
194 virtual CloningAction handleEndCatch(ValueToValueMapTy &VMap,
195 const Instruction *Inst,
196 BasicBlock *NewBB) = 0;
197 virtual CloningAction handleTypeIdFor(ValueToValueMapTy &VMap,
198 const Instruction *Inst,
199 BasicBlock *NewBB) = 0;
200 virtual CloningAction handleInvoke(ValueToValueMapTy &VMap,
201 const InvokeInst *Invoke,
202 BasicBlock *NewBB) = 0;
203 virtual CloningAction handleResume(ValueToValueMapTy &VMap,
204 const ResumeInst *Resume,
205 BasicBlock *NewBB) = 0;
206 virtual CloningAction handleCompare(ValueToValueMapTy &VMap,
207 const CmpInst *Compare,
208 BasicBlock *NewBB) = 0;
209 virtual CloningAction handleLandingPad(ValueToValueMapTy &VMap,
210 const LandingPadInst *LPad,
211 BasicBlock *NewBB) = 0;
213 ValueMaterializer *getValueMaterializer() override { return &Materializer; }
216 WinEHFrameVariableMaterializer Materializer;
217 Type *SelectorIDType;
219 LandingPadMap &LPadMap;
221 /// The value representing the parent frame pointer.
222 Value *EstablisherFrame;
225 class WinEHCatchDirector : public WinEHCloningDirectorBase {
228 Function *CatchFn, Value *Selector, FrameVarInfoMap &VarInfo,
229 LandingPadMap &LPadMap,
230 DenseMap<LandingPadInst *, const LandingPadInst *> &NestedLPads)
231 : WinEHCloningDirectorBase(CatchFn, VarInfo, LPadMap),
232 CurrentSelector(Selector->stripPointerCasts()),
233 ExceptionObjectVar(nullptr), NestedLPtoOriginalLP(NestedLPads) {}
235 CloningAction handleBeginCatch(ValueToValueMapTy &VMap,
236 const Instruction *Inst,
237 BasicBlock *NewBB) override;
238 CloningAction handleEndCatch(ValueToValueMapTy &VMap, const Instruction *Inst,
239 BasicBlock *NewBB) override;
240 CloningAction handleTypeIdFor(ValueToValueMapTy &VMap,
241 const Instruction *Inst,
242 BasicBlock *NewBB) override;
243 CloningAction handleInvoke(ValueToValueMapTy &VMap, const InvokeInst *Invoke,
244 BasicBlock *NewBB) override;
245 CloningAction handleResume(ValueToValueMapTy &VMap, const ResumeInst *Resume,
246 BasicBlock *NewBB) override;
247 CloningAction handleCompare(ValueToValueMapTy &VMap,
248 const CmpInst *Compare, BasicBlock *NewBB) override;
249 CloningAction handleLandingPad(ValueToValueMapTy &VMap,
250 const LandingPadInst *LPad,
251 BasicBlock *NewBB) override;
253 Value *getExceptionVar() { return ExceptionObjectVar; }
254 TinyPtrVector<BasicBlock *> &getReturnTargets() { return ReturnTargets; }
257 Value *CurrentSelector;
259 Value *ExceptionObjectVar;
260 TinyPtrVector<BasicBlock *> ReturnTargets;
262 // This will be a reference to the field of the same name in the WinEHPrepare
263 // object which instantiates this WinEHCatchDirector object.
264 DenseMap<LandingPadInst *, const LandingPadInst *> &NestedLPtoOriginalLP;
267 class WinEHCleanupDirector : public WinEHCloningDirectorBase {
269 WinEHCleanupDirector(Function *CleanupFn, FrameVarInfoMap &VarInfo,
270 LandingPadMap &LPadMap)
271 : WinEHCloningDirectorBase(CleanupFn, VarInfo, LPadMap) {}
273 CloningAction handleBeginCatch(ValueToValueMapTy &VMap,
274 const Instruction *Inst,
275 BasicBlock *NewBB) override;
276 CloningAction handleEndCatch(ValueToValueMapTy &VMap, const Instruction *Inst,
277 BasicBlock *NewBB) override;
278 CloningAction handleTypeIdFor(ValueToValueMapTy &VMap,
279 const Instruction *Inst,
280 BasicBlock *NewBB) override;
281 CloningAction handleInvoke(ValueToValueMapTy &VMap, const InvokeInst *Invoke,
282 BasicBlock *NewBB) override;
283 CloningAction handleResume(ValueToValueMapTy &VMap, const ResumeInst *Resume,
284 BasicBlock *NewBB) override;
285 CloningAction handleCompare(ValueToValueMapTy &VMap,
286 const CmpInst *Compare, BasicBlock *NewBB) override;
287 CloningAction handleLandingPad(ValueToValueMapTy &VMap,
288 const LandingPadInst *LPad,
289 BasicBlock *NewBB) override;
292 class LandingPadActions {
294 LandingPadActions() : HasCleanupHandlers(false) {}
296 void insertCatchHandler(CatchHandler *Action) { Actions.push_back(Action); }
297 void insertCleanupHandler(CleanupHandler *Action) {
298 Actions.push_back(Action);
299 HasCleanupHandlers = true;
302 bool includesCleanup() const { return HasCleanupHandlers; }
304 SmallVectorImpl<ActionHandler *> &actions() { return Actions; }
305 SmallVectorImpl<ActionHandler *>::iterator begin() { return Actions.begin(); }
306 SmallVectorImpl<ActionHandler *>::iterator end() { return Actions.end(); }
309 // Note that this class does not own the ActionHandler objects in this vector.
310 // The ActionHandlers are owned by the CatchHandlerMap and CleanupHandlerMap
311 // in the WinEHPrepare class.
312 SmallVector<ActionHandler *, 4> Actions;
313 bool HasCleanupHandlers;
316 } // end anonymous namespace
318 char WinEHPrepare::ID = 0;
319 INITIALIZE_TM_PASS(WinEHPrepare, "winehprepare", "Prepare Windows exceptions",
322 FunctionPass *llvm::createWinEHPass(const TargetMachine *TM) {
323 return new WinEHPrepare(TM);
326 bool WinEHPrepare::runOnFunction(Function &Fn) {
327 // No need to prepare outlined handlers.
328 if (Fn.hasFnAttribute("wineh-parent"))
331 SmallVector<LandingPadInst *, 4> LPads;
332 SmallVector<ResumeInst *, 4> Resumes;
333 for (BasicBlock &BB : Fn) {
334 if (auto *LP = BB.getLandingPadInst())
336 if (auto *Resume = dyn_cast<ResumeInst>(BB.getTerminator()))
337 Resumes.push_back(Resume);
340 // No need to prepare functions that lack landing pads.
344 // Classify the personality to see what kind of preparation we need.
345 Personality = classifyEHPersonality(LPads.back()->getPersonalityFn());
347 // Do nothing if this is not an MSVC personality.
348 if (!isMSVCEHPersonality(Personality))
351 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
353 // If there were any landing pads, prepareExceptionHandlers will make changes.
354 prepareExceptionHandlers(Fn, LPads);
358 bool WinEHPrepare::doFinalization(Module &M) { return false; }
360 void WinEHPrepare::getAnalysisUsage(AnalysisUsage &AU) const {
361 AU.addRequired<DominatorTreeWrapperPass>();
364 static bool isSelectorDispatch(BasicBlock *BB, BasicBlock *&CatchHandler,
365 Constant *&Selector, BasicBlock *&NextBB);
367 // Finds blocks reachable from the starting set Worklist. Does not follow unwind
368 // edges or blocks listed in StopPoints.
369 static void findReachableBlocks(SmallPtrSetImpl<BasicBlock *> &ReachableBBs,
370 SetVector<BasicBlock *> &Worklist,
371 const SetVector<BasicBlock *> *StopPoints) {
372 while (!Worklist.empty()) {
373 BasicBlock *BB = Worklist.pop_back_val();
375 // Don't cross blocks that we should stop at.
376 if (StopPoints && StopPoints->count(BB))
379 if (!ReachableBBs.insert(BB).second)
380 continue; // Already visited.
382 // Don't follow unwind edges of invokes.
383 if (auto *II = dyn_cast<InvokeInst>(BB->getTerminator())) {
384 Worklist.insert(II->getNormalDest());
388 // Otherwise, follow all successors.
389 Worklist.insert(succ_begin(BB), succ_end(BB));
393 /// Find all points where exceptional control rejoins normal control flow via
394 /// llvm.eh.endcatch. Add them to the normal bb reachability worklist.
395 static void findCXXEHReturnPoints(Function &F,
396 SetVector<BasicBlock *> &EHReturnBlocks) {
397 for (auto BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) {
398 BasicBlock *BB = BBI;
399 for (Instruction &I : *BB) {
400 if (match(&I, m_Intrinsic<Intrinsic::eh_endcatch>())) {
401 // Split the block after the call to llvm.eh.endcatch if there is
402 // anything other than an unconditional branch, or if the successor
403 // starts with a phi.
404 auto *Br = dyn_cast<BranchInst>(I.getNextNode());
405 if (!Br || !Br->isUnconditional() ||
406 isa<PHINode>(Br->getSuccessor(0)->begin())) {
407 DEBUG(dbgs() << "splitting block " << BB->getName()
408 << " with llvm.eh.endcatch\n");
409 BBI = BB->splitBasicBlock(I.getNextNode(), "ehreturn");
411 // The next BB is normal control flow.
412 EHReturnBlocks.insert(BB->getTerminator()->getSuccessor(0));
419 static bool isCatchAllLandingPad(const BasicBlock *BB) {
420 const LandingPadInst *LP = BB->getLandingPadInst();
423 unsigned N = LP->getNumClauses();
424 return (N > 0 && LP->isCatch(N - 1) &&
425 isa<ConstantPointerNull>(LP->getClause(N - 1)));
428 /// Find all points where exceptions control rejoins normal control flow via
429 /// selector dispatch.
430 static void findSEHEHReturnPoints(Function &F,
431 SetVector<BasicBlock *> &EHReturnBlocks) {
432 for (auto BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) {
433 BasicBlock *BB = BBI;
434 // If the landingpad is a catch-all, treat the whole lpad as if it is
435 // reachable from normal control flow.
436 // FIXME: This is imprecise. We need a better way of identifying where a
437 // catch-all starts and cleanups stop. As far as LLVM is concerned, there
439 if (isCatchAllLandingPad(BB)) {
440 EHReturnBlocks.insert(BB);
444 BasicBlock *CatchHandler;
447 if (isSelectorDispatch(BB, CatchHandler, Selector, NextBB)) {
448 // Split the edge if there is a phi node. Returning from EH to a phi node
449 // is just as impossible as having a phi after an indirectbr.
450 if (isa<PHINode>(CatchHandler->begin())) {
451 DEBUG(dbgs() << "splitting EH return edge from " << BB->getName()
452 << " to " << CatchHandler->getName() << '\n');
453 BBI = CatchHandler = SplitCriticalEdge(
454 BB, std::find(succ_begin(BB), succ_end(BB), CatchHandler));
456 EHReturnBlocks.insert(CatchHandler);
461 /// Ensure that all values live into and out of exception handlers are stored
463 /// FIXME: This falls down when values are defined in one handler and live into
464 /// another handler. For example, a cleanup defines a value used only by a
466 void WinEHPrepare::demoteValuesLiveAcrossHandlers(
467 Function &F, SmallVectorImpl<LandingPadInst *> &LPads) {
468 DEBUG(dbgs() << "Demoting values live across exception handlers in function "
469 << F.getName() << '\n');
471 // Build a set of all non-exceptional blocks and exceptional blocks.
472 // - Non-exceptional blocks are blocks reachable from the entry block while
473 // not following invoke unwind edges.
474 // - Exceptional blocks are blocks reachable from landingpads. Analysis does
475 // not follow llvm.eh.endcatch blocks, which mark a transition from
476 // exceptional to normal control.
477 SmallPtrSet<BasicBlock *, 4> NormalBlocks;
478 SmallPtrSet<BasicBlock *, 4> EHBlocks;
479 SetVector<BasicBlock *> EHReturnBlocks;
480 SetVector<BasicBlock *> Worklist;
482 if (Personality == EHPersonality::MSVC_CXX)
483 findCXXEHReturnPoints(F, EHReturnBlocks);
485 findSEHEHReturnPoints(F, EHReturnBlocks);
488 dbgs() << "identified the following blocks as EH return points:\n";
489 for (BasicBlock *BB : EHReturnBlocks)
490 dbgs() << " " << BB->getName() << '\n';
493 // Join points should not have phis at this point, unless they are a
494 // landingpad, in which case we will demote their phis later.
496 for (BasicBlock *BB : EHReturnBlocks)
497 assert((BB->isLandingPad() || !isa<PHINode>(BB->begin())) &&
498 "non-lpad EH return block has phi");
501 // Normal blocks are the blocks reachable from the entry block and all EH
503 Worklist = EHReturnBlocks;
504 Worklist.insert(&F.getEntryBlock());
505 findReachableBlocks(NormalBlocks, Worklist, nullptr);
507 dbgs() << "marked the following blocks as normal:\n";
508 for (BasicBlock *BB : NormalBlocks)
509 dbgs() << " " << BB->getName() << '\n';
512 // Exceptional blocks are the blocks reachable from landingpads that don't
513 // cross EH return points.
515 for (auto *LPI : LPads)
516 Worklist.insert(LPI->getParent());
517 findReachableBlocks(EHBlocks, Worklist, &EHReturnBlocks);
519 dbgs() << "marked the following blocks as exceptional:\n";
520 for (BasicBlock *BB : EHBlocks)
521 dbgs() << " " << BB->getName() << '\n';
524 SetVector<Argument *> ArgsToDemote;
525 SetVector<Instruction *> InstrsToDemote;
526 for (BasicBlock &BB : F) {
527 bool IsNormalBB = NormalBlocks.count(&BB);
528 bool IsEHBB = EHBlocks.count(&BB);
529 if (!IsNormalBB && !IsEHBB)
530 continue; // Blocks that are neither normal nor EH are unreachable.
531 for (Instruction &I : BB) {
532 for (Value *Op : I.operands()) {
533 // Don't demote static allocas, constants, and labels.
534 if (isa<Constant>(Op) || isa<BasicBlock>(Op) || isa<InlineAsm>(Op))
536 auto *AI = dyn_cast<AllocaInst>(Op);
537 if (AI && AI->isStaticAlloca())
540 if (auto *Arg = dyn_cast<Argument>(Op)) {
542 DEBUG(dbgs() << "Demoting argument " << *Arg
543 << " used by EH instr: " << I << "\n");
544 ArgsToDemote.insert(Arg);
549 auto *OpI = cast<Instruction>(Op);
550 BasicBlock *OpBB = OpI->getParent();
551 // If a value is produced and consumed in the same BB, we don't need to
555 bool IsOpNormalBB = NormalBlocks.count(OpBB);
556 bool IsOpEHBB = EHBlocks.count(OpBB);
557 if (IsNormalBB != IsOpNormalBB || IsEHBB != IsOpEHBB) {
559 dbgs() << "Demoting instruction live in-out from EH:\n";
560 dbgs() << "Instr: " << *OpI << '\n';
561 dbgs() << "User: " << I << '\n';
563 InstrsToDemote.insert(OpI);
569 // Demote values live into and out of handlers.
570 // FIXME: This demotion is inefficient. We should insert spills at the point
571 // of definition, insert one reload in each handler that uses the value, and
572 // insert reloads in the BB used to rejoin normal control flow.
573 Instruction *AllocaInsertPt = F.getEntryBlock().getFirstInsertionPt();
574 for (Instruction *I : InstrsToDemote)
575 DemoteRegToStack(*I, false, AllocaInsertPt);
577 // Demote arguments separately, and only for uses in EH blocks.
578 for (Argument *Arg : ArgsToDemote) {
579 auto *Slot = new AllocaInst(Arg->getType(), nullptr,
580 Arg->getName() + ".reg2mem", AllocaInsertPt);
581 SmallVector<User *, 4> Users(Arg->user_begin(), Arg->user_end());
582 for (User *U : Users) {
583 auto *I = dyn_cast<Instruction>(U);
584 if (I && EHBlocks.count(I->getParent())) {
585 auto *Reload = new LoadInst(Slot, Arg->getName() + ".reload", false, I);
586 U->replaceUsesOfWith(Arg, Reload);
589 new StoreInst(Arg, Slot, AllocaInsertPt);
592 // Demote landingpad phis, as the landingpad will be removed from the machine
594 for (LandingPadInst *LPI : LPads) {
595 BasicBlock *BB = LPI->getParent();
596 while (auto *Phi = dyn_cast<PHINode>(BB->begin()))
597 DemotePHIToStack(Phi, AllocaInsertPt);
600 DEBUG(dbgs() << "Demoted " << InstrsToDemote.size() << " instructions and "
601 << ArgsToDemote.size() << " arguments for WinEHPrepare\n\n");
604 bool WinEHPrepare::prepareExceptionHandlers(
605 Function &F, SmallVectorImpl<LandingPadInst *> &LPads) {
606 // Don't run on functions that are already prepared.
607 for (LandingPadInst *LPad : LPads) {
608 BasicBlock *LPadBB = LPad->getParent();
609 for (Instruction &Inst : *LPadBB)
610 if (match(&Inst, m_Intrinsic<Intrinsic::eh_actions>()))
614 demoteValuesLiveAcrossHandlers(F, LPads);
616 // These containers are used to re-map frame variables that are used in
617 // outlined catch and cleanup handlers. They will be populated as the
618 // handlers are outlined.
619 FrameVarInfoMap FrameVarInfo;
621 bool HandlersOutlined = false;
623 Module *M = F.getParent();
624 LLVMContext &Context = M->getContext();
626 // Create a new function to receive the handler contents.
627 PointerType *Int8PtrType = Type::getInt8PtrTy(Context);
628 Type *Int32Type = Type::getInt32Ty(Context);
629 Function *ActionIntrin = Intrinsic::getDeclaration(M, Intrinsic::eh_actions);
631 for (LandingPadInst *LPad : LPads) {
632 // Look for evidence that this landingpad has already been processed.
633 bool LPadHasActionList = false;
634 BasicBlock *LPadBB = LPad->getParent();
635 for (Instruction &Inst : *LPadBB) {
636 if (match(&Inst, m_Intrinsic<Intrinsic::eh_actions>())) {
637 LPadHasActionList = true;
642 // If we've already outlined the handlers for this landingpad,
643 // there's nothing more to do here.
644 if (LPadHasActionList)
647 // If either of the values in the aggregate returned by the landing pad is
648 // extracted and stored to memory, promote the stored value to a register.
649 promoteLandingPadValues(LPad);
651 LandingPadActions Actions;
652 mapLandingPadBlocks(LPad, Actions);
654 HandlersOutlined |= !Actions.actions().empty();
655 for (ActionHandler *Action : Actions) {
656 if (Action->hasBeenProcessed())
658 BasicBlock *StartBB = Action->getStartBlock();
660 // SEH doesn't do any outlining for catches. Instead, pass the handler
661 // basic block addr to llvm.eh.actions and list the block as a return
663 if (isAsynchronousEHPersonality(Personality)) {
664 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
665 processSEHCatchHandler(CatchAction, StartBB);
670 outlineHandler(Action, &F, LPad, StartBB, FrameVarInfo);
673 // Replace the landing pad with a new llvm.eh.action based landing pad.
674 BasicBlock *NewLPadBB = BasicBlock::Create(Context, "lpad", &F, LPadBB);
675 assert(!isa<PHINode>(LPadBB->begin()));
676 auto *NewLPad = cast<LandingPadInst>(LPad->clone());
677 NewLPadBB->getInstList().push_back(NewLPad);
678 while (!pred_empty(LPadBB)) {
679 auto *pred = *pred_begin(LPadBB);
680 InvokeInst *Invoke = cast<InvokeInst>(pred->getTerminator());
681 Invoke->setUnwindDest(NewLPadBB);
684 // If anyone is still using the old landingpad value, just give them undef
685 // instead. The eh pointer and selector values are not real.
686 LPad->replaceAllUsesWith(UndefValue::get(LPad->getType()));
688 // Replace the mapping of any nested landing pad that previously mapped
689 // to this landing pad with a referenced to the cloned version.
690 for (auto &LPadPair : NestedLPtoOriginalLP) {
691 const LandingPadInst *OriginalLPad = LPadPair.second;
692 if (OriginalLPad == LPad) {
693 LPadPair.second = NewLPad;
697 // Replace uses of the old lpad in phis with this block and delete the old
699 LPadBB->replaceSuccessorsPhiUsesWith(NewLPadBB);
700 LPadBB->getTerminator()->eraseFromParent();
701 new UnreachableInst(LPadBB->getContext(), LPadBB);
703 // Add a call to describe the actions for this landing pad.
704 std::vector<Value *> ActionArgs;
705 for (ActionHandler *Action : Actions) {
706 // Action codes from docs are: 0 cleanup, 1 catch.
707 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
708 ActionArgs.push_back(ConstantInt::get(Int32Type, 1));
709 ActionArgs.push_back(CatchAction->getSelector());
710 // Find the frame escape index of the exception object alloca in the
712 int FrameEscapeIdx = -1;
713 Value *EHObj = const_cast<Value *>(CatchAction->getExceptionVar());
714 if (EHObj && !isa<ConstantPointerNull>(EHObj)) {
715 auto I = FrameVarInfo.find(EHObj);
716 assert(I != FrameVarInfo.end() &&
717 "failed to map llvm.eh.begincatch var");
718 FrameEscapeIdx = std::distance(FrameVarInfo.begin(), I);
720 ActionArgs.push_back(ConstantInt::get(Int32Type, FrameEscapeIdx));
722 ActionArgs.push_back(ConstantInt::get(Int32Type, 0));
724 ActionArgs.push_back(Action->getHandlerBlockOrFunc());
727 CallInst::Create(ActionIntrin, ActionArgs, "recover", NewLPadBB);
729 // Add an indirect branch listing possible successors of the catch handlers.
730 SetVector<BasicBlock *> ReturnTargets;
731 for (ActionHandler *Action : Actions) {
732 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
733 const auto &CatchTargets = CatchAction->getReturnTargets();
734 ReturnTargets.insert(CatchTargets.begin(), CatchTargets.end());
737 IndirectBrInst *Branch =
738 IndirectBrInst::Create(Recover, ReturnTargets.size(), NewLPadBB);
739 for (BasicBlock *Target : ReturnTargets)
740 Branch->addDestination(Target);
741 } // End for each landingpad
743 // If nothing got outlined, there is no more processing to be done.
744 if (!HandlersOutlined)
747 // Replace any nested landing pad stubs with the correct action handler.
748 // This must be done before we remove unreachable blocks because it
749 // cleans up references to outlined blocks that will be deleted.
750 for (auto &LPadPair : NestedLPtoOriginalLP)
751 completeNestedLandingPad(&F, LPadPair.first, LPadPair.second, FrameVarInfo);
752 NestedLPtoOriginalLP.clear();
754 F.addFnAttr("wineh-parent", F.getName());
756 // Delete any blocks that were only used by handlers that were outlined above.
757 removeUnreachableBlocks(F);
759 BasicBlock *Entry = &F.getEntryBlock();
760 IRBuilder<> Builder(F.getParent()->getContext());
761 Builder.SetInsertPoint(Entry->getFirstInsertionPt());
763 Function *FrameEscapeFn =
764 Intrinsic::getDeclaration(M, Intrinsic::frameescape);
765 Function *RecoverFrameFn =
766 Intrinsic::getDeclaration(M, Intrinsic::framerecover);
767 SmallVector<Value *, 8> AllocasToEscape;
769 // Scan the entry block for an existing call to llvm.frameescape. We need to
770 // keep escaping those objects.
771 for (Instruction &I : F.front()) {
772 auto *II = dyn_cast<IntrinsicInst>(&I);
773 if (II && II->getIntrinsicID() == Intrinsic::frameescape) {
774 auto Args = II->arg_operands();
775 AllocasToEscape.append(Args.begin(), Args.end());
776 II->eraseFromParent();
781 // Finally, replace all of the temporary allocas for frame variables used in
782 // the outlined handlers with calls to llvm.framerecover.
783 for (auto &VarInfoEntry : FrameVarInfo) {
784 Value *ParentVal = VarInfoEntry.first;
785 TinyPtrVector<AllocaInst *> &Allocas = VarInfoEntry.second;
786 AllocaInst *ParentAlloca = cast<AllocaInst>(ParentVal);
788 // FIXME: We should try to sink unescaped allocas from the parent frame into
789 // the child frame. If the alloca is escaped, we have to use the lifetime
790 // markers to ensure that the alloca is only live within the child frame.
792 // Add this alloca to the list of things to escape.
793 AllocasToEscape.push_back(ParentAlloca);
795 // Next replace all outlined allocas that are mapped to it.
796 for (AllocaInst *TempAlloca : Allocas) {
797 if (TempAlloca == getCatchObjectSentinel())
798 continue; // Skip catch parameter sentinels.
799 Function *HandlerFn = TempAlloca->getParent()->getParent();
800 // FIXME: Sink this GEP into the blocks where it is used.
801 Builder.SetInsertPoint(TempAlloca);
802 Builder.SetCurrentDebugLocation(TempAlloca->getDebugLoc());
803 Value *RecoverArgs[] = {
804 Builder.CreateBitCast(&F, Int8PtrType, ""),
805 &(HandlerFn->getArgumentList().back()),
806 llvm::ConstantInt::get(Int32Type, AllocasToEscape.size() - 1)};
807 Value *RecoveredAlloca = Builder.CreateCall(RecoverFrameFn, RecoverArgs);
808 // Add a pointer bitcast if the alloca wasn't an i8.
809 if (RecoveredAlloca->getType() != TempAlloca->getType()) {
810 RecoveredAlloca->setName(Twine(TempAlloca->getName()) + ".i8");
812 Builder.CreateBitCast(RecoveredAlloca, TempAlloca->getType());
814 TempAlloca->replaceAllUsesWith(RecoveredAlloca);
815 TempAlloca->removeFromParent();
816 RecoveredAlloca->takeName(TempAlloca);
819 } // End for each FrameVarInfo entry.
821 // Insert 'call void (...)* @llvm.frameescape(...)' at the end of the entry
823 Builder.SetInsertPoint(&F.getEntryBlock().back());
824 Builder.CreateCall(FrameEscapeFn, AllocasToEscape);
826 // Clean up the handler action maps we created for this function
827 DeleteContainerSeconds(CatchHandlerMap);
828 CatchHandlerMap.clear();
829 DeleteContainerSeconds(CleanupHandlerMap);
830 CleanupHandlerMap.clear();
832 return HandlersOutlined;
835 void WinEHPrepare::promoteLandingPadValues(LandingPadInst *LPad) {
836 // If the return values of the landing pad instruction are extracted and
837 // stored to memory, we want to promote the store locations to reg values.
838 SmallVector<AllocaInst *, 2> EHAllocas;
840 // The landingpad instruction returns an aggregate value. Typically, its
841 // value will be passed to a pair of extract value instructions and the
842 // results of those extracts are often passed to store instructions.
843 // In unoptimized code the stored value will often be loaded and then stored
845 for (auto *U : LPad->users()) {
846 ExtractValueInst *Extract = dyn_cast<ExtractValueInst>(U);
850 for (auto *EU : Extract->users()) {
851 if (auto *Store = dyn_cast<StoreInst>(EU)) {
852 auto *AV = cast<AllocaInst>(Store->getPointerOperand());
853 EHAllocas.push_back(AV);
858 // We can't do this without a dominator tree.
861 if (!EHAllocas.empty()) {
862 PromoteMemToReg(EHAllocas, *DT);
866 // After promotion, some extracts may be trivially dead. Remove them.
867 SmallVector<Value *, 4> Users(LPad->user_begin(), LPad->user_end());
868 for (auto *U : Users)
869 RecursivelyDeleteTriviallyDeadInstructions(U);
872 void WinEHPrepare::completeNestedLandingPad(Function *ParentFn,
873 LandingPadInst *OutlinedLPad,
874 const LandingPadInst *OriginalLPad,
875 FrameVarInfoMap &FrameVarInfo) {
876 // Get the nested block and erase the unreachable instruction that was
877 // temporarily inserted as its terminator.
878 LLVMContext &Context = ParentFn->getContext();
879 BasicBlock *OutlinedBB = OutlinedLPad->getParent();
880 assert(isa<UnreachableInst>(OutlinedBB->getTerminator()));
881 OutlinedBB->getTerminator()->eraseFromParent();
882 // That should leave OutlinedLPad as the last instruction in its block.
883 assert(&OutlinedBB->back() == OutlinedLPad);
885 // The original landing pad will have already had its action intrinsic
886 // built by the outlining loop. We need to clone that into the outlined
887 // location. It may also be necessary to add references to the exception
888 // variables to the outlined handler in which this landing pad is nested
889 // and remap return instructions in the nested handlers that should return
890 // to an address in the outlined handler.
891 Function *OutlinedHandlerFn = OutlinedBB->getParent();
892 BasicBlock::const_iterator II = OriginalLPad;
894 // The instruction after the landing pad should now be a call to eh.actions.
895 const Instruction *Recover = II;
896 assert(match(Recover, m_Intrinsic<Intrinsic::eh_actions>()));
897 IntrinsicInst *EHActions = cast<IntrinsicInst>(Recover->clone());
899 // Remap the exception variables into the outlined function.
900 WinEHFrameVariableMaterializer Materializer(OutlinedHandlerFn, FrameVarInfo);
901 SmallVector<BlockAddress *, 4> ActionTargets;
902 SmallVector<ActionHandler *, 4> ActionList;
903 parseEHActions(EHActions, ActionList);
904 for (auto *Action : ActionList) {
905 auto *Catch = dyn_cast<CatchHandler>(Action);
908 // The dyn_cast to function here selects C++ catch handlers and skips
909 // SEH catch handlers.
910 auto *Handler = dyn_cast<Function>(Catch->getHandlerBlockOrFunc());
913 // Visit all the return instructions, looking for places that return
914 // to a location within OutlinedHandlerFn.
915 for (BasicBlock &NestedHandlerBB : *Handler) {
916 auto *Ret = dyn_cast<ReturnInst>(NestedHandlerBB.getTerminator());
920 // Handler functions must always return a block address.
921 BlockAddress *BA = cast<BlockAddress>(Ret->getReturnValue());
922 // The original target will have been in the main parent function,
923 // but if it is the address of a block that has been outlined, it
924 // should be a block that was outlined into OutlinedHandlerFn.
925 assert(BA->getFunction() == ParentFn);
927 // Ignore targets that aren't part of OutlinedHandlerFn.
928 if (!LPadTargetBlocks.count(BA->getBasicBlock()))
931 // If the return value is the address ofF a block that we
932 // previously outlined into the parent handler function, replace
933 // the return instruction and add the mapped target to the list
934 // of possible return addresses.
935 BasicBlock *MappedBB = LPadTargetBlocks[BA->getBasicBlock()];
936 assert(MappedBB->getParent() == OutlinedHandlerFn);
937 BlockAddress *NewBA = BlockAddress::get(OutlinedHandlerFn, MappedBB);
938 Ret->eraseFromParent();
939 ReturnInst::Create(Context, NewBA, &NestedHandlerBB);
940 ActionTargets.push_back(NewBA);
943 DeleteContainerPointers(ActionList);
945 OutlinedBB->getInstList().push_back(EHActions);
947 // Insert an indirect branch into the outlined landing pad BB.
948 IndirectBrInst *IBr = IndirectBrInst::Create(EHActions, 0, OutlinedBB);
949 // Add the previously collected action targets.
950 for (auto *Target : ActionTargets)
951 IBr->addDestination(Target->getBasicBlock());
954 // This function examines a block to determine whether the block ends with a
955 // conditional branch to a catch handler based on a selector comparison.
956 // This function is used both by the WinEHPrepare::findSelectorComparison() and
957 // WinEHCleanupDirector::handleTypeIdFor().
958 static bool isSelectorDispatch(BasicBlock *BB, BasicBlock *&CatchHandler,
959 Constant *&Selector, BasicBlock *&NextBB) {
960 ICmpInst::Predicate Pred;
961 BasicBlock *TBB, *FBB;
964 if (!match(BB->getTerminator(),
965 m_Br(m_ICmp(Pred, m_Value(LHS), m_Value(RHS)), TBB, FBB)))
969 m_Intrinsic<Intrinsic::eh_typeid_for>(m_Constant(Selector))) &&
970 !match(RHS, m_Intrinsic<Intrinsic::eh_typeid_for>(m_Constant(Selector))))
973 if (Pred == CmpInst::ICMP_EQ) {
979 if (Pred == CmpInst::ICMP_NE) {
988 static bool isCatchBlock(BasicBlock *BB) {
989 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
991 if (match(cast<Value>(II), m_Intrinsic<Intrinsic::eh_begincatch>()))
997 static BasicBlock *createStubLandingPad(Function *Handler,
998 Value *PersonalityFn) {
999 // FIXME: Finish this!
1000 LLVMContext &Context = Handler->getContext();
1001 BasicBlock *StubBB = BasicBlock::Create(Context, "stub");
1002 Handler->getBasicBlockList().push_back(StubBB);
1003 IRBuilder<> Builder(StubBB);
1004 LandingPadInst *LPad = Builder.CreateLandingPad(
1005 llvm::StructType::get(Type::getInt8PtrTy(Context),
1006 Type::getInt32Ty(Context), nullptr),
1008 // Insert a call to llvm.eh.actions so that we don't try to outline this lpad.
1009 Function *ActionIntrin = Intrinsic::getDeclaration(Handler->getParent(),
1010 Intrinsic::eh_actions);
1011 Builder.CreateCall(ActionIntrin, "recover");
1012 LPad->setCleanup(true);
1013 Builder.CreateUnreachable();
1017 // Cycles through the blocks in an outlined handler function looking for an
1018 // invoke instruction and inserts an invoke of llvm.donothing with an empty
1019 // landing pad if none is found. The code that generates the .xdata tables for
1020 // the handler needs at least one landing pad to identify the parent function's
1022 void WinEHPrepare::addStubInvokeToHandlerIfNeeded(Function *Handler,
1023 Value *PersonalityFn) {
1024 ReturnInst *Ret = nullptr;
1025 for (BasicBlock &BB : *Handler) {
1026 TerminatorInst *Terminator = BB.getTerminator();
1027 // If we find an invoke, there is nothing to be done.
1028 auto *II = dyn_cast<InvokeInst>(Terminator);
1031 // If we've already recorded a return instruction, keep looking for invokes.
1034 // If we haven't recorded a return instruction yet, try this terminator.
1035 Ret = dyn_cast<ReturnInst>(Terminator);
1038 // If we got this far, the handler contains no invokes. We should have seen
1039 // at least one return. We'll insert an invoke of llvm.donothing ahead of
1042 BasicBlock *OldRetBB = Ret->getParent();
1043 BasicBlock *NewRetBB = SplitBlock(OldRetBB, Ret);
1044 // SplitBlock adds an unconditional branch instruction at the end of the
1045 // parent block. We want to replace that with an invoke call, so we can
1047 OldRetBB->getTerminator()->eraseFromParent();
1048 BasicBlock *StubLandingPad = createStubLandingPad(Handler, PersonalityFn);
1050 Intrinsic::getDeclaration(Handler->getParent(), Intrinsic::donothing);
1051 InvokeInst::Create(F, NewRetBB, StubLandingPad, None, "", OldRetBB);
1054 bool WinEHPrepare::outlineHandler(ActionHandler *Action, Function *SrcFn,
1055 LandingPadInst *LPad, BasicBlock *StartBB,
1056 FrameVarInfoMap &VarInfo) {
1057 Module *M = SrcFn->getParent();
1058 LLVMContext &Context = M->getContext();
1060 // Create a new function to receive the handler contents.
1061 Type *Int8PtrType = Type::getInt8PtrTy(Context);
1062 std::vector<Type *> ArgTys;
1063 ArgTys.push_back(Int8PtrType);
1064 ArgTys.push_back(Int8PtrType);
1066 if (Action->getType() == Catch) {
1067 FunctionType *FnType = FunctionType::get(Int8PtrType, ArgTys, false);
1068 Handler = Function::Create(FnType, GlobalVariable::InternalLinkage,
1069 SrcFn->getName() + ".catch", M);
1071 FunctionType *FnType =
1072 FunctionType::get(Type::getVoidTy(Context), ArgTys, false);
1073 Handler = Function::Create(FnType, GlobalVariable::InternalLinkage,
1074 SrcFn->getName() + ".cleanup", M);
1077 Handler->addFnAttr("wineh-parent", SrcFn->getName());
1079 // Generate a standard prolog to setup the frame recovery structure.
1080 IRBuilder<> Builder(Context);
1081 BasicBlock *Entry = BasicBlock::Create(Context, "entry");
1082 Handler->getBasicBlockList().push_front(Entry);
1083 Builder.SetInsertPoint(Entry);
1084 Builder.SetCurrentDebugLocation(LPad->getDebugLoc());
1086 std::unique_ptr<WinEHCloningDirectorBase> Director;
1088 ValueToValueMapTy VMap;
1090 LandingPadMap &LPadMap = LPadMaps[LPad];
1091 if (!LPadMap.isInitialized())
1092 LPadMap.mapLandingPad(LPad);
1093 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
1094 Constant *Sel = CatchAction->getSelector();
1095 Director.reset(new WinEHCatchDirector(Handler, Sel, VarInfo, LPadMap,
1096 NestedLPtoOriginalLP));
1097 LPadMap.remapEHValues(VMap, UndefValue::get(Int8PtrType),
1098 ConstantInt::get(Type::getInt32Ty(Context), 1));
1100 Director.reset(new WinEHCleanupDirector(Handler, VarInfo, LPadMap));
1101 LPadMap.remapEHValues(VMap, UndefValue::get(Int8PtrType),
1102 UndefValue::get(Type::getInt32Ty(Context)));
1105 SmallVector<ReturnInst *, 8> Returns;
1106 ClonedCodeInfo OutlinedFunctionInfo;
1108 // If the start block contains PHI nodes, we need to map them.
1109 BasicBlock::iterator II = StartBB->begin();
1110 while (auto *PN = dyn_cast<PHINode>(II)) {
1111 bool Mapped = false;
1112 // Look for PHI values that we have already mapped (such as the selector).
1113 for (Value *Val : PN->incoming_values()) {
1114 if (VMap.count(Val)) {
1115 VMap[PN] = VMap[Val];
1119 // If we didn't find a match for this value, map it as an undef.
1121 VMap[PN] = UndefValue::get(PN->getType());
1126 // The landing pad value may be used by PHI nodes. It will ultimately be
1127 // eliminated, but we need it in the map for intermediate handling.
1128 VMap[LPad] = UndefValue::get(LPad->getType());
1130 // Skip over PHIs and, if applicable, landingpad instructions.
1131 II = StartBB->getFirstInsertionPt();
1133 CloneAndPruneIntoFromInst(Handler, SrcFn, II, VMap,
1134 /*ModuleLevelChanges=*/false, Returns, "",
1135 &OutlinedFunctionInfo, Director.get());
1137 // Move all the instructions in the first cloned block into our entry block.
1138 BasicBlock *FirstClonedBB = std::next(Function::iterator(Entry));
1139 Entry->getInstList().splice(Entry->end(), FirstClonedBB->getInstList());
1140 FirstClonedBB->eraseFromParent();
1142 // Make sure we can identify the handler's personality later.
1143 addStubInvokeToHandlerIfNeeded(Handler, LPad->getPersonalityFn());
1145 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
1146 WinEHCatchDirector *CatchDirector =
1147 reinterpret_cast<WinEHCatchDirector *>(Director.get());
1148 CatchAction->setExceptionVar(CatchDirector->getExceptionVar());
1149 CatchAction->setReturnTargets(CatchDirector->getReturnTargets());
1151 // Look for blocks that are not part of the landing pad that we just
1152 // outlined but terminate with a call to llvm.eh.endcatch and a
1153 // branch to a block that is in the handler we just outlined.
1154 // These blocks will be part of a nested landing pad that intends to
1155 // return to an address in this handler. This case is best handled
1156 // after both landing pads have been outlined, so for now we'll just
1157 // save the association of the blocks in LPadTargetBlocks. The
1158 // return instructions which are created from these branches will be
1159 // replaced after all landing pads have been outlined.
1160 for (const auto MapEntry : VMap) {
1161 // VMap maps all values and blocks that were just cloned, but dead
1162 // blocks which were pruned will map to nullptr.
1163 if (!isa<BasicBlock>(MapEntry.first) || MapEntry.second == nullptr)
1165 const BasicBlock *MappedBB = cast<BasicBlock>(MapEntry.first);
1166 for (auto *Pred : predecessors(const_cast<BasicBlock *>(MappedBB))) {
1167 auto *Branch = dyn_cast<BranchInst>(Pred->getTerminator());
1168 if (!Branch || !Branch->isUnconditional() || Pred->size() <= 1)
1170 BasicBlock::iterator II = const_cast<BranchInst *>(Branch);
1172 if (match(cast<Value>(II), m_Intrinsic<Intrinsic::eh_endcatch>())) {
1173 // This would indicate that a nested landing pad wants to return
1174 // to a block that is outlined into two different handlers.
1175 assert(!LPadTargetBlocks.count(MappedBB));
1176 LPadTargetBlocks[MappedBB] = cast<BasicBlock>(MapEntry.second);
1180 } // End if (CatchAction)
1182 Action->setHandlerBlockOrFunc(Handler);
1187 /// This BB must end in a selector dispatch. All we need to do is pass the
1188 /// handler block to llvm.eh.actions and list it as a possible indirectbr
1190 void WinEHPrepare::processSEHCatchHandler(CatchHandler *CatchAction,
1191 BasicBlock *StartBB) {
1192 BasicBlock *HandlerBB;
1195 bool Res = isSelectorDispatch(StartBB, HandlerBB, Selector, NextBB);
1197 // If this was EH dispatch, this must be a conditional branch to the handler
1199 // FIXME: Handle instructions in the dispatch block. Currently we drop them,
1200 // leading to crashes if some optimization hoists stuff here.
1201 assert(CatchAction->getSelector() && HandlerBB &&
1202 "expected catch EH dispatch");
1204 // This must be a catch-all. Split the block after the landingpad.
1205 assert(CatchAction->getSelector()->isNullValue() && "expected catch-all");
1207 StartBB->splitBasicBlock(StartBB->getFirstInsertionPt(), "catch.all");
1209 CatchAction->setHandlerBlockOrFunc(BlockAddress::get(HandlerBB));
1210 TinyPtrVector<BasicBlock *> Targets(HandlerBB);
1211 CatchAction->setReturnTargets(Targets);
1214 void LandingPadMap::mapLandingPad(const LandingPadInst *LPad) {
1215 // Each instance of this class should only ever be used to map a single
1217 assert(OriginLPad == nullptr || OriginLPad == LPad);
1219 // If the landing pad has already been mapped, there's nothing more to do.
1220 if (OriginLPad == LPad)
1225 // The landingpad instruction returns an aggregate value. Typically, its
1226 // value will be passed to a pair of extract value instructions and the
1227 // results of those extracts will have been promoted to reg values before
1228 // this routine is called.
1229 for (auto *U : LPad->users()) {
1230 const ExtractValueInst *Extract = dyn_cast<ExtractValueInst>(U);
1233 assert(Extract->getNumIndices() == 1 &&
1234 "Unexpected operation: extracting both landing pad values");
1235 unsigned int Idx = *(Extract->idx_begin());
1236 assert((Idx == 0 || Idx == 1) &&
1237 "Unexpected operation: extracting an unknown landing pad element");
1239 ExtractedEHPtrs.push_back(Extract);
1240 } else if (Idx == 1) {
1241 ExtractedSelectors.push_back(Extract);
1246 bool LandingPadMap::isOriginLandingPadBlock(const BasicBlock *BB) const {
1247 return BB->getLandingPadInst() == OriginLPad;
1250 bool LandingPadMap::isLandingPadSpecificInst(const Instruction *Inst) const {
1251 if (Inst == OriginLPad)
1253 for (auto *Extract : ExtractedEHPtrs) {
1254 if (Inst == Extract)
1257 for (auto *Extract : ExtractedSelectors) {
1258 if (Inst == Extract)
1264 void LandingPadMap::remapEHValues(ValueToValueMapTy &VMap, Value *EHPtrValue,
1265 Value *SelectorValue) const {
1266 // Remap all landing pad extract instructions to the specified values.
1267 for (auto *Extract : ExtractedEHPtrs)
1268 VMap[Extract] = EHPtrValue;
1269 for (auto *Extract : ExtractedSelectors)
1270 VMap[Extract] = SelectorValue;
1273 static bool isFrameAddressCall(const Value *V) {
1274 return match(const_cast<Value *>(V),
1275 m_Intrinsic<Intrinsic::frameaddress>(m_SpecificInt(0)));
1278 CloningDirector::CloningAction WinEHCloningDirectorBase::handleInstruction(
1279 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1280 // If this is one of the boilerplate landing pad instructions, skip it.
1281 // The instruction will have already been remapped in VMap.
1282 if (LPadMap.isLandingPadSpecificInst(Inst))
1283 return CloningDirector::SkipInstruction;
1285 // Nested landing pads will be cloned as stubs, with just the
1286 // landingpad instruction and an unreachable instruction. When
1287 // all landingpads have been outlined, we'll replace this with the
1288 // llvm.eh.actions call and indirect branch created when the
1289 // landing pad was outlined.
1290 if (auto *LPad = dyn_cast<LandingPadInst>(Inst)) {
1291 return handleLandingPad(VMap, LPad, NewBB);
1294 if (auto *Invoke = dyn_cast<InvokeInst>(Inst))
1295 return handleInvoke(VMap, Invoke, NewBB);
1297 if (auto *Resume = dyn_cast<ResumeInst>(Inst))
1298 return handleResume(VMap, Resume, NewBB);
1300 if (auto *Cmp = dyn_cast<CmpInst>(Inst))
1301 return handleCompare(VMap, Cmp, NewBB);
1303 if (match(Inst, m_Intrinsic<Intrinsic::eh_begincatch>()))
1304 return handleBeginCatch(VMap, Inst, NewBB);
1305 if (match(Inst, m_Intrinsic<Intrinsic::eh_endcatch>()))
1306 return handleEndCatch(VMap, Inst, NewBB);
1307 if (match(Inst, m_Intrinsic<Intrinsic::eh_typeid_for>()))
1308 return handleTypeIdFor(VMap, Inst, NewBB);
1310 // When outlining llvm.frameaddress(i32 0), remap that to the second argument,
1311 // which is the FP of the parent.
1312 if (isFrameAddressCall(Inst)) {
1313 VMap[Inst] = EstablisherFrame;
1314 return CloningDirector::SkipInstruction;
1317 // Continue with the default cloning behavior.
1318 return CloningDirector::CloneInstruction;
1321 CloningDirector::CloningAction WinEHCatchDirector::handleLandingPad(
1322 ValueToValueMapTy &VMap, const LandingPadInst *LPad, BasicBlock *NewBB) {
1323 Instruction *NewInst = LPad->clone();
1324 if (LPad->hasName())
1325 NewInst->setName(LPad->getName());
1326 // Save this correlation for later processing.
1327 NestedLPtoOriginalLP[cast<LandingPadInst>(NewInst)] = LPad;
1328 VMap[LPad] = NewInst;
1329 BasicBlock::InstListType &InstList = NewBB->getInstList();
1330 InstList.push_back(NewInst);
1331 InstList.push_back(new UnreachableInst(NewBB->getContext()));
1332 return CloningDirector::StopCloningBB;
1335 CloningDirector::CloningAction WinEHCatchDirector::handleBeginCatch(
1336 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1337 // The argument to the call is some form of the first element of the
1338 // landingpad aggregate value, but that doesn't matter. It isn't used
1340 // The second argument is an outparameter where the exception object will be
1341 // stored. Typically the exception object is a scalar, but it can be an
1342 // aggregate when catching by value.
1343 // FIXME: Leave something behind to indicate where the exception object lives
1344 // for this handler. Should it be part of llvm.eh.actions?
1345 assert(ExceptionObjectVar == nullptr && "Multiple calls to "
1346 "llvm.eh.begincatch found while "
1347 "outlining catch handler.");
1348 ExceptionObjectVar = Inst->getOperand(1)->stripPointerCasts();
1349 if (isa<ConstantPointerNull>(ExceptionObjectVar))
1350 return CloningDirector::SkipInstruction;
1351 assert(cast<AllocaInst>(ExceptionObjectVar)->isStaticAlloca() &&
1352 "catch parameter is not static alloca");
1353 Materializer.escapeCatchObject(ExceptionObjectVar);
1354 return CloningDirector::SkipInstruction;
1357 CloningDirector::CloningAction
1358 WinEHCatchDirector::handleEndCatch(ValueToValueMapTy &VMap,
1359 const Instruction *Inst, BasicBlock *NewBB) {
1360 auto *IntrinCall = dyn_cast<IntrinsicInst>(Inst);
1361 // It might be interesting to track whether or not we are inside a catch
1362 // function, but that might make the algorithm more brittle than it needs
1365 // The end catch call can occur in one of two places: either in a
1366 // landingpad block that is part of the catch handlers exception mechanism,
1367 // or at the end of the catch block. However, a catch-all handler may call
1368 // end catch from the original landing pad. If the call occurs in a nested
1369 // landing pad block, we must skip it and continue so that the landing pad
1371 auto *ParentBB = IntrinCall->getParent();
1372 if (ParentBB->isLandingPad() && !LPadMap.isOriginLandingPadBlock(ParentBB))
1373 return CloningDirector::SkipInstruction;
1375 // If an end catch occurs anywhere else we want to terminate the handler
1376 // with a return to the code that follows the endcatch call. If the
1377 // next instruction is not an unconditional branch, we need to split the
1378 // block to provide a clear target for the return instruction.
1379 BasicBlock *ContinueBB;
1380 auto Next = std::next(BasicBlock::const_iterator(IntrinCall));
1381 const BranchInst *Branch = dyn_cast<BranchInst>(Next);
1382 if (!Branch || !Branch->isUnconditional()) {
1383 // We're interrupting the cloning process at this location, so the
1384 // const_cast we're doing here will not cause a problem.
1385 ContinueBB = SplitBlock(const_cast<BasicBlock *>(ParentBB),
1386 const_cast<Instruction *>(cast<Instruction>(Next)));
1388 ContinueBB = Branch->getSuccessor(0);
1391 ReturnInst::Create(NewBB->getContext(), BlockAddress::get(ContinueBB), NewBB);
1392 ReturnTargets.push_back(ContinueBB);
1394 // We just added a terminator to the cloned block.
1395 // Tell the caller to stop processing the current basic block so that
1396 // the branch instruction will be skipped.
1397 return CloningDirector::StopCloningBB;
1400 CloningDirector::CloningAction WinEHCatchDirector::handleTypeIdFor(
1401 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1402 auto *IntrinCall = dyn_cast<IntrinsicInst>(Inst);
1403 Value *Selector = IntrinCall->getArgOperand(0)->stripPointerCasts();
1404 // This causes a replacement that will collapse the landing pad CFG based
1405 // on the filter function we intend to match.
1406 if (Selector == CurrentSelector)
1407 VMap[Inst] = ConstantInt::get(SelectorIDType, 1);
1409 VMap[Inst] = ConstantInt::get(SelectorIDType, 0);
1410 // Tell the caller not to clone this instruction.
1411 return CloningDirector::SkipInstruction;
1414 CloningDirector::CloningAction
1415 WinEHCatchDirector::handleInvoke(ValueToValueMapTy &VMap,
1416 const InvokeInst *Invoke, BasicBlock *NewBB) {
1417 return CloningDirector::CloneInstruction;
1420 CloningDirector::CloningAction
1421 WinEHCatchDirector::handleResume(ValueToValueMapTy &VMap,
1422 const ResumeInst *Resume, BasicBlock *NewBB) {
1423 // Resume instructions shouldn't be reachable from catch handlers.
1424 // We still need to handle it, but it will be pruned.
1425 BasicBlock::InstListType &InstList = NewBB->getInstList();
1426 InstList.push_back(new UnreachableInst(NewBB->getContext()));
1427 return CloningDirector::StopCloningBB;
1430 CloningDirector::CloningAction
1431 WinEHCatchDirector::handleCompare(ValueToValueMapTy &VMap,
1432 const CmpInst *Compare, BasicBlock *NewBB) {
1433 const IntrinsicInst *IntrinCall = nullptr;
1434 if (match(Compare->getOperand(0), m_Intrinsic<Intrinsic::eh_typeid_for>())) {
1435 IntrinCall = dyn_cast<IntrinsicInst>(Compare->getOperand(0));
1436 } else if (match(Compare->getOperand(1), m_Intrinsic<Intrinsic::eh_typeid_for>())) {
1437 IntrinCall = dyn_cast<IntrinsicInst>(Compare->getOperand(1));
1440 Value *Selector = IntrinCall->getArgOperand(0)->stripPointerCasts();
1441 // This causes a replacement that will collapse the landing pad CFG based
1442 // on the filter function we intend to match.
1443 if (Selector == CurrentSelector->stripPointerCasts()) {
1444 VMap[Compare] = ConstantInt::get(SelectorIDType, 1);
1447 VMap[Compare] = ConstantInt::get(SelectorIDType, 0);
1449 return CloningDirector::SkipInstruction;
1451 return CloningDirector::CloneInstruction;
1454 CloningDirector::CloningAction WinEHCleanupDirector::handleLandingPad(
1455 ValueToValueMapTy &VMap, const LandingPadInst *LPad, BasicBlock *NewBB) {
1456 // The MS runtime will terminate the process if an exception occurs in a
1457 // cleanup handler, so we shouldn't encounter landing pads in the actual
1458 // cleanup code, but they may appear in catch blocks. Depending on where
1459 // we started cloning we may see one, but it will get dropped during dead
1461 Instruction *NewInst = new UnreachableInst(NewBB->getContext());
1462 VMap[LPad] = NewInst;
1463 BasicBlock::InstListType &InstList = NewBB->getInstList();
1464 InstList.push_back(NewInst);
1465 return CloningDirector::StopCloningBB;
1468 CloningDirector::CloningAction WinEHCleanupDirector::handleBeginCatch(
1469 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1470 // Cleanup code may flow into catch blocks or the catch block may be part
1471 // of a branch that will be optimized away. We'll insert a return
1472 // instruction now, but it may be pruned before the cloning process is
1474 ReturnInst::Create(NewBB->getContext(), nullptr, NewBB);
1475 return CloningDirector::StopCloningBB;
1478 CloningDirector::CloningAction WinEHCleanupDirector::handleEndCatch(
1479 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1480 // Cleanup handlers nested within catch handlers may begin with a call to
1481 // eh.endcatch. We can just ignore that instruction.
1482 return CloningDirector::SkipInstruction;
1485 CloningDirector::CloningAction WinEHCleanupDirector::handleTypeIdFor(
1486 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1487 // If we encounter a selector comparison while cloning a cleanup handler,
1488 // we want to stop cloning immediately. Anything after the dispatch
1489 // will be outlined into a different handler.
1490 BasicBlock *CatchHandler;
1493 if (isSelectorDispatch(const_cast<BasicBlock *>(Inst->getParent()),
1494 CatchHandler, Selector, NextBB)) {
1495 ReturnInst::Create(NewBB->getContext(), nullptr, NewBB);
1496 return CloningDirector::StopCloningBB;
1498 // If eg.typeid.for is called for any other reason, it can be ignored.
1499 VMap[Inst] = ConstantInt::get(SelectorIDType, 0);
1500 return CloningDirector::SkipInstruction;
1503 CloningDirector::CloningAction WinEHCleanupDirector::handleInvoke(
1504 ValueToValueMapTy &VMap, const InvokeInst *Invoke, BasicBlock *NewBB) {
1505 // All invokes in cleanup handlers can be replaced with calls.
1506 SmallVector<Value *, 16> CallArgs(Invoke->op_begin(), Invoke->op_end() - 3);
1507 // Insert a normal call instruction...
1509 CallInst::Create(const_cast<Value *>(Invoke->getCalledValue()), CallArgs,
1510 Invoke->getName(), NewBB);
1511 NewCall->setCallingConv(Invoke->getCallingConv());
1512 NewCall->setAttributes(Invoke->getAttributes());
1513 NewCall->setDebugLoc(Invoke->getDebugLoc());
1514 VMap[Invoke] = NewCall;
1516 // Remap the operands.
1517 llvm::RemapInstruction(NewCall, VMap, RF_None, nullptr, &Materializer);
1519 // Insert an unconditional branch to the normal destination.
1520 BranchInst::Create(Invoke->getNormalDest(), NewBB);
1522 // The unwind destination won't be cloned into the new function, so
1523 // we don't need to clean up its phi nodes.
1525 // We just added a terminator to the cloned block.
1526 // Tell the caller to stop processing the current basic block.
1527 return CloningDirector::CloneSuccessors;
1530 CloningDirector::CloningAction WinEHCleanupDirector::handleResume(
1531 ValueToValueMapTy &VMap, const ResumeInst *Resume, BasicBlock *NewBB) {
1532 ReturnInst::Create(NewBB->getContext(), nullptr, NewBB);
1534 // We just added a terminator to the cloned block.
1535 // Tell the caller to stop processing the current basic block so that
1536 // the branch instruction will be skipped.
1537 return CloningDirector::StopCloningBB;
1540 CloningDirector::CloningAction
1541 WinEHCleanupDirector::handleCompare(ValueToValueMapTy &VMap,
1542 const CmpInst *Compare, BasicBlock *NewBB) {
1543 if (match(Compare->getOperand(0), m_Intrinsic<Intrinsic::eh_typeid_for>()) ||
1544 match(Compare->getOperand(1), m_Intrinsic<Intrinsic::eh_typeid_for>())) {
1545 VMap[Compare] = ConstantInt::get(SelectorIDType, 1);
1546 return CloningDirector::SkipInstruction;
1548 return CloningDirector::CloneInstruction;
1552 WinEHFrameVariableMaterializer::WinEHFrameVariableMaterializer(
1553 Function *OutlinedFn, FrameVarInfoMap &FrameVarInfo)
1554 : FrameVarInfo(FrameVarInfo), Builder(OutlinedFn->getContext()) {
1555 BasicBlock *EntryBB = &OutlinedFn->getEntryBlock();
1556 Builder.SetInsertPoint(EntryBB, EntryBB->getFirstInsertionPt());
1559 Value *WinEHFrameVariableMaterializer::materializeValueFor(Value *V) {
1560 // If we're asked to materialize a static alloca, we temporarily create an
1561 // alloca in the outlined function and add this to the FrameVarInfo map. When
1562 // all the outlining is complete, we'll replace these temporary allocas with
1563 // calls to llvm.framerecover.
1564 if (auto *AV = dyn_cast<AllocaInst>(V)) {
1565 assert(AV->isStaticAlloca() &&
1566 "cannot materialize un-demoted dynamic alloca");
1567 AllocaInst *NewAlloca = dyn_cast<AllocaInst>(AV->clone());
1568 Builder.Insert(NewAlloca, AV->getName());
1569 FrameVarInfo[AV].push_back(NewAlloca);
1573 if (isa<Instruction>(V) || isa<Argument>(V)) {
1574 errs() << "Failed to demote instruction used in exception handler:\n";
1575 errs() << " " << *V << '\n';
1576 report_fatal_error("WinEHPrepare failed to demote instruction");
1579 // Don't materialize other values.
1583 void WinEHFrameVariableMaterializer::escapeCatchObject(Value *V) {
1584 // Catch parameter objects have to live in the parent frame. When we see a use
1585 // of a catch parameter, add a sentinel to the multimap to indicate that it's
1586 // used from another handler. This will prevent us from trying to sink the
1587 // alloca into the handler and ensure that the catch parameter is present in
1588 // the call to llvm.frameescape.
1589 FrameVarInfo[V].push_back(getCatchObjectSentinel());
1592 // This function maps the catch and cleanup handlers that are reachable from the
1593 // specified landing pad. The landing pad sequence will have this basic shape:
1595 // <cleanup handler>
1596 // <selector comparison>
1598 // <cleanup handler>
1599 // <selector comparison>
1601 // <cleanup handler>
1604 // Any of the cleanup slots may be absent. The cleanup slots may be occupied by
1605 // any arbitrary control flow, but all paths through the cleanup code must
1606 // eventually reach the next selector comparison and no path can skip to a
1607 // different selector comparisons, though some paths may terminate abnormally.
1608 // Therefore, we will use a depth first search from the start of any given
1609 // cleanup block and stop searching when we find the next selector comparison.
1611 // If the landingpad instruction does not have a catch clause, we will assume
1612 // that any instructions other than selector comparisons and catch handlers can
1613 // be ignored. In practice, these will only be the boilerplate instructions.
1615 // The catch handlers may also have any control structure, but we are only
1616 // interested in the start of the catch handlers, so we don't need to actually
1617 // follow the flow of the catch handlers. The start of the catch handlers can
1618 // be located from the compare instructions, but they can be skipped in the
1619 // flow by following the contrary branch.
1620 void WinEHPrepare::mapLandingPadBlocks(LandingPadInst *LPad,
1621 LandingPadActions &Actions) {
1622 unsigned int NumClauses = LPad->getNumClauses();
1623 unsigned int HandlersFound = 0;
1624 BasicBlock *BB = LPad->getParent();
1626 DEBUG(dbgs() << "Mapping landing pad: " << BB->getName() << "\n");
1628 if (NumClauses == 0) {
1629 findCleanupHandlers(Actions, BB, nullptr);
1633 VisitedBlockSet VisitedBlocks;
1635 while (HandlersFound != NumClauses) {
1636 BasicBlock *NextBB = nullptr;
1638 // See if the clause we're looking for is a catch-all.
1639 // If so, the catch begins immediately.
1640 Constant *ExpectedSelector = LPad->getClause(HandlersFound)->stripPointerCasts();
1641 if (isa<ConstantPointerNull>(ExpectedSelector)) {
1642 // The catch all must occur last.
1643 assert(HandlersFound == NumClauses - 1);
1645 // There can be additional selector dispatches in the call chain that we
1647 BasicBlock *CatchBlock = nullptr;
1649 while (BB && isSelectorDispatch(BB, CatchBlock, Selector, NextBB)) {
1650 DEBUG(dbgs() << " Found extra catch dispatch in block "
1651 << CatchBlock->getName() << "\n");
1655 // For C++ EH, check if there is any interesting cleanup code before we
1656 // begin the catch. This is important because cleanups cannot rethrow
1657 // exceptions but code called from catches can. For SEH, it isn't
1658 // important if some finally code before a catch-all is executed out of
1659 // line or after recovering from the exception.
1660 if (Personality == EHPersonality::MSVC_CXX)
1661 findCleanupHandlers(Actions, BB, BB);
1663 // Add the catch handler to the action list.
1664 CatchHandler *Action = nullptr;
1665 if (CatchHandlerMap.count(BB) && CatchHandlerMap[BB] != nullptr) {
1666 // If the CatchHandlerMap already has an entry for this BB, re-use it.
1667 Action = CatchHandlerMap[BB];
1668 assert(Action->getSelector() == ExpectedSelector);
1670 // Since this is a catch-all handler, the selector won't actually appear
1671 // in the code anywhere. ExpectedSelector here is the constant null ptr
1672 // that we got from the landing pad instruction.
1673 Action = new CatchHandler(BB, ExpectedSelector, nullptr);
1674 CatchHandlerMap[BB] = Action;
1676 Actions.insertCatchHandler(Action);
1677 DEBUG(dbgs() << " Catch all handler at block " << BB->getName() << "\n");
1680 // Once we reach a catch-all, don't expect to hit a resume instruction.
1685 CatchHandler *CatchAction = findCatchHandler(BB, NextBB, VisitedBlocks);
1686 assert(CatchAction);
1688 // See if there is any interesting code executed before the dispatch.
1689 findCleanupHandlers(Actions, BB, CatchAction->getStartBlock());
1691 // When the source program contains multiple nested try blocks the catch
1692 // handlers can get strung together in such a way that we can encounter
1693 // a dispatch for a selector that we've already had a handler for.
1694 if (CatchAction->getSelector()->stripPointerCasts() == ExpectedSelector) {
1697 // Add the catch handler to the action list.
1698 DEBUG(dbgs() << " Found catch dispatch in block "
1699 << CatchAction->getStartBlock()->getName() << "\n");
1700 Actions.insertCatchHandler(CatchAction);
1702 // Under some circumstances optimized IR will flow unconditionally into a
1703 // handler block without checking the selector. This can only happen if
1704 // the landing pad has a catch-all handler and the handler for the
1705 // preceeding catch clause is identical to the catch-call handler
1706 // (typically an empty catch). In this case, the handler must be shared
1707 // by all remaining clauses.
1708 if (isa<ConstantPointerNull>(
1709 CatchAction->getSelector()->stripPointerCasts())) {
1710 DEBUG(dbgs() << " Applying early catch-all handler in block "
1711 << CatchAction->getStartBlock()->getName()
1712 << " to all remaining clauses.\n");
1713 Actions.insertCatchHandler(CatchAction);
1717 DEBUG(dbgs() << " Found extra catch dispatch in block "
1718 << CatchAction->getStartBlock()->getName() << "\n");
1721 // Move on to the block after the catch handler.
1725 // If we didn't wind up in a catch-all, see if there is any interesting code
1726 // executed before the resume.
1727 findCleanupHandlers(Actions, BB, BB);
1729 // It's possible that some optimization moved code into a landingpad that
1731 // previously being used for cleanup. If that happens, we need to execute
1733 // extra code from a cleanup handler.
1734 if (Actions.includesCleanup() && !LPad->isCleanup())
1735 LPad->setCleanup(true);
1738 // This function searches starting with the input block for the next
1739 // block that terminates with a branch whose condition is based on a selector
1740 // comparison. This may be the input block. See the mapLandingPadBlocks
1741 // comments for a discussion of control flow assumptions.
1743 CatchHandler *WinEHPrepare::findCatchHandler(BasicBlock *BB,
1744 BasicBlock *&NextBB,
1745 VisitedBlockSet &VisitedBlocks) {
1746 // See if we've already found a catch handler use it.
1747 // Call count() first to avoid creating a null entry for blocks
1748 // we haven't seen before.
1749 if (CatchHandlerMap.count(BB) && CatchHandlerMap[BB] != nullptr) {
1750 CatchHandler *Action = cast<CatchHandler>(CatchHandlerMap[BB]);
1751 NextBB = Action->getNextBB();
1755 // VisitedBlocks applies only to the current search. We still
1756 // need to consider blocks that we've visited while mapping other
1758 VisitedBlocks.insert(BB);
1760 BasicBlock *CatchBlock = nullptr;
1761 Constant *Selector = nullptr;
1763 // If this is the first time we've visited this block from any landing pad
1764 // look to see if it is a selector dispatch block.
1765 if (!CatchHandlerMap.count(BB)) {
1766 if (isSelectorDispatch(BB, CatchBlock, Selector, NextBB)) {
1767 CatchHandler *Action = new CatchHandler(BB, Selector, NextBB);
1768 CatchHandlerMap[BB] = Action;
1771 // If we encounter a block containing an llvm.eh.begincatch before we
1772 // find a selector dispatch block, the handler is assumed to be
1773 // reached unconditionally. This happens for catch-all blocks, but
1774 // it can also happen for other catch handlers that have been combined
1775 // with the catch-all handler during optimization.
1776 if (isCatchBlock(BB)) {
1777 PointerType *Int8PtrTy = Type::getInt8PtrTy(BB->getContext());
1778 Constant *NullSelector = ConstantPointerNull::get(Int8PtrTy);
1779 CatchHandler *Action = new CatchHandler(BB, NullSelector, nullptr);
1780 CatchHandlerMap[BB] = Action;
1785 // Visit each successor, looking for the dispatch.
1786 // FIXME: We expect to find the dispatch quickly, so this will probably
1787 // work better as a breadth first search.
1788 for (BasicBlock *Succ : successors(BB)) {
1789 if (VisitedBlocks.count(Succ))
1792 CatchHandler *Action = findCatchHandler(Succ, NextBB, VisitedBlocks);
1799 // These are helper functions to combine repeated code from findCleanupHandlers.
1800 static void createCleanupHandler(LandingPadActions &Actions,
1801 CleanupHandlerMapTy &CleanupHandlerMap,
1803 CleanupHandler *Action = new CleanupHandler(BB);
1804 CleanupHandlerMap[BB] = Action;
1805 Actions.insertCleanupHandler(Action);
1806 DEBUG(dbgs() << " Found cleanup code in block "
1807 << Action->getStartBlock()->getName() << "\n");
1810 static CallSite matchOutlinedFinallyCall(BasicBlock *BB,
1811 Instruction *MaybeCall) {
1812 // Look for finally blocks that Clang has already outlined for us.
1813 // %fp = call i8* @llvm.frameaddress(i32 0)
1814 // call void @"fin$parent"(iN 1, i8* %fp)
1815 if (isFrameAddressCall(MaybeCall) && MaybeCall != BB->getTerminator())
1816 MaybeCall = MaybeCall->getNextNode();
1817 CallSite FinallyCall(MaybeCall);
1818 if (!FinallyCall || FinallyCall.arg_size() != 2)
1820 if (!match(FinallyCall.getArgument(0), m_SpecificInt(1)))
1822 if (!isFrameAddressCall(FinallyCall.getArgument(1)))
1827 static BasicBlock *followSingleUnconditionalBranches(BasicBlock *BB) {
1828 // Skip single ubr blocks.
1829 while (BB->getFirstNonPHIOrDbg() == BB->getTerminator()) {
1830 auto *Br = dyn_cast<BranchInst>(BB->getTerminator());
1831 if (Br && Br->isUnconditional())
1832 BB = Br->getSuccessor(0);
1839 // This function searches starting with the input block for the next block that
1840 // contains code that is not part of a catch handler and would not be eliminated
1841 // during handler outlining.
1843 void WinEHPrepare::findCleanupHandlers(LandingPadActions &Actions,
1844 BasicBlock *StartBB, BasicBlock *EndBB) {
1845 // Here we will skip over the following:
1847 // landing pad prolog:
1849 // Unconditional branches
1851 // Selector dispatch
1855 // Anything else marks the start of an interesting block
1857 BasicBlock *BB = StartBB;
1858 // Anything other than an unconditional branch will kick us out of this loop
1859 // one way or another.
1861 BB = followSingleUnconditionalBranches(BB);
1862 // If we've already scanned this block, don't scan it again. If it is
1863 // a cleanup block, there will be an action in the CleanupHandlerMap.
1864 // If we've scanned it and it is not a cleanup block, there will be a
1865 // nullptr in the CleanupHandlerMap. If we have not scanned it, there will
1866 // be no entry in the CleanupHandlerMap. We must call count() first to
1867 // avoid creating a null entry for blocks we haven't scanned.
1868 if (CleanupHandlerMap.count(BB)) {
1869 if (auto *Action = CleanupHandlerMap[BB]) {
1870 Actions.insertCleanupHandler(Action);
1871 DEBUG(dbgs() << " Found cleanup code in block "
1872 << Action->getStartBlock()->getName() << "\n");
1873 // FIXME: This cleanup might chain into another, and we need to discover
1877 // Here we handle the case where the cleanup handler map contains a
1878 // value for this block but the value is a nullptr. This means that
1879 // we have previously analyzed the block and determined that it did
1880 // not contain any cleanup code. Based on the earlier analysis, we
1881 // know the the block must end in either an unconditional branch, a
1882 // resume or a conditional branch that is predicated on a comparison
1883 // with a selector. Either the resume or the selector dispatch
1884 // would terminate the search for cleanup code, so the unconditional
1885 // branch is the only case for which we might need to continue
1887 BasicBlock *SuccBB = followSingleUnconditionalBranches(BB);
1888 if (SuccBB == BB || SuccBB == EndBB)
1895 // Create an entry in the cleanup handler map for this block. Initially
1896 // we create an entry that says this isn't a cleanup block. If we find
1897 // cleanup code, the caller will replace this entry.
1898 CleanupHandlerMap[BB] = nullptr;
1900 TerminatorInst *Terminator = BB->getTerminator();
1902 // Landing pad blocks have extra instructions we need to accept.
1903 LandingPadMap *LPadMap = nullptr;
1904 if (BB->isLandingPad()) {
1905 LandingPadInst *LPad = BB->getLandingPadInst();
1906 LPadMap = &LPadMaps[LPad];
1907 if (!LPadMap->isInitialized())
1908 LPadMap->mapLandingPad(LPad);
1911 // Look for the bare resume pattern:
1912 // %lpad.val1 = insertvalue { i8*, i32 } undef, i8* %exn, 0
1913 // %lpad.val2 = insertvalue { i8*, i32 } %lpad.val1, i32 %sel, 1
1914 // resume { i8*, i32 } %lpad.val2
1915 if (auto *Resume = dyn_cast<ResumeInst>(Terminator)) {
1916 InsertValueInst *Insert1 = nullptr;
1917 InsertValueInst *Insert2 = nullptr;
1918 Value *ResumeVal = Resume->getOperand(0);
1919 // If the resume value isn't a phi or landingpad value, it should be a
1920 // series of insertions. Identify them so we can avoid them when scanning
1922 if (!isa<PHINode>(ResumeVal) && !isa<LandingPadInst>(ResumeVal)) {
1923 Insert2 = dyn_cast<InsertValueInst>(ResumeVal);
1925 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1926 Insert1 = dyn_cast<InsertValueInst>(Insert2->getAggregateOperand());
1928 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1930 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
1932 Instruction *Inst = II;
1933 if (LPadMap && LPadMap->isLandingPadSpecificInst(Inst))
1935 if (Inst == Insert1 || Inst == Insert2 || Inst == Resume)
1937 if (!Inst->hasOneUse() ||
1938 (Inst->user_back() != Insert1 && Inst->user_back() != Insert2)) {
1939 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1945 BranchInst *Branch = dyn_cast<BranchInst>(Terminator);
1946 if (Branch && Branch->isConditional()) {
1947 // Look for the selector dispatch.
1948 // %2 = call i32 @llvm.eh.typeid.for(i8* bitcast (i8** @_ZTIf to i8*))
1949 // %matches = icmp eq i32 %sel, %2
1950 // br i1 %matches, label %catch14, label %eh.resume
1951 CmpInst *Compare = dyn_cast<CmpInst>(Branch->getCondition());
1952 if (!Compare || !Compare->isEquality())
1953 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1954 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
1956 Instruction *Inst = II;
1957 if (LPadMap && LPadMap->isLandingPadSpecificInst(Inst))
1959 if (Inst == Compare || Inst == Branch)
1961 if (match(Inst, m_Intrinsic<Intrinsic::eh_typeid_for>()))
1963 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1965 // The selector dispatch block should always terminate our search.
1966 assert(BB == EndBB);
1970 if (isAsynchronousEHPersonality(Personality)) {
1971 // If this is a landingpad block, split the block at the first non-landing
1973 Instruction *MaybeCall = BB->getFirstNonPHIOrDbg();
1975 while (MaybeCall != BB->getTerminator() &&
1976 LPadMap->isLandingPadSpecificInst(MaybeCall))
1977 MaybeCall = MaybeCall->getNextNode();
1980 // Look for outlined finally calls.
1981 if (CallSite FinallyCall = matchOutlinedFinallyCall(BB, MaybeCall)) {
1982 Function *Fin = FinallyCall.getCalledFunction();
1983 assert(Fin && "outlined finally call should be direct");
1984 auto *Action = new CleanupHandler(BB);
1985 Action->setHandlerBlockOrFunc(Fin);
1986 Actions.insertCleanupHandler(Action);
1987 CleanupHandlerMap[BB] = Action;
1988 DEBUG(dbgs() << " Found frontend-outlined finally call to "
1989 << Fin->getName() << " in block "
1990 << Action->getStartBlock()->getName() << "\n");
1992 // Split the block if there were more interesting instructions and look
1993 // for finally calls in the normal successor block.
1994 BasicBlock *SuccBB = BB;
1995 if (FinallyCall.getInstruction() != BB->getTerminator() &&
1996 FinallyCall.getInstruction()->getNextNode() != BB->getTerminator()) {
1997 SuccBB = BB->splitBasicBlock(FinallyCall.getInstruction()->getNextNode());
1999 if (FinallyCall.isInvoke()) {
2000 SuccBB = cast<InvokeInst>(FinallyCall.getInstruction())->getNormalDest();
2002 SuccBB = BB->getUniqueSuccessor();
2003 assert(SuccBB && "splitOutlinedFinallyCalls didn't insert a branch");
2013 // Anything else is either a catch block or interesting cleanup code.
2014 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
2016 Instruction *Inst = II;
2017 if (LPadMap && LPadMap->isLandingPadSpecificInst(Inst))
2019 // Unconditional branches fall through to this loop.
2022 // If this is a catch block, there is no cleanup code to be found.
2023 if (match(Inst, m_Intrinsic<Intrinsic::eh_begincatch>()))
2025 // If this a nested landing pad, it may contain an endcatch call.
2026 if (match(Inst, m_Intrinsic<Intrinsic::eh_endcatch>()))
2028 // Anything else makes this interesting cleanup code.
2029 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
2032 // Only unconditional branches in empty blocks should get this far.
2033 assert(Branch && Branch->isUnconditional());
2036 BB = Branch->getSuccessor(0);
2040 // This is a public function, declared in WinEHFuncInfo.h and is also
2041 // referenced by WinEHNumbering in FunctionLoweringInfo.cpp.
2042 void llvm::parseEHActions(const IntrinsicInst *II,
2043 SmallVectorImpl<ActionHandler *> &Actions) {
2044 for (unsigned I = 0, E = II->getNumArgOperands(); I != E;) {
2045 uint64_t ActionKind =
2046 cast<ConstantInt>(II->getArgOperand(I))->getZExtValue();
2047 if (ActionKind == /*catch=*/1) {
2048 auto *Selector = cast<Constant>(II->getArgOperand(I + 1));
2049 ConstantInt *EHObjIndex = cast<ConstantInt>(II->getArgOperand(I + 2));
2050 int64_t EHObjIndexVal = EHObjIndex->getSExtValue();
2051 Constant *Handler = cast<Constant>(II->getArgOperand(I + 3));
2053 auto *CH = new CatchHandler(/*BB=*/nullptr, Selector, /*NextBB=*/nullptr);
2054 CH->setHandlerBlockOrFunc(Handler);
2055 CH->setExceptionVarIndex(EHObjIndexVal);
2056 Actions.push_back(CH);
2057 } else if (ActionKind == 0) {
2058 Constant *Handler = cast<Constant>(II->getArgOperand(I + 1));
2060 auto *CH = new CleanupHandler(/*BB=*/nullptr);
2061 CH->setHandlerBlockOrFunc(Handler);
2062 Actions.push_back(CH);
2064 llvm_unreachable("Expected either a catch or cleanup handler!");
2067 std::reverse(Actions.begin(), Actions.end());