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"
|
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"
|
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"
|
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.
|
2010-07-21 22:09:45 +00:00
|
|
|
INITIALIZE_PASS(MachineModuleInfo, "machinemoduleinfo",
|
2010-10-07 22:25:06 +00:00
|
|
|
"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 {
|
|
|
|
class MMIAddrLabelMapCallbackPtr : CallbackVH {
|
|
|
|
MMIAddrLabelMap *Map;
|
|
|
|
public:
|
|
|
|
MMIAddrLabelMapCallbackPtr() : Map(0) {}
|
|
|
|
MMIAddrLabelMapCallbackPtr(Value *V) : CallbackVH(V), Map(0) {}
|
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
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
virtual void deleted();
|
|
|
|
virtual void allUsesReplacedWith(Value *V2);
|
|
|
|
};
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
class MMIAddrLabelMap {
|
|
|
|
MCContext &Context;
|
|
|
|
struct AddrLabelSymEntry {
|
2010-03-16 00:29:39 +00:00
|
|
|
/// Symbols - The symbols for the label. This is a pointer union that is
|
|
|
|
/// either one symbol (the common case) or a list of symbols.
|
|
|
|
PointerUnion<MCSymbol *, std::vector<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
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
/// BBCallbacks - 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
|
|
|
|
|
|
|
/// DeletedAddrLabelsNeedingEmission - 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.
|
|
|
|
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
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
// Deallocate any of the 'list of symbols' case.
|
|
|
|
for (DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry>::iterator
|
|
|
|
I = AddrLabelSymbols.begin(), E = AddrLabelSymbols.end(); I != E; ++I)
|
|
|
|
if (I->second.Symbols.is<std::vector<MCSymbol*>*>())
|
|
|
|
delete I->second.Symbols.get<std::vector<MCSymbol*>*>();
|
2010-03-15 20:39:00 +00:00
|
|
|
}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
MCSymbol *getAddrLabelSymbol(BasicBlock *BB);
|
|
|
|
std::vector<MCSymbol*> getAddrLabelSymbolToEmit(BasicBlock *BB);
|
|
|
|
|
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);
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
MCSymbol *MMIAddrLabelMap::getAddrLabelSymbol(BasicBlock *BB) {
|
|
|
|
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.
|
2010-03-16 00:29:39 +00:00
|
|
|
if (!Entry.Symbols.isNull()) {
|
2010-03-15 20:39:00 +00:00
|
|
|
assert(BB->getParent() == Entry.Fn && "Parent changed");
|
2010-03-16 00:29:39 +00:00
|
|
|
if (Entry.Symbols.is<MCSymbol*>())
|
|
|
|
return Entry.Symbols.get<MCSymbol*>();
|
|
|
|
return (*Entry.Symbols.get<std::vector<MCSymbol*>*>())[0];
|
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.
|
|
|
|
BBCallbacks.push_back(BB);
|
|
|
|
BBCallbacks.back().setMap(this);
|
|
|
|
Entry.Index = BBCallbacks.size()-1;
|
2010-03-15 20:39:00 +00:00
|
|
|
Entry.Fn = BB->getParent();
|
2010-03-16 00:29:39 +00:00
|
|
|
MCSymbol *Result = Context.CreateTempSymbol();
|
|
|
|
Entry.Symbols = Result;
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<MCSymbol*>
|
|
|
|
MMIAddrLabelMap::getAddrLabelSymbolToEmit(BasicBlock *BB) {
|
|
|
|
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-16 00:29:39 +00:00
|
|
|
std::vector<MCSymbol*> Result;
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
// If we already had an entry for this block, just return it.
|
|
|
|
if (Entry.Symbols.isNull())
|
|
|
|
Result.push_back(getAddrLabelSymbol(BB));
|
|
|
|
else if (MCSymbol *Sym = Entry.Symbols.dyn_cast<MCSymbol*>())
|
|
|
|
Result.push_back(Sym);
|
|
|
|
else
|
|
|
|
Result = *Entry.Symbols.get<std::vector<MCSymbol*>*>();
|
|
|
|
return Result;
|
2010-03-15 19:09:43 +00:00
|
|
|
}
|
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
/// takeDeletedSymbolsForFunction - If we have any deleted symbols for F, return
|
|
|
|
/// them.
|
|
|
|
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.
|
|
|
|
AddrLabelSymEntry Entry = AddrLabelSymbols[BB];
|
|
|
|
AddrLabelSymbols.erase(BB);
|
2010-03-16 00:29:39 +00:00
|
|
|
assert(!Entry.Symbols.isNull() && "Didn't have a symbol, why a callback?");
|
2010-03-15 19:09:43 +00:00
|
|
|
BBCallbacks[Entry.Index] = 0; // Clear the callback.
|
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
assert((BB->getParent() == 0 || BB->getParent() == Entry.Fn) &&
|
|
|
|
"Block/parent mismatch");
|
2010-03-16 00:29:39 +00:00
|
|
|
|
|
|
|
// Handle both the single and the multiple symbols cases.
|
|
|
|
if (MCSymbol *Sym = Entry.Symbols.dyn_cast<MCSymbol*>()) {
|
|
|
|
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);
|
|
|
|
} else {
|
|
|
|
std::vector<MCSymbol*> *Syms = Entry.Symbols.get<std::vector<MCSymbol*>*>();
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = Syms->size(); i != e; ++i) {
|
|
|
|
MCSymbol *Sym = (*Syms)[i];
|
|
|
|
if (Sym->isDefined()) continue; // Ignore already emitted labels.
|
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-10-16 08:25:21 +00:00
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
// The entry is deleted, free the memory associated with the symbol list.
|
|
|
|
delete Syms;
|
|
|
|
}
|
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.
|
|
|
|
AddrLabelSymEntry OldEntry = AddrLabelSymbols[Old];
|
|
|
|
AddrLabelSymbols.erase(Old);
|
2010-03-16 00:29:39 +00:00
|
|
|
assert(!OldEntry.Symbols.isNull() && "Didn't have a symbol, why a callback?");
|
|
|
|
|
|
|
|
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.
|
2010-03-16 00:29:39 +00:00
|
|
|
if (NewEntry.Symbols.isNull()) {
|
2010-03-22 23:15:57 +00:00
|
|
|
BBCallbacks[OldEntry.Index].setPtr(New); // Update the callback.
|
2010-03-16 00:29:39 +00:00
|
|
|
NewEntry = OldEntry; // Set New's entry.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
BBCallbacks[OldEntry.Index] = 0; // Update the callback.
|
|
|
|
|
|
|
|
// Otherwise, we need to add the old symbol to the new block's set. If it is
|
|
|
|
// just a single entry, upgrade it to a symbol list.
|
|
|
|
if (MCSymbol *PrevSym = NewEntry.Symbols.dyn_cast<MCSymbol*>()) {
|
|
|
|
std::vector<MCSymbol*> *SymList = new std::vector<MCSymbol*>();
|
|
|
|
SymList->push_back(PrevSym);
|
|
|
|
NewEntry.Symbols = SymList;
|
|
|
|
}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
std::vector<MCSymbol*> *SymList =
|
|
|
|
NewEntry.Symbols.get<std::vector<MCSymbol*>*>();
|
|
|
|
|
|
|
|
// If the old entry was a single symbol, add it.
|
|
|
|
if (MCSymbol *Sym = OldEntry.Symbols.dyn_cast<MCSymbol*>()) {
|
|
|
|
SymList->push_back(Sym);
|
|
|
|
return;
|
2010-03-15 19:09:43 +00:00
|
|
|
}
|
2010-10-16 08:25:21 +00:00
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
// Otherwise, concatenate the list.
|
|
|
|
std::vector<MCSymbol*> *Syms =OldEntry.Symbols.get<std::vector<MCSymbol*>*>();
|
|
|
|
SymList->insert(SymList->end(), Syms->begin(), Syms->end());
|
|
|
|
delete Syms;
|
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
|
|
|
|
2010-12-10 07:39:47 +00:00
|
|
|
MachineModuleInfo::MachineModuleInfo(const MCAsmInfo &MAI,
|
2011-07-18 20:57:22 +00:00
|
|
|
const MCRegisterInfo &MRI,
|
2011-07-20 19:50:42 +00:00
|
|
|
const MCObjectFileInfo *MOFI)
|
2012-12-06 22:12:44 +00:00
|
|
|
: ImmutablePass(ID), Context(MAI, MRI, MOFI, 0, 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
|
|
|
|
2010-03-13 20:55:24 +00:00
|
|
|
MachineModuleInfo::MachineModuleInfo()
|
2011-07-20 05:58:47 +00:00
|
|
|
: ImmutablePass(ID),
|
2011-07-20 19:50:42 +00:00
|
|
|
Context(*(MCAsmInfo*)0, *(MCRegisterInfo*)0, (MCObjectFileInfo*)0) {
|
2012-02-05 08:31:47 +00:00
|
|
|
llvm_unreachable("This MachineModuleInfo constructor should never be called, "
|
|
|
|
"MMI should always be explicitly constructed by "
|
|
|
|
"LLVMTargetMachine");
|
2010-03-13 20:55:24 +00:00
|
|
|
}
|
|
|
|
|
2009-09-15 22:44:26 +00:00
|
|
|
MachineModuleInfo::~MachineModuleInfo() {
|
2012-12-05 17:12:22 +00:00
|
|
|
}
|
|
|
|
|
2013-05-13 01:16:13 +00:00
|
|
|
static MCCFIInstruction convertMoveToCFI(const MCRegisterInfo &MRI,
|
|
|
|
MCSymbol *Label,
|
|
|
|
const MachineLocation &Dst,
|
|
|
|
const MachineLocation &Src) {
|
|
|
|
// If advancing cfa.
|
|
|
|
if (Dst.isReg() && Dst.getReg() == MachineLocation::VirtualFP) {
|
|
|
|
if (Src.getReg() == MachineLocation::VirtualFP)
|
|
|
|
return MCCFIInstruction::createDefCfaOffset(Label, Src.getOffset());
|
|
|
|
// Reg + Offset
|
|
|
|
return MCCFIInstruction::createDefCfa(
|
|
|
|
Label, MRI.getDwarfRegNum(Src.getReg(), true), -Src.getOffset());
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Src.isReg() && Src.getReg() == MachineLocation::VirtualFP) {
|
|
|
|
assert(Dst.isReg() && "Machine move not supported yet.");
|
|
|
|
return MCCFIInstruction::createDefCfaRegister(
|
|
|
|
Label, MRI.getDwarfRegNum(Dst.getReg(), true));
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(!Dst.isReg() && "Machine move not supported yet.");
|
|
|
|
return MCCFIInstruction::createOffset(
|
|
|
|
Label, MRI.getDwarfRegNum(Src.getReg(), true), Dst.getOffset());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MachineModuleInfo::addFrameMove(MCSymbol *Label,
|
|
|
|
const MachineLocation &Dst,
|
|
|
|
const MachineLocation &Src) {
|
|
|
|
MCCFIInstruction I =
|
|
|
|
convertMoveToCFI(Context.getRegisterInfo(), Label, Dst, Src);
|
|
|
|
FrameInstructions.push_back(I);
|
|
|
|
}
|
|
|
|
|
2012-12-05 17:12:22 +00:00
|
|
|
bool MachineModuleInfo::doInitialization(Module &M) {
|
2012-12-06 22:12:44 +00:00
|
|
|
|
2012-12-05 17:12:22 +00:00
|
|
|
ObjFileMMI = 0;
|
|
|
|
CompactUnwindEncoding = 0;
|
|
|
|
CurCallSite = 0;
|
|
|
|
CallsEHReturn = 0;
|
|
|
|
CallsUnwindInit = 0;
|
|
|
|
DbgInfoAvailable = UsesVAFloatArgument = false;
|
|
|
|
// Always emit some info, by default "no personality" info.
|
|
|
|
Personalities.push_back(NULL);
|
|
|
|
AddrLabelSymbols = 0;
|
|
|
|
TheModule = 0;
|
|
|
|
|
|
|
|
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;
|
|
|
|
AddrLabelSymbols = 0;
|
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;
|
|
|
|
ObjFileMMI = 0;
|
|
|
|
|
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
|
|
|
/// EndFunction - Discard function meta information.
|
2006-04-07 16:34: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();
|
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();
|
2007-07-14 14:06:15 +00:00
|
|
|
CallsEHReturn = 0;
|
|
|
|
CallsUnwindInit = 0;
|
2011-07-19 00:00:58 +00:00
|
|
|
CompactUnwindEncoding = 0;
|
2009-10-08 20:41:17 +00:00
|
|
|
VariableDbgInfo.clear();
|
2006-04-07 16:34:46 +00:00
|
|
|
}
|
|
|
|
|
2006-01-26 20:21:46 +00:00
|
|
|
/// AnalyzeModule - Scan the module for global debug information.
|
|
|
|
///
|
2010-04-15 01:51:59 +00:00
|
|
|
void MachineModuleInfo::AnalyzeModule(const Module &M) {
|
2009-07-20 06:14:25 +00:00
|
|
|
// Insert functions in the llvm.used array (but not llvm.compiler.used) into
|
|
|
|
// UsedFunctions.
|
2010-04-15 01:51:59 +00:00
|
|
|
const GlobalVariable *GV = M.getGlobalVariable("llvm.used");
|
2008-01-16 19:59:28 +00:00
|
|
|
if (!GV || !GV->hasInitializer()) return;
|
|
|
|
|
|
|
|
// Should be an array of 'i8*'.
|
2013-04-22 14:58:02 +00:00
|
|
|
const ConstantArray *InitList = cast<ConstantArray>(GV->getInitializer());
|
2008-01-16 19:59:28 +00:00
|
|
|
|
2009-07-20 06:05:50 +00:00
|
|
|
for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
|
2010-04-15 01:51:59 +00:00
|
|
|
if (const Function *F =
|
2009-07-20 06:05:50 +00:00
|
|
|
dyn_cast<Function>(InitList->getOperand(i)->stripPointerCasts()))
|
|
|
|
UsedFunctions.insert(F);
|
2006-01-26 20:21:46 +00:00
|
|
|
}
|
|
|
|
|
2010-03-15 19:09:43 +00:00
|
|
|
//===- Address of Block Management ----------------------------------------===//
|
|
|
|
|
|
|
|
|
2010-03-14 17:53:23 +00:00
|
|
|
/// getAddrLabelSymbol - Return the symbol to be used for the specified basic
|
|
|
|
/// block when its address is taken. This cannot be its normal LBB label
|
|
|
|
/// because the block may be accessed outside its containing function.
|
|
|
|
MCSymbol *MachineModuleInfo::getAddrLabelSymbol(const BasicBlock *BB) {
|
2010-03-15 19:09:43 +00:00
|
|
|
// Lazily create AddrLabelSymbols.
|
|
|
|
if (AddrLabelSymbols == 0)
|
|
|
|
AddrLabelSymbols = new MMIAddrLabelMap(Context);
|
|
|
|
return AddrLabelSymbols->getAddrLabelSymbol(const_cast<BasicBlock*>(BB));
|
2010-03-14 17:53:23 +00:00
|
|
|
}
|
|
|
|
|
2010-03-16 00:29:39 +00:00
|
|
|
/// getAddrLabelSymbolToEmit - Return the symbol to be used for the specified
|
|
|
|
/// basic block when its address is taken. If other blocks were RAUW'd to
|
|
|
|
/// this one, we may have to emit them as well, return the whole set.
|
|
|
|
std::vector<MCSymbol*> MachineModuleInfo::
|
|
|
|
getAddrLabelSymbolToEmit(const BasicBlock *BB) {
|
|
|
|
// Lazily create AddrLabelSymbols.
|
|
|
|
if (AddrLabelSymbols == 0)
|
|
|
|
AddrLabelSymbols = new MMIAddrLabelMap(Context);
|
|
|
|
return AddrLabelSymbols->getAddrLabelSymbolToEmit(const_cast<BasicBlock*>(BB));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-03-15 20:39:00 +00:00
|
|
|
/// takeDeletedSymbolsForFunction - If the specified function has had any
|
|
|
|
/// references to address-taken blocks generated, but the block got deleted,
|
|
|
|
/// return the symbol now so we can emit it. This prevents emitting a
|
|
|
|
/// reference to a symbol that has no definition.
|
|
|
|
void MachineModuleInfo::
|
|
|
|
takeDeletedSymbolsForFunction(const Function *F,
|
|
|
|
std::vector<MCSymbol*> &Result) {
|
|
|
|
// If no blocks have had their addresses taken, we're done.
|
|
|
|
if (AddrLabelSymbols == 0) return;
|
|
|
|
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
|
|
|
|
|
|
|
/// getOrCreateLandingPadInfo - Find or create an LandingPadInfo for the
|
|
|
|
/// specified MachineBasicBlock.
|
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];
|
|
|
|
}
|
|
|
|
|
|
|
|
/// addInvoke - Provide the begin and end labels of an invoke style call and
|
|
|
|
/// associate it with a try landing pad block.
|
|
|
|
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
|
|
|
}
|
|
|
|
|
|
|
|
/// addLandingPad - Provide the label of a try LandingPad block.
|
|
|
|
///
|
2010-03-14 02:33:54 +00:00
|
|
|
MCSymbol *MachineModuleInfo::addLandingPad(MachineBasicBlock *LandingPad) {
|
2010-03-14 08:36:50 +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
|
|
|
}
|
|
|
|
|
|
|
|
/// addPersonality - Provide the personality function for the exception
|
|
|
|
/// information.
|
|
|
|
void MachineModuleInfo::addPersonality(MachineBasicBlock *LandingPad,
|
2010-04-15 01:51:59 +00:00
|
|
|
const Function *Personality) {
|
2007-03-01 20:25:32 +00:00
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
2007-05-13 15:42:26 +00:00
|
|
|
LP.Personality = Personality;
|
2007-05-12 22:36:25 +00:00
|
|
|
|
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;
|
2009-08-26 21:27:09 +00:00
|
|
|
|
2009-08-26 21:30:49 +00:00
|
|
|
// If this is the first personality we're adding go
|
|
|
|
// ahead and add it at the beginning.
|
|
|
|
if (Personalities[0] == NULL)
|
|
|
|
Personalities[0] = Personality;
|
|
|
|
else
|
|
|
|
Personalities.push_back(Personality);
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// addCatchTypeInfo - Provide the catch typeinfo for a landing pad.
|
|
|
|
///
|
2011-07-28 21:25:33 +00:00
|
|
|
void MachineModuleInfo::
|
|
|
|
addCatchTypeInfo(MachineBasicBlock *LandingPad,
|
|
|
|
ArrayRef<const GlobalVariable *> 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
|
|
|
|
|
|
|
/// addFilterTypeInfo - Provide the filter typeinfo for a landing pad.
|
2007-03-01 20:25:32 +00:00
|
|
|
///
|
2011-07-28 21:25:33 +00:00
|
|
|
void MachineModuleInfo::
|
|
|
|
addFilterTypeInfo(MachineBasicBlock *LandingPad,
|
|
|
|
ArrayRef<const GlobalVariable *> 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
|
|
|
/// addCleanup - Add a cleanup action for a landing pad.
|
|
|
|
///
|
|
|
|
void MachineModuleInfo::addCleanup(MachineBasicBlock *LandingPad) {
|
|
|
|
LandingPadInfo &LP = getOrCreateLandingPadInfo(LandingPad);
|
|
|
|
LP.TypeIds.push_back(0);
|
|
|
|
}
|
|
|
|
|
2007-02-21 22:38:31 +00:00
|
|
|
/// TidyLandingPads - Remap landing pad labels and remove any deleted landing
|
|
|
|
/// pads.
|
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))
|
2010-03-09 01:51:43 +00:00
|
|
|
LandingPad.LandingPadLabel = 0;
|
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);
|
|
|
|
--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
|
|
|
/// setCallSiteLandingPad - Map the landing pad's EH symbol to the call site
|
|
|
|
/// indexes.
|
|
|
|
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
|
|
|
}
|
|
|
|
|
2009-08-26 21:27:09 +00:00
|
|
|
/// getTypeIDFor - Return the type id for the specified typeinfo. This is
|
2007-02-21 22:38:31 +00:00
|
|
|
/// function wide.
|
2010-04-15 01:51:59 +00:00
|
|
|
unsigned MachineModuleInfo::getTypeIDFor(const GlobalVariable *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();
|
|
|
|
}
|
|
|
|
|
2007-06-02 16:53:42 +00:00
|
|
|
/// getFilterIDFor - Return the filter id for the specified typeinfos. This is
|
|
|
|
/// function wide.
|
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;
|
|
|
|
}
|
|
|
|
|
2007-05-13 15:42:26 +00:00
|
|
|
/// getPersonality - Return the personality function for the current function.
|
2010-04-15 01:51:59 +00:00
|
|
|
const Function *MachineModuleInfo::getPersonality() const {
|
2007-05-12 22:36:25 +00:00
|
|
|
// FIXME: Until PR1414 will be fixed, we're using 1 personality function per
|
2007-05-13 15:42:26 +00:00
|
|
|
// function
|
|
|
|
return !LandingPads.empty() ? LandingPads[0].Personality : NULL;
|
2007-02-21 22:38:31 +00:00
|
|
|
}
|
|
|
|
|
2007-05-13 15:42:26 +00:00
|
|
|
/// getPersonalityIndex - Return unique index for current personality
|
2009-08-26 21:44:57 +00:00
|
|
|
/// function. NULL/first personality function should always get zero index.
|
2007-05-13 15:42:26 +00:00
|
|
|
unsigned MachineModuleInfo::getPersonalityIndex() const {
|
2007-05-23 11:08:31 +00:00
|
|
|
const Function* Personality = NULL;
|
2009-08-26 21:27:09 +00:00
|
|
|
|
2007-05-23 11:08:31 +00:00
|
|
|
// Scan landing pads. If there is at least one non-NULL personality - use it.
|
2012-02-13 23:45:26 +00:00
|
|
|
for (unsigned i = 0, e = LandingPads.size(); i != e; ++i)
|
2007-05-23 11:08:31 +00:00
|
|
|
if (LandingPads[i].Personality) {
|
|
|
|
Personality = LandingPads[i].Personality;
|
|
|
|
break;
|
|
|
|
}
|
2009-08-26 21:27:09 +00:00
|
|
|
|
2012-02-13 23:45:26 +00:00
|
|
|
for (unsigned i = 0, e = Personalities.size(); i < e; ++i) {
|
2007-05-13 15:42:26 +00:00
|
|
|
if (Personalities[i] == Personality)
|
|
|
|
return i;
|
2008-07-03 22:53:42 +00:00
|
|
|
}
|
2007-05-13 15:42:26 +00:00
|
|
|
|
2009-08-26 21:44:57 +00:00
|
|
|
// This will happen if the current personality function is
|
|
|
|
// in the zero index.
|
2007-05-13 15:42:26 +00:00
|
|
|
return 0;
|
|
|
|
}
|