2007-01-26 21:38:26 +00:00
|
|
|
//===-- llvm/CodeGen/MachineModuleInfo.cpp ----------------------*- C++ -*-===//
|
2006-01-04 13:36:38 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2006-01-04 13:36:38 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-01-26 21:38:26 +00:00
|
|
|
#include "llvm/CodeGen/MachineModuleInfo.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/ADT/PointerUnion.h"
|
2015-11-17 21:10:25 +00:00
|
|
|
#include "llvm/ADT/TinyPtrVector.h"
|
2015-12-02 23:06:39 +00:00
|
|
|
#include "llvm/Analysis/EHPersonalities.h"
|
2008-06-30 07:31:25 +00:00
|
|
|
#include "llvm/Analysis/ValueTracking.h"
|
2006-11-07 19:33:46 +00:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2016-08-24 01:52:46 +00:00
|
|
|
#include "llvm/CodeGen/MachineFunctionInitializer.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
2008-09-22 22:21:38 +00:00
|
|
|
#include "llvm/CodeGen/Passes.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
|
|
|
#include "llvm/IR/GlobalVariable.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
2011-07-20 05:58:47 +00:00
|
|
|
#include "llvm/MC/MCObjectFileInfo.h"
|
2010-03-14 01:41:15 +00:00
|
|
|
#include "llvm/MC/MCSymbol.h"
|
2006-01-26 20:21:46 +00:00
|
|
|
#include "llvm/Support/Dwarf.h"
|
2009-07-11 20:10:48 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2016-08-24 00:42:05 +00:00
|
|
|
#include "llvm/Target/TargetLoweringObjectFile.h"
|
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2006-01-04 13:36:38 +00:00
|
|
|
using namespace llvm;
|
2006-03-01 20:39:36 +00:00
|
|
|
using namespace llvm::dwarf;
|
2006-01-04 13:36:38 +00:00
|
|
|
|
2012-10-08 16:38:25 +00:00
|
|
|
// Handle the Pass registration stuff necessary to use DataLayout's.
|
2016-08-24 00:42:05 +00:00
|
|
|
INITIALIZE_TM_PASS(MachineModuleInfo, "machinemoduleinfo",
|
|
|
|
"Machine Module Information", false, false)
|
2007-05-03 01:11:54 +00:00
|
|
|
char MachineModuleInfo::ID = 0;
|
2006-01-17 17:31:53 +00:00
|
|
|
|
2009-09-15 22:44:26 +00:00
|
|
|
// Out of line virtual method.
|
|
|
|
MachineModuleInfoImpl::~MachineModuleInfoImpl() {}
|
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
namespace llvm {
|
2015-08-03 22:30:24 +00:00
|
|
|
class MMIAddrLabelMapCallbackPtr final : CallbackVH {
|
2010-03-15 19:09:43 +00:00
|
|
|
MMIAddrLabelMap *Map;
|
|
|
|
public:
|
2014-04-14 00:51:57 +00:00
|
|
|
MMIAddrLabelMapCallbackPtr() : Map(nullptr) {}
|
|
|
|
MMIAddrLabelMapCallbackPtr(Value *V) : CallbackVH(V), Map(nullptr) {}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-22 23:15:57 +00:00
|
|
|
void setPtr(BasicBlock *BB) {
|
|
|
|
ValueHandleBase::operator=(BB);
|
|
|
|
}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
void setMap(MMIAddrLabelMap *map) { Map = map; }
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2014-03-07 09:26:03 +00:00
|
|
|
void deleted() override;
|
|
|
|
void allUsesReplacedWith(Value *V2) override;
|
2010-03-15 19:09:43 +00:00
|
|
|
};
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
class MMIAddrLabelMap {
|
|
|
|
MCContext &Context;
|
|
|
|
struct AddrLabelSymEntry {
|
2016-11-16 22:24:53 +00:00
|
|
|
/// The symbols for the label.
|
2015-06-29 20:21:55 +00:00
|
|
|
TinyPtrVector<MCSymbol *> Symbols;
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
Function *Fn; // The containing function of the BasicBlock.
|
|
|
|
unsigned Index; // The index in BBCallbacks for the BasicBlock.
|
2010-03-15 19:09:43 +00:00
|
|
|
};
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry> AddrLabelSymbols;
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2016-11-16 22:24:53 +00:00
|
|
|
/// Callbacks for the BasicBlock's that we have entries for. We use this so
|
|
|
|
/// we get notified if a block is deleted or RAUWd.
|
2010-03-15 19:09:43 +00:00
|
|
|
std::vector<MMIAddrLabelMapCallbackPtr> BBCallbacks;
|
2010-03-15 20:39:00 +00:00
|
|
|
|
2016-11-16 22:24:53 +00:00
|
|
|
/// This is a per-function list of symbols whose corresponding BasicBlock got
|
|
|
|
/// deleted. These symbols need to be emitted at some point in the file, so
|
|
|
|
/// AsmPrinter emits them after the function body.
|
2010-03-15 20:39:00 +00:00
|
|
|
DenseMap<AssertingVH<Function>, std::vector<MCSymbol*> >
|
|
|
|
DeletedAddrLabelsNeedingEmission;
|
2010-03-15 19:09:43 +00:00
|
|
|
public:
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
MMIAddrLabelMap(MCContext &context) : Context(context) {}
|
2010-03-15 20:39:00 +00:00
|
|
|
~MMIAddrLabelMap() {
|
|
|
|
assert(DeletedAddrLabelsNeedingEmission.empty() &&
|
|
|
|
"Some labels for deleted blocks never got emitted");
|
|
|
|
}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2015-06-29 20:21:55 +00:00
|
|
|
ArrayRef<MCSymbol *> getAddrLabelSymbolToEmit(BasicBlock *BB);
|
2010-03-16 00:29:39 +00:00
|
|
|
|
2010-10-16 08:25:21 +00:00
|
|
|
void takeDeletedSymbolsForFunction(Function *F,
|
2010-03-15 20:39:00 +00:00
|
|
|
std::vector<MCSymbol*> &Result);
|
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
void UpdateForDeletedBlock(BasicBlock *BB);
|
|
|
|
void UpdateForRAUWBlock(BasicBlock *Old, BasicBlock *New);
|
|
|
|
};
|
2015-06-23 09:49:53 +00:00
|
|
|
}
|
2010-03-15 19:09:43 +00:00
|
|
|
|
2015-06-29 20:21:55 +00:00
|
|
|
ArrayRef<MCSymbol *> MMIAddrLabelMap::getAddrLabelSymbolToEmit(BasicBlock *BB) {
|
2010-03-15 19:09:43 +00:00
|
|
|
assert(BB->hasAddressTaken() &&
|
|
|
|
"Shouldn't get label for block without address taken");
|
|
|
|
AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
// If we already had an entry for this block, just return it.
|
2015-06-29 20:21:55 +00:00
|
|
|
if (!Entry.Symbols.empty()) {
|
2010-03-15 20:39:00 +00:00
|
|
|
assert(BB->getParent() == Entry.Fn && "Parent changed");
|
2015-06-29 20:21:55 +00:00
|
|
|
return Entry.Symbols;
|
2010-03-15 20:39:00 +00:00
|
|
|
}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
// Otherwise, this is a new entry, create a new symbol for it and add an
|
|
|
|
// entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd.
|
2015-05-29 19:43:39 +00:00
|
|
|
BBCallbacks.emplace_back(BB);
|
2010-03-15 19:09:43 +00:00
|
|
|
BBCallbacks.back().setMap(this);
|
2015-06-29 20:21:55 +00:00
|
|
|
Entry.Index = BBCallbacks.size() - 1;
|
2010-03-15 20:39:00 +00:00
|
|
|
Entry.Fn = BB->getParent();
|
2015-06-29 20:21:55 +00:00
|
|
|
Entry.Symbols.push_back(Context.createTempSymbol());
|
|
|
|
return Entry.Symbols;
|
2010-03-16 00:29:39 +00:00
|
|
|
}
|
|
|
|
|
2016-11-16 22:24:53 +00:00
|
|
|
/// If we have any deleted symbols for F, return them.
|
2010-03-15 20:39:00 +00:00
|
|
|
void MMIAddrLabelMap::
|
|
|
|
takeDeletedSymbolsForFunction(Function *F, std::vector<MCSymbol*> &Result) {
|
|
|
|
DenseMap<AssertingVH<Function>, std::vector<MCSymbol*> >::iterator I =
|
|
|
|
DeletedAddrLabelsNeedingEmission.find(F);
|
|
|
|
|
|
|
|
// If there are no entries for the function, just return.
|
|
|
|
if (I == DeletedAddrLabelsNeedingEmission.end()) return;
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
// Otherwise, take the list.
|
|
|
|
std::swap(Result, I->second);
|
|
|
|
DeletedAddrLabelsNeedingEmission.erase(I);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
void MMIAddrLabelMap::UpdateForDeletedBlock(BasicBlock *BB) {
|
|
|
|
// If the block got deleted, there is no need for the symbol. If the symbol
|
|
|
|
// was already emitted, we can just forget about it, otherwise we need to
|
|
|
|
// queue it up for later emission when the function is output.
|
2015-06-29 20:21:55 +00:00
|
|
|
AddrLabelSymEntry Entry = std::move(AddrLabelSymbols[BB]);
|
2010-03-15 19:09:43 +00:00
|
|
|
AddrLabelSymbols.erase(BB);
|
2015-06-29 20:21:55 +00:00
|
|
|
assert(!Entry.Symbols.empty() && "Didn't have a symbol, why a callback?");
|
2014-04-14 00:51:57 +00:00
|
|
|
BBCallbacks[Entry.Index] = nullptr; // Clear the callback.
|
2010-03-15 19:09:43 +00:00
|
|
|
|
2014-04-14 00:51:57 +00:00
|
|
|
assert((BB->getParent() == nullptr || BB->getParent() == Entry.Fn) &&
|
2010-03-15 20:39:00 +00:00
|
|
|
"Block/parent mismatch");
|
2010-03-16 00:29:39 +00:00
|
|
|
|
2015-06-29 20:21:55 +00:00
|
|
|
for (MCSymbol *Sym : Entry.Symbols) {
|
2010-03-16 00:29:39 +00:00
|
|
|
if (Sym->isDefined())
|
|
|
|
return;
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
// If the block is not yet defined, we need to emit it at the end of the
|
|
|
|
// function. Add the symbol to the DeletedAddrLabelsNeedingEmission list
|
|
|
|
// for the containing Function. Since the block is being deleted, its
|
|
|
|
// parent may already be removed, we have to get the function from 'Entry'.
|
|
|
|
DeletedAddrLabelsNeedingEmission[Entry.Fn].push_back(Sym);
|
|
|
|
}
|
2010-03-15 19:09:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MMIAddrLabelMap::UpdateForRAUWBlock(BasicBlock *Old, BasicBlock *New) {
|
|
|
|
// Get the entry for the RAUW'd block and remove it from our map.
|
2015-06-29 20:21:55 +00:00
|
|
|
AddrLabelSymEntry OldEntry = std::move(AddrLabelSymbols[Old]);
|
2010-03-15 19:09:43 +00:00
|
|
|
AddrLabelSymbols.erase(Old);
|
2015-06-29 20:21:55 +00:00
|
|
|
assert(!OldEntry.Symbols.empty() && "Didn't have a symbol, why a callback?");
|
2010-03-16 00:29:39 +00:00
|
|
|
|
|
|
|
AddrLabelSymEntry &NewEntry = AddrLabelSymbols[New];
|
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
// If New is not address taken, just move our symbol over to it.
|
2015-06-29 20:21:55 +00:00
|
|
|
if (NewEntry.Symbols.empty()) {
|
2010-03-22 23:15:57 +00:00
|
|
|
BBCallbacks[OldEntry.Index].setPtr(New); // Update the callback.
|
2015-06-29 20:21:55 +00:00
|
|
|
NewEntry = std::move(OldEntry); // Set New's entry.
|
2010-03-16 00:29:39 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-04-14 00:51:57 +00:00
|
|
|
BBCallbacks[OldEntry.Index] = nullptr; // Update the callback.
|
2010-03-16 00:29:39 +00:00
|
|
|
|
2015-06-29 20:21:55 +00:00
|
|
|
// Otherwise, we need to add the old symbols to the new block's set.
|
|
|
|
NewEntry.Symbols.insert(NewEntry.Symbols.end(), OldEntry.Symbols.begin(),
|
|
|
|
OldEntry.Symbols.end());
|
2010-03-15 19:09:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MMIAddrLabelMapCallbackPtr::deleted() {
|
|
|
|
Map->UpdateForDeletedBlock(cast<BasicBlock>(getValPtr()));
|
|
|
|
}
|
|
|
|
|
|
|
|
void MMIAddrLabelMapCallbackPtr::allUsesReplacedWith(Value *V2) {
|
|
|
|
Map->UpdateForRAUWBlock(cast<BasicBlock>(getValPtr()), cast<BasicBlock>(V2));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-01-26 20:21:46 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2009-08-26 21:27:09 +00:00
|
|
|
|
2016-08-24 00:42:05 +00:00
|
|
|
MachineModuleInfo::MachineModuleInfo(const TargetMachine *TM)
|
2016-08-24 01:52:46 +00:00
|
|
|
: ImmutablePass(ID), TM(*TM),
|
|
|
|
Context(TM->getMCAsmInfo(), TM->getMCRegisterInfo(),
|
|
|
|
TM->getObjFileLowering(), nullptr, false) {
|
2010-10-19 17:21:58 +00:00
|
|
|
initializeMachineModuleInfoPass(*PassRegistry::getPassRegistry());
|
2007-05-13 15:42:26 +00:00
|
|
|
}
|
2006-01-26 20:21:46 +00:00
|
|
|
|
2009-09-15 22:44:26 +00:00
|
|
|
MachineModuleInfo::~MachineModuleInfo() {
|
2012-12-05 17:12:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool MachineModuleInfo::doInitialization(Module &M) {
|
2012-12-06 22:12:44 +00:00
|
|
|
|
2014-04-14 00:51:57 +00:00
|
|
|
ObjFileMMI = nullptr;
|
2012-12-05 17:12:22 +00:00
|
|
|
CurCallSite = 0;
|
2015-07-03 07:56:24 +00:00
|
|
|
CallsEHReturn = false;
|
|
|
|
CallsUnwindInit = false;
|
2015-08-27 23:27:47 +00:00
|
|
|
HasEHFunclets = false;
|
2014-12-30 20:05:19 +00:00
|
|
|
DbgInfoAvailable = UsesVAFloatArgument = UsesMorestackAddr = false;
|
2015-02-14 00:21:02 +00:00
|
|
|
PersonalityTypeCache = EHPersonality::Unknown;
|
2014-04-14 00:51:57 +00:00
|
|
|
AddrLabelSymbols = nullptr;
|
2016-08-24 01:52:46 +00:00
|
|
|
TheModule = &M;
|
2012-12-05 17:12:22 +00:00
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool MachineModuleInfo::doFinalization(Module &M) {
|
|
|
|
|
|
|
|
Personalities.clear();
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
delete AddrLabelSymbols;
|
2014-04-14 00:51:57 +00:00
|
|
|
AddrLabelSymbols = nullptr;
|
2012-12-05 17:12:22 +00:00
|
|
|
|
2012-12-12 22:59:46 +00:00
|
|
|
Context.reset();
|
2012-12-06 22:12:44 +00:00
|
|
|
|
2013-01-04 18:04:42 +00:00
|
|
|
delete ObjFileMMI;
|
2014-04-14 00:51:57 +00:00
|
|
|
ObjFileMMI = nullptr;
|
2013-01-04 18:04:42 +00:00
|
|
|
|
2012-12-05 17:12:22 +00:00
|
|
|
return false;
|
2006-01-26 20:21:46 +00:00
|
|
|
}
|
|
|
|
|
2007-01-26 21:38:26 +00:00
|
|
|
void MachineModuleInfo::EndFunction() {
|
2006-04-07 16:34:46 +00:00
|
|
|
// Clean up frame info.
|
2013-05-13 01:16:13 +00:00
|
|
|
FrameInstructions.clear();
|
2009-08-26 21:27:09 +00:00
|
|
|
|
2007-02-21 22:38:31 +00:00
|
|
|
// Clean up exception info.
|
|
|
|
LandingPads.clear();
|
2015-05-29 17:00:57 +00:00
|
|
|
PersonalityTypeCache = EHPersonality::Unknown;
|
2010-01-28 01:45:32 +00:00
|
|
|
CallSiteMap.clear();
|
2007-02-21 22:38:31 +00:00
|
|
|
TypeInfos.clear();
|
2007-06-02 16:53:42 +00:00
|
|
|
FilterIds.clear();
|
2007-07-05 15:15:01 +00:00
|
|
|
FilterEnds.clear();
|
2015-07-03 07:56:24 +00:00
|
|
|
CallsEHReturn = false;
|
|
|
|
CallsUnwindInit = false;
|
2015-08-27 23:27:47 +00:00
|
|
|
HasEHFunclets = false;
|
2014-03-09 15:44:39 +00:00
|
|
|
VariableDbgInfos.clear();
|
2006-04-07 16:34:46 +00:00
|
|
|
}
|
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
//===- Address of Block Management ----------------------------------------===//
|
|
|
|
|
2015-06-29 20:21:55 +00:00
|
|
|
ArrayRef<MCSymbol *>
|
|
|
|
MachineModuleInfo::getAddrLabelSymbolToEmit(const BasicBlock *BB) {
|
2010-03-16 00:29:39 +00:00
|
|
|
// Lazily create AddrLabelSymbols.
|
2014-04-14 00:51:57 +00:00
|
|
|
if (!AddrLabelSymbols)
|
2010-03-16 00:29:39 +00:00
|
|
|
AddrLabelSymbols = new MMIAddrLabelMap(Context);
|
|
|
|
return AddrLabelSymbols->getAddrLabelSymbolToEmit(const_cast<BasicBlock*>(BB));
|
|
|
|
}
|
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
void MachineModuleInfo::
|
|
|
|
takeDeletedSymbolsForFunction(const Function *F,
|
|
|
|
std::vector<MCSymbol*> &Result) {
|
|
|
|
// If no blocks have had their addresses taken, we're done.
|
2014-04-14 00:51:57 +00:00
|
|
|
if (!AddrLabelSymbols) return;
|
2010-03-15 20:39:00 +00:00
|
|
|
return AddrLabelSymbols->
|
|
|
|
takeDeletedSymbolsForFunction(const_cast<Function*>(F), Result);
|
|
|
|
}
|
2010-03-14 17:53:23 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
//===- EH -----------------------------------------------------------------===//
|
2007-02-21 22:38:31 +00:00
|
|
|
|
2008-07-03 22:53:42 +00:00
|
|
|
LandingPadInfo &MachineModuleInfo::getOrCreateLandingPadInfo
|
|
|
|
(MachineBasicBlock *LandingPad) {
|
2007-02-21 22:38:31 +00:00
|
|
|
unsigned N = LandingPads.size();
|
|
|
|
for (unsigned i = 0; i < N; ++i) {
|
2007-03-01 20:25:32 +00:00
|
|
|
LandingPadInfo &LP = LandingPads[i];
|
|
|
|
if (LP.LandingPadBlock == LandingPad)
|
|
|
|
return LP;
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
2009-08-26 21:27:09 +00:00
|
|
|
|
2007-02-21 22:38:31 +00:00
|
|
|
LandingPads.push_back(LandingPadInfo(LandingPad));
|
|
|
|
return LandingPads[N];
|
|
|
|
}
|
|
|
|
|
|
|
|
void MachineModuleInfo::addInvoke(MachineBasicBlock *LandingPad,
|
2010-03-14 01:41:15 +00:00
|
|
|
MCSymbol *BeginLabel, MCSymbol *EndLabel) {
|
2007-03-01 20:25:32 +00:00
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
2007-05-10 22:34:59 +00:00
|
|
|
LP.BeginLabels.push_back(BeginLabel);
|
|
|
|
LP.EndLabels.push_back(EndLabel);
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
|
|
|
|
2010-03-14 02:33:54 +00:00
|
|
|
MCSymbol *MachineModuleInfo::addLandingPad(MachineBasicBlock *LandingPad) {
|
2015-05-18 18:43:14 +00:00
|
|
|
MCSymbol *LandingPadLabel = Context.createTempSymbol();
|
2007-03-01 20:25:32 +00:00
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
2009-08-26 21:27:09 +00:00
|
|
|
LP.LandingPadLabel = LandingPadLabel;
|
2010-03-14 02:33:54 +00:00
|
|
|
return LandingPadLabel;
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
|
|
|
|
2015-07-14 19:22:51 +00:00
|
|
|
void MachineModuleInfo::addPersonality(const Function *Personality) {
|
2008-07-03 22:53:42 +00:00
|
|
|
for (unsigned i = 0; i < Personalities.size(); ++i)
|
2007-05-13 15:42:26 +00:00
|
|
|
if (Personalities[i] == Personality)
|
|
|
|
return;
|
2015-08-31 20:02:16 +00:00
|
|
|
Personalities.push_back(Personality);
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
|
|
|
|
2011-07-28 21:25:33 +00:00
|
|
|
void MachineModuleInfo::
|
|
|
|
addCatchTypeInfo(MachineBasicBlock *LandingPad,
|
2014-11-14 00:35:50 +00:00
|
|
|
ArrayRef<const GlobalValue *> TyInfo) {
|
2007-03-01 20:25:32 +00:00
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
2007-02-21 22:38:31 +00:00
|
|
|
for (unsigned N = TyInfo.size(); N; --N)
|
2007-03-01 20:25:32 +00:00
|
|
|
LP.TypeIds.push_back(getTypeIDFor(TyInfo[N - 1]));
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
2007-06-02 16:53:42 +00:00
|
|
|
|
2011-07-28 21:25:33 +00:00
|
|
|
void MachineModuleInfo::
|
|
|
|
addFilterTypeInfo(MachineBasicBlock *LandingPad,
|
2014-11-14 00:35:50 +00:00
|
|
|
ArrayRef<const GlobalValue *> TyInfo) {
|
2007-03-01 20:25:32 +00:00
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
2008-07-07 21:41:57 +00:00
|
|
|
std::vector<unsigned> IdsInFilter(TyInfo.size());
|
2008-07-03 22:53:42 +00:00
|
|
|
for (unsigned I = 0, E = TyInfo.size(); I != E; ++I)
|
2007-06-02 16:53:42 +00:00
|
|
|
IdsInFilter[I] = getTypeIDFor(TyInfo[I]);
|
|
|
|
LP.TypeIds.push_back(getFilterIDFor(IdsInFilter));
|
2007-03-01 20:25:32 +00:00
|
|
|
}
|
|
|
|
|
There is an impedance matching problem between LLVM and
gcc exception handling: if an exception unwinds through
an invoke, then execution must branch to the invoke's
unwind target. We previously tried to enforce this by
appending a cleanup action to every selector, however
this does not always work correctly due to an optimization
in the C++ unwinding runtime: if only cleanups would be
run while unwinding an exception, then the program just
terminates without actually executing the cleanups, as
invoke semantics would require. I was hoping this
wouldn't be a problem, but in fact it turns out to be the
cause of all the remaining failures in the LLVM testsuite
(these also fail with -enable-correct-eh-support, so turning
on -enable-eh didn't make things worse!). Instead we need
to append a full-blown catch-all to the end of each
selector. The correct way of doing this depends on the
personality function, i.e. it is language dependent, so
can only be done by gcc. Thus this patch which generalizes
the eh.selector intrinsic so that it can handle all possible
kinds of action table entries (before it didn't accomodate
cleanups): now 0 indicates a cleanup, and filters have to be
specified using the number of type infos plus one rather than
the number of type infos. Related gcc patches will cause
Ada to pass a cleanup (0) to force the selector to always
fire, while C++ will use a C++ catch-all (null).
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41484 91177308-0d34-0410-b5e6-96231b3b80d8
2007-08-27 15:47:50 +00:00
|
|
|
void MachineModuleInfo::addCleanup(MachineBasicBlock *LandingPad) {
|
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
|
|
|
LP.TypeIds.push_back(0);
|
|
|
|
}
|
|
|
|
|
2015-04-21 18:23:57 +00:00
|
|
|
void MachineModuleInfo::addSEHCatchHandler(MachineBasicBlock *LandingPad,
|
|
|
|
const Function *Filter,
|
|
|
|
const BlockAddress *RecoverBA) {
|
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
|
|
|
SEHHandler Handler;
|
|
|
|
Handler.FilterOrFinally = Filter;
|
|
|
|
Handler.RecoverBA = RecoverBA;
|
|
|
|
LP.SEHHandlers.push_back(Handler);
|
|
|
|
}
|
|
|
|
|
|
|
|
void MachineModuleInfo::addSEHCleanupHandler(MachineBasicBlock *LandingPad,
|
|
|
|
const Function *Cleanup) {
|
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
|
|
|
SEHHandler Handler;
|
|
|
|
Handler.FilterOrFinally = Cleanup;
|
|
|
|
Handler.RecoverBA = nullptr;
|
|
|
|
LP.SEHHandlers.push_back(Handler);
|
|
|
|
}
|
|
|
|
|
2010-04-16 08:46:10 +00:00
|
|
|
void MachineModuleInfo::TidyLandingPads(DenseMap<MCSymbol*, uintptr_t> *LPMap) {
|
2007-02-21 22:38:31 +00:00
|
|
|
for (unsigned i = 0; i != LandingPads.size(); ) {
|
|
|
|
LandingPadInfo &LandingPad = LandingPads[i];
|
2010-04-16 08:46:10 +00:00
|
|
|
if (LandingPad.LandingPadLabel &&
|
|
|
|
!LandingPad.LandingPadLabel->isDefined() &&
|
|
|
|
(!LPMap || (*LPMap)[LandingPad.LandingPadLabel] == 0))
|
2014-04-14 00:51:57 +00:00
|
|
|
LandingPad.LandingPadLabel = nullptr;
|
2007-05-10 22:34:59 +00:00
|
|
|
|
2007-05-23 11:08:31 +00:00
|
|
|
// Special case: we *should* emit LPs with null LP MBB. This indicates
|
2007-12-19 07:36:31 +00:00
|
|
|
// "nounwind" case.
|
2007-05-23 11:08:31 +00:00
|
|
|
if (!LandingPad.LandingPadLabel && LandingPad.LandingPadBlock) {
|
2007-02-21 22:38:31 +00:00
|
|
|
LandingPads.erase(LandingPads.begin() + i);
|
|
|
|
continue;
|
|
|
|
}
|
Fix PR1628. When exception handling is turned on,
labels are generated bracketing each call (not just
invokes). This is used to generate entries in
the exception table required by the C++ personality.
However it gets in the way of tail-merging. This
patch solves the problem by no longer placing labels
around ordinary calls. Instead we generate entries
in the exception table that cover every instruction
in the function that wasn't covered by an invoke
range (the range given by the labels around the invoke).
As an optimization, such entries are only generated for
parts of the function that contain a call, since for
the moment those are the only instructions that can
throw an exception [1]. As a happy consequence, we
now get a smaller exception table, since the same
region can cover many calls. While there, I also
implemented folding of invoke ranges - successive
ranges are merged when safe to do so. Finally, if
a selector contains only a cleanup, there's a special
shorthand for it - place a 0 in the call-site entry.
I implemented this while there. As a result, the
exception table output (excluding filters) is now
optimal - it cannot be made smaller [2]. The
problem with throw filters is that folding them
optimally is hard, and the benefit of folding them is
minimal.
[1] I tested that having trapping instructions (eg
divide by zero) in such a region doesn't cause trouble.
[2] It could be made smaller with the help of higher
layers, eg by having branch folding reorder basic blocks
ending in invokes with the same landing pad so they
follow each other. I don't know if this is worth doing.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41718 91177308-0d34-0410-b5e6-96231b3b80d8
2007-09-05 11:27:52 +00:00
|
|
|
|
2010-03-14 01:41:15 +00:00
|
|
|
for (unsigned j = 0, e = LandingPads[i].BeginLabels.size(); j != e; ++j) {
|
|
|
|
MCSymbol *BeginLabel = LandingPad.BeginLabels[j];
|
|
|
|
MCSymbol *EndLabel = LandingPad.EndLabels[j];
|
2010-04-16 08:46:10 +00:00
|
|
|
if ((BeginLabel->isDefined() ||
|
|
|
|
(LPMap && (*LPMap)[BeginLabel] != 0)) &&
|
|
|
|
(EndLabel->isDefined() ||
|
|
|
|
(LPMap && (*LPMap)[EndLabel] != 0))) continue;
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-14 01:41:15 +00:00
|
|
|
LandingPad.BeginLabels.erase(LandingPad.BeginLabels.begin() + j);
|
|
|
|
LandingPad.EndLabels.erase(LandingPad.EndLabels.begin() + j);
|
2016-02-18 22:09:30 +00:00
|
|
|
--j;
|
|
|
|
--e;
|
2007-05-10 22:34:59 +00:00
|
|
|
}
|
Fix PR1628. When exception handling is turned on,
labels are generated bracketing each call (not just
invokes). This is used to generate entries in
the exception table required by the C++ personality.
However it gets in the way of tail-merging. This
patch solves the problem by no longer placing labels
around ordinary calls. Instead we generate entries
in the exception table that cover every instruction
in the function that wasn't covered by an invoke
range (the range given by the labels around the invoke).
As an optimization, such entries are only generated for
parts of the function that contain a call, since for
the moment those are the only instructions that can
throw an exception [1]. As a happy consequence, we
now get a smaller exception table, since the same
region can cover many calls. While there, I also
implemented folding of invoke ranges - successive
ranges are merged when safe to do so. Finally, if
a selector contains only a cleanup, there's a special
shorthand for it - place a 0 in the call-site entry.
I implemented this while there. As a result, the
exception table output (excluding filters) is now
optimal - it cannot be made smaller [2]. The
problem with throw filters is that folding them
optimally is hard, and the benefit of folding them is
minimal.
[1] I tested that having trapping instructions (eg
divide by zero) in such a region doesn't cause trouble.
[2] It could be made smaller with the help of higher
layers, eg by having branch folding reorder basic blocks
ending in invokes with the same landing pad so they
follow each other. I don't know if this is worth doing.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41718 91177308-0d34-0410-b5e6-96231b3b80d8
2007-09-05 11:27:52 +00:00
|
|
|
|
|
|
|
// Remove landing pads with no try-ranges.
|
2008-01-29 13:02:09 +00:00
|
|
|
if (LandingPads[i].BeginLabels.empty()) {
|
Fix PR1628. When exception handling is turned on,
labels are generated bracketing each call (not just
invokes). This is used to generate entries in
the exception table required by the C++ personality.
However it gets in the way of tail-merging. This
patch solves the problem by no longer placing labels
around ordinary calls. Instead we generate entries
in the exception table that cover every instruction
in the function that wasn't covered by an invoke
range (the range given by the labels around the invoke).
As an optimization, such entries are only generated for
parts of the function that contain a call, since for
the moment those are the only instructions that can
throw an exception [1]. As a happy consequence, we
now get a smaller exception table, since the same
region can cover many calls. While there, I also
implemented folding of invoke ranges - successive
ranges are merged when safe to do so. Finally, if
a selector contains only a cleanup, there's a special
shorthand for it - place a 0 in the call-site entry.
I implemented this while there. As a result, the
exception table output (excluding filters) is now
optimal - it cannot be made smaller [2]. The
problem with throw filters is that folding them
optimally is hard, and the benefit of folding them is
minimal.
[1] I tested that having trapping instructions (eg
divide by zero) in such a region doesn't cause trouble.
[2] It could be made smaller with the help of higher
layers, eg by having branch folding reorder basic blocks
ending in invokes with the same landing pad so they
follow each other. I don't know if this is worth doing.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41718 91177308-0d34-0410-b5e6-96231b3b80d8
2007-09-05 11:27:52 +00:00
|
|
|
LandingPads.erase(LandingPads.begin() + i);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If there is no landing pad, ensure that the list of typeids is empty.
|
|
|
|
// If the only typeid is a cleanup, this is the same as having no typeids.
|
|
|
|
if (!LandingPad.LandingPadBlock ||
|
|
|
|
(LandingPad.TypeIds.size() == 1 && !LandingPad.TypeIds[0]))
|
|
|
|
LandingPad.TypeIds.clear();
|
2007-02-21 22:38:31 +00:00
|
|
|
++i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-05 22:20:38 +00:00
|
|
|
void MachineModuleInfo::setCallSiteLandingPad(MCSymbol *Sym,
|
|
|
|
ArrayRef<unsigned> Sites) {
|
2012-02-14 10:29:27 +00:00
|
|
|
LPadToCallSiteMap[Sym].append(Sites.begin(), Sites.end());
|
2011-10-05 22:20:38 +00:00
|
|
|
}
|
|
|
|
|
2014-11-14 00:35:50 +00:00
|
|
|
unsigned MachineModuleInfo::getTypeIDFor(const GlobalValue *TI) {
|
2008-07-03 22:53:42 +00:00
|
|
|
for (unsigned i = 0, N = TypeInfos.size(); i != N; ++i)
|
|
|
|
if (TypeInfos[i] == TI) return i + 1;
|
2007-02-21 22:38:31 +00:00
|
|
|
|
|
|
|
TypeInfos.push_back(TI);
|
|
|
|
return TypeInfos.size();
|
|
|
|
}
|
|
|
|
|
2008-06-27 01:27:56 +00:00
|
|
|
int MachineModuleInfo::getFilterIDFor(std::vector<unsigned> &TyIds) {
|
2007-07-05 15:15:01 +00:00
|
|
|
// If the new filter coincides with the tail of an existing filter, then
|
|
|
|
// re-use the existing filter. Folding filters more than this requires
|
|
|
|
// re-ordering filters and/or their elements - probably not worth it.
|
|
|
|
for (std::vector<unsigned>::iterator I = FilterEnds.begin(),
|
|
|
|
E = FilterEnds.end(); I != E; ++I) {
|
2008-06-27 01:27:56 +00:00
|
|
|
unsigned i = *I, j = TyIds.size();
|
2007-07-05 15:15:01 +00:00
|
|
|
|
|
|
|
while (i && j)
|
|
|
|
if (FilterIds[--i] != TyIds[--j])
|
|
|
|
goto try_next;
|
|
|
|
|
|
|
|
if (!j)
|
|
|
|
// The new filter coincides with range [i, end) of the existing filter.
|
|
|
|
return -(1 + i);
|
2008-06-27 01:27:56 +00:00
|
|
|
|
2007-07-05 15:15:01 +00:00
|
|
|
try_next:;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add the new filter.
|
2008-06-27 01:27:56 +00:00
|
|
|
int FilterID = -(1 + FilterIds.size());
|
|
|
|
FilterIds.reserve(FilterIds.size() + TyIds.size() + 1);
|
2012-02-14 10:29:27 +00:00
|
|
|
FilterIds.insert(FilterIds.end(), TyIds.begin(), TyIds.end());
|
2008-06-27 01:27:56 +00:00
|
|
|
FilterEnds.push_back(FilterIds.size());
|
2007-06-02 16:53:42 +00:00
|
|
|
FilterIds.push_back(0); // terminator
|
|
|
|
return FilterID;
|
|
|
|
}
|
2016-08-24 01:52:46 +00:00
|
|
|
|
|
|
|
MachineFunction &MachineModuleInfo::getMachineFunction(const Function &F) {
|
|
|
|
// Shortcut for the common case where a sequence of MachineFunctionPasses
|
|
|
|
// all query for the same Function.
|
|
|
|
if (LastRequest == &F)
|
|
|
|
return *LastResult;
|
|
|
|
|
|
|
|
auto I = MachineFunctions.insert(
|
|
|
|
std::make_pair(&F, std::unique_ptr<MachineFunction>()));
|
|
|
|
MachineFunction *MF;
|
|
|
|
if (I.second) {
|
|
|
|
// No pre-existing machine function, create a new one.
|
|
|
|
MF = new MachineFunction(&F, TM, NextFnNum++, *this);
|
|
|
|
// Update the set entry.
|
|
|
|
I.first->second.reset(MF);
|
|
|
|
|
|
|
|
if (MFInitializer)
|
|
|
|
if (MFInitializer->initializeMachineFunction(*MF))
|
|
|
|
report_fatal_error("Unable to initialize machine function");
|
|
|
|
} else {
|
|
|
|
MF = I.first->second.get();
|
|
|
|
}
|
|
|
|
|
|
|
|
LastRequest = &F;
|
|
|
|
LastResult = MF;
|
|
|
|
return *MF;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MachineModuleInfo::deleteMachineFunctionFor(Function &F) {
|
|
|
|
MachineFunctions.erase(&F);
|
|
|
|
LastRequest = nullptr;
|
|
|
|
LastResult = nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
/// This pass frees the MachineFunction object associated with a Function.
|
|
|
|
class FreeMachineFunction : public FunctionPass {
|
|
|
|
public:
|
|
|
|
static char ID;
|
|
|
|
FreeMachineFunction() : FunctionPass(ID) {}
|
|
|
|
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override {
|
|
|
|
AU.addRequired<MachineModuleInfo>();
|
|
|
|
AU.addPreserved<MachineModuleInfo>();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool runOnFunction(Function &F) override {
|
|
|
|
MachineModuleInfo &MMI = getAnalysis<MachineModuleInfo>();
|
|
|
|
MMI.deleteMachineFunctionFor(F);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
char FreeMachineFunction::ID;
|
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
FunctionPass *createFreeMachineFunctionPass() {
|
|
|
|
return new FreeMachineFunction();
|
|
|
|
}
|
|
|
|
} // end namespace llvm
|