2009-05-22 22:36:31 +02:00
|
|
|
//===-- DwarfEHPrepare - Prepare exception handling for code generation ---===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This pass mulches exception handling code into a form adapted to code
|
2010-03-27 00:41:30 +01:00
|
|
|
// generation. Required if using dwarf exception handling.
|
2009-05-22 22:36:31 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#define DEBUG_TYPE "dwarfehprepare"
|
|
|
|
#include "llvm/Function.h"
|
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/IntrinsicInst.h"
|
|
|
|
#include "llvm/Module.h"
|
|
|
|
#include "llvm/Pass.h"
|
2010-03-27 00:41:30 +01:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
|
|
|
#include "llvm/Analysis/Dominators.h"
|
|
|
|
#include "llvm/CodeGen/Passes.h"
|
2010-01-21 00:03:55 +01:00
|
|
|
#include "llvm/MC/MCAsmInfo.h"
|
2010-06-25 13:25:30 +02:00
|
|
|
#include "llvm/Support/CallSite.h"
|
2009-05-22 22:36:31 +02:00
|
|
|
#include "llvm/Target/TargetLowering.h"
|
|
|
|
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
|
2010-09-03 10:31:48 +02:00
|
|
|
#include "llvm/Transforms/Utils/SSAUpdater.h"
|
2009-05-22 22:36:31 +02:00
|
|
|
using namespace llvm;
|
|
|
|
|
2009-10-29 01:22:16 +01:00
|
|
|
STATISTIC(NumLandingPadsSplit, "Number of landing pads split");
|
|
|
|
STATISTIC(NumUnwindsLowered, "Number of unwind instructions lowered");
|
2009-10-29 01:37:35 +01:00
|
|
|
STATISTIC(NumExceptionValuesMoved, "Number of eh.exception calls moved");
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
namespace {
|
2009-10-25 07:33:48 +01:00
|
|
|
class DwarfEHPrepare : public FunctionPass {
|
2010-04-19 21:05:59 +02:00
|
|
|
const TargetMachine *TM;
|
2009-05-22 22:36:31 +02:00
|
|
|
const TargetLowering *TLI;
|
|
|
|
|
|
|
|
// The eh.exception intrinsic.
|
2009-10-29 01:37:35 +01:00
|
|
|
Function *ExceptionValueIntrinsic;
|
2009-05-22 22:36:31 +02:00
|
|
|
|
2010-03-27 00:41:30 +01:00
|
|
|
// The eh.selector intrinsic.
|
|
|
|
Function *SelectorIntrinsic;
|
|
|
|
|
2010-10-29 09:46:01 +02:00
|
|
|
// _Unwind_Resume_or_Rethrow or _Unwind_SjLj_Resume call.
|
2010-03-27 00:41:30 +01:00
|
|
|
Constant *URoR;
|
|
|
|
|
|
|
|
// The EH language-specific catch-all type.
|
|
|
|
GlobalVariable *EHCatchAllValue;
|
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
// _Unwind_Resume or the target equivalent.
|
|
|
|
Constant *RewindFunction;
|
|
|
|
|
2010-08-31 11:05:06 +02:00
|
|
|
// We both use and preserve dominator info.
|
2009-05-22 22:36:31 +02:00
|
|
|
DominatorTree *DT;
|
|
|
|
|
|
|
|
// The function we are running on.
|
|
|
|
Function *F;
|
|
|
|
|
|
|
|
// The landing pads for this function.
|
|
|
|
typedef SmallPtrSet<BasicBlock*, 8> BBSet;
|
|
|
|
BBSet LandingPads;
|
|
|
|
|
|
|
|
bool NormalizeLandingPads();
|
|
|
|
bool LowerUnwinds();
|
|
|
|
bool MoveExceptionValueCalls();
|
|
|
|
|
|
|
|
Instruction *CreateExceptionValueCall(BasicBlock *BB);
|
|
|
|
|
2010-03-27 02:19:12 +01:00
|
|
|
/// CleanupSelectors - Any remaining eh.selector intrinsic calls which still
|
2010-07-27 00:36:52 +02:00
|
|
|
/// use the "llvm.eh.catch.all.value" call need to convert to using its
|
2010-03-27 02:19:12 +01:00
|
|
|
/// initializer instead.
|
2010-07-01 00:49:53 +02:00
|
|
|
bool CleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels);
|
2010-03-27 02:19:12 +01:00
|
|
|
|
2010-06-24 20:49:10 +02:00
|
|
|
bool HasCatchAllInSelector(IntrinsicInst *);
|
2010-06-12 04:34:29 +02:00
|
|
|
|
2010-03-30 01:02:46 +02:00
|
|
|
/// FindAllCleanupSelectors - Find all eh.selector calls that are clean-ups.
|
2010-07-01 00:49:53 +02:00
|
|
|
void FindAllCleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels,
|
|
|
|
SmallPtrSet<IntrinsicInst*, 32> &CatchAllSels);
|
2010-03-30 01:02:46 +02:00
|
|
|
|
|
|
|
/// FindAllURoRInvokes - Find all URoR invokes in the function.
|
|
|
|
void FindAllURoRInvokes(SmallPtrSet<InvokeInst*, 32> &URoRInvokes);
|
|
|
|
|
2010-10-29 09:46:01 +02:00
|
|
|
/// HandleURoRInvokes - Handle invokes of "_Unwind_Resume_or_Rethrow" or
|
|
|
|
/// "_Unwind_SjLj_Resume" calls. The "unwind" part of these invokes jump to
|
|
|
|
/// a landing pad within the current function. This is a candidate to merge
|
|
|
|
/// the selector associated with the URoR invoke with the one from the
|
|
|
|
/// URoR's landing pad.
|
2010-03-27 00:41:30 +01:00
|
|
|
bool HandleURoRInvokes();
|
|
|
|
|
2010-03-30 01:37:07 +02:00
|
|
|
/// FindSelectorAndURoR - Find the eh.selector call and URoR call associated
|
|
|
|
/// with the eh.exception call. This recursively looks past instructions
|
|
|
|
/// which don't change the EH pointer value, like casts or PHI nodes.
|
|
|
|
bool FindSelectorAndURoR(Instruction *Inst, bool &URoRInvoke,
|
|
|
|
SmallPtrSet<IntrinsicInst*, 8> &SelCalls);
|
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
public:
|
|
|
|
static char ID; // Pass identification, replacement for typeid.
|
2010-08-31 11:05:06 +02:00
|
|
|
DwarfEHPrepare(const TargetMachine *tm) :
|
2010-08-06 20:33:48 +02:00
|
|
|
FunctionPass(ID), TM(tm), TLI(TM->getTargetLowering()),
|
2010-03-27 00:41:30 +01:00
|
|
|
ExceptionValueIntrinsic(0), SelectorIntrinsic(0),
|
2010-10-19 19:21:58 +02:00
|
|
|
URoR(0), EHCatchAllValue(0), RewindFunction(0) {
|
|
|
|
initializeDominatorTreePass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
virtual bool runOnFunction(Function &Fn);
|
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
// getAnalysisUsage - We need the dominator tree for handling URoR.
|
2009-10-29 01:37:35 +01:00
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
2010-08-31 11:05:06 +02:00
|
|
|
AU.addRequired<DominatorTree>();
|
2009-10-29 01:37:35 +01:00
|
|
|
AU.addPreserved<DominatorTree>();
|
|
|
|
}
|
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
const char *getPassName() const {
|
|
|
|
return "Exception handling preparation";
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
char DwarfEHPrepare::ID = 0;
|
|
|
|
|
2010-08-31 11:05:06 +02:00
|
|
|
FunctionPass *llvm::createDwarfEHPass(const TargetMachine *tm) {
|
|
|
|
return new DwarfEHPrepare(tm);
|
2009-05-22 22:36:31 +02:00
|
|
|
}
|
|
|
|
|
2010-06-24 20:49:10 +02:00
|
|
|
/// HasCatchAllInSelector - Return true if the intrinsic instruction has a
|
|
|
|
/// catch-all.
|
|
|
|
bool DwarfEHPrepare::HasCatchAllInSelector(IntrinsicInst *II) {
|
|
|
|
if (!EHCatchAllValue) return false;
|
2010-06-12 04:34:29 +02:00
|
|
|
|
2010-06-25 13:25:30 +02:00
|
|
|
unsigned ArgIdx = II->getNumArgOperands() - 1;
|
|
|
|
GlobalVariable *GV = dyn_cast<GlobalVariable>(II->getArgOperand(ArgIdx));
|
2010-06-24 20:49:10 +02:00
|
|
|
return GV == EHCatchAllValue;
|
2010-06-12 04:34:29 +02:00
|
|
|
}
|
|
|
|
|
2010-03-30 01:02:46 +02:00
|
|
|
/// FindAllCleanupSelectors - Find all eh.selector calls that are clean-ups.
|
|
|
|
void DwarfEHPrepare::
|
2010-07-01 00:49:53 +02:00
|
|
|
FindAllCleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels,
|
|
|
|
SmallPtrSet<IntrinsicInst*, 32> &CatchAllSels) {
|
2010-03-27 00:41:30 +01:00
|
|
|
for (Value::use_iterator
|
2010-03-30 01:02:46 +02:00
|
|
|
I = SelectorIntrinsic->use_begin(),
|
|
|
|
E = SelectorIntrinsic->use_end(); I != E; ++I) {
|
2010-07-22 15:36:47 +02:00
|
|
|
IntrinsicInst *II = cast<IntrinsicInst>(*I);
|
2010-03-30 01:02:46 +02:00
|
|
|
|
2010-06-12 04:34:29 +02:00
|
|
|
if (II->getParent()->getParent() != F)
|
|
|
|
continue;
|
2010-03-30 01:02:46 +02:00
|
|
|
|
2010-06-24 20:49:10 +02:00
|
|
|
if (!HasCatchAllInSelector(II))
|
2010-06-12 04:34:29 +02:00
|
|
|
Sels.insert(II);
|
2010-07-01 00:49:53 +02:00
|
|
|
else
|
|
|
|
CatchAllSels.insert(II);
|
2010-03-27 00:41:30 +01:00
|
|
|
}
|
2010-03-30 01:02:46 +02:00
|
|
|
}
|
2010-03-27 00:41:30 +01:00
|
|
|
|
2010-03-30 01:02:46 +02:00
|
|
|
/// FindAllURoRInvokes - Find all URoR invokes in the function.
|
|
|
|
void DwarfEHPrepare::
|
|
|
|
FindAllURoRInvokes(SmallPtrSet<InvokeInst*, 32> &URoRInvokes) {
|
|
|
|
for (Value::use_iterator
|
|
|
|
I = URoR->use_begin(),
|
|
|
|
E = URoR->use_end(); I != E; ++I) {
|
2010-07-22 15:36:47 +02:00
|
|
|
if (InvokeInst *II = dyn_cast<InvokeInst>(*I))
|
2010-03-30 01:02:46 +02:00
|
|
|
URoRInvokes.insert(II);
|
|
|
|
}
|
2010-03-27 00:41:30 +01:00
|
|
|
}
|
|
|
|
|
2010-03-27 02:19:12 +01:00
|
|
|
/// CleanupSelectors - Any remaining eh.selector intrinsic calls which still use
|
2010-07-27 00:36:52 +02:00
|
|
|
/// the "llvm.eh.catch.all.value" call need to convert to using its
|
2010-03-27 02:19:12 +01:00
|
|
|
/// initializer instead.
|
2010-07-01 00:49:53 +02:00
|
|
|
bool DwarfEHPrepare::CleanupSelectors(SmallPtrSet<IntrinsicInst*, 32> &Sels) {
|
2010-03-30 01:02:46 +02:00
|
|
|
if (!EHCatchAllValue) return false;
|
|
|
|
|
|
|
|
if (!SelectorIntrinsic) {
|
|
|
|
SelectorIntrinsic =
|
|
|
|
Intrinsic::getDeclaration(F->getParent(), Intrinsic::eh_selector);
|
|
|
|
if (!SelectorIntrinsic) return false;
|
|
|
|
}
|
|
|
|
|
2010-03-27 02:22:38 +01:00
|
|
|
bool Changed = false;
|
2010-07-01 00:49:53 +02:00
|
|
|
for (SmallPtrSet<IntrinsicInst*, 32>::iterator
|
|
|
|
I = Sels.begin(), E = Sels.end(); I != E; ++I) {
|
|
|
|
IntrinsicInst *Sel = *I;
|
2010-03-27 02:19:12 +01:00
|
|
|
|
2010-07-27 00:36:52 +02:00
|
|
|
// Index of the "llvm.eh.catch.all.value" variable.
|
2010-06-29 15:03:46 +02:00
|
|
|
unsigned OpIdx = Sel->getNumArgOperands() - 1;
|
|
|
|
GlobalVariable *GV = dyn_cast<GlobalVariable>(Sel->getArgOperand(OpIdx));
|
2010-03-27 02:19:12 +01:00
|
|
|
if (GV != EHCatchAllValue) continue;
|
2010-06-29 15:03:46 +02:00
|
|
|
Sel->setArgOperand(OpIdx, EHCatchAllValue->getInitializer());
|
2010-03-27 02:22:38 +01:00
|
|
|
Changed = true;
|
2010-03-27 02:19:12 +01:00
|
|
|
}
|
2010-03-27 02:22:38 +01:00
|
|
|
|
|
|
|
return Changed;
|
2010-03-27 02:19:12 +01:00
|
|
|
}
|
|
|
|
|
2010-03-30 01:37:07 +02:00
|
|
|
/// FindSelectorAndURoR - Find the eh.selector call associated with the
|
|
|
|
/// eh.exception call. And indicate if there is a URoR "invoke" associated with
|
|
|
|
/// the eh.exception call. This recursively looks past instructions which don't
|
|
|
|
/// change the EH pointer value, like casts or PHI nodes.
|
|
|
|
bool
|
|
|
|
DwarfEHPrepare::FindSelectorAndURoR(Instruction *Inst, bool &URoRInvoke,
|
|
|
|
SmallPtrSet<IntrinsicInst*, 8> &SelCalls) {
|
|
|
|
SmallPtrSet<PHINode*, 32> SeenPHIs;
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (Value::use_iterator
|
|
|
|
I = Inst->use_begin(), E = Inst->use_end(); I != E; ++I) {
|
2010-07-22 15:36:47 +02:00
|
|
|
Instruction *II = dyn_cast<Instruction>(*I);
|
2010-03-30 01:37:07 +02:00
|
|
|
if (!II || II->getParent()->getParent() != F) continue;
|
|
|
|
|
|
|
|
if (IntrinsicInst *Sel = dyn_cast<IntrinsicInst>(II)) {
|
|
|
|
if (Sel->getIntrinsicID() == Intrinsic::eh_selector)
|
|
|
|
SelCalls.insert(Sel);
|
|
|
|
} else if (InvokeInst *Invoke = dyn_cast<InvokeInst>(II)) {
|
|
|
|
if (Invoke->getCalledFunction() == URoR)
|
|
|
|
URoRInvoke = true;
|
|
|
|
} else if (CastInst *CI = dyn_cast<CastInst>(II)) {
|
|
|
|
Changed |= FindSelectorAndURoR(CI, URoRInvoke, SelCalls);
|
|
|
|
} else if (PHINode *PN = dyn_cast<PHINode>(II)) {
|
|
|
|
if (SeenPHIs.insert(PN))
|
|
|
|
// Don't process a PHI node more than once.
|
|
|
|
Changed |= FindSelectorAndURoR(PN, URoRInvoke, SelCalls);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2010-10-29 09:46:01 +02:00
|
|
|
/// HandleURoRInvokes - Handle invokes of "_Unwind_Resume_or_Rethrow" or
|
|
|
|
/// "_Unwind_SjLj_Resume" calls. The "unwind" part of these invokes jump to a
|
|
|
|
/// landing pad within the current function. This is a candidate to merge the
|
|
|
|
/// selector associated with the URoR invoke with the one from the URoR's
|
|
|
|
/// landing pad.
|
2010-03-27 00:41:30 +01:00
|
|
|
bool DwarfEHPrepare::HandleURoRInvokes() {
|
|
|
|
if (!EHCatchAllValue) {
|
|
|
|
EHCatchAllValue =
|
2010-07-27 00:36:52 +02:00
|
|
|
F->getParent()->getNamedGlobal("llvm.eh.catch.all.value");
|
2010-03-27 00:41:30 +01:00
|
|
|
if (!EHCatchAllValue) return false;
|
|
|
|
}
|
|
|
|
|
2010-03-27 02:19:12 +01:00
|
|
|
if (!SelectorIntrinsic) {
|
|
|
|
SelectorIntrinsic =
|
|
|
|
Intrinsic::getDeclaration(F->getParent(), Intrinsic::eh_selector);
|
|
|
|
if (!SelectorIntrinsic) return false;
|
|
|
|
}
|
|
|
|
|
2010-07-01 00:49:53 +02:00
|
|
|
SmallPtrSet<IntrinsicInst*, 32> Sels;
|
|
|
|
SmallPtrSet<IntrinsicInst*, 32> CatchAllSels;
|
|
|
|
FindAllCleanupSelectors(Sels, CatchAllSels);
|
|
|
|
|
2010-03-27 00:41:30 +01:00
|
|
|
if (!URoR) {
|
|
|
|
URoR = F->getParent()->getFunction("_Unwind_Resume_or_Rethrow");
|
2010-10-29 09:46:01 +02:00
|
|
|
if (!URoR) {
|
|
|
|
URoR = F->getParent()->getFunction("_Unwind_SjLj_Resume");
|
|
|
|
if (!URoR) return CleanupSelectors(CatchAllSels);
|
|
|
|
}
|
2010-03-27 00:41:30 +01:00
|
|
|
}
|
|
|
|
|
2010-03-30 01:02:46 +02:00
|
|
|
SmallPtrSet<InvokeInst*, 32> URoRInvokes;
|
|
|
|
FindAllURoRInvokes(URoRInvokes);
|
2010-03-27 00:41:30 +01:00
|
|
|
|
|
|
|
SmallPtrSet<IntrinsicInst*, 32> SelsToConvert;
|
|
|
|
|
2010-03-30 01:02:46 +02:00
|
|
|
for (SmallPtrSet<IntrinsicInst*, 32>::iterator
|
|
|
|
SI = Sels.begin(), SE = Sels.end(); SI != SE; ++SI) {
|
|
|
|
const BasicBlock *SelBB = (*SI)->getParent();
|
|
|
|
for (SmallPtrSet<InvokeInst*, 32>::iterator
|
|
|
|
UI = URoRInvokes.begin(), UE = URoRInvokes.end(); UI != UE; ++UI) {
|
|
|
|
const BasicBlock *URoRBB = (*UI)->getParent();
|
2010-07-26 19:38:15 +02:00
|
|
|
if (DT->dominates(SelBB, URoRBB)) {
|
2010-03-30 01:02:46 +02:00
|
|
|
SelsToConvert.insert(*SI);
|
|
|
|
break;
|
2010-03-27 00:41:30 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-03-30 01:02:46 +02:00
|
|
|
bool Changed = false;
|
|
|
|
|
2010-03-30 01:37:07 +02:00
|
|
|
if (Sels.size() != SelsToConvert.size()) {
|
|
|
|
// If we haven't been able to convert all of the clean-up selectors, then
|
|
|
|
// loop through the slow way to see if they still need to be converted.
|
|
|
|
if (!ExceptionValueIntrinsic) {
|
|
|
|
ExceptionValueIntrinsic =
|
|
|
|
Intrinsic::getDeclaration(F->getParent(), Intrinsic::eh_exception);
|
2010-07-01 00:49:53 +02:00
|
|
|
if (!ExceptionValueIntrinsic)
|
|
|
|
return CleanupSelectors(CatchAllSels);
|
2010-03-30 01:37:07 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
for (Value::use_iterator
|
|
|
|
I = ExceptionValueIntrinsic->use_begin(),
|
|
|
|
E = ExceptionValueIntrinsic->use_end(); I != E; ++I) {
|
2010-07-22 15:36:47 +02:00
|
|
|
IntrinsicInst *EHPtr = dyn_cast<IntrinsicInst>(*I);
|
2010-03-30 01:37:07 +02:00
|
|
|
if (!EHPtr || EHPtr->getParent()->getParent() != F) continue;
|
|
|
|
|
|
|
|
bool URoRInvoke = false;
|
|
|
|
SmallPtrSet<IntrinsicInst*, 8> SelCalls;
|
|
|
|
Changed |= FindSelectorAndURoR(EHPtr, URoRInvoke, SelCalls);
|
|
|
|
|
|
|
|
if (URoRInvoke) {
|
|
|
|
// This EH pointer is being used by an invoke of an URoR instruction and
|
|
|
|
// an eh.selector intrinsic call. If the eh.selector is a 'clean-up', we
|
|
|
|
// need to convert it to a 'catch-all'.
|
|
|
|
for (SmallPtrSet<IntrinsicInst*, 8>::iterator
|
2010-06-12 04:34:29 +02:00
|
|
|
SI = SelCalls.begin(), SE = SelCalls.end(); SI != SE; ++SI)
|
2010-06-24 20:49:10 +02:00
|
|
|
if (!HasCatchAllInSelector(*SI))
|
2010-06-12 04:34:29 +02:00
|
|
|
SelsToConvert.insert(*SI);
|
2010-03-30 01:37:07 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-03-27 00:41:30 +01:00
|
|
|
if (!SelsToConvert.empty()) {
|
|
|
|
// Convert all clean-up eh.selectors, which are associated with "invokes" of
|
|
|
|
// URoR calls, into catch-all eh.selectors.
|
|
|
|
Changed = true;
|
|
|
|
|
|
|
|
for (SmallPtrSet<IntrinsicInst*, 8>::iterator
|
|
|
|
SI = SelsToConvert.begin(), SE = SelsToConvert.end();
|
|
|
|
SI != SE; ++SI) {
|
|
|
|
IntrinsicInst *II = *SI;
|
|
|
|
|
|
|
|
// Use the exception object pointer and the personality function
|
|
|
|
// from the original selector.
|
2010-06-25 13:25:30 +02:00
|
|
|
CallSite CS(II);
|
|
|
|
IntrinsicInst::op_iterator I = CS.arg_begin();
|
|
|
|
IntrinsicInst::op_iterator E = CS.arg_end();
|
|
|
|
IntrinsicInst::op_iterator B = prior(E);
|
|
|
|
|
|
|
|
// Exclude last argument if it is an integer.
|
|
|
|
if (isa<ConstantInt>(B)) E = B;
|
2010-06-12 04:34:29 +02:00
|
|
|
|
2010-06-28 18:40:52 +02:00
|
|
|
// Add exception object pointer (front).
|
|
|
|
// Add personality function (next).
|
|
|
|
// Add in any filter IDs (rest).
|
|
|
|
SmallVector<Value*, 8> Args(I, E);
|
2010-06-12 04:34:29 +02:00
|
|
|
|
2010-03-27 00:41:30 +01:00
|
|
|
Args.push_back(EHCatchAllValue->getInitializer()); // Catch-all indicator.
|
|
|
|
|
|
|
|
CallInst *NewSelector =
|
|
|
|
CallInst::Create(SelectorIntrinsic, Args.begin(), Args.end(),
|
|
|
|
"eh.sel.catch.all", II);
|
|
|
|
|
|
|
|
NewSelector->setTailCall(II->isTailCall());
|
|
|
|
NewSelector->setAttributes(II->getAttributes());
|
|
|
|
NewSelector->setCallingConv(II->getCallingConv());
|
|
|
|
|
|
|
|
II->replaceAllUsesWith(NewSelector);
|
|
|
|
II->eraseFromParent();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-07-01 00:49:53 +02:00
|
|
|
Changed |= CleanupSelectors(CatchAllSels);
|
2010-03-27 00:41:30 +01:00
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
/// NormalizeLandingPads - Normalize and discover landing pads, noting them
|
|
|
|
/// in the LandingPads set. A landing pad is normal if the only CFG edges
|
2009-09-15 23:56:46 +02:00
|
|
|
/// that end at it are unwind edges from invoke instructions. If we inlined
|
|
|
|
/// through an invoke we could have a normal branch from the previous
|
|
|
|
/// unwind block through to the landing pad for the original invoke.
|
2009-05-22 22:36:31 +02:00
|
|
|
/// Abnormal landing pads are fixed up by redirecting all unwind edges to
|
|
|
|
/// a new basic block which falls through to the original.
|
|
|
|
bool DwarfEHPrepare::NormalizeLandingPads() {
|
|
|
|
bool Changed = false;
|
|
|
|
|
2010-04-19 21:05:59 +02:00
|
|
|
const MCAsmInfo *MAI = TM->getMCAsmInfo();
|
2010-01-21 00:03:55 +01:00
|
|
|
bool usingSjLjEH = MAI->getExceptionHandlingType() == ExceptionHandling::SjLj;
|
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) {
|
|
|
|
TerminatorInst *TI = I->getTerminator();
|
|
|
|
if (!isa<InvokeInst>(TI))
|
|
|
|
continue;
|
|
|
|
BasicBlock *LPad = TI->getSuccessor(1);
|
|
|
|
// Skip landing pads that have already been normalized.
|
|
|
|
if (LandingPads.count(LPad))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Check that only invoke unwind edges end at the landing pad.
|
|
|
|
bool OnlyUnwoundTo = true;
|
2010-01-21 00:03:55 +01:00
|
|
|
bool SwitchOK = usingSjLjEH;
|
2009-05-22 22:36:31 +02:00
|
|
|
for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad);
|
|
|
|
PI != PE; ++PI) {
|
|
|
|
TerminatorInst *PT = (*PI)->getTerminator();
|
2010-01-21 00:03:55 +01:00
|
|
|
// The SjLj dispatch block uses a switch instruction. This is effectively
|
|
|
|
// an unwind edge, so we can disregard it here. There will only ever
|
|
|
|
// be one dispatch, however, so if there are multiple switches, one
|
|
|
|
// of them truly is a normal edge, not an unwind edge.
|
|
|
|
if (SwitchOK && isa<SwitchInst>(PT)) {
|
|
|
|
SwitchOK = false;
|
|
|
|
continue;
|
|
|
|
}
|
2009-05-22 22:36:31 +02:00
|
|
|
if (!isa<InvokeInst>(PT) || LPad == PT->getSuccessor(0)) {
|
|
|
|
OnlyUnwoundTo = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-09-20 04:20:51 +02:00
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
if (OnlyUnwoundTo) {
|
|
|
|
// Only unwind edges lead to the landing pad. Remember the landing pad.
|
|
|
|
LandingPads.insert(LPad);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// At least one normal edge ends at the landing pad. Redirect the unwind
|
|
|
|
// edges to a new basic block which falls through into this one.
|
|
|
|
|
|
|
|
// Create the new basic block.
|
2009-10-29 01:37:35 +01:00
|
|
|
BasicBlock *NewBB = BasicBlock::Create(F->getContext(),
|
2009-08-13 23:58:54 +02:00
|
|
|
LPad->getName() + "_unwind_edge");
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
// Insert it into the function right before the original landing pad.
|
|
|
|
LPad->getParent()->getBasicBlockList().insert(LPad, NewBB);
|
|
|
|
|
|
|
|
// Redirect unwind edges from the original landing pad to NewBB.
|
|
|
|
for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad); PI != PE; ) {
|
|
|
|
TerminatorInst *PT = (*PI++)->getTerminator();
|
|
|
|
if (isa<InvokeInst>(PT) && PT->getSuccessor(1) == LPad)
|
|
|
|
// Unwind to the new block.
|
|
|
|
PT->setSuccessor(1, NewBB);
|
|
|
|
}
|
|
|
|
|
|
|
|
// If there are any PHI nodes in LPad, we need to update them so that they
|
|
|
|
// merge incoming values from NewBB instead.
|
|
|
|
for (BasicBlock::iterator II = LPad->begin(); isa<PHINode>(II); ++II) {
|
|
|
|
PHINode *PN = cast<PHINode>(II);
|
|
|
|
pred_iterator PB = pred_begin(NewBB), PE = pred_end(NewBB);
|
|
|
|
|
|
|
|
// Check to see if all of the values coming in via unwind edges are the
|
|
|
|
// same. If so, we don't need to create a new PHI node.
|
|
|
|
Value *InVal = PN->getIncomingValueForBlock(*PB);
|
|
|
|
for (pred_iterator PI = PB; PI != PE; ++PI) {
|
|
|
|
if (PI != PB && InVal != PN->getIncomingValueForBlock(*PI)) {
|
|
|
|
InVal = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (InVal == 0) {
|
|
|
|
// Different unwind edges have different values. Create a new PHI node
|
|
|
|
// in NewBB.
|
|
|
|
PHINode *NewPN = PHINode::Create(PN->getType(), PN->getName()+".unwind",
|
|
|
|
NewBB);
|
|
|
|
// Add an entry for each unwind edge, using the value from the old PHI.
|
|
|
|
for (pred_iterator PI = PB; PI != PE; ++PI)
|
|
|
|
NewPN->addIncoming(PN->getIncomingValueForBlock(*PI), *PI);
|
|
|
|
|
|
|
|
// Now use this new PHI as the common incoming value for NewBB in PN.
|
|
|
|
InVal = NewPN;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Revector exactly one entry in the PHI node to come from NewBB
|
|
|
|
// and delete all other entries that come from unwind edges. If
|
|
|
|
// there are both normal and unwind edges from the same predecessor,
|
|
|
|
// this leaves an entry for the normal edge.
|
|
|
|
for (pred_iterator PI = PB; PI != PE; ++PI)
|
|
|
|
PN->removeIncomingValue(*PI);
|
|
|
|
PN->addIncoming(InVal, NewBB);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add a fallthrough from NewBB to the original landing pad.
|
|
|
|
BranchInst::Create(LPad, NewBB);
|
|
|
|
|
2010-08-31 11:05:06 +02:00
|
|
|
// Now update DominatorTree analysis information.
|
|
|
|
DT->splitBlock(NewBB);
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
// Remember the newly constructed landing pad. The original landing pad
|
|
|
|
// LPad is no longer a landing pad now that all unwind edges have been
|
|
|
|
// revectored to NewBB.
|
|
|
|
LandingPads.insert(NewBB);
|
|
|
|
++NumLandingPadsSplit;
|
|
|
|
Changed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// LowerUnwinds - Turn unwind instructions into calls to _Unwind_Resume,
|
|
|
|
/// rethrowing any previously caught exception. This will crash horribly
|
|
|
|
/// at runtime if there is no such exception: using unwind to throw a new
|
|
|
|
/// exception is currently not supported.
|
|
|
|
bool DwarfEHPrepare::LowerUnwinds() {
|
2009-09-14 22:52:37 +02:00
|
|
|
SmallVector<TerminatorInst*, 16> UnwindInsts;
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) {
|
|
|
|
TerminatorInst *TI = I->getTerminator();
|
2009-09-14 22:52:37 +02:00
|
|
|
if (isa<UnwindInst>(TI))
|
|
|
|
UnwindInsts.push_back(TI);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (UnwindInsts.empty()) return false;
|
|
|
|
|
|
|
|
// Find the rewind function if we didn't already.
|
|
|
|
if (!RewindFunction) {
|
2009-10-29 01:37:35 +01:00
|
|
|
LLVMContext &Ctx = UnwindInsts[0]->getContext();
|
2009-09-14 22:52:37 +02:00
|
|
|
std::vector<const Type*>
|
2009-10-29 01:37:35 +01:00
|
|
|
Params(1, Type::getInt8PtrTy(Ctx));
|
|
|
|
FunctionType *FTy = FunctionType::get(Type::getVoidTy(Ctx),
|
2009-09-14 22:52:37 +02:00
|
|
|
Params, false);
|
|
|
|
const char *RewindName = TLI->getLibcallName(RTLIB::UNWIND_RESUME);
|
|
|
|
RewindFunction = F->getParent()->getOrInsertFunction(RewindName, FTy);
|
|
|
|
}
|
|
|
|
|
2009-10-29 01:37:35 +01:00
|
|
|
bool Changed = false;
|
|
|
|
|
2009-09-14 22:52:37 +02:00
|
|
|
for (SmallVectorImpl<TerminatorInst*>::iterator
|
|
|
|
I = UnwindInsts.begin(), E = UnwindInsts.end(); I != E; ++I) {
|
|
|
|
TerminatorInst *TI = *I;
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
// Replace the unwind instruction with a call to _Unwind_Resume (or the
|
|
|
|
// appropriate target equivalent) followed by an UnreachableInst.
|
|
|
|
|
|
|
|
// Create the call...
|
2009-09-04 03:14:14 +02:00
|
|
|
CallInst *CI = CallInst::Create(RewindFunction,
|
2010-09-03 10:31:48 +02:00
|
|
|
CreateExceptionValueCall(TI->getParent()),
|
2009-09-14 22:52:37 +02:00
|
|
|
"", TI);
|
2009-09-04 03:14:14 +02:00
|
|
|
CI->setCallingConv(TLI->getLibcallCallingConv(RTLIB::UNWIND_RESUME));
|
2009-05-22 22:36:31 +02:00
|
|
|
// ...followed by an UnreachableInst.
|
2009-10-29 01:37:35 +01:00
|
|
|
new UnreachableInst(TI->getContext(), TI);
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
// Nuke the unwind instruction.
|
|
|
|
TI->eraseFromParent();
|
|
|
|
++NumUnwindsLowered;
|
|
|
|
Changed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// MoveExceptionValueCalls - Ensure that eh.exception is only ever called from
|
2010-09-03 10:31:48 +02:00
|
|
|
/// landing pads by replacing calls outside of landing pads with direct use of
|
|
|
|
/// a register holding the appropriate value; this requires adding calls inside
|
|
|
|
/// all landing pads to initialize the register. Also, move eh.exception calls
|
|
|
|
/// inside landing pads to the start of the landing pad (optional, but may make
|
|
|
|
/// things simpler for later passes).
|
2009-05-22 22:36:31 +02:00
|
|
|
bool DwarfEHPrepare::MoveExceptionValueCalls() {
|
|
|
|
// If the eh.exception intrinsic is not declared in the module then there is
|
|
|
|
// nothing to do. Speed up compilation by checking for this common case.
|
2009-10-29 01:37:35 +01:00
|
|
|
if (!ExceptionValueIntrinsic &&
|
2009-05-22 22:36:31 +02:00
|
|
|
!F->getParent()->getFunction(Intrinsic::getName(Intrinsic::eh_exception)))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
bool Changed = false;
|
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
// Move calls to eh.exception that are inside a landing pad to the start of
|
|
|
|
// the landing pad.
|
|
|
|
for (BBSet::const_iterator LI = LandingPads.begin(), LE = LandingPads.end();
|
|
|
|
LI != LE; ++LI) {
|
|
|
|
BasicBlock *LP = *LI;
|
|
|
|
for (BasicBlock::iterator II = LP->getFirstNonPHIOrDbg(), IE = LP->end();
|
|
|
|
II != IE;)
|
|
|
|
if (EHExceptionInst *EI = dyn_cast<EHExceptionInst>(II++)) {
|
|
|
|
// Found a call to eh.exception.
|
|
|
|
if (!EI->use_empty()) {
|
|
|
|
// If there is already a call to eh.exception at the start of the
|
|
|
|
// landing pad, then get hold of it; otherwise create such a call.
|
|
|
|
Value *CallAtStart = CreateExceptionValueCall(LP);
|
|
|
|
|
|
|
|
// If the call was at the start of a landing pad then leave it alone.
|
|
|
|
if (EI == CallAtStart)
|
|
|
|
continue;
|
|
|
|
EI->replaceAllUsesWith(CallAtStart);
|
2009-05-22 22:36:31 +02:00
|
|
|
}
|
2010-09-03 10:31:48 +02:00
|
|
|
EI->eraseFromParent();
|
|
|
|
++NumExceptionValuesMoved;
|
|
|
|
Changed = true;
|
|
|
|
}
|
2009-05-22 22:36:31 +02:00
|
|
|
}
|
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
// Look for calls to eh.exception that are not in a landing pad. If one is
|
|
|
|
// found, then a register that holds the exception value will be created in
|
|
|
|
// each landing pad, and the SSAUpdater will be used to compute the values
|
|
|
|
// returned by eh.exception calls outside of landing pads.
|
|
|
|
SSAUpdater SSA;
|
|
|
|
|
|
|
|
// Remember where we found the eh.exception call, to avoid rescanning earlier
|
|
|
|
// basic blocks which we already know contain no eh.exception calls.
|
|
|
|
bool FoundCallOutsideLandingPad = false;
|
|
|
|
Function::iterator BB = F->begin();
|
|
|
|
for (Function::iterator BE = F->end(); BB != BE; ++BB) {
|
|
|
|
// Skip over landing pads.
|
|
|
|
if (LandingPads.count(BB))
|
|
|
|
continue;
|
2009-05-22 22:36:31 +02:00
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
|
|
|
|
II != IE; ++II)
|
|
|
|
if (isa<EHExceptionInst>(II)) {
|
|
|
|
SSA.Initialize(II->getType(), II->getName());
|
|
|
|
FoundCallOutsideLandingPad = true;
|
|
|
|
break;
|
|
|
|
}
|
2010-09-01 16:07:47 +02:00
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
if (FoundCallOutsideLandingPad)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If all calls to eh.exception are in landing pads then we are done.
|
|
|
|
if (!FoundCallOutsideLandingPad)
|
|
|
|
return Changed;
|
2009-05-22 22:36:31 +02:00
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
// Add a call to eh.exception at the start of each landing pad, and tell the
|
|
|
|
// SSAUpdater that this is the value produced by the landing pad.
|
2009-05-22 22:36:31 +02:00
|
|
|
for (BBSet::iterator LI = LandingPads.begin(), LE = LandingPads.end();
|
2010-09-03 10:31:48 +02:00
|
|
|
LI != LE; ++LI)
|
|
|
|
SSA.AddAvailableValue(*LI, CreateExceptionValueCall(*LI));
|
|
|
|
|
|
|
|
// Now turn all calls to eh.exception that are not in a landing pad into a use
|
|
|
|
// of the appropriate register.
|
|
|
|
for (Function::iterator BE = F->end(); BB != BE; ++BB) {
|
|
|
|
// Skip over landing pads.
|
|
|
|
if (LandingPads.count(BB))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (BasicBlock::iterator II = BB->getFirstNonPHIOrDbg(), IE = BB->end();
|
|
|
|
II != IE;)
|
|
|
|
if (EHExceptionInst *EI = dyn_cast<EHExceptionInst>(II++)) {
|
|
|
|
// Found a call to eh.exception, replace it with the value from any
|
|
|
|
// upstream landing pad(s).
|
|
|
|
EI->replaceAllUsesWith(SSA.GetValueAtEndOfBlock(BB));
|
|
|
|
EI->eraseFromParent();
|
|
|
|
++NumExceptionValuesMoved;
|
|
|
|
}
|
2009-05-22 22:36:31 +02:00
|
|
|
}
|
|
|
|
|
2010-09-03 10:31:48 +02:00
|
|
|
return true;
|
2009-05-22 22:36:31 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/// CreateExceptionValueCall - Insert a call to the eh.exception intrinsic at
|
|
|
|
/// the start of the basic block (unless there already is one, in which case
|
|
|
|
/// the existing call is returned).
|
|
|
|
Instruction *DwarfEHPrepare::CreateExceptionValueCall(BasicBlock *BB) {
|
2010-04-02 23:49:27 +02:00
|
|
|
Instruction *Start = BB->getFirstNonPHIOrDbg();
|
2009-05-22 22:36:31 +02:00
|
|
|
// Is this a call to eh.exception?
|
|
|
|
if (IntrinsicInst *CI = dyn_cast<IntrinsicInst>(Start))
|
|
|
|
if (CI->getIntrinsicID() == Intrinsic::eh_exception)
|
|
|
|
// Reuse the existing call.
|
|
|
|
return Start;
|
|
|
|
|
|
|
|
// Find the eh.exception intrinsic if we didn't already.
|
2009-10-29 01:37:35 +01:00
|
|
|
if (!ExceptionValueIntrinsic)
|
|
|
|
ExceptionValueIntrinsic = Intrinsic::getDeclaration(F->getParent(),
|
2009-05-22 22:36:31 +02:00
|
|
|
Intrinsic::eh_exception);
|
|
|
|
|
|
|
|
// Create the call.
|
2009-10-29 01:37:35 +01:00
|
|
|
return CallInst::Create(ExceptionValueIntrinsic, "eh.value.call", Start);
|
2009-05-22 22:36:31 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool DwarfEHPrepare::runOnFunction(Function &Fn) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
// Initialize internal state.
|
2010-08-31 11:05:06 +02:00
|
|
|
DT = &getAnalysis<DominatorTree>();
|
2009-05-22 22:36:31 +02:00
|
|
|
F = &Fn;
|
|
|
|
|
|
|
|
// Ensure that only unwind edges end at landing pads (a landing pad is a
|
|
|
|
// basic block where an invoke unwind edge ends).
|
|
|
|
Changed |= NormalizeLandingPads();
|
|
|
|
|
|
|
|
// Turn unwind instructions into libcalls.
|
|
|
|
Changed |= LowerUnwinds();
|
|
|
|
|
2009-10-29 01:37:35 +01:00
|
|
|
// TODO: Move eh.selector calls to landing pads and combine them.
|
2009-05-22 22:36:31 +02:00
|
|
|
|
|
|
|
// Move eh.exception calls to landing pads.
|
|
|
|
Changed |= MoveExceptionValueCalls();
|
|
|
|
|
2010-03-27 00:41:30 +01:00
|
|
|
Changed |= HandleURoRInvokes();
|
|
|
|
|
2009-05-22 22:36:31 +02:00
|
|
|
LandingPads.clear();
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|