2012-03-14 04:04:21 +08:00
|
|
|
//===- SjLjEHPrepare.cpp - Eliminate Invoke & Unwind instructions ---------===//
|
2009-08-18 00:41:22 +08:00
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2009-08-18 00:41:22 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This transformation is designed for use by code generators which use SjLj
|
|
|
|
// based exception handling.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/ADT/SetVector.h"
|
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
|
|
|
#include "llvm/ADT/SmallVector.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
2017-06-06 19:49:48 +08:00
|
|
|
#include "llvm/CodeGen/Passes.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/DataLayout.h"
|
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
|
|
|
#include "llvm/IR/IRBuilder.h"
|
|
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
#include "llvm/IR/Intrinsics.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
Sink all InitializePasses.h includes
This file lists every pass in LLVM, and is included by Pass.h, which is
very popular. Every time we add, remove, or rename a pass in LLVM, it
caused lots of recompilation.
I found this fact by looking at this table, which is sorted by the
number of times a file was changed over the last 100,000 git commits
multiplied by the number of object files that depend on it in the
current checkout:
recompiles touches affected_files header
342380 95 3604 llvm/include/llvm/ADT/STLExtras.h
314730 234 1345 llvm/include/llvm/InitializePasses.h
307036 118 2602 llvm/include/llvm/ADT/APInt.h
213049 59 3611 llvm/include/llvm/Support/MathExtras.h
170422 47 3626 llvm/include/llvm/Support/Compiler.h
162225 45 3605 llvm/include/llvm/ADT/Optional.h
158319 63 2513 llvm/include/llvm/ADT/Triple.h
140322 39 3598 llvm/include/llvm/ADT/StringRef.h
137647 59 2333 llvm/include/llvm/Support/Error.h
131619 73 1803 llvm/include/llvm/Support/FileSystem.h
Before this change, touching InitializePasses.h would cause 1345 files
to recompile. After this change, touching it only causes 550 compiles in
an incremental rebuild.
Reviewers: bkramer, asbirlea, bollu, jdoerfert
Differential Revision: https://reviews.llvm.org/D70211
2019-11-14 05:15:01 +08:00
|
|
|
#include "llvm/InitializePasses.h"
|
2009-08-18 00:41:22 +08:00
|
|
|
#include "llvm/Pass.h"
|
2012-06-29 20:38:19 +08:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2020-03-11 00:39:11 +08:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
Sink all InitializePasses.h includes
This file lists every pass in LLVM, and is included by Pass.h, which is
very popular. Every time we add, remove, or rename a pass in LLVM, it
caused lots of recompilation.
I found this fact by looking at this table, which is sorted by the
number of times a file was changed over the last 100,000 git commits
multiplied by the number of object files that depend on it in the
current checkout:
recompiles touches affected_files header
342380 95 3604 llvm/include/llvm/ADT/STLExtras.h
314730 234 1345 llvm/include/llvm/InitializePasses.h
307036 118 2602 llvm/include/llvm/ADT/APInt.h
213049 59 3611 llvm/include/llvm/Support/MathExtras.h
170422 47 3626 llvm/include/llvm/Support/Compiler.h
162225 45 3605 llvm/include/llvm/ADT/Optional.h
158319 63 2513 llvm/include/llvm/ADT/Triple.h
140322 39 3598 llvm/include/llvm/ADT/StringRef.h
137647 59 2333 llvm/include/llvm/Support/Error.h
131619 73 1803 llvm/include/llvm/Support/FileSystem.h
Before this change, touching InitializePasses.h would cause 1345 files
to recompile. After this change, touching it only causes 550 compiles in
an incremental rebuild.
Reviewers: bkramer, asbirlea, bollu, jdoerfert
Differential Revision: https://reviews.llvm.org/D70211
2019-11-14 05:15:01 +08:00
|
|
|
#include "llvm/Transforms/Utils/Local.h"
|
2009-08-18 00:41:22 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2014-04-22 10:02:50 +08:00
|
|
|
#define DEBUG_TYPE "sjljehprepare"
|
|
|
|
|
2009-08-18 00:41:22 +08:00
|
|
|
STATISTIC(NumInvokes, "Number of invokes replaced");
|
|
|
|
STATISTIC(NumSpilled, "Number of registers live across unwind edges");
|
|
|
|
|
|
|
|
namespace {
|
2013-09-24 04:57:47 +08:00
|
|
|
class SjLjEHPrepare : public FunctionPass {
|
2020-03-11 00:39:11 +08:00
|
|
|
IntegerType *DataTy;
|
2015-04-05 05:07:10 +08:00
|
|
|
Type *doubleUnderDataTy;
|
|
|
|
Type *doubleUnderJBufTy;
|
2013-09-24 04:57:47 +08:00
|
|
|
Type *FunctionContextTy;
|
[opaque pointer types] Add a FunctionCallee wrapper type, and use it.
Recommit r352791 after tweaking DerivedTypes.h slightly, so that gcc
doesn't choke on it, hopefully.
Original Message:
The FunctionCallee type is effectively a {FunctionType*,Value*} pair,
and is a useful convenience to enable code to continue passing the
result of getOrInsertFunction() through to EmitCall, even once pointer
types lose their pointee-type.
Then:
- update the CallInst/InvokeInst instruction creation functions to
take a Callee,
- modify getOrInsertFunction to return FunctionCallee, and
- update all callers appropriately.
One area of particular note is the change to the sanitizer
code. Previously, they had been casting the result of
`getOrInsertFunction` to a `Function*` via
`checkSanitizerInterfaceFunction`, and storing that. That would report
an error if someone had already inserted a function declaraction with
a mismatching signature.
However, in general, LLVM allows for such mismatches, as
`getOrInsertFunction` will automatically insert a bitcast if
needed. As part of this cleanup, cause the sanitizer code to do the
same. (It will call its functions using the expected signature,
however they may have been declared.)
Finally, in a small number of locations, callers of
`getOrInsertFunction` actually were expecting/requiring that a brand
new function was being created. In such cases, I've switched them to
Function::Create instead.
Differential Revision: https://reviews.llvm.org/D57315
llvm-svn: 352827
2019-02-01 10:28:03 +08:00
|
|
|
FunctionCallee RegisterFn;
|
|
|
|
FunctionCallee UnregisterFn;
|
|
|
|
Function *BuiltinSetupDispatchFn;
|
|
|
|
Function *FrameAddrFn;
|
|
|
|
Function *StackAddrFn;
|
|
|
|
Function *StackRestoreFn;
|
|
|
|
Function *LSDAAddrFn;
|
|
|
|
Function *CallSiteFn;
|
|
|
|
Function *FuncCtxFn;
|
2013-09-24 04:57:47 +08:00
|
|
|
AllocaInst *FuncCtx;
|
2020-03-11 00:39:11 +08:00
|
|
|
const TargetMachine *TM;
|
2013-09-24 04:57:47 +08:00
|
|
|
|
|
|
|
public:
|
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2020-03-11 00:39:11 +08:00
|
|
|
explicit SjLjEHPrepare(const TargetMachine *TM = nullptr)
|
|
|
|
: FunctionPass(ID), TM(TM) {}
|
2014-03-07 17:26:03 +08:00
|
|
|
bool doInitialization(Module &M) override;
|
|
|
|
bool runOnFunction(Function &F) override;
|
2013-09-24 04:57:47 +08:00
|
|
|
|
2014-03-07 17:26:03 +08:00
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override {}
|
2016-10-01 10:56:57 +08:00
|
|
|
StringRef getPassName() const override {
|
2013-09-24 04:57:47 +08:00
|
|
|
return "SJLJ Exception Handling preparation";
|
|
|
|
}
|
2009-08-18 00:41:22 +08:00
|
|
|
|
2013-09-24 04:57:47 +08:00
|
|
|
private:
|
|
|
|
bool setupEntryBlockAndCallSites(Function &F);
|
|
|
|
void substituteLPadValues(LandingPadInst *LPI, Value *ExnVal, Value *SelVal);
|
|
|
|
Value *setupFunctionContext(Function &F, ArrayRef<LandingPadInst *> LPads);
|
|
|
|
void lowerIncomingArguments(Function &F);
|
|
|
|
void lowerAcrossUnwindEdges(Function &F, ArrayRef<InvokeInst *> Invokes);
|
|
|
|
void insertCallSiteStore(Instruction *I, int Number);
|
|
|
|
};
|
2009-08-18 00:41:22 +08:00
|
|
|
} // end anonymous namespace
|
|
|
|
|
2012-03-14 04:04:21 +08:00
|
|
|
char SjLjEHPrepare::ID = 0;
|
2017-05-26 05:26:32 +08:00
|
|
|
INITIALIZE_PASS(SjLjEHPrepare, DEBUG_TYPE, "Prepare SjLj exceptions",
|
2015-07-10 05:48:40 +08:00
|
|
|
false, false)
|
2009-08-18 00:41:22 +08:00
|
|
|
|
2012-03-14 04:04:21 +08:00
|
|
|
// Public Interface To the SjLjEHPrepare pass.
|
2020-03-11 00:39:11 +08:00
|
|
|
FunctionPass *llvm::createSjLjEHPreparePass(const TargetMachine *TM) {
|
|
|
|
return new SjLjEHPrepare(TM);
|
|
|
|
}
|
|
|
|
|
2009-08-24 02:13:48 +08:00
|
|
|
// doInitialization - Set up decalarations and types needed to process
|
|
|
|
// exceptions.
|
2012-03-14 04:04:21 +08:00
|
|
|
bool SjLjEHPrepare::doInitialization(Module &M) {
|
2009-08-18 00:41:22 +08:00
|
|
|
// Build the function context structure.
|
|
|
|
// builtin_setjmp uses a five word jbuf
|
2011-07-12 22:06:48 +08:00
|
|
|
Type *VoidPtrTy = Type::getInt8PtrTy(M.getContext());
|
2020-03-11 00:39:11 +08:00
|
|
|
unsigned DataBits =
|
|
|
|
TM ? TM->getSjLjDataSize() : TargetMachine::DefaultSjLjDataSize;
|
|
|
|
DataTy = Type::getIntNTy(M.getContext(), DataBits);
|
|
|
|
doubleUnderDataTy = ArrayType::get(DataTy, 4);
|
2015-04-05 05:07:10 +08:00
|
|
|
doubleUnderJBufTy = ArrayType::get(VoidPtrTy, 5);
|
|
|
|
FunctionContextTy = StructType::get(VoidPtrTy, // __prev
|
2020-03-11 00:39:11 +08:00
|
|
|
DataTy, // call_site
|
2015-04-05 05:07:10 +08:00
|
|
|
doubleUnderDataTy, // __data
|
|
|
|
VoidPtrTy, // __personality
|
|
|
|
VoidPtrTy, // __lsda
|
2017-05-10 03:31:13 +08:00
|
|
|
doubleUnderJBufTy // __jbuf
|
2020-03-11 00:39:11 +08:00
|
|
|
);
|
2009-08-18 00:41:22 +08:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-03-05 06:07:46 +08:00
|
|
|
/// insertCallSiteStore - Insert a store of the call-site value to the
|
|
|
|
/// function context
|
2012-03-14 04:04:21 +08:00
|
|
|
void SjLjEHPrepare::insertCallSiteStore(Instruction *I, int Number) {
|
2012-01-27 10:02:24 +08:00
|
|
|
IRBuilder<> Builder(I);
|
|
|
|
|
|
|
|
// Get a reference to the call_site field.
|
|
|
|
Type *Int32Ty = Type::getInt32Ty(I->getContext());
|
|
|
|
Value *Zero = ConstantInt::get(Int32Ty, 0);
|
|
|
|
Value *One = ConstantInt::get(Int32Ty, 1);
|
|
|
|
Value *Idxs[2] = { Zero, One };
|
2015-03-25 06:38:16 +08:00
|
|
|
Value *CallSite =
|
|
|
|
Builder.CreateGEP(FunctionContextTy, FuncCtx, Idxs, "call_site");
|
2012-01-27 10:02:24 +08:00
|
|
|
|
|
|
|
// Insert a store of the call-site number
|
2020-03-11 00:39:11 +08:00
|
|
|
ConstantInt *CallSiteNoC = ConstantInt::get(DataTy, Number);
|
2013-09-24 04:57:47 +08:00
|
|
|
Builder.CreateStore(CallSiteNoC, CallSite, true /*volatile*/);
|
2010-03-05 06:07:46 +08:00
|
|
|
}
|
|
|
|
|
2016-02-19 12:46:06 +08:00
|
|
|
/// MarkBlocksLiveIn - Insert BB and all of its predecessors into LiveBBs until
|
2009-08-18 00:41:22 +08:00
|
|
|
/// we reach blocks we've already seen.
|
2012-03-16 09:04:00 +08:00
|
|
|
static void MarkBlocksLiveIn(BasicBlock *BB,
|
2014-08-21 13:55:13 +08:00
|
|
|
SmallPtrSetImpl<BasicBlock *> &LiveBBs) {
|
2014-11-19 15:49:26 +08:00
|
|
|
if (!LiveBBs.insert(BB).second)
|
2013-09-24 04:57:47 +08:00
|
|
|
return; // already been here.
|
2009-08-18 00:41:22 +08:00
|
|
|
|
2017-07-13 07:05:15 +08:00
|
|
|
df_iterator_default_set<BasicBlock*> Visited;
|
|
|
|
|
|
|
|
for (BasicBlock *B : inverse_depth_first_ext(BB, Visited))
|
|
|
|
LiveBBs.insert(B);
|
2009-08-18 00:41:22 +08:00
|
|
|
}
|
|
|
|
|
2011-12-15 06:45:33 +08:00
|
|
|
/// substituteLPadValues - Substitute the values returned by the landingpad
|
|
|
|
/// instruction with those returned by the personality function.
|
2012-03-14 04:04:21 +08:00
|
|
|
void SjLjEHPrepare::substituteLPadValues(LandingPadInst *LPI, Value *ExnVal,
|
|
|
|
Value *SelVal) {
|
2021-01-01 01:39:11 +08:00
|
|
|
SmallVector<Value *, 8> UseWorkList(LPI->users());
|
2011-12-15 06:45:33 +08:00
|
|
|
while (!UseWorkList.empty()) {
|
|
|
|
Value *Val = UseWorkList.pop_back_val();
|
2016-02-19 12:46:06 +08:00
|
|
|
auto *EVI = dyn_cast<ExtractValueInst>(Val);
|
2013-09-24 04:57:47 +08:00
|
|
|
if (!EVI)
|
|
|
|
continue;
|
|
|
|
if (EVI->getNumIndices() != 1)
|
|
|
|
continue;
|
2011-12-15 06:45:33 +08:00
|
|
|
if (*EVI->idx_begin() == 0)
|
|
|
|
EVI->replaceAllUsesWith(ExnVal);
|
|
|
|
else if (*EVI->idx_begin() == 1)
|
|
|
|
EVI->replaceAllUsesWith(SelVal);
|
2016-02-19 12:46:06 +08:00
|
|
|
if (EVI->use_empty())
|
2011-12-15 06:45:33 +08:00
|
|
|
EVI->eraseFromParent();
|
|
|
|
}
|
|
|
|
|
2016-02-19 12:46:06 +08:00
|
|
|
if (LPI->use_empty())
|
2013-09-24 04:57:47 +08:00
|
|
|
return;
|
2011-12-15 06:45:33 +08:00
|
|
|
|
|
|
|
// There are still some uses of LPI. Construct an aggregate with the exception
|
|
|
|
// values and replace the LPI with that aggregate.
|
|
|
|
Type *LPadType = LPI->getType();
|
|
|
|
Value *LPadVal = UndefValue::get(LPadType);
|
2015-10-10 06:56:24 +08:00
|
|
|
auto *SelI = cast<Instruction>(SelVal);
|
|
|
|
IRBuilder<> Builder(SelI->getParent(), std::next(SelI->getIterator()));
|
2011-12-15 06:45:33 +08:00
|
|
|
LPadVal = Builder.CreateInsertValue(LPadVal, ExnVal, 0, "lpad.val");
|
|
|
|
LPadVal = Builder.CreateInsertValue(LPadVal, SelVal, 1, "lpad.val");
|
|
|
|
|
|
|
|
LPI->replaceAllUsesWith(LPadVal);
|
|
|
|
}
|
|
|
|
|
2011-09-28 11:14:05 +08:00
|
|
|
/// setupFunctionContext - Allocate the function context on the stack and fill
|
|
|
|
/// it with all of the data that we know at this point.
|
2013-09-24 04:57:47 +08:00
|
|
|
Value *SjLjEHPrepare::setupFunctionContext(Function &F,
|
|
|
|
ArrayRef<LandingPadInst *> LPads) {
|
2015-10-10 06:56:24 +08:00
|
|
|
BasicBlock *EntryBB = &F.front();
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
// Create an alloca for the incoming jump buffer ptr and the new jump buffer
|
|
|
|
// that needs to be restored on all exits from the function. This is an alloca
|
|
|
|
// because the value needs to be added to the global context list.
|
2015-07-08 09:00:31 +08:00
|
|
|
auto &DL = F.getParent()->getDataLayout();
|
2019-10-26 04:26:23 +08:00
|
|
|
const Align Alignment(DL.getPrefTypeAlignment(FunctionContextTy));
|
|
|
|
FuncCtx = new AllocaInst(FunctionContextTy, DL.getAllocaAddrSpace(), nullptr,
|
|
|
|
Alignment, "fn_context", &EntryBB->front());
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
// Fill in the function context structure.
|
2016-02-19 12:46:06 +08:00
|
|
|
for (LandingPadInst *LPI : LPads) {
|
2015-10-10 06:56:24 +08:00
|
|
|
IRBuilder<> Builder(LPI->getParent(),
|
|
|
|
LPI->getParent()->getFirstInsertionPt());
|
2011-09-28 11:14:05 +08:00
|
|
|
|
2012-01-27 10:02:24 +08:00
|
|
|
// Reference the __data field.
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *FCData =
|
|
|
|
Builder.CreateConstGEP2_32(FunctionContextTy, FuncCtx, 0, 2, "__data");
|
2012-01-27 10:02:24 +08:00
|
|
|
|
|
|
|
// The exception values come back in context->__data[0].
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *ExceptionAddr = Builder.CreateConstGEP2_32(doubleUnderDataTy, FCData,
|
|
|
|
0, 0, "exception_gep");
|
2020-03-11 00:39:11 +08:00
|
|
|
Value *ExnVal = Builder.CreateLoad(DataTy, ExceptionAddr, true, "exn_val");
|
2012-09-03 20:27:43 +08:00
|
|
|
ExnVal = Builder.CreateIntToPtr(ExnVal, Builder.getInt8PtrTy());
|
2012-01-27 10:02:24 +08:00
|
|
|
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *SelectorAddr = Builder.CreateConstGEP2_32(doubleUnderDataTy, FCData,
|
|
|
|
0, 1, "exn_selector_gep");
|
2019-02-02 04:44:24 +08:00
|
|
|
Value *SelVal =
|
2020-03-11 00:39:11 +08:00
|
|
|
Builder.CreateLoad(DataTy, SelectorAddr, true, "exn_selector_val");
|
|
|
|
|
|
|
|
// SelVal must be Int32Ty, so trunc it
|
|
|
|
SelVal = Builder.CreateTrunc(SelVal, Type::getInt32Ty(F.getContext()));
|
2011-09-28 11:14:05 +08:00
|
|
|
|
2011-12-15 06:45:33 +08:00
|
|
|
substituteLPadValues(LPI, ExnVal, SelVal);
|
2011-09-28 11:14:05 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Personality function
|
2012-09-03 20:27:43 +08:00
|
|
|
IRBuilder<> Builder(EntryBB->getTerminator());
|
2016-02-19 11:13:40 +08:00
|
|
|
Value *PersonalityFn = F.getPersonalityFn();
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *PersonalityFieldPtr = Builder.CreateConstGEP2_32(
|
|
|
|
FunctionContextTy, FuncCtx, 0, 3, "pers_fn_gep");
|
2013-09-24 04:57:47 +08:00
|
|
|
Builder.CreateStore(
|
|
|
|
Builder.CreateBitCast(PersonalityFn, Builder.getInt8PtrTy()),
|
|
|
|
PersonalityFieldPtr, /*isVolatile=*/true);
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
// LSDA address
|
2015-05-19 06:13:54 +08:00
|
|
|
Value *LSDA = Builder.CreateCall(LSDAAddrFn, {}, "lsda_addr");
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *LSDAFieldPtr =
|
|
|
|
Builder.CreateConstGEP2_32(FunctionContextTy, FuncCtx, 0, 4, "lsda_gep");
|
2012-09-03 20:27:43 +08:00
|
|
|
Builder.CreateStore(LSDA, LSDAFieldPtr, /*isVolatile=*/true);
|
2011-09-28 11:14:05 +08:00
|
|
|
|
2011-10-04 05:15:28 +08:00
|
|
|
return FuncCtx;
|
2011-09-28 11:14:05 +08:00
|
|
|
}
|
|
|
|
|
2011-10-08 08:56:47 +08:00
|
|
|
/// lowerIncomingArguments - To avoid having to handle incoming arguments
|
|
|
|
/// specially, we lower each arg to a copy instruction in the entry block. This
|
|
|
|
/// ensures that the argument value itself cannot be live out of the entry
|
|
|
|
/// block.
|
2012-03-14 04:04:21 +08:00
|
|
|
void SjLjEHPrepare::lowerIncomingArguments(Function &F) {
|
2011-10-08 08:56:47 +08:00
|
|
|
BasicBlock::iterator AfterAllocaInsPt = F.begin()->begin();
|
|
|
|
while (isa<AllocaInst>(AfterAllocaInsPt) &&
|
2016-02-19 12:46:06 +08:00
|
|
|
cast<AllocaInst>(AfterAllocaInsPt)->isStaticAlloca())
|
2011-10-08 08:56:47 +08:00
|
|
|
++AfterAllocaInsPt;
|
2015-10-10 06:56:24 +08:00
|
|
|
assert(AfterAllocaInsPt != F.front().end());
|
2011-10-08 08:56:47 +08:00
|
|
|
|
2015-10-10 06:56:24 +08:00
|
|
|
for (auto &AI : F.args()) {
|
2018-03-14 23:44:07 +08:00
|
|
|
// Swift error really is a register that we model as memory -- instruction
|
|
|
|
// selection will perform mem-to-reg for us and spill/reload appropriately
|
|
|
|
// around calls that clobber it. There is no need to spill this
|
|
|
|
// value to the stack and doing so would not be allowed.
|
|
|
|
if (AI.isSwiftError())
|
|
|
|
continue;
|
|
|
|
|
2015-10-10 06:56:24 +08:00
|
|
|
Type *Ty = AI.getType();
|
2011-10-08 08:56:47 +08:00
|
|
|
|
2014-07-15 02:21:11 +08:00
|
|
|
// Use 'select i8 true, %arg, undef' to simulate a 'no-op' instruction.
|
|
|
|
Value *TrueValue = ConstantInt::getTrue(F.getContext());
|
|
|
|
Value *UndefValue = UndefValue::get(Ty);
|
2015-10-10 06:56:24 +08:00
|
|
|
Instruction *SI = SelectInst::Create(
|
|
|
|
TrueValue, &AI, UndefValue, AI.getName() + ".tmp", &*AfterAllocaInsPt);
|
|
|
|
AI.replaceAllUsesWith(SI);
|
2014-07-15 02:21:11 +08:00
|
|
|
|
|
|
|
// Reset the operand, because it was clobbered by the RAUW above.
|
2015-10-10 06:56:24 +08:00
|
|
|
SI->setOperand(1, &AI);
|
2011-10-08 08:56:47 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// lowerAcrossUnwindEdges - Find all variables which are alive across an unwind
|
|
|
|
/// edge and spill them.
|
2012-03-14 04:04:21 +08:00
|
|
|
void SjLjEHPrepare::lowerAcrossUnwindEdges(Function &F,
|
2013-09-24 04:57:47 +08:00
|
|
|
ArrayRef<InvokeInst *> Invokes) {
|
2011-10-08 08:56:47 +08:00
|
|
|
// Finally, scan the code looking for instructions with bad live ranges.
|
2016-02-19 12:46:06 +08:00
|
|
|
for (BasicBlock &BB : F) {
|
|
|
|
for (Instruction &Inst : BB) {
|
2011-10-08 08:56:47 +08:00
|
|
|
// Ignore obvious cases we don't have to handle. In particular, most
|
|
|
|
// instructions either have no uses or only have a single use inside the
|
|
|
|
// current block. Ignore them quickly.
|
2016-02-19 12:46:06 +08:00
|
|
|
if (Inst.use_empty())
|
2013-09-24 04:57:47 +08:00
|
|
|
continue;
|
2016-02-19 12:46:06 +08:00
|
|
|
if (Inst.hasOneUse() &&
|
|
|
|
cast<Instruction>(Inst.user_back())->getParent() == &BB &&
|
|
|
|
!isa<PHINode>(Inst.user_back()))
|
2013-09-24 04:57:47 +08:00
|
|
|
continue;
|
2011-10-08 08:56:47 +08:00
|
|
|
|
|
|
|
// If this is an alloca in the entry block, it's not a real register
|
|
|
|
// value.
|
2016-02-19 12:46:06 +08:00
|
|
|
if (auto *AI = dyn_cast<AllocaInst>(&Inst))
|
|
|
|
if (AI->isStaticAlloca())
|
2011-10-08 08:56:47 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
// Avoid iterator invalidation by copying users to a temporary vector.
|
2013-09-24 04:57:47 +08:00
|
|
|
SmallVector<Instruction *, 16> Users;
|
2016-02-19 12:46:06 +08:00
|
|
|
for (User *U : Inst.users()) {
|
2014-03-09 11:16:01 +08:00
|
|
|
Instruction *UI = cast<Instruction>(U);
|
2016-02-19 12:46:06 +08:00
|
|
|
if (UI->getParent() != &BB || isa<PHINode>(UI))
|
2014-03-09 11:16:01 +08:00
|
|
|
Users.push_back(UI);
|
2011-10-08 08:56:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Find all of the blocks that this value is live in.
|
2016-01-30 09:24:31 +08:00
|
|
|
SmallPtrSet<BasicBlock *, 32> LiveBBs;
|
2016-02-19 12:46:06 +08:00
|
|
|
LiveBBs.insert(&BB);
|
2011-10-08 08:56:47 +08:00
|
|
|
while (!Users.empty()) {
|
2016-02-19 12:46:06 +08:00
|
|
|
Instruction *U = Users.pop_back_val();
|
2011-10-08 08:56:47 +08:00
|
|
|
|
2012-03-16 09:04:00 +08:00
|
|
|
if (!isa<PHINode>(U)) {
|
|
|
|
MarkBlocksLiveIn(U->getParent(), LiveBBs);
|
|
|
|
} else {
|
2011-10-08 08:56:47 +08:00
|
|
|
// Uses for a PHI node occur in their predecessor block.
|
2012-03-16 09:04:00 +08:00
|
|
|
PHINode *PN = cast<PHINode>(U);
|
2011-10-08 08:56:47 +08:00
|
|
|
for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
|
2016-02-19 12:46:06 +08:00
|
|
|
if (PN->getIncomingValue(i) == &Inst)
|
2012-03-16 09:04:00 +08:00
|
|
|
MarkBlocksLiveIn(PN->getIncomingBlock(i), LiveBBs);
|
2011-10-08 08:56:47 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-16 09:04:00 +08:00
|
|
|
// Now that we know all of the blocks that this thing is live in, see if
|
|
|
|
// it includes any of the unwind locations.
|
|
|
|
bool NeedsSpill = false;
|
2016-02-19 12:46:06 +08:00
|
|
|
for (InvokeInst *Invoke : Invokes) {
|
|
|
|
BasicBlock *UnwindBlock = Invoke->getUnwindDest();
|
|
|
|
if (UnwindBlock != &BB && LiveBBs.count(UnwindBlock)) {
|
2018-05-14 20:53:11 +08:00
|
|
|
LLVM_DEBUG(dbgs() << "SJLJ Spill: " << Inst << " around "
|
|
|
|
<< UnwindBlock->getName() << "\n");
|
2012-03-16 09:04:00 +08:00
|
|
|
NeedsSpill = true;
|
|
|
|
break;
|
2011-10-08 08:56:47 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-16 09:04:00 +08:00
|
|
|
// If we decided we need a spill, do it.
|
|
|
|
// FIXME: Spilling this way is overkill, as it forces all uses of
|
|
|
|
// the value to be reloaded from the stack slot, even those that aren't
|
|
|
|
// in the unwind blocks. We should be more selective.
|
|
|
|
if (NeedsSpill) {
|
2016-02-19 12:46:06 +08:00
|
|
|
DemoteRegToStack(Inst, true);
|
2012-03-16 09:04:00 +08:00
|
|
|
++NumSpilled;
|
2012-03-13 04:19:41 +08:00
|
|
|
}
|
2011-10-08 08:56:47 +08:00
|
|
|
}
|
|
|
|
}
|
2011-10-22 06:08:56 +08:00
|
|
|
|
|
|
|
// Go through the landing pads and remove any PHIs there.
|
2016-02-19 12:46:06 +08:00
|
|
|
for (InvokeInst *Invoke : Invokes) {
|
|
|
|
BasicBlock *UnwindBlock = Invoke->getUnwindDest();
|
2011-10-22 06:08:56 +08:00
|
|
|
LandingPadInst *LPI = UnwindBlock->getLandingPadInst();
|
|
|
|
|
|
|
|
// Place PHIs into a set to avoid invalidating the iterator.
|
2013-09-24 04:57:47 +08:00
|
|
|
SmallPtrSet<PHINode *, 8> PHIsToDemote;
|
|
|
|
for (BasicBlock::iterator PN = UnwindBlock->begin(); isa<PHINode>(PN); ++PN)
|
2011-10-22 06:08:56 +08:00
|
|
|
PHIsToDemote.insert(cast<PHINode>(PN));
|
2013-09-24 04:57:47 +08:00
|
|
|
if (PHIsToDemote.empty())
|
|
|
|
continue;
|
2011-10-22 06:08:56 +08:00
|
|
|
|
|
|
|
// Demote the PHIs to the stack.
|
2014-08-25 07:23:06 +08:00
|
|
|
for (PHINode *PN : PHIsToDemote)
|
|
|
|
DemotePHIToStack(PN);
|
2011-10-22 06:08:56 +08:00
|
|
|
|
|
|
|
// Move the landingpad instruction back to the top of the landing pad block.
|
2015-10-10 06:56:24 +08:00
|
|
|
LPI->moveBefore(&UnwindBlock->front());
|
2011-10-22 06:08:56 +08:00
|
|
|
}
|
2011-10-08 08:56:47 +08:00
|
|
|
}
|
|
|
|
|
2011-09-28 11:14:05 +08:00
|
|
|
/// setupEntryBlockAndCallSites - Setup the entry block by creating and filling
|
|
|
|
/// the function context and marking the call sites with the appropriate
|
|
|
|
/// values. These values are used by the DWARF EH emitter.
|
2012-03-14 04:04:21 +08:00
|
|
|
bool SjLjEHPrepare::setupEntryBlockAndCallSites(Function &F) {
|
2013-09-24 04:57:47 +08:00
|
|
|
SmallVector<ReturnInst *, 16> Returns;
|
|
|
|
SmallVector<InvokeInst *, 16> Invokes;
|
|
|
|
SmallSetVector<LandingPadInst *, 16> LPads;
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
// Look through the terminators of the basic blocks to find invokes.
|
2016-02-19 12:46:06 +08:00
|
|
|
for (BasicBlock &BB : F)
|
|
|
|
if (auto *II = dyn_cast<InvokeInst>(BB.getTerminator())) {
|
2013-03-08 10:21:08 +08:00
|
|
|
if (Function *Callee = II->getCalledFunction())
|
2016-02-19 12:46:06 +08:00
|
|
|
if (Callee->getIntrinsicID() == Intrinsic::donothing) {
|
2013-03-08 10:21:08 +08:00
|
|
|
// Remove the NOP invoke.
|
|
|
|
BranchInst::Create(II->getNormalDest(), II);
|
|
|
|
II->eraseFromParent();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2011-09-28 11:14:05 +08:00
|
|
|
Invokes.push_back(II);
|
Record landing pads with a SmallSetVector to avoid multiple entries.
There may be many invokes that share one landing pad, and the previous code
would record the landing pad once for each invoke. Besides the wasted
effort, a pair of volatile loads gets inserted every time the landing pad is
processed. The rest of the code can get optimized away when a landing pad
is processed repeatedly, but the volatile loads remain, resulting in code like:
LBB35_18:
Ltmp483:
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r4, [r7, #-72]
ldr r2, [r7, #-68]
llvm-svn: 144787
2011-11-16 15:57:21 +08:00
|
|
|
LPads.insert(II->getUnwindDest()->getLandingPadInst());
|
2016-02-19 12:46:06 +08:00
|
|
|
} else if (auto *RI = dyn_cast<ReturnInst>(BB.getTerminator())) {
|
2011-09-29 05:56:53 +08:00
|
|
|
Returns.push_back(RI);
|
2011-09-28 11:14:05 +08:00
|
|
|
}
|
|
|
|
|
2013-09-24 04:57:47 +08:00
|
|
|
if (Invokes.empty())
|
|
|
|
return false;
|
2011-09-28 11:14:05 +08:00
|
|
|
|
2011-10-25 01:12:36 +08:00
|
|
|
NumInvokes += Invokes.size();
|
|
|
|
|
2011-10-08 08:56:47 +08:00
|
|
|
lowerIncomingArguments(F);
|
|
|
|
lowerAcrossUnwindEdges(F, Invokes);
|
|
|
|
|
Record landing pads with a SmallSetVector to avoid multiple entries.
There may be many invokes that share one landing pad, and the previous code
would record the landing pad once for each invoke. Besides the wasted
effort, a pair of volatile loads gets inserted every time the landing pad is
processed. The rest of the code can get optimized away when a landing pad
is processed repeatedly, but the volatile loads remain, resulting in code like:
LBB35_18:
Ltmp483:
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r2, [r7, #-72]
ldr r2, [r7, #-68]
ldr r4, [r7, #-72]
ldr r2, [r7, #-68]
llvm-svn: 144787
2011-11-16 15:57:21 +08:00
|
|
|
Value *FuncCtx =
|
2013-09-24 04:57:47 +08:00
|
|
|
setupFunctionContext(F, makeArrayRef(LPads.begin(), LPads.end()));
|
2015-10-10 06:56:24 +08:00
|
|
|
BasicBlock *EntryBB = &F.front();
|
2012-09-03 20:27:43 +08:00
|
|
|
IRBuilder<> Builder(EntryBB->getTerminator());
|
2011-10-04 05:15:28 +08:00
|
|
|
|
|
|
|
// Get a reference to the jump buffer.
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *JBufPtr =
|
|
|
|
Builder.CreateConstGEP2_32(FunctionContextTy, FuncCtx, 0, 5, "jbuf_gep");
|
2011-10-04 05:15:28 +08:00
|
|
|
|
|
|
|
// Save the frame pointer.
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *FramePtr = Builder.CreateConstGEP2_32(doubleUnderJBufTy, JBufPtr, 0, 0,
|
|
|
|
"jbuf_fp_gep");
|
2011-10-04 05:15:28 +08:00
|
|
|
|
2012-09-03 20:27:43 +08:00
|
|
|
Value *Val = Builder.CreateCall(FrameAddrFn, Builder.getInt32(0), "fp");
|
|
|
|
Builder.CreateStore(Val, FramePtr, /*isVolatile=*/true);
|
2011-10-04 05:15:28 +08:00
|
|
|
|
|
|
|
// Save the stack pointer.
|
2015-04-05 05:07:10 +08:00
|
|
|
Value *StackPtr = Builder.CreateConstGEP2_32(doubleUnderJBufTy, JBufPtr, 0, 2,
|
|
|
|
"jbuf_sp_gep");
|
2011-09-29 05:56:53 +08:00
|
|
|
|
2015-05-19 06:13:54 +08:00
|
|
|
Val = Builder.CreateCall(StackAddrFn, {}, "sp");
|
2012-09-03 20:27:43 +08:00
|
|
|
Builder.CreateStore(Val, StackPtr, /*isVolatile=*/true);
|
2011-09-29 05:56:53 +08:00
|
|
|
|
2015-07-17 06:34:16 +08:00
|
|
|
// Call the setup_dispatch instrinsic. It fills in the rest of the jmpbuf.
|
|
|
|
Builder.CreateCall(BuiltinSetupDispatchFn, {});
|
2011-09-29 05:56:53 +08:00
|
|
|
|
|
|
|
// Store a pointer to the function context so that the back-end will know
|
|
|
|
// where to look for it.
|
2012-09-03 20:27:43 +08:00
|
|
|
Value *FuncCtxArg = Builder.CreateBitCast(FuncCtx, Builder.getInt8PtrTy());
|
|
|
|
Builder.CreateCall(FuncCtxFn, FuncCtxArg);
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
// At this point, we are all set up, update the invoke instructions to mark
|
2011-10-06 06:04:08 +08:00
|
|
|
// their call_site values.
|
2011-09-28 11:14:05 +08:00
|
|
|
for (unsigned I = 0, E = Invokes.size(); I != E; ++I) {
|
2012-01-27 10:02:24 +08:00
|
|
|
insertCallSiteStore(Invokes[I], I + 1);
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
ConstantInt *CallSiteNum =
|
2013-09-24 04:57:47 +08:00
|
|
|
ConstantInt::get(Type::getInt32Ty(F.getContext()), I + 1);
|
2011-09-28 11:14:05 +08:00
|
|
|
|
|
|
|
// Record the call site value for the back end so it stays associated with
|
|
|
|
// the invoke.
|
|
|
|
CallInst::Create(CallSiteFn, CallSiteNum, "", Invokes[I]);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mark call instructions that aren't nounwind as no-action (call_site ==
|
|
|
|
// -1). Skip the entry block, as prior to then, no function context has been
|
|
|
|
// created for this function and any unexpected exceptions thrown will go
|
|
|
|
// directly to the caller's context, which is what we want anyway, so no need
|
|
|
|
// to do anything here.
|
2016-02-19 12:46:06 +08:00
|
|
|
for (BasicBlock &BB : F) {
|
2016-02-22 04:39:50 +08:00
|
|
|
if (&BB == &F.front())
|
2016-02-19 12:46:06 +08:00
|
|
|
continue;
|
|
|
|
for (Instruction &I : BB)
|
|
|
|
if (I.mayThrow())
|
|
|
|
insertCallSiteStore(&I, -1);
|
|
|
|
}
|
2011-09-28 11:14:05 +08:00
|
|
|
|
2011-09-29 05:56:53 +08:00
|
|
|
// Register the function context and make sure it's known to not throw
|
2013-09-24 04:57:47 +08:00
|
|
|
CallInst *Register =
|
|
|
|
CallInst::Create(RegisterFn, FuncCtx, "", EntryBB->getTerminator());
|
2011-09-29 05:56:53 +08:00
|
|
|
Register->setDoesNotThrow();
|
|
|
|
|
2011-11-16 15:12:00 +08:00
|
|
|
// Following any allocas not in the entry block, update the saved SP in the
|
|
|
|
// jmpbuf to the new value.
|
2016-02-19 12:46:06 +08:00
|
|
|
for (BasicBlock &BB : F) {
|
2016-02-22 04:39:50 +08:00
|
|
|
if (&BB == &F.front())
|
2011-11-16 15:12:00 +08:00
|
|
|
continue;
|
2016-02-19 12:46:06 +08:00
|
|
|
for (Instruction &I : BB) {
|
|
|
|
if (auto *CI = dyn_cast<CallInst>(&I)) {
|
2011-11-16 15:12:00 +08:00
|
|
|
if (CI->getCalledFunction() != StackRestoreFn)
|
|
|
|
continue;
|
2016-02-19 12:46:06 +08:00
|
|
|
} else if (!isa<AllocaInst>(&I)) {
|
2011-11-16 15:12:00 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Instruction *StackAddr = CallInst::Create(StackAddrFn, "sp");
|
2016-02-19 12:46:06 +08:00
|
|
|
StackAddr->insertAfter(&I);
|
2020-05-15 05:48:10 +08:00
|
|
|
new StoreInst(StackAddr, StackPtr, true, StackAddr->getNextNode());
|
2011-11-16 15:12:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-29 05:56:53 +08:00
|
|
|
// Finally, for any returns from this function, if this function contains an
|
|
|
|
// invoke, add a call to unregister the function context.
|
2021-06-24 06:33:55 +08:00
|
|
|
for (ReturnInst *Return : Returns) {
|
|
|
|
Instruction *InsertPoint = Return;
|
|
|
|
if (CallInst *CI = Return->getParent()->getTerminatingMustTailCall())
|
|
|
|
InsertPoint = CI;
|
|
|
|
CallInst::Create(UnregisterFn, FuncCtx, "", InsertPoint);
|
|
|
|
}
|
2011-09-29 05:56:53 +08:00
|
|
|
|
2011-09-28 11:14:05 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2012-03-14 04:04:21 +08:00
|
|
|
bool SjLjEHPrepare::runOnFunction(Function &F) {
|
2016-02-19 11:13:40 +08:00
|
|
|
Module &M = *F.getParent();
|
2017-04-07 04:23:57 +08:00
|
|
|
RegisterFn = M.getOrInsertFunction(
|
|
|
|
"_Unwind_SjLj_Register", Type::getVoidTy(M.getContext()),
|
2017-04-11 23:01:18 +08:00
|
|
|
PointerType::getUnqual(FunctionContextTy));
|
2016-02-19 11:13:40 +08:00
|
|
|
UnregisterFn = M.getOrInsertFunction(
|
|
|
|
"_Unwind_SjLj_Unregister", Type::getVoidTy(M.getContext()),
|
2017-04-11 23:01:18 +08:00
|
|
|
PointerType::getUnqual(FunctionContextTy));
|
2019-07-22 20:42:48 +08:00
|
|
|
FrameAddrFn = Intrinsic::getDeclaration(
|
|
|
|
&M, Intrinsic::frameaddress,
|
|
|
|
{Type::getInt8PtrTy(M.getContext(),
|
|
|
|
M.getDataLayout().getAllocaAddrSpace())});
|
2016-02-19 11:13:40 +08:00
|
|
|
StackAddrFn = Intrinsic::getDeclaration(&M, Intrinsic::stacksave);
|
|
|
|
StackRestoreFn = Intrinsic::getDeclaration(&M, Intrinsic::stackrestore);
|
|
|
|
BuiltinSetupDispatchFn =
|
|
|
|
Intrinsic::getDeclaration(&M, Intrinsic::eh_sjlj_setup_dispatch);
|
|
|
|
LSDAAddrFn = Intrinsic::getDeclaration(&M, Intrinsic::eh_sjlj_lsda);
|
|
|
|
CallSiteFn = Intrinsic::getDeclaration(&M, Intrinsic::eh_sjlj_callsite);
|
|
|
|
FuncCtxFn = Intrinsic::getDeclaration(&M, Intrinsic::eh_sjlj_functioncontext);
|
|
|
|
|
2011-10-25 01:12:36 +08:00
|
|
|
bool Res = setupEntryBlockAndCallSites(F);
|
2009-08-18 00:41:22 +08:00
|
|
|
return Res;
|
|
|
|
}
|