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 // FIXME: Remove this once the backend can handle the prepared IR.
328 SEHPrepare("sehprepare", cl::Hidden,
329 cl::desc("Prepare functions with SEH personalities"));
331 bool WinEHPrepare::runOnFunction(Function &Fn) {
332 // No need to prepare outlined handlers.
333 if (Fn.hasFnAttribute("wineh-parent"))
336 SmallVector<LandingPadInst *, 4> LPads;
337 SmallVector<ResumeInst *, 4> Resumes;
338 for (BasicBlock &BB : Fn) {
339 if (auto *LP = BB.getLandingPadInst())
341 if (auto *Resume = dyn_cast<ResumeInst>(BB.getTerminator()))
342 Resumes.push_back(Resume);
345 // No need to prepare functions that lack landing pads.
349 // Classify the personality to see what kind of preparation we need.
350 Personality = classifyEHPersonality(LPads.back()->getPersonalityFn());
352 // Do nothing if this is not an MSVC personality.
353 if (!isMSVCEHPersonality(Personality))
356 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
358 if (isAsynchronousEHPersonality(Personality) && !SEHPrepare) {
359 // Replace all resume instructions with unreachable.
360 // FIXME: Remove this once the backend can handle the prepared IR.
361 for (ResumeInst *Resume : Resumes) {
362 IRBuilder<>(Resume).CreateUnreachable();
363 Resume->eraseFromParent();
368 // If there were any landing pads, prepareExceptionHandlers will make changes.
369 prepareExceptionHandlers(Fn, LPads);
373 bool WinEHPrepare::doFinalization(Module &M) { return false; }
375 void WinEHPrepare::getAnalysisUsage(AnalysisUsage &AU) const {
376 AU.addRequired<DominatorTreeWrapperPass>();
379 static bool isSelectorDispatch(BasicBlock *BB, BasicBlock *&CatchHandler,
380 Constant *&Selector, BasicBlock *&NextBB);
382 // Finds blocks reachable from the starting set Worklist. Does not follow unwind
383 // edges or blocks listed in StopPoints.
384 static void findReachableBlocks(SmallPtrSetImpl<BasicBlock *> &ReachableBBs,
385 SetVector<BasicBlock *> &Worklist,
386 const SetVector<BasicBlock *> *StopPoints) {
387 while (!Worklist.empty()) {
388 BasicBlock *BB = Worklist.pop_back_val();
390 // Don't cross blocks that we should stop at.
391 if (StopPoints && StopPoints->count(BB))
394 if (!ReachableBBs.insert(BB).second)
395 continue; // Already visited.
397 // Don't follow unwind edges of invokes.
398 if (auto *II = dyn_cast<InvokeInst>(BB->getTerminator())) {
399 Worklist.insert(II->getNormalDest());
403 // Otherwise, follow all successors.
404 Worklist.insert(succ_begin(BB), succ_end(BB));
408 /// Find all points where exceptional control rejoins normal control flow via
409 /// llvm.eh.endcatch. Add them to the normal bb reachability worklist.
410 static void findCXXEHReturnPoints(Function &F,
411 SetVector<BasicBlock *> &EHReturnBlocks) {
412 for (auto BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) {
413 BasicBlock *BB = BBI;
414 for (Instruction &I : *BB) {
415 if (match(&I, m_Intrinsic<Intrinsic::eh_endcatch>())) {
416 // Split the block after the call to llvm.eh.endcatch if there is
417 // anything other than an unconditional branch, or if the successor
418 // starts with a phi.
419 auto *Br = dyn_cast<BranchInst>(I.getNextNode());
420 if (!Br || !Br->isUnconditional() ||
421 isa<PHINode>(Br->getSuccessor(0)->begin())) {
422 DEBUG(dbgs() << "splitting block " << BB->getName()
423 << " with llvm.eh.endcatch\n");
424 BBI = BB->splitBasicBlock(I.getNextNode(), "ehreturn");
426 // The next BB is normal control flow.
427 EHReturnBlocks.insert(BB->getTerminator()->getSuccessor(0));
434 static bool isCatchAllLandingPad(const BasicBlock *BB) {
435 const LandingPadInst *LP = BB->getLandingPadInst();
438 unsigned N = LP->getNumClauses();
439 return (N > 0 && LP->isCatch(N - 1) &&
440 isa<ConstantPointerNull>(LP->getClause(N - 1)));
443 /// Find all points where exceptions control rejoins normal control flow via
444 /// selector dispatch.
445 static void findSEHEHReturnPoints(Function &F,
446 SetVector<BasicBlock *> &EHReturnBlocks) {
447 for (auto BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) {
448 BasicBlock *BB = BBI;
449 // If the landingpad is a catch-all, treat the whole lpad as if it is
450 // reachable from normal control flow.
451 // FIXME: This is imprecise. We need a better way of identifying where a
452 // catch-all starts and cleanups stop. As far as LLVM is concerned, there
454 if (isCatchAllLandingPad(BB)) {
455 EHReturnBlocks.insert(BB);
459 BasicBlock *CatchHandler;
462 if (isSelectorDispatch(BB, CatchHandler, Selector, NextBB)) {
463 // Split the edge if there is a phi node. Returning from EH to a phi node
464 // is just as impossible as having a phi after an indirectbr.
465 if (isa<PHINode>(CatchHandler->begin())) {
466 DEBUG(dbgs() << "splitting EH return edge from " << BB->getName()
467 << " to " << CatchHandler->getName() << '\n');
468 BBI = CatchHandler = SplitCriticalEdge(
469 BB, std::find(succ_begin(BB), succ_end(BB), CatchHandler));
471 EHReturnBlocks.insert(CatchHandler);
476 /// Ensure that all values live into and out of exception handlers are stored
478 /// FIXME: This falls down when values are defined in one handler and live into
479 /// another handler. For example, a cleanup defines a value used only by a
481 void WinEHPrepare::demoteValuesLiveAcrossHandlers(
482 Function &F, SmallVectorImpl<LandingPadInst *> &LPads) {
483 DEBUG(dbgs() << "Demoting values live across exception handlers in function "
484 << F.getName() << '\n');
486 // Build a set of all non-exceptional blocks and exceptional blocks.
487 // - Non-exceptional blocks are blocks reachable from the entry block while
488 // not following invoke unwind edges.
489 // - Exceptional blocks are blocks reachable from landingpads. Analysis does
490 // not follow llvm.eh.endcatch blocks, which mark a transition from
491 // exceptional to normal control.
492 SmallPtrSet<BasicBlock *, 4> NormalBlocks;
493 SmallPtrSet<BasicBlock *, 4> EHBlocks;
494 SetVector<BasicBlock *> EHReturnBlocks;
495 SetVector<BasicBlock *> Worklist;
497 if (Personality == EHPersonality::MSVC_CXX)
498 findCXXEHReturnPoints(F, EHReturnBlocks);
500 findSEHEHReturnPoints(F, EHReturnBlocks);
503 dbgs() << "identified the following blocks as EH return points:\n";
504 for (BasicBlock *BB : EHReturnBlocks)
505 dbgs() << " " << BB->getName() << '\n';
508 // Join points should not have phis at this point, unless they are a
509 // landingpad, in which case we will demote their phis later.
511 for (BasicBlock *BB : EHReturnBlocks)
512 assert((BB->isLandingPad() || !isa<PHINode>(BB->begin())) &&
513 "non-lpad EH return block has phi");
516 // Normal blocks are the blocks reachable from the entry block and all EH
518 Worklist = EHReturnBlocks;
519 Worklist.insert(&F.getEntryBlock());
520 findReachableBlocks(NormalBlocks, Worklist, nullptr);
522 dbgs() << "marked the following blocks as normal:\n";
523 for (BasicBlock *BB : NormalBlocks)
524 dbgs() << " " << BB->getName() << '\n';
527 // Exceptional blocks are the blocks reachable from landingpads that don't
528 // cross EH return points.
530 for (auto *LPI : LPads)
531 Worklist.insert(LPI->getParent());
532 findReachableBlocks(EHBlocks, Worklist, &EHReturnBlocks);
534 dbgs() << "marked the following blocks as exceptional:\n";
535 for (BasicBlock *BB : EHBlocks)
536 dbgs() << " " << BB->getName() << '\n';
539 SetVector<Argument *> ArgsToDemote;
540 SetVector<Instruction *> InstrsToDemote;
541 for (BasicBlock &BB : F) {
542 bool IsNormalBB = NormalBlocks.count(&BB);
543 bool IsEHBB = EHBlocks.count(&BB);
544 if (!IsNormalBB && !IsEHBB)
545 continue; // Blocks that are neither normal nor EH are unreachable.
546 for (Instruction &I : BB) {
547 for (Value *Op : I.operands()) {
548 // Don't demote static allocas, constants, and labels.
549 if (isa<Constant>(Op) || isa<BasicBlock>(Op) || isa<InlineAsm>(Op))
551 auto *AI = dyn_cast<AllocaInst>(Op);
552 if (AI && AI->isStaticAlloca())
555 if (auto *Arg = dyn_cast<Argument>(Op)) {
557 DEBUG(dbgs() << "Demoting argument " << *Arg
558 << " used by EH instr: " << I << "\n");
559 ArgsToDemote.insert(Arg);
564 auto *OpI = cast<Instruction>(Op);
565 BasicBlock *OpBB = OpI->getParent();
566 // If a value is produced and consumed in the same BB, we don't need to
570 bool IsOpNormalBB = NormalBlocks.count(OpBB);
571 bool IsOpEHBB = EHBlocks.count(OpBB);
572 if (IsNormalBB != IsOpNormalBB || IsEHBB != IsOpEHBB) {
574 dbgs() << "Demoting instruction live in-out from EH:\n";
575 dbgs() << "Instr: " << *OpI << '\n';
576 dbgs() << "User: " << I << '\n';
578 InstrsToDemote.insert(OpI);
584 // Demote values live into and out of handlers.
585 // FIXME: This demotion is inefficient. We should insert spills at the point
586 // of definition, insert one reload in each handler that uses the value, and
587 // insert reloads in the BB used to rejoin normal control flow.
588 Instruction *AllocaInsertPt = F.getEntryBlock().getFirstInsertionPt();
589 for (Instruction *I : InstrsToDemote)
590 DemoteRegToStack(*I, false, AllocaInsertPt);
592 // Demote arguments separately, and only for uses in EH blocks.
593 for (Argument *Arg : ArgsToDemote) {
594 auto *Slot = new AllocaInst(Arg->getType(), nullptr,
595 Arg->getName() + ".reg2mem", AllocaInsertPt);
596 SmallVector<User *, 4> Users(Arg->user_begin(), Arg->user_end());
597 for (User *U : Users) {
598 auto *I = dyn_cast<Instruction>(U);
599 if (I && EHBlocks.count(I->getParent())) {
600 auto *Reload = new LoadInst(Slot, Arg->getName() + ".reload", false, I);
601 U->replaceUsesOfWith(Arg, Reload);
604 new StoreInst(Arg, Slot, AllocaInsertPt);
607 // Demote landingpad phis, as the landingpad will be removed from the machine
609 for (LandingPadInst *LPI : LPads) {
610 BasicBlock *BB = LPI->getParent();
611 while (auto *Phi = dyn_cast<PHINode>(BB->begin()))
612 DemotePHIToStack(Phi, AllocaInsertPt);
615 DEBUG(dbgs() << "Demoted " << InstrsToDemote.size() << " instructions and "
616 << ArgsToDemote.size() << " arguments for WinEHPrepare\n\n");
619 bool WinEHPrepare::prepareExceptionHandlers(
620 Function &F, SmallVectorImpl<LandingPadInst *> &LPads) {
621 // Don't run on functions that are already prepared.
622 for (LandingPadInst *LPad : LPads) {
623 BasicBlock *LPadBB = LPad->getParent();
624 for (Instruction &Inst : *LPadBB)
625 if (match(&Inst, m_Intrinsic<Intrinsic::eh_actions>()))
629 demoteValuesLiveAcrossHandlers(F, LPads);
631 // These containers are used to re-map frame variables that are used in
632 // outlined catch and cleanup handlers. They will be populated as the
633 // handlers are outlined.
634 FrameVarInfoMap FrameVarInfo;
636 bool HandlersOutlined = false;
638 Module *M = F.getParent();
639 LLVMContext &Context = M->getContext();
641 // Create a new function to receive the handler contents.
642 PointerType *Int8PtrType = Type::getInt8PtrTy(Context);
643 Type *Int32Type = Type::getInt32Ty(Context);
644 Function *ActionIntrin = Intrinsic::getDeclaration(M, Intrinsic::eh_actions);
646 for (LandingPadInst *LPad : LPads) {
647 // Look for evidence that this landingpad has already been processed.
648 bool LPadHasActionList = false;
649 BasicBlock *LPadBB = LPad->getParent();
650 for (Instruction &Inst : *LPadBB) {
651 if (match(&Inst, m_Intrinsic<Intrinsic::eh_actions>())) {
652 LPadHasActionList = true;
657 // If we've already outlined the handlers for this landingpad,
658 // there's nothing more to do here.
659 if (LPadHasActionList)
662 // If either of the values in the aggregate returned by the landing pad is
663 // extracted and stored to memory, promote the stored value to a register.
664 promoteLandingPadValues(LPad);
666 LandingPadActions Actions;
667 mapLandingPadBlocks(LPad, Actions);
669 HandlersOutlined |= !Actions.actions().empty();
670 for (ActionHandler *Action : Actions) {
671 if (Action->hasBeenProcessed())
673 BasicBlock *StartBB = Action->getStartBlock();
675 // SEH doesn't do any outlining for catches. Instead, pass the handler
676 // basic block addr to llvm.eh.actions and list the block as a return
678 if (isAsynchronousEHPersonality(Personality)) {
679 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
680 processSEHCatchHandler(CatchAction, StartBB);
685 outlineHandler(Action, &F, LPad, StartBB, FrameVarInfo);
688 // Replace the landing pad with a new llvm.eh.action based landing pad.
689 BasicBlock *NewLPadBB = BasicBlock::Create(Context, "lpad", &F, LPadBB);
690 assert(!isa<PHINode>(LPadBB->begin()));
691 auto *NewLPad = cast<LandingPadInst>(LPad->clone());
692 NewLPadBB->getInstList().push_back(NewLPad);
693 while (!pred_empty(LPadBB)) {
694 auto *pred = *pred_begin(LPadBB);
695 InvokeInst *Invoke = cast<InvokeInst>(pred->getTerminator());
696 Invoke->setUnwindDest(NewLPadBB);
699 // If anyone is still using the old landingpad value, just give them undef
700 // instead. The eh pointer and selector values are not real.
701 LPad->replaceAllUsesWith(UndefValue::get(LPad->getType()));
703 // Replace the mapping of any nested landing pad that previously mapped
704 // to this landing pad with a referenced to the cloned version.
705 for (auto &LPadPair : NestedLPtoOriginalLP) {
706 const LandingPadInst *OriginalLPad = LPadPair.second;
707 if (OriginalLPad == LPad) {
708 LPadPair.second = NewLPad;
712 // Replace uses of the old lpad in phis with this block and delete the old
714 LPadBB->replaceSuccessorsPhiUsesWith(NewLPadBB);
715 LPadBB->getTerminator()->eraseFromParent();
716 new UnreachableInst(LPadBB->getContext(), LPadBB);
718 // Add a call to describe the actions for this landing pad.
719 std::vector<Value *> ActionArgs;
720 for (ActionHandler *Action : Actions) {
721 // Action codes from docs are: 0 cleanup, 1 catch.
722 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
723 ActionArgs.push_back(ConstantInt::get(Int32Type, 1));
724 ActionArgs.push_back(CatchAction->getSelector());
725 // Find the frame escape index of the exception object alloca in the
727 int FrameEscapeIdx = -1;
728 Value *EHObj = const_cast<Value *>(CatchAction->getExceptionVar());
729 if (EHObj && !isa<ConstantPointerNull>(EHObj)) {
730 auto I = FrameVarInfo.find(EHObj);
731 assert(I != FrameVarInfo.end() &&
732 "failed to map llvm.eh.begincatch var");
733 FrameEscapeIdx = std::distance(FrameVarInfo.begin(), I);
735 ActionArgs.push_back(ConstantInt::get(Int32Type, FrameEscapeIdx));
737 ActionArgs.push_back(ConstantInt::get(Int32Type, 0));
739 ActionArgs.push_back(Action->getHandlerBlockOrFunc());
742 CallInst::Create(ActionIntrin, ActionArgs, "recover", NewLPadBB);
744 // Add an indirect branch listing possible successors of the catch handlers.
745 SetVector<BasicBlock *> ReturnTargets;
746 for (ActionHandler *Action : Actions) {
747 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
748 const auto &CatchTargets = CatchAction->getReturnTargets();
749 ReturnTargets.insert(CatchTargets.begin(), CatchTargets.end());
752 IndirectBrInst *Branch =
753 IndirectBrInst::Create(Recover, ReturnTargets.size(), NewLPadBB);
754 for (BasicBlock *Target : ReturnTargets)
755 Branch->addDestination(Target);
756 } // End for each landingpad
758 // If nothing got outlined, there is no more processing to be done.
759 if (!HandlersOutlined)
762 // Replace any nested landing pad stubs with the correct action handler.
763 // This must be done before we remove unreachable blocks because it
764 // cleans up references to outlined blocks that will be deleted.
765 for (auto &LPadPair : NestedLPtoOriginalLP)
766 completeNestedLandingPad(&F, LPadPair.first, LPadPair.second, FrameVarInfo);
767 NestedLPtoOriginalLP.clear();
769 F.addFnAttr("wineh-parent", F.getName());
771 // Delete any blocks that were only used by handlers that were outlined above.
772 removeUnreachableBlocks(F);
774 BasicBlock *Entry = &F.getEntryBlock();
775 IRBuilder<> Builder(F.getParent()->getContext());
776 Builder.SetInsertPoint(Entry->getFirstInsertionPt());
778 Function *FrameEscapeFn =
779 Intrinsic::getDeclaration(M, Intrinsic::frameescape);
780 Function *RecoverFrameFn =
781 Intrinsic::getDeclaration(M, Intrinsic::framerecover);
782 SmallVector<Value *, 8> AllocasToEscape;
784 // Scan the entry block for an existing call to llvm.frameescape. We need to
785 // keep escaping those objects.
786 for (Instruction &I : F.front()) {
787 auto *II = dyn_cast<IntrinsicInst>(&I);
788 if (II && II->getIntrinsicID() == Intrinsic::frameescape) {
789 auto Args = II->arg_operands();
790 AllocasToEscape.append(Args.begin(), Args.end());
791 II->eraseFromParent();
796 // Finally, replace all of the temporary allocas for frame variables used in
797 // the outlined handlers with calls to llvm.framerecover.
798 for (auto &VarInfoEntry : FrameVarInfo) {
799 Value *ParentVal = VarInfoEntry.first;
800 TinyPtrVector<AllocaInst *> &Allocas = VarInfoEntry.second;
801 AllocaInst *ParentAlloca = cast<AllocaInst>(ParentVal);
803 // FIXME: We should try to sink unescaped allocas from the parent frame into
804 // the child frame. If the alloca is escaped, we have to use the lifetime
805 // markers to ensure that the alloca is only live within the child frame.
807 // Add this alloca to the list of things to escape.
808 AllocasToEscape.push_back(ParentAlloca);
810 // Next replace all outlined allocas that are mapped to it.
811 for (AllocaInst *TempAlloca : Allocas) {
812 if (TempAlloca == getCatchObjectSentinel())
813 continue; // Skip catch parameter sentinels.
814 Function *HandlerFn = TempAlloca->getParent()->getParent();
815 // FIXME: Sink this GEP into the blocks where it is used.
816 Builder.SetInsertPoint(TempAlloca);
817 Builder.SetCurrentDebugLocation(TempAlloca->getDebugLoc());
818 Value *RecoverArgs[] = {
819 Builder.CreateBitCast(&F, Int8PtrType, ""),
820 &(HandlerFn->getArgumentList().back()),
821 llvm::ConstantInt::get(Int32Type, AllocasToEscape.size() - 1)};
822 Value *RecoveredAlloca = Builder.CreateCall(RecoverFrameFn, RecoverArgs);
823 // Add a pointer bitcast if the alloca wasn't an i8.
824 if (RecoveredAlloca->getType() != TempAlloca->getType()) {
825 RecoveredAlloca->setName(Twine(TempAlloca->getName()) + ".i8");
827 Builder.CreateBitCast(RecoveredAlloca, TempAlloca->getType());
829 TempAlloca->replaceAllUsesWith(RecoveredAlloca);
830 TempAlloca->removeFromParent();
831 RecoveredAlloca->takeName(TempAlloca);
834 } // End for each FrameVarInfo entry.
836 // Insert 'call void (...)* @llvm.frameescape(...)' at the end of the entry
838 Builder.SetInsertPoint(&F.getEntryBlock().back());
839 Builder.CreateCall(FrameEscapeFn, AllocasToEscape);
841 // Clean up the handler action maps we created for this function
842 DeleteContainerSeconds(CatchHandlerMap);
843 CatchHandlerMap.clear();
844 DeleteContainerSeconds(CleanupHandlerMap);
845 CleanupHandlerMap.clear();
847 return HandlersOutlined;
850 void WinEHPrepare::promoteLandingPadValues(LandingPadInst *LPad) {
851 // If the return values of the landing pad instruction are extracted and
852 // stored to memory, we want to promote the store locations to reg values.
853 SmallVector<AllocaInst *, 2> EHAllocas;
855 // The landingpad instruction returns an aggregate value. Typically, its
856 // value will be passed to a pair of extract value instructions and the
857 // results of those extracts are often passed to store instructions.
858 // In unoptimized code the stored value will often be loaded and then stored
860 for (auto *U : LPad->users()) {
861 ExtractValueInst *Extract = dyn_cast<ExtractValueInst>(U);
865 for (auto *EU : Extract->users()) {
866 if (auto *Store = dyn_cast<StoreInst>(EU)) {
867 auto *AV = cast<AllocaInst>(Store->getPointerOperand());
868 EHAllocas.push_back(AV);
873 // We can't do this without a dominator tree.
876 if (!EHAllocas.empty()) {
877 PromoteMemToReg(EHAllocas, *DT);
881 // After promotion, some extracts may be trivially dead. Remove them.
882 SmallVector<Value *, 4> Users(LPad->user_begin(), LPad->user_end());
883 for (auto *U : Users)
884 RecursivelyDeleteTriviallyDeadInstructions(U);
887 void WinEHPrepare::completeNestedLandingPad(Function *ParentFn,
888 LandingPadInst *OutlinedLPad,
889 const LandingPadInst *OriginalLPad,
890 FrameVarInfoMap &FrameVarInfo) {
891 // Get the nested block and erase the unreachable instruction that was
892 // temporarily inserted as its terminator.
893 LLVMContext &Context = ParentFn->getContext();
894 BasicBlock *OutlinedBB = OutlinedLPad->getParent();
895 assert(isa<UnreachableInst>(OutlinedBB->getTerminator()));
896 OutlinedBB->getTerminator()->eraseFromParent();
897 // That should leave OutlinedLPad as the last instruction in its block.
898 assert(&OutlinedBB->back() == OutlinedLPad);
900 // The original landing pad will have already had its action intrinsic
901 // built by the outlining loop. We need to clone that into the outlined
902 // location. It may also be necessary to add references to the exception
903 // variables to the outlined handler in which this landing pad is nested
904 // and remap return instructions in the nested handlers that should return
905 // to an address in the outlined handler.
906 Function *OutlinedHandlerFn = OutlinedBB->getParent();
907 BasicBlock::const_iterator II = OriginalLPad;
909 // The instruction after the landing pad should now be a call to eh.actions.
910 const Instruction *Recover = II;
911 assert(match(Recover, m_Intrinsic<Intrinsic::eh_actions>()));
912 IntrinsicInst *EHActions = cast<IntrinsicInst>(Recover->clone());
914 // Remap the exception variables into the outlined function.
915 WinEHFrameVariableMaterializer Materializer(OutlinedHandlerFn, FrameVarInfo);
916 SmallVector<BlockAddress *, 4> ActionTargets;
917 SmallVector<ActionHandler *, 4> ActionList;
918 parseEHActions(EHActions, ActionList);
919 for (auto *Action : ActionList) {
920 auto *Catch = dyn_cast<CatchHandler>(Action);
923 // The dyn_cast to function here selects C++ catch handlers and skips
924 // SEH catch handlers.
925 auto *Handler = dyn_cast<Function>(Catch->getHandlerBlockOrFunc());
928 // Visit all the return instructions, looking for places that return
929 // to a location within OutlinedHandlerFn.
930 for (BasicBlock &NestedHandlerBB : *Handler) {
931 auto *Ret = dyn_cast<ReturnInst>(NestedHandlerBB.getTerminator());
935 // Handler functions must always return a block address.
936 BlockAddress *BA = cast<BlockAddress>(Ret->getReturnValue());
937 // The original target will have been in the main parent function,
938 // but if it is the address of a block that has been outlined, it
939 // should be a block that was outlined into OutlinedHandlerFn.
940 assert(BA->getFunction() == ParentFn);
942 // Ignore targets that aren't part of OutlinedHandlerFn.
943 if (!LPadTargetBlocks.count(BA->getBasicBlock()))
946 // If the return value is the address ofF a block that we
947 // previously outlined into the parent handler function, replace
948 // the return instruction and add the mapped target to the list
949 // of possible return addresses.
950 BasicBlock *MappedBB = LPadTargetBlocks[BA->getBasicBlock()];
951 assert(MappedBB->getParent() == OutlinedHandlerFn);
952 BlockAddress *NewBA = BlockAddress::get(OutlinedHandlerFn, MappedBB);
953 Ret->eraseFromParent();
954 ReturnInst::Create(Context, NewBA, &NestedHandlerBB);
955 ActionTargets.push_back(NewBA);
958 DeleteContainerPointers(ActionList);
960 OutlinedBB->getInstList().push_back(EHActions);
962 // Insert an indirect branch into the outlined landing pad BB.
963 IndirectBrInst *IBr = IndirectBrInst::Create(EHActions, 0, OutlinedBB);
964 // Add the previously collected action targets.
965 for (auto *Target : ActionTargets)
966 IBr->addDestination(Target->getBasicBlock());
969 // This function examines a block to determine whether the block ends with a
970 // conditional branch to a catch handler based on a selector comparison.
971 // This function is used both by the WinEHPrepare::findSelectorComparison() and
972 // WinEHCleanupDirector::handleTypeIdFor().
973 static bool isSelectorDispatch(BasicBlock *BB, BasicBlock *&CatchHandler,
974 Constant *&Selector, BasicBlock *&NextBB) {
975 ICmpInst::Predicate Pred;
976 BasicBlock *TBB, *FBB;
979 if (!match(BB->getTerminator(),
980 m_Br(m_ICmp(Pred, m_Value(LHS), m_Value(RHS)), TBB, FBB)))
984 m_Intrinsic<Intrinsic::eh_typeid_for>(m_Constant(Selector))) &&
985 !match(RHS, m_Intrinsic<Intrinsic::eh_typeid_for>(m_Constant(Selector))))
988 if (Pred == CmpInst::ICMP_EQ) {
994 if (Pred == CmpInst::ICMP_NE) {
1003 static bool isCatchBlock(BasicBlock *BB) {
1004 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
1006 if (match(cast<Value>(II), m_Intrinsic<Intrinsic::eh_begincatch>()))
1012 static BasicBlock *createStubLandingPad(Function *Handler,
1013 Value *PersonalityFn) {
1014 // FIXME: Finish this!
1015 LLVMContext &Context = Handler->getContext();
1016 BasicBlock *StubBB = BasicBlock::Create(Context, "stub");
1017 Handler->getBasicBlockList().push_back(StubBB);
1018 IRBuilder<> Builder(StubBB);
1019 LandingPadInst *LPad = Builder.CreateLandingPad(
1020 llvm::StructType::get(Type::getInt8PtrTy(Context),
1021 Type::getInt32Ty(Context), nullptr),
1023 // Insert a call to llvm.eh.actions so that we don't try to outline this lpad.
1024 Function *ActionIntrin = Intrinsic::getDeclaration(Handler->getParent(),
1025 Intrinsic::eh_actions);
1026 Builder.CreateCall(ActionIntrin, "recover");
1027 LPad->setCleanup(true);
1028 Builder.CreateUnreachable();
1032 // Cycles through the blocks in an outlined handler function looking for an
1033 // invoke instruction and inserts an invoke of llvm.donothing with an empty
1034 // landing pad if none is found. The code that generates the .xdata tables for
1035 // the handler needs at least one landing pad to identify the parent function's
1037 void WinEHPrepare::addStubInvokeToHandlerIfNeeded(Function *Handler,
1038 Value *PersonalityFn) {
1039 ReturnInst *Ret = nullptr;
1040 for (BasicBlock &BB : *Handler) {
1041 TerminatorInst *Terminator = BB.getTerminator();
1042 // If we find an invoke, there is nothing to be done.
1043 auto *II = dyn_cast<InvokeInst>(Terminator);
1046 // If we've already recorded a return instruction, keep looking for invokes.
1049 // If we haven't recorded a return instruction yet, try this terminator.
1050 Ret = dyn_cast<ReturnInst>(Terminator);
1053 // If we got this far, the handler contains no invokes. We should have seen
1054 // at least one return. We'll insert an invoke of llvm.donothing ahead of
1057 BasicBlock *OldRetBB = Ret->getParent();
1058 BasicBlock *NewRetBB = SplitBlock(OldRetBB, Ret);
1059 // SplitBlock adds an unconditional branch instruction at the end of the
1060 // parent block. We want to replace that with an invoke call, so we can
1062 OldRetBB->getTerminator()->eraseFromParent();
1063 BasicBlock *StubLandingPad = createStubLandingPad(Handler, PersonalityFn);
1065 Intrinsic::getDeclaration(Handler->getParent(), Intrinsic::donothing);
1066 InvokeInst::Create(F, NewRetBB, StubLandingPad, None, "", OldRetBB);
1069 bool WinEHPrepare::outlineHandler(ActionHandler *Action, Function *SrcFn,
1070 LandingPadInst *LPad, BasicBlock *StartBB,
1071 FrameVarInfoMap &VarInfo) {
1072 Module *M = SrcFn->getParent();
1073 LLVMContext &Context = M->getContext();
1075 // Create a new function to receive the handler contents.
1076 Type *Int8PtrType = Type::getInt8PtrTy(Context);
1077 std::vector<Type *> ArgTys;
1078 ArgTys.push_back(Int8PtrType);
1079 ArgTys.push_back(Int8PtrType);
1081 if (Action->getType() == Catch) {
1082 FunctionType *FnType = FunctionType::get(Int8PtrType, ArgTys, false);
1083 Handler = Function::Create(FnType, GlobalVariable::InternalLinkage,
1084 SrcFn->getName() + ".catch", M);
1086 FunctionType *FnType =
1087 FunctionType::get(Type::getVoidTy(Context), ArgTys, false);
1088 Handler = Function::Create(FnType, GlobalVariable::InternalLinkage,
1089 SrcFn->getName() + ".cleanup", M);
1092 Handler->addFnAttr("wineh-parent", SrcFn->getName());
1094 // Generate a standard prolog to setup the frame recovery structure.
1095 IRBuilder<> Builder(Context);
1096 BasicBlock *Entry = BasicBlock::Create(Context, "entry");
1097 Handler->getBasicBlockList().push_front(Entry);
1098 Builder.SetInsertPoint(Entry);
1099 Builder.SetCurrentDebugLocation(LPad->getDebugLoc());
1101 std::unique_ptr<WinEHCloningDirectorBase> Director;
1103 ValueToValueMapTy VMap;
1105 LandingPadMap &LPadMap = LPadMaps[LPad];
1106 if (!LPadMap.isInitialized())
1107 LPadMap.mapLandingPad(LPad);
1108 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
1109 Constant *Sel = CatchAction->getSelector();
1110 Director.reset(new WinEHCatchDirector(Handler, Sel, VarInfo, LPadMap,
1111 NestedLPtoOriginalLP));
1112 LPadMap.remapEHValues(VMap, UndefValue::get(Int8PtrType),
1113 ConstantInt::get(Type::getInt32Ty(Context), 1));
1115 Director.reset(new WinEHCleanupDirector(Handler, VarInfo, LPadMap));
1116 LPadMap.remapEHValues(VMap, UndefValue::get(Int8PtrType),
1117 UndefValue::get(Type::getInt32Ty(Context)));
1120 SmallVector<ReturnInst *, 8> Returns;
1121 ClonedCodeInfo OutlinedFunctionInfo;
1123 // If the start block contains PHI nodes, we need to map them.
1124 BasicBlock::iterator II = StartBB->begin();
1125 while (auto *PN = dyn_cast<PHINode>(II)) {
1126 bool Mapped = false;
1127 // Look for PHI values that we have already mapped (such as the selector).
1128 for (Value *Val : PN->incoming_values()) {
1129 if (VMap.count(Val)) {
1130 VMap[PN] = VMap[Val];
1134 // If we didn't find a match for this value, map it as an undef.
1136 VMap[PN] = UndefValue::get(PN->getType());
1141 // The landing pad value may be used by PHI nodes. It will ultimately be
1142 // eliminated, but we need it in the map for intermediate handling.
1143 VMap[LPad] = UndefValue::get(LPad->getType());
1145 // Skip over PHIs and, if applicable, landingpad instructions.
1146 II = StartBB->getFirstInsertionPt();
1148 CloneAndPruneIntoFromInst(Handler, SrcFn, II, VMap,
1149 /*ModuleLevelChanges=*/false, Returns, "",
1150 &OutlinedFunctionInfo, Director.get());
1152 // Move all the instructions in the first cloned block into our entry block.
1153 BasicBlock *FirstClonedBB = std::next(Function::iterator(Entry));
1154 Entry->getInstList().splice(Entry->end(), FirstClonedBB->getInstList());
1155 FirstClonedBB->eraseFromParent();
1157 // Make sure we can identify the handler's personality later.
1158 addStubInvokeToHandlerIfNeeded(Handler, LPad->getPersonalityFn());
1160 if (auto *CatchAction = dyn_cast<CatchHandler>(Action)) {
1161 WinEHCatchDirector *CatchDirector =
1162 reinterpret_cast<WinEHCatchDirector *>(Director.get());
1163 CatchAction->setExceptionVar(CatchDirector->getExceptionVar());
1164 CatchAction->setReturnTargets(CatchDirector->getReturnTargets());
1166 // Look for blocks that are not part of the landing pad that we just
1167 // outlined but terminate with a call to llvm.eh.endcatch and a
1168 // branch to a block that is in the handler we just outlined.
1169 // These blocks will be part of a nested landing pad that intends to
1170 // return to an address in this handler. This case is best handled
1171 // after both landing pads have been outlined, so for now we'll just
1172 // save the association of the blocks in LPadTargetBlocks. The
1173 // return instructions which are created from these branches will be
1174 // replaced after all landing pads have been outlined.
1175 for (const auto MapEntry : VMap) {
1176 // VMap maps all values and blocks that were just cloned, but dead
1177 // blocks which were pruned will map to nullptr.
1178 if (!isa<BasicBlock>(MapEntry.first) || MapEntry.second == nullptr)
1180 const BasicBlock *MappedBB = cast<BasicBlock>(MapEntry.first);
1181 for (auto *Pred : predecessors(const_cast<BasicBlock *>(MappedBB))) {
1182 auto *Branch = dyn_cast<BranchInst>(Pred->getTerminator());
1183 if (!Branch || !Branch->isUnconditional() || Pred->size() <= 1)
1185 BasicBlock::iterator II = const_cast<BranchInst *>(Branch);
1187 if (match(cast<Value>(II), m_Intrinsic<Intrinsic::eh_endcatch>())) {
1188 // This would indicate that a nested landing pad wants to return
1189 // to a block that is outlined into two different handlers.
1190 assert(!LPadTargetBlocks.count(MappedBB));
1191 LPadTargetBlocks[MappedBB] = cast<BasicBlock>(MapEntry.second);
1195 } // End if (CatchAction)
1197 Action->setHandlerBlockOrFunc(Handler);
1202 /// This BB must end in a selector dispatch. All we need to do is pass the
1203 /// handler block to llvm.eh.actions and list it as a possible indirectbr
1205 void WinEHPrepare::processSEHCatchHandler(CatchHandler *CatchAction,
1206 BasicBlock *StartBB) {
1207 BasicBlock *HandlerBB;
1210 bool Res = isSelectorDispatch(StartBB, HandlerBB, Selector, NextBB);
1212 // If this was EH dispatch, this must be a conditional branch to the handler
1214 // FIXME: Handle instructions in the dispatch block. Currently we drop them,
1215 // leading to crashes if some optimization hoists stuff here.
1216 assert(CatchAction->getSelector() && HandlerBB &&
1217 "expected catch EH dispatch");
1219 // This must be a catch-all. Split the block after the landingpad.
1220 assert(CatchAction->getSelector()->isNullValue() && "expected catch-all");
1222 StartBB->splitBasicBlock(StartBB->getFirstInsertionPt(), "catch.all");
1224 CatchAction->setHandlerBlockOrFunc(BlockAddress::get(HandlerBB));
1225 TinyPtrVector<BasicBlock *> Targets(HandlerBB);
1226 CatchAction->setReturnTargets(Targets);
1229 void LandingPadMap::mapLandingPad(const LandingPadInst *LPad) {
1230 // Each instance of this class should only ever be used to map a single
1232 assert(OriginLPad == nullptr || OriginLPad == LPad);
1234 // If the landing pad has already been mapped, there's nothing more to do.
1235 if (OriginLPad == LPad)
1240 // The landingpad instruction returns an aggregate value. Typically, its
1241 // value will be passed to a pair of extract value instructions and the
1242 // results of those extracts will have been promoted to reg values before
1243 // this routine is called.
1244 for (auto *U : LPad->users()) {
1245 const ExtractValueInst *Extract = dyn_cast<ExtractValueInst>(U);
1248 assert(Extract->getNumIndices() == 1 &&
1249 "Unexpected operation: extracting both landing pad values");
1250 unsigned int Idx = *(Extract->idx_begin());
1251 assert((Idx == 0 || Idx == 1) &&
1252 "Unexpected operation: extracting an unknown landing pad element");
1254 ExtractedEHPtrs.push_back(Extract);
1255 } else if (Idx == 1) {
1256 ExtractedSelectors.push_back(Extract);
1261 bool LandingPadMap::isOriginLandingPadBlock(const BasicBlock *BB) const {
1262 return BB->getLandingPadInst() == OriginLPad;
1265 bool LandingPadMap::isLandingPadSpecificInst(const Instruction *Inst) const {
1266 if (Inst == OriginLPad)
1268 for (auto *Extract : ExtractedEHPtrs) {
1269 if (Inst == Extract)
1272 for (auto *Extract : ExtractedSelectors) {
1273 if (Inst == Extract)
1279 void LandingPadMap::remapEHValues(ValueToValueMapTy &VMap, Value *EHPtrValue,
1280 Value *SelectorValue) const {
1281 // Remap all landing pad extract instructions to the specified values.
1282 for (auto *Extract : ExtractedEHPtrs)
1283 VMap[Extract] = EHPtrValue;
1284 for (auto *Extract : ExtractedSelectors)
1285 VMap[Extract] = SelectorValue;
1288 static bool isFrameAddressCall(const Value *V) {
1289 return match(const_cast<Value *>(V),
1290 m_Intrinsic<Intrinsic::frameaddress>(m_SpecificInt(0)));
1293 CloningDirector::CloningAction WinEHCloningDirectorBase::handleInstruction(
1294 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1295 // If this is one of the boilerplate landing pad instructions, skip it.
1296 // The instruction will have already been remapped in VMap.
1297 if (LPadMap.isLandingPadSpecificInst(Inst))
1298 return CloningDirector::SkipInstruction;
1300 // Nested landing pads will be cloned as stubs, with just the
1301 // landingpad instruction and an unreachable instruction. When
1302 // all landingpads have been outlined, we'll replace this with the
1303 // llvm.eh.actions call and indirect branch created when the
1304 // landing pad was outlined.
1305 if (auto *LPad = dyn_cast<LandingPadInst>(Inst)) {
1306 return handleLandingPad(VMap, LPad, NewBB);
1309 if (auto *Invoke = dyn_cast<InvokeInst>(Inst))
1310 return handleInvoke(VMap, Invoke, NewBB);
1312 if (auto *Resume = dyn_cast<ResumeInst>(Inst))
1313 return handleResume(VMap, Resume, NewBB);
1315 if (auto *Cmp = dyn_cast<CmpInst>(Inst))
1316 return handleCompare(VMap, Cmp, NewBB);
1318 if (match(Inst, m_Intrinsic<Intrinsic::eh_begincatch>()))
1319 return handleBeginCatch(VMap, Inst, NewBB);
1320 if (match(Inst, m_Intrinsic<Intrinsic::eh_endcatch>()))
1321 return handleEndCatch(VMap, Inst, NewBB);
1322 if (match(Inst, m_Intrinsic<Intrinsic::eh_typeid_for>()))
1323 return handleTypeIdFor(VMap, Inst, NewBB);
1325 // When outlining llvm.frameaddress(i32 0), remap that to the second argument,
1326 // which is the FP of the parent.
1327 if (isFrameAddressCall(Inst)) {
1328 VMap[Inst] = EstablisherFrame;
1329 return CloningDirector::SkipInstruction;
1332 // Continue with the default cloning behavior.
1333 return CloningDirector::CloneInstruction;
1336 CloningDirector::CloningAction WinEHCatchDirector::handleLandingPad(
1337 ValueToValueMapTy &VMap, const LandingPadInst *LPad, BasicBlock *NewBB) {
1338 Instruction *NewInst = LPad->clone();
1339 if (LPad->hasName())
1340 NewInst->setName(LPad->getName());
1341 // Save this correlation for later processing.
1342 NestedLPtoOriginalLP[cast<LandingPadInst>(NewInst)] = LPad;
1343 VMap[LPad] = NewInst;
1344 BasicBlock::InstListType &InstList = NewBB->getInstList();
1345 InstList.push_back(NewInst);
1346 InstList.push_back(new UnreachableInst(NewBB->getContext()));
1347 return CloningDirector::StopCloningBB;
1350 CloningDirector::CloningAction WinEHCatchDirector::handleBeginCatch(
1351 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1352 // The argument to the call is some form of the first element of the
1353 // landingpad aggregate value, but that doesn't matter. It isn't used
1355 // The second argument is an outparameter where the exception object will be
1356 // stored. Typically the exception object is a scalar, but it can be an
1357 // aggregate when catching by value.
1358 // FIXME: Leave something behind to indicate where the exception object lives
1359 // for this handler. Should it be part of llvm.eh.actions?
1360 assert(ExceptionObjectVar == nullptr && "Multiple calls to "
1361 "llvm.eh.begincatch found while "
1362 "outlining catch handler.");
1363 ExceptionObjectVar = Inst->getOperand(1)->stripPointerCasts();
1364 if (isa<ConstantPointerNull>(ExceptionObjectVar))
1365 return CloningDirector::SkipInstruction;
1366 assert(cast<AllocaInst>(ExceptionObjectVar)->isStaticAlloca() &&
1367 "catch parameter is not static alloca");
1368 Materializer.escapeCatchObject(ExceptionObjectVar);
1369 return CloningDirector::SkipInstruction;
1372 CloningDirector::CloningAction
1373 WinEHCatchDirector::handleEndCatch(ValueToValueMapTy &VMap,
1374 const Instruction *Inst, BasicBlock *NewBB) {
1375 auto *IntrinCall = dyn_cast<IntrinsicInst>(Inst);
1376 // It might be interesting to track whether or not we are inside a catch
1377 // function, but that might make the algorithm more brittle than it needs
1380 // The end catch call can occur in one of two places: either in a
1381 // landingpad block that is part of the catch handlers exception mechanism,
1382 // or at the end of the catch block. However, a catch-all handler may call
1383 // end catch from the original landing pad. If the call occurs in a nested
1384 // landing pad block, we must skip it and continue so that the landing pad
1386 auto *ParentBB = IntrinCall->getParent();
1387 if (ParentBB->isLandingPad() && !LPadMap.isOriginLandingPadBlock(ParentBB))
1388 return CloningDirector::SkipInstruction;
1390 // If an end catch occurs anywhere else we want to terminate the handler
1391 // with a return to the code that follows the endcatch call. If the
1392 // next instruction is not an unconditional branch, we need to split the
1393 // block to provide a clear target for the return instruction.
1394 BasicBlock *ContinueBB;
1395 auto Next = std::next(BasicBlock::const_iterator(IntrinCall));
1396 const BranchInst *Branch = dyn_cast<BranchInst>(Next);
1397 if (!Branch || !Branch->isUnconditional()) {
1398 // We're interrupting the cloning process at this location, so the
1399 // const_cast we're doing here will not cause a problem.
1400 ContinueBB = SplitBlock(const_cast<BasicBlock *>(ParentBB),
1401 const_cast<Instruction *>(cast<Instruction>(Next)));
1403 ContinueBB = Branch->getSuccessor(0);
1406 ReturnInst::Create(NewBB->getContext(), BlockAddress::get(ContinueBB), NewBB);
1407 ReturnTargets.push_back(ContinueBB);
1409 // We just added a terminator to the cloned block.
1410 // Tell the caller to stop processing the current basic block so that
1411 // the branch instruction will be skipped.
1412 return CloningDirector::StopCloningBB;
1415 CloningDirector::CloningAction WinEHCatchDirector::handleTypeIdFor(
1416 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1417 auto *IntrinCall = dyn_cast<IntrinsicInst>(Inst);
1418 Value *Selector = IntrinCall->getArgOperand(0)->stripPointerCasts();
1419 // This causes a replacement that will collapse the landing pad CFG based
1420 // on the filter function we intend to match.
1421 if (Selector == CurrentSelector)
1422 VMap[Inst] = ConstantInt::get(SelectorIDType, 1);
1424 VMap[Inst] = ConstantInt::get(SelectorIDType, 0);
1425 // Tell the caller not to clone this instruction.
1426 return CloningDirector::SkipInstruction;
1429 CloningDirector::CloningAction
1430 WinEHCatchDirector::handleInvoke(ValueToValueMapTy &VMap,
1431 const InvokeInst *Invoke, BasicBlock *NewBB) {
1432 return CloningDirector::CloneInstruction;
1435 CloningDirector::CloningAction
1436 WinEHCatchDirector::handleResume(ValueToValueMapTy &VMap,
1437 const ResumeInst *Resume, BasicBlock *NewBB) {
1438 // Resume instructions shouldn't be reachable from catch handlers.
1439 // We still need to handle it, but it will be pruned.
1440 BasicBlock::InstListType &InstList = NewBB->getInstList();
1441 InstList.push_back(new UnreachableInst(NewBB->getContext()));
1442 return CloningDirector::StopCloningBB;
1445 CloningDirector::CloningAction
1446 WinEHCatchDirector::handleCompare(ValueToValueMapTy &VMap,
1447 const CmpInst *Compare, BasicBlock *NewBB) {
1448 const IntrinsicInst *IntrinCall = nullptr;
1449 if (match(Compare->getOperand(0), m_Intrinsic<Intrinsic::eh_typeid_for>())) {
1450 IntrinCall = dyn_cast<IntrinsicInst>(Compare->getOperand(0));
1451 } else if (match(Compare->getOperand(1), m_Intrinsic<Intrinsic::eh_typeid_for>())) {
1452 IntrinCall = dyn_cast<IntrinsicInst>(Compare->getOperand(1));
1455 Value *Selector = IntrinCall->getArgOperand(0)->stripPointerCasts();
1456 // This causes a replacement that will collapse the landing pad CFG based
1457 // on the filter function we intend to match.
1458 if (Selector == CurrentSelector->stripPointerCasts()) {
1459 VMap[Compare] = ConstantInt::get(SelectorIDType, 1);
1462 VMap[Compare] = ConstantInt::get(SelectorIDType, 0);
1464 return CloningDirector::SkipInstruction;
1466 return CloningDirector::CloneInstruction;
1469 CloningDirector::CloningAction WinEHCleanupDirector::handleLandingPad(
1470 ValueToValueMapTy &VMap, const LandingPadInst *LPad, BasicBlock *NewBB) {
1471 // The MS runtime will terminate the process if an exception occurs in a
1472 // cleanup handler, so we shouldn't encounter landing pads in the actual
1473 // cleanup code, but they may appear in catch blocks. Depending on where
1474 // we started cloning we may see one, but it will get dropped during dead
1476 Instruction *NewInst = new UnreachableInst(NewBB->getContext());
1477 VMap[LPad] = NewInst;
1478 BasicBlock::InstListType &InstList = NewBB->getInstList();
1479 InstList.push_back(NewInst);
1480 return CloningDirector::StopCloningBB;
1483 CloningDirector::CloningAction WinEHCleanupDirector::handleBeginCatch(
1484 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1485 // Cleanup code may flow into catch blocks or the catch block may be part
1486 // of a branch that will be optimized away. We'll insert a return
1487 // instruction now, but it may be pruned before the cloning process is
1489 ReturnInst::Create(NewBB->getContext(), nullptr, NewBB);
1490 return CloningDirector::StopCloningBB;
1493 CloningDirector::CloningAction WinEHCleanupDirector::handleEndCatch(
1494 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1495 // Cleanup handlers nested within catch handlers may begin with a call to
1496 // eh.endcatch. We can just ignore that instruction.
1497 return CloningDirector::SkipInstruction;
1500 CloningDirector::CloningAction WinEHCleanupDirector::handleTypeIdFor(
1501 ValueToValueMapTy &VMap, const Instruction *Inst, BasicBlock *NewBB) {
1502 // If we encounter a selector comparison while cloning a cleanup handler,
1503 // we want to stop cloning immediately. Anything after the dispatch
1504 // will be outlined into a different handler.
1505 BasicBlock *CatchHandler;
1508 if (isSelectorDispatch(const_cast<BasicBlock *>(Inst->getParent()),
1509 CatchHandler, Selector, NextBB)) {
1510 ReturnInst::Create(NewBB->getContext(), nullptr, NewBB);
1511 return CloningDirector::StopCloningBB;
1513 // If eg.typeid.for is called for any other reason, it can be ignored.
1514 VMap[Inst] = ConstantInt::get(SelectorIDType, 0);
1515 return CloningDirector::SkipInstruction;
1518 CloningDirector::CloningAction WinEHCleanupDirector::handleInvoke(
1519 ValueToValueMapTy &VMap, const InvokeInst *Invoke, BasicBlock *NewBB) {
1520 // All invokes in cleanup handlers can be replaced with calls.
1521 SmallVector<Value *, 16> CallArgs(Invoke->op_begin(), Invoke->op_end() - 3);
1522 // Insert a normal call instruction...
1524 CallInst::Create(const_cast<Value *>(Invoke->getCalledValue()), CallArgs,
1525 Invoke->getName(), NewBB);
1526 NewCall->setCallingConv(Invoke->getCallingConv());
1527 NewCall->setAttributes(Invoke->getAttributes());
1528 NewCall->setDebugLoc(Invoke->getDebugLoc());
1529 VMap[Invoke] = NewCall;
1531 // Remap the operands.
1532 llvm::RemapInstruction(NewCall, VMap, RF_None, nullptr, &Materializer);
1534 // Insert an unconditional branch to the normal destination.
1535 BranchInst::Create(Invoke->getNormalDest(), NewBB);
1537 // The unwind destination won't be cloned into the new function, so
1538 // we don't need to clean up its phi nodes.
1540 // We just added a terminator to the cloned block.
1541 // Tell the caller to stop processing the current basic block.
1542 return CloningDirector::CloneSuccessors;
1545 CloningDirector::CloningAction WinEHCleanupDirector::handleResume(
1546 ValueToValueMapTy &VMap, const ResumeInst *Resume, BasicBlock *NewBB) {
1547 ReturnInst::Create(NewBB->getContext(), nullptr, NewBB);
1549 // We just added a terminator to the cloned block.
1550 // Tell the caller to stop processing the current basic block so that
1551 // the branch instruction will be skipped.
1552 return CloningDirector::StopCloningBB;
1555 CloningDirector::CloningAction
1556 WinEHCleanupDirector::handleCompare(ValueToValueMapTy &VMap,
1557 const CmpInst *Compare, BasicBlock *NewBB) {
1558 if (match(Compare->getOperand(0), m_Intrinsic<Intrinsic::eh_typeid_for>()) ||
1559 match(Compare->getOperand(1), m_Intrinsic<Intrinsic::eh_typeid_for>())) {
1560 VMap[Compare] = ConstantInt::get(SelectorIDType, 1);
1561 return CloningDirector::SkipInstruction;
1563 return CloningDirector::CloneInstruction;
1567 WinEHFrameVariableMaterializer::WinEHFrameVariableMaterializer(
1568 Function *OutlinedFn, FrameVarInfoMap &FrameVarInfo)
1569 : FrameVarInfo(FrameVarInfo), Builder(OutlinedFn->getContext()) {
1570 BasicBlock *EntryBB = &OutlinedFn->getEntryBlock();
1571 Builder.SetInsertPoint(EntryBB, EntryBB->getFirstInsertionPt());
1574 Value *WinEHFrameVariableMaterializer::materializeValueFor(Value *V) {
1575 // If we're asked to materialize a static alloca, we temporarily create an
1576 // alloca in the outlined function and add this to the FrameVarInfo map. When
1577 // all the outlining is complete, we'll replace these temporary allocas with
1578 // calls to llvm.framerecover.
1579 if (auto *AV = dyn_cast<AllocaInst>(V)) {
1580 assert(AV->isStaticAlloca() &&
1581 "cannot materialize un-demoted dynamic alloca");
1582 AllocaInst *NewAlloca = dyn_cast<AllocaInst>(AV->clone());
1583 Builder.Insert(NewAlloca, AV->getName());
1584 FrameVarInfo[AV].push_back(NewAlloca);
1588 if (isa<Instruction>(V) || isa<Argument>(V)) {
1589 errs() << "Failed to demote instruction used in exception handler:\n";
1590 errs() << " " << *V << '\n';
1591 report_fatal_error("WinEHPrepare failed to demote instruction");
1594 // Don't materialize other values.
1598 void WinEHFrameVariableMaterializer::escapeCatchObject(Value *V) {
1599 // Catch parameter objects have to live in the parent frame. When we see a use
1600 // of a catch parameter, add a sentinel to the multimap to indicate that it's
1601 // used from another handler. This will prevent us from trying to sink the
1602 // alloca into the handler and ensure that the catch parameter is present in
1603 // the call to llvm.frameescape.
1604 FrameVarInfo[V].push_back(getCatchObjectSentinel());
1607 // This function maps the catch and cleanup handlers that are reachable from the
1608 // specified landing pad. The landing pad sequence will have this basic shape:
1610 // <cleanup handler>
1611 // <selector comparison>
1613 // <cleanup handler>
1614 // <selector comparison>
1616 // <cleanup handler>
1619 // Any of the cleanup slots may be absent. The cleanup slots may be occupied by
1620 // any arbitrary control flow, but all paths through the cleanup code must
1621 // eventually reach the next selector comparison and no path can skip to a
1622 // different selector comparisons, though some paths may terminate abnormally.
1623 // Therefore, we will use a depth first search from the start of any given
1624 // cleanup block and stop searching when we find the next selector comparison.
1626 // If the landingpad instruction does not have a catch clause, we will assume
1627 // that any instructions other than selector comparisons and catch handlers can
1628 // be ignored. In practice, these will only be the boilerplate instructions.
1630 // The catch handlers may also have any control structure, but we are only
1631 // interested in the start of the catch handlers, so we don't need to actually
1632 // follow the flow of the catch handlers. The start of the catch handlers can
1633 // be located from the compare instructions, but they can be skipped in the
1634 // flow by following the contrary branch.
1635 void WinEHPrepare::mapLandingPadBlocks(LandingPadInst *LPad,
1636 LandingPadActions &Actions) {
1637 unsigned int NumClauses = LPad->getNumClauses();
1638 unsigned int HandlersFound = 0;
1639 BasicBlock *BB = LPad->getParent();
1641 DEBUG(dbgs() << "Mapping landing pad: " << BB->getName() << "\n");
1643 if (NumClauses == 0) {
1644 findCleanupHandlers(Actions, BB, nullptr);
1648 VisitedBlockSet VisitedBlocks;
1650 while (HandlersFound != NumClauses) {
1651 BasicBlock *NextBB = nullptr;
1653 // See if the clause we're looking for is a catch-all.
1654 // If so, the catch begins immediately.
1655 Constant *ExpectedSelector = LPad->getClause(HandlersFound)->stripPointerCasts();
1656 if (isa<ConstantPointerNull>(ExpectedSelector)) {
1657 // The catch all must occur last.
1658 assert(HandlersFound == NumClauses - 1);
1660 // There can be additional selector dispatches in the call chain that we
1662 BasicBlock *CatchBlock = nullptr;
1664 while (BB && isSelectorDispatch(BB, CatchBlock, Selector, NextBB)) {
1665 DEBUG(dbgs() << " Found extra catch dispatch in block "
1666 << CatchBlock->getName() << "\n");
1670 // For C++ EH, check if there is any interesting cleanup code before we
1671 // begin the catch. This is important because cleanups cannot rethrow
1672 // exceptions but code called from catches can. For SEH, it isn't
1673 // important if some finally code before a catch-all is executed out of
1674 // line or after recovering from the exception.
1675 if (Personality == EHPersonality::MSVC_CXX)
1676 findCleanupHandlers(Actions, BB, BB);
1678 // Add the catch handler to the action list.
1679 CatchHandler *Action = nullptr;
1680 if (CatchHandlerMap.count(BB) && CatchHandlerMap[BB] != nullptr) {
1681 // If the CatchHandlerMap already has an entry for this BB, re-use it.
1682 Action = CatchHandlerMap[BB];
1683 assert(Action->getSelector() == ExpectedSelector);
1685 // Since this is a catch-all handler, the selector won't actually appear
1686 // in the code anywhere. ExpectedSelector here is the constant null ptr
1687 // that we got from the landing pad instruction.
1688 Action = new CatchHandler(BB, ExpectedSelector, nullptr);
1689 CatchHandlerMap[BB] = Action;
1691 Actions.insertCatchHandler(Action);
1692 DEBUG(dbgs() << " Catch all handler at block " << BB->getName() << "\n");
1695 // Once we reach a catch-all, don't expect to hit a resume instruction.
1700 CatchHandler *CatchAction = findCatchHandler(BB, NextBB, VisitedBlocks);
1701 assert(CatchAction);
1703 // See if there is any interesting code executed before the dispatch.
1704 findCleanupHandlers(Actions, BB, CatchAction->getStartBlock());
1706 // When the source program contains multiple nested try blocks the catch
1707 // handlers can get strung together in such a way that we can encounter
1708 // a dispatch for a selector that we've already had a handler for.
1709 if (CatchAction->getSelector()->stripPointerCasts() == ExpectedSelector) {
1712 // Add the catch handler to the action list.
1713 DEBUG(dbgs() << " Found catch dispatch in block "
1714 << CatchAction->getStartBlock()->getName() << "\n");
1715 Actions.insertCatchHandler(CatchAction);
1717 // Under some circumstances optimized IR will flow unconditionally into a
1718 // handler block without checking the selector. This can only happen if
1719 // the landing pad has a catch-all handler and the handler for the
1720 // preceeding catch clause is identical to the catch-call handler
1721 // (typically an empty catch). In this case, the handler must be shared
1722 // by all remaining clauses.
1723 if (isa<ConstantPointerNull>(
1724 CatchAction->getSelector()->stripPointerCasts())) {
1725 DEBUG(dbgs() << " Applying early catch-all handler in block "
1726 << CatchAction->getStartBlock()->getName()
1727 << " to all remaining clauses.\n");
1728 Actions.insertCatchHandler(CatchAction);
1732 DEBUG(dbgs() << " Found extra catch dispatch in block "
1733 << CatchAction->getStartBlock()->getName() << "\n");
1736 // Move on to the block after the catch handler.
1740 // If we didn't wind up in a catch-all, see if there is any interesting code
1741 // executed before the resume.
1742 findCleanupHandlers(Actions, BB, BB);
1744 // It's possible that some optimization moved code into a landingpad that
1746 // previously being used for cleanup. If that happens, we need to execute
1748 // extra code from a cleanup handler.
1749 if (Actions.includesCleanup() && !LPad->isCleanup())
1750 LPad->setCleanup(true);
1753 // This function searches starting with the input block for the next
1754 // block that terminates with a branch whose condition is based on a selector
1755 // comparison. This may be the input block. See the mapLandingPadBlocks
1756 // comments for a discussion of control flow assumptions.
1758 CatchHandler *WinEHPrepare::findCatchHandler(BasicBlock *BB,
1759 BasicBlock *&NextBB,
1760 VisitedBlockSet &VisitedBlocks) {
1761 // See if we've already found a catch handler use it.
1762 // Call count() first to avoid creating a null entry for blocks
1763 // we haven't seen before.
1764 if (CatchHandlerMap.count(BB) && CatchHandlerMap[BB] != nullptr) {
1765 CatchHandler *Action = cast<CatchHandler>(CatchHandlerMap[BB]);
1766 NextBB = Action->getNextBB();
1770 // VisitedBlocks applies only to the current search. We still
1771 // need to consider blocks that we've visited while mapping other
1773 VisitedBlocks.insert(BB);
1775 BasicBlock *CatchBlock = nullptr;
1776 Constant *Selector = nullptr;
1778 // If this is the first time we've visited this block from any landing pad
1779 // look to see if it is a selector dispatch block.
1780 if (!CatchHandlerMap.count(BB)) {
1781 if (isSelectorDispatch(BB, CatchBlock, Selector, NextBB)) {
1782 CatchHandler *Action = new CatchHandler(BB, Selector, NextBB);
1783 CatchHandlerMap[BB] = Action;
1786 // If we encounter a block containing an llvm.eh.begincatch before we
1787 // find a selector dispatch block, the handler is assumed to be
1788 // reached unconditionally. This happens for catch-all blocks, but
1789 // it can also happen for other catch handlers that have been combined
1790 // with the catch-all handler during optimization.
1791 if (isCatchBlock(BB)) {
1792 PointerType *Int8PtrTy = Type::getInt8PtrTy(BB->getContext());
1793 Constant *NullSelector = ConstantPointerNull::get(Int8PtrTy);
1794 CatchHandler *Action = new CatchHandler(BB, NullSelector, nullptr);
1795 CatchHandlerMap[BB] = Action;
1800 // Visit each successor, looking for the dispatch.
1801 // FIXME: We expect to find the dispatch quickly, so this will probably
1802 // work better as a breadth first search.
1803 for (BasicBlock *Succ : successors(BB)) {
1804 if (VisitedBlocks.count(Succ))
1807 CatchHandler *Action = findCatchHandler(Succ, NextBB, VisitedBlocks);
1814 // These are helper functions to combine repeated code from findCleanupHandlers.
1815 static void createCleanupHandler(LandingPadActions &Actions,
1816 CleanupHandlerMapTy &CleanupHandlerMap,
1818 CleanupHandler *Action = new CleanupHandler(BB);
1819 CleanupHandlerMap[BB] = Action;
1820 Actions.insertCleanupHandler(Action);
1821 DEBUG(dbgs() << " Found cleanup code in block "
1822 << Action->getStartBlock()->getName() << "\n");
1825 static CallSite matchOutlinedFinallyCall(BasicBlock *BB,
1826 Instruction *MaybeCall) {
1827 // Look for finally blocks that Clang has already outlined for us.
1828 // %fp = call i8* @llvm.frameaddress(i32 0)
1829 // call void @"fin$parent"(iN 1, i8* %fp)
1830 if (isFrameAddressCall(MaybeCall) && MaybeCall != BB->getTerminator())
1831 MaybeCall = MaybeCall->getNextNode();
1832 CallSite FinallyCall(MaybeCall);
1833 if (!FinallyCall || FinallyCall.arg_size() != 2)
1835 if (!match(FinallyCall.getArgument(0), m_SpecificInt(1)))
1837 if (!isFrameAddressCall(FinallyCall.getArgument(1)))
1842 static BasicBlock *followSingleUnconditionalBranches(BasicBlock *BB) {
1843 // Skip single ubr blocks.
1844 while (BB->getFirstNonPHIOrDbg() == BB->getTerminator()) {
1845 auto *Br = dyn_cast<BranchInst>(BB->getTerminator());
1846 if (Br && Br->isUnconditional())
1847 BB = Br->getSuccessor(0);
1854 // This function searches starting with the input block for the next block that
1855 // contains code that is not part of a catch handler and would not be eliminated
1856 // during handler outlining.
1858 void WinEHPrepare::findCleanupHandlers(LandingPadActions &Actions,
1859 BasicBlock *StartBB, BasicBlock *EndBB) {
1860 // Here we will skip over the following:
1862 // landing pad prolog:
1864 // Unconditional branches
1866 // Selector dispatch
1870 // Anything else marks the start of an interesting block
1872 BasicBlock *BB = StartBB;
1873 // Anything other than an unconditional branch will kick us out of this loop
1874 // one way or another.
1876 BB = followSingleUnconditionalBranches(BB);
1877 // If we've already scanned this block, don't scan it again. If it is
1878 // a cleanup block, there will be an action in the CleanupHandlerMap.
1879 // If we've scanned it and it is not a cleanup block, there will be a
1880 // nullptr in the CleanupHandlerMap. If we have not scanned it, there will
1881 // be no entry in the CleanupHandlerMap. We must call count() first to
1882 // avoid creating a null entry for blocks we haven't scanned.
1883 if (CleanupHandlerMap.count(BB)) {
1884 if (auto *Action = CleanupHandlerMap[BB]) {
1885 Actions.insertCleanupHandler(Action);
1886 DEBUG(dbgs() << " Found cleanup code in block "
1887 << Action->getStartBlock()->getName() << "\n");
1888 // FIXME: This cleanup might chain into another, and we need to discover
1892 // Here we handle the case where the cleanup handler map contains a
1893 // value for this block but the value is a nullptr. This means that
1894 // we have previously analyzed the block and determined that it did
1895 // not contain any cleanup code. Based on the earlier analysis, we
1896 // know the the block must end in either an unconditional branch, a
1897 // resume or a conditional branch that is predicated on a comparison
1898 // with a selector. Either the resume or the selector dispatch
1899 // would terminate the search for cleanup code, so the unconditional
1900 // branch is the only case for which we might need to continue
1902 BasicBlock *SuccBB = followSingleUnconditionalBranches(BB);
1903 if (SuccBB == BB || SuccBB == EndBB)
1910 // Create an entry in the cleanup handler map for this block. Initially
1911 // we create an entry that says this isn't a cleanup block. If we find
1912 // cleanup code, the caller will replace this entry.
1913 CleanupHandlerMap[BB] = nullptr;
1915 TerminatorInst *Terminator = BB->getTerminator();
1917 // Landing pad blocks have extra instructions we need to accept.
1918 LandingPadMap *LPadMap = nullptr;
1919 if (BB->isLandingPad()) {
1920 LandingPadInst *LPad = BB->getLandingPadInst();
1921 LPadMap = &LPadMaps[LPad];
1922 if (!LPadMap->isInitialized())
1923 LPadMap->mapLandingPad(LPad);
1926 // Look for the bare resume pattern:
1927 // %lpad.val1 = insertvalue { i8*, i32 } undef, i8* %exn, 0
1928 // %lpad.val2 = insertvalue { i8*, i32 } %lpad.val1, i32 %sel, 1
1929 // resume { i8*, i32 } %lpad.val2
1930 if (auto *Resume = dyn_cast<ResumeInst>(Terminator)) {
1931 InsertValueInst *Insert1 = nullptr;
1932 InsertValueInst *Insert2 = nullptr;
1933 Value *ResumeVal = Resume->getOperand(0);
1934 // If the resume value isn't a phi or landingpad value, it should be a
1935 // series of insertions. Identify them so we can avoid them when scanning
1937 if (!isa<PHINode>(ResumeVal) && !isa<LandingPadInst>(ResumeVal)) {
1938 Insert2 = dyn_cast<InsertValueInst>(ResumeVal);
1940 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1941 Insert1 = dyn_cast<InsertValueInst>(Insert2->getAggregateOperand());
1943 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1945 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
1947 Instruction *Inst = II;
1948 if (LPadMap && LPadMap->isLandingPadSpecificInst(Inst))
1950 if (Inst == Insert1 || Inst == Insert2 || Inst == Resume)
1952 if (!Inst->hasOneUse() ||
1953 (Inst->user_back() != Insert1 && Inst->user_back() != Insert2)) {
1954 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1960 BranchInst *Branch = dyn_cast<BranchInst>(Terminator);
1961 if (Branch && Branch->isConditional()) {
1962 // Look for the selector dispatch.
1963 // %2 = call i32 @llvm.eh.typeid.for(i8* bitcast (i8** @_ZTIf to i8*))
1964 // %matches = icmp eq i32 %sel, %2
1965 // br i1 %matches, label %catch14, label %eh.resume
1966 CmpInst *Compare = dyn_cast<CmpInst>(Branch->getCondition());
1967 if (!Compare || !Compare->isEquality())
1968 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1969 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
1971 Instruction *Inst = II;
1972 if (LPadMap && LPadMap->isLandingPadSpecificInst(Inst))
1974 if (Inst == Compare || Inst == Branch)
1976 if (match(Inst, m_Intrinsic<Intrinsic::eh_typeid_for>()))
1978 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
1980 // The selector dispatch block should always terminate our search.
1981 assert(BB == EndBB);
1985 if (isAsynchronousEHPersonality(Personality)) {
1986 // If this is a landingpad block, split the block at the first non-landing
1988 Instruction *MaybeCall = BB->getFirstNonPHIOrDbg();
1990 while (MaybeCall != BB->getTerminator() &&
1991 LPadMap->isLandingPadSpecificInst(MaybeCall))
1992 MaybeCall = MaybeCall->getNextNode();
1995 // Look for outlined finally calls.
1996 if (CallSite FinallyCall = matchOutlinedFinallyCall(BB, MaybeCall)) {
1997 Function *Fin = FinallyCall.getCalledFunction();
1998 assert(Fin && "outlined finally call should be direct");
1999 auto *Action = new CleanupHandler(BB);
2000 Action->setHandlerBlockOrFunc(Fin);
2001 Actions.insertCleanupHandler(Action);
2002 CleanupHandlerMap[BB] = Action;
2003 DEBUG(dbgs() << " Found frontend-outlined finally call to "
2004 << Fin->getName() << " in block "
2005 << Action->getStartBlock()->getName() << "\n");
2007 // Split the block if there were more interesting instructions and look
2008 // for finally calls in the normal successor block.
2009 BasicBlock *SuccBB = BB;
2010 if (FinallyCall.getInstruction() != BB->getTerminator() &&
2011 FinallyCall.getInstruction()->getNextNode() != BB->getTerminator()) {
2012 SuccBB = BB->splitBasicBlock(FinallyCall.getInstruction()->getNextNode());
2014 if (FinallyCall.isInvoke()) {
2015 SuccBB = cast<InvokeInst>(FinallyCall.getInstruction())->getNormalDest();
2017 SuccBB = BB->getUniqueSuccessor();
2018 assert(SuccBB && "splitOutlinedFinallyCalls didn't insert a branch");
2028 // Anything else is either a catch block or interesting cleanup code.
2029 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
2031 Instruction *Inst = II;
2032 if (LPadMap && LPadMap->isLandingPadSpecificInst(Inst))
2034 // Unconditional branches fall through to this loop.
2037 // If this is a catch block, there is no cleanup code to be found.
2038 if (match(Inst, m_Intrinsic<Intrinsic::eh_begincatch>()))
2040 // If this a nested landing pad, it may contain an endcatch call.
2041 if (match(Inst, m_Intrinsic<Intrinsic::eh_endcatch>()))
2043 // Anything else makes this interesting cleanup code.
2044 return createCleanupHandler(Actions, CleanupHandlerMap, BB);
2047 // Only unconditional branches in empty blocks should get this far.
2048 assert(Branch && Branch->isUnconditional());
2051 BB = Branch->getSuccessor(0);
2055 // This is a public function, declared in WinEHFuncInfo.h and is also
2056 // referenced by WinEHNumbering in FunctionLoweringInfo.cpp.
2057 void llvm::parseEHActions(const IntrinsicInst *II,
2058 SmallVectorImpl<ActionHandler *> &Actions) {
2059 for (unsigned I = 0, E = II->getNumArgOperands(); I != E;) {
2060 uint64_t ActionKind =
2061 cast<ConstantInt>(II->getArgOperand(I))->getZExtValue();
2062 if (ActionKind == /*catch=*/1) {
2063 auto *Selector = cast<Constant>(II->getArgOperand(I + 1));
2064 ConstantInt *EHObjIndex = cast<ConstantInt>(II->getArgOperand(I + 2));
2065 int64_t EHObjIndexVal = EHObjIndex->getSExtValue();
2066 Constant *Handler = cast<Constant>(II->getArgOperand(I + 3));
2068 auto *CH = new CatchHandler(/*BB=*/nullptr, Selector, /*NextBB=*/nullptr);
2069 CH->setHandlerBlockOrFunc(Handler);
2070 CH->setExceptionVarIndex(EHObjIndexVal);
2071 Actions.push_back(CH);
2072 } else if (ActionKind == 0) {
2073 Constant *Handler = cast<Constant>(II->getArgOperand(I + 1));
2075 auto *CH = new CleanupHandler(/*BB=*/nullptr);
2076 CH->setHandlerBlockOrFunc(Handler);
2077 Actions.push_back(CH);
2079 llvm_unreachable("Expected either a catch or cleanup handler!");
2082 std::reverse(Actions.begin(), Actions.end());