1 //===-- DwarfEHPrepare - Prepare exception handling for code generation ---===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // This pass mulches exception handling code into a form adapted to code 11 // generation. Required if using dwarf exception handling. 12 // 13 //===----------------------------------------------------------------------===// 14 15 #define DEBUG_TYPE "dwarfehprepare" 16 #include "llvm/Function.h" 17 #include "llvm/Instructions.h" 18 #include "llvm/IntrinsicInst.h" 19 #include "llvm/Module.h" 20 #include "llvm/Pass.h" 21 #include "llvm/ADT/Statistic.h" 22 #include "llvm/Analysis/Dominators.h" 23 #include "llvm/CodeGen/Passes.h" 24 #include "llvm/MC/MCAsmInfo.h" 25 #include "llvm/Support/CallSite.h" 26 #include "llvm/Target/TargetLowering.h" 27 #include "llvm/Transforms/Utils/BasicBlockUtils.h" 28 #include "llvm/Transforms/Utils/SSAUpdater.h" 29 using namespace llvm; 30 31 STATISTIC(NumLandingPadsSplit, "Number of landing pads split"); 32 STATISTIC(NumUnwindsLowered, "Number of unwind instructions lowered"); 33 STATISTIC(NumResumesLowered, "Number of eh.resume calls lowered"); 34 STATISTIC(NumExceptionValuesMoved, "Number of eh.exception calls moved"); 35 36 namespace { 37 class DwarfEHPrepare : public FunctionPass { 38 const TargetMachine *TM; 39 const TargetLowering *TLI; 40 41 // The eh.exception intrinsic. 42 Function *ExceptionValueIntrinsic; 43 44 // The eh.selector intrinsic. 45 Function *SelectorIntrinsic; 46 47 // _Unwind_Resume_or_Rethrow or _Unwind_SjLj_Resume call. 48 Constant *URoR; 49 50 // The EH language-specific catch-all type. 51 GlobalVariable *EHCatchAllValue; 52 53 // _Unwind_Resume or the target equivalent. 54 Constant *RewindFunction; 55 56 // We both use and preserve dominator info. 57 DominatorTree *DT; 58 59 // The function we are running on. 60 Function *F; 61 62 // The landing pads for this function. 63 typedef SmallPtrSet<BasicBlock*, 8> BBSet; 64 BBSet LandingPads; 65 66 bool NormalizeLandingPads(); 67 bool LowerUnwindsAndResumes(); 68 bool MoveExceptionValueCalls(); 69 70 Instruction *CreateExceptionValueCall(BasicBlock *BB); 71 72 /// CleanupSelectors - Any remaining eh.selector intrinsic calls which still 73 /// use the "llvm.eh.catch.all.value" call need to convert to using its 74 /// initializer instead. 75 bool CleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels); 76 77 bool HasCatchAllInSelector(IntrinsicInst *); 78 79 /// FindAllCleanupSelectors - Find all eh.selector calls that are clean-ups. 80 void FindAllCleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels, 81 SmallPtrSet<IntrinsicInst*, 32> &CatchAllSels); 82 83 /// FindAllURoRInvokes - Find all URoR invokes in the function. 84 void FindAllURoRInvokes(SmallPtrSet<InvokeInst*, 32> &URoRInvokes); 85 86 /// HandleURoRInvokes - Handle invokes of "_Unwind_Resume_or_Rethrow" or 87 /// "_Unwind_SjLj_Resume" calls. The "unwind" part of these invokes jump to 88 /// a landing pad within the current function. This is a candidate to merge 89 /// the selector associated with the URoR invoke with the one from the 90 /// URoR's landing pad. 91 bool HandleURoRInvokes(); 92 93 /// FindSelectorAndURoR - Find the eh.selector call and URoR call associated 94 /// with the eh.exception call. This recursively looks past instructions 95 /// which don't change the EH pointer value, like casts or PHI nodes. 96 bool FindSelectorAndURoR(Instruction *Inst, bool &URoRInvoke, 97 SmallPtrSet<IntrinsicInst*, 8> &SelCalls, 98 SmallPtrSet<PHINode*, 32> &SeenPHIs); 99 100 public: 101 static char ID; // Pass identification, replacement for typeid. 102 DwarfEHPrepare(const TargetMachine *tm) : 103 FunctionPass(ID), TM(tm), TLI(TM->getTargetLowering()), 104 ExceptionValueIntrinsic(0), SelectorIntrinsic(0), 105 URoR(0), EHCatchAllValue(0), RewindFunction(0) { 106 initializeDominatorTreePass(*PassRegistry::getPassRegistry()); 107 } 108 109 virtual bool runOnFunction(Function &Fn); 110 111 // getAnalysisUsage - We need the dominator tree for handling URoR. 112 virtual void getAnalysisUsage(AnalysisUsage &AU) const { 113 AU.addRequired<DominatorTree>(); 114 AU.addPreserved<DominatorTree>(); 115 } 116 117 const char *getPassName() const { 118 return "Exception handling preparation"; 119 } 120 121 }; 122 } // end anonymous namespace 123 124 char DwarfEHPrepare::ID = 0; 125 126 FunctionPass *llvm::createDwarfEHPass(const TargetMachine *tm) { 127 return new DwarfEHPrepare(tm); 128 } 129 130 /// HasCatchAllInSelector - Return true if the intrinsic instruction has a 131 /// catch-all. 132 bool DwarfEHPrepare::HasCatchAllInSelector(IntrinsicInst *II) { 133 if (!EHCatchAllValue) return false; 134 135 unsigned ArgIdx = II->getNumArgOperands() - 1; 136 GlobalVariable *GV = dyn_cast<GlobalVariable>(II->getArgOperand(ArgIdx)); 137 return GV == EHCatchAllValue; 138 } 139 140 /// FindAllCleanupSelectors - Find all eh.selector calls that are clean-ups. 141 void DwarfEHPrepare:: 142 FindAllCleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels, 143 SmallPtrSet<IntrinsicInst*, 32> &CatchAllSels) { 144 for (Value::use_iterator 145 I = SelectorIntrinsic->use_begin(), 146 E = SelectorIntrinsic->use_end(); I != E; ++I) { 147 IntrinsicInst *II = cast<IntrinsicInst>(*I); 148 149 if (II->getParent()->getParent() != F) 150 continue; 151 152 if (!HasCatchAllInSelector(II)) 153 Sels.insert(II); 154 else 155 CatchAllSels.insert(II); 156 } 157 } 158 159 /// FindAllURoRInvokes - Find all URoR invokes in the function. 160 void DwarfEHPrepare:: 161 FindAllURoRInvokes(SmallPtrSet<InvokeInst*, 32> &URoRInvokes) { 162 for (Value::use_iterator 163 I = URoR->use_begin(), 164 E = URoR->use_end(); I != E; ++I) { 165 if (InvokeInst *II = dyn_cast<InvokeInst>(*I)) 166 URoRInvokes.insert(II); 167 } 168 } 169 170 /// CleanupSelectors - Any remaining eh.selector intrinsic calls which still use 171 /// the "llvm.eh.catch.all.value" call need to convert to using its 172 /// initializer instead. 173 bool DwarfEHPrepare::CleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels) { 174 if (!EHCatchAllValue) return false; 175 176 if (!SelectorIntrinsic) { 177 SelectorIntrinsic = 178 Intrinsic::getDeclaration(F->getParent(), Intrinsic::eh_selector); 179 if (!SelectorIntrinsic) return false; 180 } 181 182 bool Changed = false; 183 for (SmallPtrSet<IntrinsicInst*, 32>::iterator 184 I = Sels.begin(), E = Sels.end(); I != E; ++I) { 185 IntrinsicInst *Sel = *I; 186 187 // Index of the "llvm.eh.catch.all.value" variable. 188 unsigned OpIdx = Sel->getNumArgOperands() - 1; 189 GlobalVariable *GV = dyn_cast<GlobalVariable>(Sel->getArgOperand(OpIdx)); 190 if (GV != EHCatchAllValue) continue; 191 Sel->setArgOperand(OpIdx, EHCatchAllValue->getInitializer()); 192 Changed = true; 193 } 194 195 return Changed; 196 } 197 198 /// FindSelectorAndURoR - Find the eh.selector call associated with the 199 /// eh.exception call. And indicate if there is a URoR "invoke" associated with 200 /// the eh.exception call. This recursively looks past instructions which don't 201 /// change the EH pointer value, like casts or PHI nodes. 202 bool 203 DwarfEHPrepare::FindSelectorAndURoR(Instruction *Inst, bool &URoRInvoke, 204 SmallPtrSet<IntrinsicInst*, 8> &SelCalls, 205 SmallPtrSet<PHINode*, 32> &SeenPHIs) { 206 bool Changed = false; 207 208 for (Value::use_iterator 209 I = Inst->use_begin(), E = Inst->use_end(); I != E; ++I) { 210 Instruction *II = dyn_cast<Instruction>(*I); 211 if (!II || II->getParent()->getParent() != F) continue; 212 213 if (IntrinsicInst *Sel = dyn_cast<IntrinsicInst>(II)) { 214 if (Sel->getIntrinsicID() == Intrinsic::eh_selector) 215 SelCalls.insert(Sel); 216 } else if (InvokeInst *Invoke = dyn_cast<InvokeInst>(II)) { 217 if (Invoke->getCalledFunction() == URoR) 218 URoRInvoke = true; 219 } else if (CastInst *CI = dyn_cast<CastInst>(II)) { 220 Changed |= FindSelectorAndURoR(CI, URoRInvoke, SelCalls, SeenPHIs); 221 } else if (PHINode *PN = dyn_cast<PHINode>(II)) { 222 if (SeenPHIs.insert(PN)) 223 // Don't process a PHI node more than once. 224 Changed |= FindSelectorAndURoR(PN, URoRInvoke, SelCalls, SeenPHIs); 225 } 226 } 227 228 return Changed; 229 } 230 231 /// HandleURoRInvokes - Handle invokes of "_Unwind_Resume_or_Rethrow" or 232 /// "_Unwind_SjLj_Resume" calls. The "unwind" part of these invokes jump to a 233 /// landing pad within the current function. This is a candidate to merge the 234 /// selector associated with the URoR invoke with the one from the URoR's 235 /// landing pad. 236 bool DwarfEHPrepare::HandleURoRInvokes() { 237 if (!EHCatchAllValue) { 238 EHCatchAllValue = 239 F->getParent()->getNamedGlobal("llvm.eh.catch.all.value"); 240 if (!EHCatchAllValue) return false; 241 } 242 243 if (!SelectorIntrinsic) { 244 SelectorIntrinsic = 245 Intrinsic::getDeclaration(F->getParent(), Intrinsic::eh_selector); 246 if (!SelectorIntrinsic) return false; 247 } 248 249 SmallPtrSet<IntrinsicInst*, 32> Sels; 250 SmallPtrSet<IntrinsicInst*, 32> CatchAllSels; 251 FindAllCleanupSelectors(Sels, CatchAllSels); 252 253 if (!URoR) { 254 URoR = F->getParent()->getFunction("_Unwind_Resume_or_Rethrow"); 255 if (!URoR) return CleanupSelectors(CatchAllSels); 256 } 257 258 SmallPtrSet<InvokeInst*, 32> URoRInvokes; 259 FindAllURoRInvokes(URoRInvokes); 260 261 SmallPtrSet<IntrinsicInst*, 32> SelsToConvert; 262 263 for (SmallPtrSet<IntrinsicInst*, 32>::iterator 264 SI = Sels.begin(), SE = Sels.end(); SI != SE; ++SI) { 265 const BasicBlock *SelBB = (*SI)->getParent(); 266 for (SmallPtrSet<InvokeInst*, 32>::iterator 267 UI = URoRInvokes.begin(), UE = URoRInvokes.end(); UI != UE; ++UI) { 268 const BasicBlock *URoRBB = (*UI)->getParent(); 269 if (DT->dominates(SelBB, URoRBB)) { 270 SelsToConvert.insert(*SI); 271 break; 272 } 273 } 274 } 275 276 bool Changed = false; 277 278 if (Sels.size() != SelsToConvert.size()) { 279 // If we haven't been able to convert all of the clean-up selectors, then 280 // loop through the slow way to see if they still need to be converted. 281 if (!ExceptionValueIntrinsic) { 282 ExceptionValueIntrinsic = 283 Intrinsic::getDeclaration(F->getParent(), Intrinsic::eh_exception); 284 if (!ExceptionValueIntrinsic) 285 return CleanupSelectors(CatchAllSels); 286 } 287 288 for (Value::use_iterator 289 I = ExceptionValueIntrinsic->use_begin(), 290 E = ExceptionValueIntrinsic->use_end(); I != E; ++I) { 291 IntrinsicInst *EHPtr = dyn_cast<IntrinsicInst>(*I); 292 if (!EHPtr || EHPtr->getParent()->getParent() != F) continue; 293 294 bool URoRInvoke = false; 295 SmallPtrSet<IntrinsicInst*, 8> SelCalls; 296 SmallPtrSet<PHINode*, 32> SeenPHIs; 297 Changed |= FindSelectorAndURoR(EHPtr, URoRInvoke, SelCalls, SeenPHIs); 298 299 if (URoRInvoke) { 300 // This EH pointer is being used by an invoke of an URoR instruction and 301 // an eh.selector intrinsic call. If the eh.selector is a 'clean-up', we 302 // need to convert it to a 'catch-all'. 303 for (SmallPtrSet<IntrinsicInst*, 8>::iterator 304 SI = SelCalls.begin(), SE = SelCalls.end(); SI != SE; ++SI) 305 if (!HasCatchAllInSelector(*SI)) 306 SelsToConvert.insert(*SI); 307 } 308 } 309 } 310 311 if (!SelsToConvert.empty()) { 312 // Convert all clean-up eh.selectors, which are associated with "invokes" of 313 // URoR calls, into catch-all eh.selectors. 314 Changed = true; 315 316 for (SmallPtrSet<IntrinsicInst*, 8>::iterator 317 SI = SelsToConvert.begin(), SE = SelsToConvert.end(); 318 SI != SE; ++SI) { 319 IntrinsicInst *II = *SI; 320 321 // Use the exception object pointer and the personality function 322 // from the original selector. 323 CallSite CS(II); 324 IntrinsicInst::op_iterator I = CS.arg_begin(); 325 IntrinsicInst::op_iterator E = CS.arg_end(); 326 IntrinsicInst::op_iterator B = prior(E); 327 328 // Exclude last argument if it is an integer. 329 if (isa<ConstantInt>(B)) E = B; 330 331 // Add exception object pointer (front). 332 // Add personality function (next). 333 // Add in any filter IDs (rest). 334 SmallVector<Value*, 8> Args(I, E); 335 336 Args.push_back(EHCatchAllValue->getInitializer()); // Catch-all indicator. 337 338 CallInst *NewSelector = 339 CallInst::Create(SelectorIntrinsic, Args, "eh.sel.catch.all", II); 340 341 NewSelector->setTailCall(II->isTailCall()); 342 NewSelector->setAttributes(II->getAttributes()); 343 NewSelector->setCallingConv(II->getCallingConv()); 344 345 II->replaceAllUsesWith(NewSelector); 346 II->eraseFromParent(); 347 } 348 } 349 350 Changed |= CleanupSelectors(CatchAllSels); 351 return Changed; 352 } 353 354 /// NormalizeLandingPads - Normalize and discover landing pads, noting them 355 /// in the LandingPads set. A landing pad is normal if the only CFG edges 356 /// that end at it are unwind edges from invoke instructions. If we inlined 357 /// through an invoke we could have a normal branch from the previous 358 /// unwind block through to the landing pad for the original invoke. 359 /// Abnormal landing pads are fixed up by redirecting all unwind edges to 360 /// a new basic block which falls through to the original. 361 bool DwarfEHPrepare::NormalizeLandingPads() { 362 bool Changed = false; 363 364 const MCAsmInfo *MAI = TM->getMCAsmInfo(); 365 bool usingSjLjEH = MAI->getExceptionHandlingType() == ExceptionHandling::SjLj; 366 367 for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) { 368 TerminatorInst *TI = I->getTerminator(); 369 if (!isa<InvokeInst>(TI)) 370 continue; 371 BasicBlock *LPad = TI->getSuccessor(1); 372 // Skip landing pads that have already been normalized. 373 if (LandingPads.count(LPad)) 374 continue; 375 376 // Check that only invoke unwind edges end at the landing pad. 377 bool OnlyUnwoundTo = true; 378 bool SwitchOK = usingSjLjEH; 379 for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad); 380 PI != PE; ++PI) { 381 TerminatorInst *PT = (*PI)->getTerminator(); 382 // The SjLj dispatch block uses a switch instruction. This is effectively 383 // an unwind edge, so we can disregard it here. There will only ever 384 // be one dispatch, however, so if there are multiple switches, one 385 // of them truly is a normal edge, not an unwind edge. 386 if (SwitchOK && isa<SwitchInst>(PT)) { 387 SwitchOK = false; 388 continue; 389 } 390 if (!isa<InvokeInst>(PT) || LPad == PT->getSuccessor(0)) { 391 OnlyUnwoundTo = false; 392 break; 393 } 394 } 395 396 if (OnlyUnwoundTo) { 397 // Only unwind edges lead to the landing pad. Remember the landing pad. 398 LandingPads.insert(LPad); 399 continue; 400 } 401 402 // At least one normal edge ends at the landing pad. Redirect the unwind 403 // edges to a new basic block which falls through into this one. 404 405 // Create the new basic block. 406 BasicBlock *NewBB = BasicBlock::Create(F->getContext(), 407 LPad->getName() + "_unwind_edge"); 408 409 // Insert it into the function right before the original landing pad. 410 LPad->getParent()->getBasicBlockList().insert(LPad, NewBB); 411 412 // Redirect unwind edges from the original landing pad to NewBB. 413 for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad); PI != PE; ) { 414 TerminatorInst *PT = (*PI++)->getTerminator(); 415 if (isa<InvokeInst>(PT) && PT->getSuccessor(1) == LPad) 416 // Unwind to the new block. 417 PT->setSuccessor(1, NewBB); 418 } 419 420 // If there are any PHI nodes in LPad, we need to update them so that they 421 // merge incoming values from NewBB instead. 422 for (BasicBlock::iterator II = LPad->begin(); isa<PHINode>(II); ++II) { 423 PHINode *PN = cast<PHINode>(II); 424 pred_iterator PB = pred_begin(NewBB), PE = pred_end(NewBB); 425 426 // Check to see if all of the values coming in via unwind edges are the 427 // same. If so, we don't need to create a new PHI node. 428 Value *InVal = PN->getIncomingValueForBlock(*PB); 429 for (pred_iterator PI = PB; PI != PE; ++PI) { 430 if (PI != PB && InVal != PN->getIncomingValueForBlock(*PI)) { 431 InVal = 0; 432 break; 433 } 434 } 435 436 if (InVal == 0) { 437 // Different unwind edges have different values. Create a new PHI node 438 // in NewBB. 439 PHINode *NewPN = PHINode::Create(PN->getType(), 440 PN->getNumIncomingValues(), 441 PN->getName()+".unwind", NewBB); 442 // Add an entry for each unwind edge, using the value from the old PHI. 443 for (pred_iterator PI = PB; PI != PE; ++PI) 444 NewPN->addIncoming(PN->getIncomingValueForBlock(*PI), *PI); 445 446 // Now use this new PHI as the common incoming value for NewBB in PN. 447 InVal = NewPN; 448 } 449 450 // Revector exactly one entry in the PHI node to come from NewBB 451 // and delete all other entries that come from unwind edges. If 452 // there are both normal and unwind edges from the same predecessor, 453 // this leaves an entry for the normal edge. 454 for (pred_iterator PI = PB; PI != PE; ++PI) 455 PN->removeIncomingValue(*PI); 456 PN->addIncoming(InVal, NewBB); 457 } 458 459 // Add a fallthrough from NewBB to the original landing pad. 460 BranchInst::Create(LPad, NewBB); 461 462 // Now update DominatorTree analysis information. 463 DT->splitBlock(NewBB); 464 465 // Remember the newly constructed landing pad. The original landing pad 466 // LPad is no longer a landing pad now that all unwind edges have been 467 // revectored to NewBB. 468 LandingPads.insert(NewBB); 469 ++NumLandingPadsSplit; 470 Changed = true; 471 } 472 473 return Changed; 474 } 475 476 /// LowerUnwinds - Turn unwind instructions into calls to _Unwind_Resume, 477 /// rethrowing any previously caught exception. This will crash horribly 478 /// at runtime if there is no such exception: using unwind to throw a new 479 /// exception is currently not supported. 480 bool DwarfEHPrepare::LowerUnwindsAndResumes() { 481 SmallVector<Instruction*, 16> ResumeInsts; 482 483 for (Function::iterator fi = F->begin(), fe = F->end(); fi != fe; ++fi) { 484 for (BasicBlock::iterator bi = fi->begin(), be = fi->end(); bi != be; ++bi){ 485 if (isa<UnwindInst>(bi)) 486 ResumeInsts.push_back(bi); 487 else if (CallInst *call = dyn_cast<CallInst>(bi)) 488 if (Function *fn = dyn_cast<Function>(call->getCalledValue())) 489 if (fn->getName() == "llvm.eh.resume") 490 ResumeInsts.push_back(bi); 491 } 492 } 493 494 if (ResumeInsts.empty()) return false; 495 496 // Find the rewind function if we didn't already. 497 if (!RewindFunction) { 498 LLVMContext &Ctx = ResumeInsts[0]->getContext(); 499 FunctionType *FTy = FunctionType::get(Type::getVoidTy(Ctx), 500 Type::getInt8PtrTy(Ctx), false); 501 const char *RewindName = TLI->getLibcallName(RTLIB::UNWIND_RESUME); 502 RewindFunction = F->getParent()->getOrInsertFunction(RewindName, FTy); 503 } 504 505 bool Changed = false; 506 507 for (SmallVectorImpl<Instruction*>::iterator 508 I = ResumeInsts.begin(), E = ResumeInsts.end(); I != E; ++I) { 509 Instruction *RI = *I; 510 511 // Replace the resuming instruction with a call to _Unwind_Resume (or the 512 // appropriate target equivalent). 513 514 llvm::Value *ExnValue; 515 if (isa<UnwindInst>(RI)) 516 ExnValue = CreateExceptionValueCall(RI->getParent()); 517 else 518 ExnValue = cast<CallInst>(RI)->getArgOperand(0); 519 520 // Create the call... 521 CallInst *CI = CallInst::Create(RewindFunction, ExnValue, "", RI); 522 CI->setCallingConv(TLI->getLibcallCallingConv(RTLIB::UNWIND_RESUME)); 523 524 // ...followed by an UnreachableInst, if it was an unwind. 525 // Calls to llvm.eh.resume are typically already followed by this. 526 if (isa<UnwindInst>(RI)) 527 new UnreachableInst(RI->getContext(), RI); 528 529 if (isa<UnwindInst>(RI)) 530 ++NumUnwindsLowered; 531 else 532 ++NumResumesLowered; 533 534 // Nuke the resume instruction. 535 RI->eraseFromParent(); 536 537 Changed = true; 538 } 539 540 return Changed; 541 } 542 543 /// MoveExceptionValueCalls - Ensure that eh.exception is only ever called from 544 /// landing pads by replacing calls outside of landing pads with direct use of 545 /// a register holding the appropriate value; this requires adding calls inside 546 /// all landing pads to initialize the register. Also, move eh.exception calls 547 /// inside landing pads to the start of the landing pad (optional, but may make 548 /// things simpler for later passes). 549 bool DwarfEHPrepare::MoveExceptionValueCalls() { 550 // If the eh.exception intrinsic is not declared in the module then there is 551 // nothing to do. Speed up compilation by checking for this common case. 552 if (!ExceptionValueIntrinsic && 553 !F->getParent()->getFunction(Intrinsic::getName(Intrinsic::eh_exception))) 554 return false; 555 556 bool Changed = false; 557 558 // Move calls to eh.exception that are inside a landing pad to the start of 559 // the landing pad. 560 for (BBSet::const_iterator LI = LandingPads.begin(), LE = LandingPads.end(); 561 LI != LE; ++LI) { 562 BasicBlock *LP = *LI; 563 for (BasicBlock::iterator II = LP->getFirstNonPHIOrDbg(), IE = LP->end(); 564 II != IE;) 565 if (EHExceptionInst *EI = dyn_cast<EHExceptionInst>(II++)) { 566 // Found a call to eh.exception. 567 if (!EI->use_empty()) { 568 // If there is already a call to eh.exception at the start of the 569 // landing pad, then get hold of it; otherwise create such a call. 570 Value *CallAtStart = CreateExceptionValueCall(LP); 571 572 // If the call was at the start of a landing pad then leave it alone. 573 if (EI == CallAtStart) 574 continue; 575 EI->replaceAllUsesWith(CallAtStart); 576 } 577 EI->eraseFromParent(); 578 ++NumExceptionValuesMoved; 579 Changed = true; 580 } 581 } 582 583 // Look for calls to eh.exception that are not in a landing pad. If one is 584 // found, then a register that holds the exception value will be created in 585 // each landing pad, and the SSAUpdater will be used to compute the values 586 // returned by eh.exception calls outside of landing pads. 587 SSAUpdater SSA; 588 589 // Remember where we found the eh.exception call, to avoid rescanning earlier 590 // basic blocks which we already know contain no eh.exception calls. 591 bool FoundCallOutsideLandingPad = false; 592 Function::iterator BB = F->begin(); 593 for (Function::iterator BE = F->end(); BB != BE; ++BB) { 594 // Skip over landing pads. 595 if (LandingPads.count(BB)) 596 continue; 597 598 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end(); 599 II != IE; ++II) 600 if (isa<EHExceptionInst>(II)) { 601 SSA.Initialize(II->getType(), II->getName()); 602 FoundCallOutsideLandingPad = true; 603 break; 604 } 605 606 if (FoundCallOutsideLandingPad) 607 break; 608 } 609 610 // If all calls to eh.exception are in landing pads then we are done. 611 if (!FoundCallOutsideLandingPad) 612 return Changed; 613 614 // Add a call to eh.exception at the start of each landing pad, and tell the 615 // SSAUpdater that this is the value produced by the landing pad. 616 for (BBSet::iterator LI = LandingPads.begin(), LE = LandingPads.end(); 617 LI != LE; ++LI) 618 SSA.AddAvailableValue(*LI, CreateExceptionValueCall(*LI)); 619 620 // Now turn all calls to eh.exception that are not in a landing pad into a use 621 // of the appropriate register. 622 for (Function::iterator BE = F->end(); BB != BE; ++BB) { 623 // Skip over landing pads. 624 if (LandingPads.count(BB)) 625 continue; 626 627 for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end(); 628 II != IE;) 629 if (EHExceptionInst *EI = dyn_cast<EHExceptionInst>(II++)) { 630 // Found a call to eh.exception, replace it with the value from any 631 // upstream landing pad(s). 632 EI->replaceAllUsesWith(SSA.GetValueAtEndOfBlock(BB)); 633 EI->eraseFromParent(); 634 ++NumExceptionValuesMoved; 635 } 636 } 637 638 return true; 639 } 640 641 /// CreateExceptionValueCall - Insert a call to the eh.exception intrinsic at 642 /// the start of the basic block (unless there already is one, in which case 643 /// the existing call is returned). 644 Instruction *DwarfEHPrepare::CreateExceptionValueCall(BasicBlock *BB) { 645 Instruction *Start = BB->getFirstNonPHIOrDbg(); 646 // Is this a call to eh.exception? 647 if (IntrinsicInst *CI = dyn_cast<IntrinsicInst>(Start)) 648 if (CI->getIntrinsicID() == Intrinsic::eh_exception) 649 // Reuse the existing call. 650 return Start; 651 652 // Find the eh.exception intrinsic if we didn't already. 653 if (!ExceptionValueIntrinsic) 654 ExceptionValueIntrinsic = Intrinsic::getDeclaration(F->getParent(), 655 Intrinsic::eh_exception); 656 657 // Create the call. 658 return CallInst::Create(ExceptionValueIntrinsic, "eh.value.call", Start); 659 } 660 661 bool DwarfEHPrepare::runOnFunction(Function &Fn) { 662 bool Changed = false; 663 664 // Initialize internal state. 665 DT = &getAnalysis<DominatorTree>(); 666 F = &Fn; 667 668 // Ensure that only unwind edges end at landing pads (a landing pad is a 669 // basic block where an invoke unwind edge ends). 670 Changed |= NormalizeLandingPads(); 671 672 // Turn unwind instructions and eh.resume calls into libcalls. 673 Changed |= LowerUnwindsAndResumes(); 674 675 // TODO: Move eh.selector calls to landing pads and combine them. 676 677 // Move eh.exception calls to landing pads. 678 Changed |= MoveExceptionValueCalls(); 679 680 Changed |= HandleURoRInvokes(); 681 682 LandingPads.clear(); 683 684 return Changed; 685 } 686