2003-10-10 17:45:12 +00:00
|
|
|
//===-- ExecutionEngine.cpp - Common Implementation shared by EEs ---------===//
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +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.
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2002-12-24 00:01:05 +00:00
|
|
|
// This file defines the common interface used by the various execution engine
|
|
|
|
// subclasses.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2003-08-05 17:00:32 +00:00
|
|
|
#define DEBUG_TYPE "jit"
|
2009-08-07 19:54:29 +00:00
|
|
|
#include "llvm/ExecutionEngine/ExecutionEngine.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
2003-09-05 20:08:15 +00:00
|
|
|
#include "llvm/ExecutionEngine/GenericValue.h"
|
2014-01-07 11:48:04 +00:00
|
|
|
#include "llvm/ExecutionEngine/JITMemoryManager.h"
|
|
|
|
#include "llvm/ExecutionEngine/ObjectCache.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/DataLayout.h"
|
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
|
|
|
#include "llvm/IR/Operator.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/Support/DynamicLibrary.h"
|
2009-07-07 17:32:34 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/Support/Host.h"
|
2006-05-08 22:00:52 +00:00
|
|
|
#include "llvm/Support/MutexGuard.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/Support/TargetRegistry.h"
|
2009-08-07 19:54:29 +00:00
|
|
|
#include "llvm/Support/ValueHandle.h"
|
2009-07-11 13:10:19 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2011-05-13 21:51:29 +00:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2008-02-20 11:08:44 +00:00
|
|
|
#include <cmath>
|
|
|
|
#include <cstring>
|
2003-11-19 21:08:57 +00:00
|
|
|
using namespace llvm;
|
2002-12-24 00:01:05 +00:00
|
|
|
|
2006-12-19 22:43:32 +00:00
|
|
|
STATISTIC(NumInitBytes, "Number of bytes of global vars initialized");
|
|
|
|
STATISTIC(NumGlobals , "Number of global vars initialized");
|
2002-12-24 00:01:05 +00:00
|
|
|
|
2013-11-19 00:57:56 +00:00
|
|
|
// Pin the vtable to this file.
|
|
|
|
void ObjectCache::anchor() {}
|
|
|
|
void ObjectBuffer::anchor() {}
|
|
|
|
void ObjectBufferStream::anchor() {}
|
|
|
|
|
2010-02-05 16:19:36 +00:00
|
|
|
ExecutionEngine *(*ExecutionEngine::JITCtor)(
|
|
|
|
Module *M,
|
|
|
|
std::string *ErrorStr,
|
|
|
|
JITMemoryManager *JMM,
|
|
|
|
bool GVsWithCode,
|
2011-05-13 21:51:29 +00:00
|
|
|
TargetMachine *TM) = 0;
|
2010-11-17 16:06:37 +00:00
|
|
|
ExecutionEngine *(*ExecutionEngine::MCJITCtor)(
|
|
|
|
Module *M,
|
|
|
|
std::string *ErrorStr,
|
2013-05-14 19:29:00 +00:00
|
|
|
RTDyldMemoryManager *MCJMM,
|
2010-11-17 16:06:37 +00:00
|
|
|
bool GVsWithCode,
|
2011-05-13 21:51:29 +00:00
|
|
|
TargetMachine *TM) = 0;
|
2010-01-27 20:34:15 +00:00
|
|
|
ExecutionEngine *(*ExecutionEngine::InterpCtor)(Module *M,
|
2009-07-18 00:42:18 +00:00
|
|
|
std::string *ErrorStr) = 0;
|
2006-03-22 06:07:50 +00:00
|
|
|
|
2010-01-27 20:34:15 +00:00
|
|
|
ExecutionEngine::ExecutionEngine(Module *M)
|
2009-10-13 17:42:08 +00:00
|
|
|
: EEState(*this),
|
2013-10-07 13:54:50 +00:00
|
|
|
LazyFunctionCreator(0) {
|
2009-10-27 20:30:28 +00:00
|
|
|
CompilingLazily = false;
|
2008-09-24 16:25:55 +00:00
|
|
|
GVCompilationDisabled = false;
|
2008-06-17 16:49:02 +00:00
|
|
|
SymbolSearchingDisabled = false;
|
2010-01-27 20:34:15 +00:00
|
|
|
Modules.push_back(M);
|
|
|
|
assert(M && "Module is null?");
|
2003-10-16 21:18:05 +00:00
|
|
|
}
|
|
|
|
|
2003-09-04 22:57:27 +00:00
|
|
|
ExecutionEngine::~ExecutionEngine() {
|
2007-03-03 18:19:18 +00:00
|
|
|
clearAllGlobalMappings();
|
2006-08-16 01:24:12 +00:00
|
|
|
for (unsigned i = 0, e = Modules.size(); i != e; ++i)
|
|
|
|
delete Modules[i];
|
2003-09-04 22:57:27 +00:00
|
|
|
}
|
|
|
|
|
2010-03-27 04:53:56 +00:00
|
|
|
namespace {
|
2010-11-13 02:48:57 +00:00
|
|
|
/// \brief Helper class which uses a value handler to automatically deletes the
|
|
|
|
/// memory block when the GlobalVariable is destroyed.
|
2010-03-27 04:53:56 +00:00
|
|
|
class GVMemoryBlock : public CallbackVH {
|
|
|
|
GVMemoryBlock(const GlobalVariable *GV)
|
|
|
|
: CallbackVH(const_cast<GlobalVariable*>(GV)) {}
|
|
|
|
|
|
|
|
public:
|
2010-11-13 02:48:57 +00:00
|
|
|
/// \brief Returns the address the GlobalVariable should be written into. The
|
|
|
|
/// GVMemoryBlock object prefixes that.
|
2012-10-08 16:38:25 +00:00
|
|
|
static char *Create(const GlobalVariable *GV, const DataLayout& TD) {
|
2011-07-18 04:54:35 +00:00
|
|
|
Type *ElTy = GV->getType()->getElementType();
|
2010-03-27 04:53:56 +00:00
|
|
|
size_t GVSize = (size_t)TD.getTypeAllocSize(ElTy);
|
|
|
|
void *RawMemory = ::operator new(
|
2012-10-08 16:38:25 +00:00
|
|
|
DataLayout::RoundUpAlignment(sizeof(GVMemoryBlock),
|
2010-03-27 04:53:56 +00:00
|
|
|
TD.getPreferredAlignment(GV))
|
|
|
|
+ GVSize);
|
|
|
|
new(RawMemory) GVMemoryBlock(GV);
|
|
|
|
return static_cast<char*>(RawMemory) + sizeof(GVMemoryBlock);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void deleted() {
|
|
|
|
// We allocated with operator new and with some extra memory hanging off the
|
|
|
|
// end, so don't just delete this. I'm not sure if this is actually
|
|
|
|
// required.
|
|
|
|
this->~GVMemoryBlock();
|
|
|
|
::operator delete(this);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
} // anonymous namespace
|
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
char *ExecutionEngine::getMemoryForGV(const GlobalVariable *GV) {
|
2012-10-08 16:38:25 +00:00
|
|
|
return GVMemoryBlock::Create(GV, *getDataLayout());
|
2008-10-25 15:41:43 +00:00
|
|
|
}
|
|
|
|
|
2010-01-27 20:34:15 +00:00
|
|
|
bool ExecutionEngine::removeModule(Module *M) {
|
2013-07-04 01:31:24 +00:00
|
|
|
for(SmallVectorImpl<Module *>::iterator I = Modules.begin(),
|
2007-10-15 19:56:32 +00:00
|
|
|
E = Modules.end(); I != E; ++I) {
|
2010-01-27 20:34:15 +00:00
|
|
|
Module *Found = *I;
|
|
|
|
if (Found == M) {
|
2007-10-15 19:56:32 +00:00
|
|
|
Modules.erase(I);
|
2010-01-27 20:34:15 +00:00
|
|
|
clearGlobalMappingsFromModule(M);
|
|
|
|
return true;
|
2009-01-23 19:27:28 +00:00
|
|
|
}
|
|
|
|
}
|
2010-01-27 20:34:15 +00:00
|
|
|
return false;
|
2009-01-23 19:27:28 +00:00
|
|
|
}
|
|
|
|
|
2006-08-16 01:24:12 +00:00
|
|
|
Function *ExecutionEngine::FindFunctionNamed(const char *FnName) {
|
|
|
|
for (unsigned i = 0, e = Modules.size(); i != e; ++i) {
|
2010-01-27 20:34:15 +00:00
|
|
|
if (Function *F = Modules[i]->getFunction(FnName))
|
2006-08-16 01:24:12 +00:00
|
|
|
return F;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
void *ExecutionEngineState::RemoveMapping(const MutexGuard &,
|
|
|
|
const GlobalValue *ToUnmap) {
|
2009-10-23 22:37:43 +00:00
|
|
|
GlobalAddressMapTy::iterator I = GlobalAddressMap.find(ToUnmap);
|
2009-10-09 22:10:27 +00:00
|
|
|
void *OldVal;
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
// FIXME: This is silly, we shouldn't end up with a mapping -> 0 in the
|
|
|
|
// GlobalAddressMap.
|
2009-10-09 22:10:27 +00:00
|
|
|
if (I == GlobalAddressMap.end())
|
|
|
|
OldVal = 0;
|
|
|
|
else {
|
|
|
|
OldVal = I->second;
|
|
|
|
GlobalAddressMap.erase(I);
|
|
|
|
}
|
|
|
|
|
|
|
|
GlobalAddressReverseMap.erase(OldVal);
|
|
|
|
return OldVal;
|
|
|
|
}
|
|
|
|
|
2006-05-08 22:00:52 +00:00
|
|
|
void ExecutionEngine::addGlobalMapping(const GlobalValue *GV, void *Addr) {
|
|
|
|
MutexGuard locked(lock);
|
2008-09-18 07:54:21 +00:00
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
DEBUG(dbgs() << "JIT: Map \'" << GV->getName()
|
2009-07-26 07:49:05 +00:00
|
|
|
<< "\' to [" << Addr << "]\n";);
|
2009-10-23 22:37:43 +00:00
|
|
|
void *&CurVal = EEState.getGlobalAddressMap(locked)[GV];
|
2006-05-08 22:00:52 +00:00
|
|
|
assert((CurVal == 0 || Addr == 0) && "GlobalMapping already established!");
|
|
|
|
CurVal = Addr;
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
// If we are using the reverse mapping, add it too.
|
2009-10-13 17:42:08 +00:00
|
|
|
if (!EEState.getGlobalAddressReverseMap(locked).empty()) {
|
2009-08-07 19:54:29 +00:00
|
|
|
AssertingVH<const GlobalValue> &V =
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.getGlobalAddressReverseMap(locked)[Addr];
|
2006-05-08 22:00:52 +00:00
|
|
|
assert((V == 0 || GV == 0) && "GlobalMapping already established!");
|
|
|
|
V = GV;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExecutionEngine::clearAllGlobalMappings() {
|
|
|
|
MutexGuard locked(lock);
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.getGlobalAddressMap(locked).clear();
|
|
|
|
EEState.getGlobalAddressReverseMap(locked).clear();
|
2006-05-08 22:00:52 +00:00
|
|
|
}
|
|
|
|
|
2008-05-21 16:34:48 +00:00
|
|
|
void ExecutionEngine::clearGlobalMappingsFromModule(Module *M) {
|
|
|
|
MutexGuard locked(lock);
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
for (Module::iterator FI = M->begin(), FE = M->end(); FI != FE; ++FI)
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.RemoveMapping(locked, FI);
|
2010-11-13 02:48:57 +00:00
|
|
|
for (Module::global_iterator GI = M->global_begin(), GE = M->global_end();
|
|
|
|
GI != GE; ++GI)
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.RemoveMapping(locked, GI);
|
2008-05-21 16:34:48 +00:00
|
|
|
}
|
|
|
|
|
2008-04-04 04:47:41 +00:00
|
|
|
void *ExecutionEngine::updateGlobalMapping(const GlobalValue *GV, void *Addr) {
|
2006-05-08 22:00:52 +00:00
|
|
|
MutexGuard locked(lock);
|
2008-04-04 04:47:41 +00:00
|
|
|
|
2009-10-23 22:37:43 +00:00
|
|
|
ExecutionEngineState::GlobalAddressMapTy &Map =
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.getGlobalAddressMap(locked);
|
2008-04-04 04:47:41 +00:00
|
|
|
|
2006-05-08 22:00:52 +00:00
|
|
|
// Deleting from the mapping?
|
2010-11-13 02:48:57 +00:00
|
|
|
if (Addr == 0)
|
2009-10-13 17:42:08 +00:00
|
|
|
return EEState.RemoveMapping(locked, GV);
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2009-10-23 22:37:43 +00:00
|
|
|
void *&CurVal = Map[GV];
|
2008-04-04 04:47:41 +00:00
|
|
|
void *OldVal = CurVal;
|
|
|
|
|
2009-10-13 17:42:08 +00:00
|
|
|
if (CurVal && !EEState.getGlobalAddressReverseMap(locked).empty())
|
|
|
|
EEState.getGlobalAddressReverseMap(locked).erase(CurVal);
|
2006-05-08 22:00:52 +00:00
|
|
|
CurVal = Addr;
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
// If we are using the reverse mapping, add it too.
|
2009-10-13 17:42:08 +00:00
|
|
|
if (!EEState.getGlobalAddressReverseMap(locked).empty()) {
|
2009-08-07 19:54:29 +00:00
|
|
|
AssertingVH<const GlobalValue> &V =
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.getGlobalAddressReverseMap(locked)[Addr];
|
2006-05-08 22:00:52 +00:00
|
|
|
assert((V == 0 || GV == 0) && "GlobalMapping already established!");
|
|
|
|
V = GV;
|
|
|
|
}
|
2008-04-04 04:47:41 +00:00
|
|
|
return OldVal;
|
2006-05-08 22:00:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void *ExecutionEngine::getPointerToGlobalIfAvailable(const GlobalValue *GV) {
|
|
|
|
MutexGuard locked(lock);
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2009-10-23 22:37:43 +00:00
|
|
|
ExecutionEngineState::GlobalAddressMapTy::iterator I =
|
|
|
|
EEState.getGlobalAddressMap(locked).find(GV);
|
2009-10-13 17:42:08 +00:00
|
|
|
return I != EEState.getGlobalAddressMap(locked).end() ? I->second : 0;
|
2006-05-08 22:00:52 +00:00
|
|
|
}
|
|
|
|
|
2003-12-31 20:21:04 +00:00
|
|
|
const GlobalValue *ExecutionEngine::getGlobalValueAtAddress(void *Addr) {
|
2005-07-12 15:51:55 +00:00
|
|
|
MutexGuard locked(lock);
|
|
|
|
|
2003-12-31 20:21:04 +00:00
|
|
|
// If we haven't computed the reverse mapping yet, do so first.
|
2009-10-13 17:42:08 +00:00
|
|
|
if (EEState.getGlobalAddressReverseMap(locked).empty()) {
|
2009-10-23 22:37:43 +00:00
|
|
|
for (ExecutionEngineState::GlobalAddressMapTy::iterator
|
2009-10-13 17:42:08 +00:00
|
|
|
I = EEState.getGlobalAddressMap(locked).begin(),
|
|
|
|
E = EEState.getGlobalAddressMap(locked).end(); I != E; ++I)
|
2010-11-13 00:55:42 +00:00
|
|
|
EEState.getGlobalAddressReverseMap(locked).insert(std::make_pair(
|
|
|
|
I->second, I->first));
|
2003-12-31 20:21:04 +00:00
|
|
|
}
|
|
|
|
|
2009-08-07 19:54:29 +00:00
|
|
|
std::map<void *, AssertingVH<const GlobalValue> >::iterator I =
|
2009-10-13 17:42:08 +00:00
|
|
|
EEState.getGlobalAddressReverseMap(locked).find(Addr);
|
|
|
|
return I != EEState.getGlobalAddressReverseMap(locked).end() ? I->second : 0;
|
2003-12-31 20:21:04 +00:00
|
|
|
}
|
2003-12-26 06:50:30 +00:00
|
|
|
|
2010-03-26 00:59:12 +00:00
|
|
|
namespace {
|
|
|
|
class ArgvArray {
|
|
|
|
char *Array;
|
|
|
|
std::vector<char*> Values;
|
|
|
|
public:
|
|
|
|
ArgvArray() : Array(NULL) {}
|
|
|
|
~ArgvArray() { clear(); }
|
|
|
|
void clear() {
|
|
|
|
delete[] Array;
|
|
|
|
Array = NULL;
|
|
|
|
for (size_t I = 0, E = Values.size(); I != E; ++I) {
|
|
|
|
delete[] Values[I];
|
|
|
|
}
|
|
|
|
Values.clear();
|
|
|
|
}
|
|
|
|
/// Turn a vector of strings into a nice argv style array of pointers to null
|
|
|
|
/// terminated strings.
|
|
|
|
void *reset(LLVMContext &C, ExecutionEngine *EE,
|
|
|
|
const std::vector<std::string> &InputArgv);
|
|
|
|
};
|
|
|
|
} // anonymous namespace
|
|
|
|
void *ArgvArray::reset(LLVMContext &C, ExecutionEngine *EE,
|
|
|
|
const std::vector<std::string> &InputArgv) {
|
|
|
|
clear(); // Free the old contents.
|
Revert the majority of the next patch in the address space series:
r165941: Resubmit the changes to llvm core to update the functions to
support different pointer sizes on a per address space basis.
Despite this commit log, this change primarily changed stuff outside of
VMCore, and those changes do not carry any tests for correctness (or
even plausibility), and we have consistently found questionable or flat
out incorrect cases in these changes. Most of them are probably correct,
but we need to devise a system that makes it more clear when we have
handled the address space concerns correctly, and ideally each pass that
gets updated would receive an accompanying test case that exercises that
pass specificaly w.r.t. alternate address spaces.
However, from this commit, I have retained the new C API entry points.
Those were an orthogonal change that probably should have been split
apart, but they seem entirely good.
In several places the changes were very obvious cleanups with no actual
multiple address space code added; these I have not reverted when
I spotted them.
In a few other places there were merge conflicts due to a cleaner
solution being implemented later, often not using address spaces at all.
In those cases, I've preserved the new code which isn't address space
dependent.
This is part of my ongoing effort to clean out the partial address space
code which carries high risk and low test coverage, and not likely to be
finished before the 3.2 release looms closer. Duncan and I would both
like to see the above issues addressed before we return to these
changes.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167222 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-01 09:14:31 +00:00
|
|
|
unsigned PtrSize = EE->getDataLayout()->getPointerSize();
|
2010-03-26 00:59:12 +00:00
|
|
|
Array = new char[(InputArgv.size()+1)*PtrSize];
|
2003-12-26 06:50:30 +00:00
|
|
|
|
2010-03-26 00:59:12 +00:00
|
|
|
DEBUG(dbgs() << "JIT: ARGV = " << (void*)Array << "\n");
|
2011-07-18 04:54:35 +00:00
|
|
|
Type *SBytePtr = Type::getInt8PtrTy(C);
|
2003-12-26 06:50:30 +00:00
|
|
|
|
|
|
|
for (unsigned i = 0; i != InputArgv.size(); ++i) {
|
|
|
|
unsigned Size = InputArgv[i].size()+1;
|
|
|
|
char *Dest = new char[Size];
|
2010-03-26 00:59:12 +00:00
|
|
|
Values.push_back(Dest);
|
2010-01-05 01:27:39 +00:00
|
|
|
DEBUG(dbgs() << "JIT: ARGV[" << i << "] = " << (void*)Dest << "\n");
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2003-12-26 06:50:30 +00:00
|
|
|
std::copy(InputArgv[i].begin(), InputArgv[i].end(), Dest);
|
|
|
|
Dest[Size-1] = 0;
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2010-03-26 00:59:12 +00:00
|
|
|
// Endian safe: Array[i] = (PointerTy)Dest;
|
|
|
|
EE->StoreValueToMemory(PTOGV(Dest), (GenericValue*)(Array+i*PtrSize),
|
2003-12-26 06:50:30 +00:00
|
|
|
SBytePtr);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Null terminate it
|
|
|
|
EE->StoreValueToMemory(PTOGV(0),
|
2010-03-26 00:59:12 +00:00
|
|
|
(GenericValue*)(Array+InputArgv.size()*PtrSize),
|
2003-12-26 06:50:30 +00:00
|
|
|
SBytePtr);
|
2010-03-26 00:59:12 +00:00
|
|
|
return Array;
|
2003-12-26 06:50:30 +00:00
|
|
|
}
|
|
|
|
|
2009-09-23 01:46:04 +00:00
|
|
|
void ExecutionEngine::runStaticConstructorsDestructors(Module *module,
|
|
|
|
bool isDtors) {
|
2006-03-08 18:42:46 +00:00
|
|
|
const char *Name = isDtors ? "llvm.global_dtors" : "llvm.global_ctors";
|
2010-11-13 02:48:57 +00:00
|
|
|
GlobalVariable *GV = module->getNamedGlobal(Name);
|
|
|
|
|
|
|
|
// If this global has internal linkage, or if it has a use, then it must be
|
|
|
|
// an old-style (llvmgcc3) static ctor with __main linked in and in use. If
|
|
|
|
// this is the case, don't execute any of the global ctors, __main will do
|
|
|
|
// it.
|
|
|
|
if (!GV || GV->isDeclaration() || GV->hasLocalLinkage()) return;
|
|
|
|
|
2011-04-06 20:38:44 +00:00
|
|
|
// Should be an array of '{ i32, void ()* }' structs. The first value is
|
2010-11-13 02:48:57 +00:00
|
|
|
// the init priority, which we ignore.
|
2012-01-24 13:41:11 +00:00
|
|
|
ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
|
|
|
|
if (InitList == 0)
|
2011-04-11 22:11:20 +00:00
|
|
|
return;
|
2010-11-13 02:48:57 +00:00
|
|
|
for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i) {
|
2012-01-24 13:41:11 +00:00
|
|
|
ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i));
|
|
|
|
if (CS == 0) continue;
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
Constant *FP = CS->getOperand(1);
|
|
|
|
if (FP->isNullValue())
|
2011-04-11 22:11:20 +00:00
|
|
|
continue; // Found a sentinal value, ignore.
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
// Strip off constant expression casts.
|
|
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
|
|
|
|
if (CE->isCast())
|
|
|
|
FP = CE->getOperand(0);
|
|
|
|
|
|
|
|
// Execute the ctor/dtor function!
|
|
|
|
if (Function *F = dyn_cast<Function>(FP))
|
|
|
|
runFunction(F, std::vector<GenericValue>());
|
|
|
|
|
|
|
|
// FIXME: It is marginally lame that we just do nothing here if we see an
|
|
|
|
// entry we don't recognize. It might not be unreasonable for the verifier
|
|
|
|
// to not even allow this and just assert here.
|
|
|
|
}
|
2008-09-30 15:51:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ExecutionEngine::runStaticConstructorsDestructors(bool isDtors) {
|
|
|
|
// Execute global ctors/dtors for each module in the program.
|
2010-11-13 02:48:57 +00:00
|
|
|
for (unsigned i = 0, e = Modules.size(); i != e; ++i)
|
|
|
|
runStaticConstructorsDestructors(Modules[i], isDtors);
|
2006-03-08 18:42:46 +00:00
|
|
|
}
|
|
|
|
|
2008-08-26 01:38:29 +00:00
|
|
|
#ifndef NDEBUG
|
2007-12-14 19:38:31 +00:00
|
|
|
/// isTargetNullPtr - Return whether the target pointer stored at Loc is null.
|
|
|
|
static bool isTargetNullPtr(ExecutionEngine *EE, void *Loc) {
|
Revert the majority of the next patch in the address space series:
r165941: Resubmit the changes to llvm core to update the functions to
support different pointer sizes on a per address space basis.
Despite this commit log, this change primarily changed stuff outside of
VMCore, and those changes do not carry any tests for correctness (or
even plausibility), and we have consistently found questionable or flat
out incorrect cases in these changes. Most of them are probably correct,
but we need to devise a system that makes it more clear when we have
handled the address space concerns correctly, and ideally each pass that
gets updated would receive an accompanying test case that exercises that
pass specificaly w.r.t. alternate address spaces.
However, from this commit, I have retained the new C API entry points.
Those were an orthogonal change that probably should have been split
apart, but they seem entirely good.
In several places the changes were very obvious cleanups with no actual
multiple address space code added; these I have not reverted when
I spotted them.
In a few other places there were merge conflicts due to a cleaner
solution being implemented later, often not using address spaces at all.
In those cases, I've preserved the new code which isn't address space
dependent.
This is part of my ongoing effort to clean out the partial address space
code which carries high risk and low test coverage, and not likely to be
finished before the 3.2 release looms closer. Duncan and I would both
like to see the above issues addressed before we return to these
changes.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167222 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-01 09:14:31 +00:00
|
|
|
unsigned PtrSize = EE->getDataLayout()->getPointerSize();
|
2007-12-14 19:38:31 +00:00
|
|
|
for (unsigned i = 0; i < PtrSize; ++i)
|
|
|
|
if (*(i + (uint8_t*)Loc))
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
2008-08-26 01:38:29 +00:00
|
|
|
#endif
|
2007-12-14 19:38:31 +00:00
|
|
|
|
2003-12-26 06:50:30 +00:00
|
|
|
int ExecutionEngine::runFunctionAsMain(Function *Fn,
|
|
|
|
const std::vector<std::string> &argv,
|
|
|
|
const char * const * envp) {
|
|
|
|
std::vector<GenericValue> GVArgs;
|
|
|
|
GenericValue GVArgc;
|
2007-03-06 03:04:04 +00:00
|
|
|
GVArgc.IntVal = APInt(32, argv.size());
|
2007-06-03 19:17:35 +00:00
|
|
|
|
|
|
|
// Check main() type
|
2004-08-16 01:05:35 +00:00
|
|
|
unsigned NumArgs = Fn->getFunctionType()->getNumParams();
|
2011-07-18 04:54:35 +00:00
|
|
|
FunctionType *FTy = Fn->getFunctionType();
|
|
|
|
Type* PPInt8Ty = Type::getInt8PtrTy(Fn->getContext())->getPointerTo();
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
// Check the argument types.
|
|
|
|
if (NumArgs > 3)
|
|
|
|
report_fatal_error("Invalid number of arguments of main() supplied");
|
|
|
|
if (NumArgs >= 3 && FTy->getParamType(2) != PPInt8Ty)
|
|
|
|
report_fatal_error("Invalid type for third argument of main() supplied");
|
|
|
|
if (NumArgs >= 2 && FTy->getParamType(1) != PPInt8Ty)
|
|
|
|
report_fatal_error("Invalid type for second argument of main() supplied");
|
|
|
|
if (NumArgs >= 1 && !FTy->getParamType(0)->isIntegerTy(32))
|
|
|
|
report_fatal_error("Invalid type for first argument of main() supplied");
|
|
|
|
if (!FTy->getReturnType()->isIntegerTy() &&
|
|
|
|
!FTy->getReturnType()->isVoidTy())
|
|
|
|
report_fatal_error("Invalid return type of main() supplied");
|
|
|
|
|
2010-03-26 00:59:12 +00:00
|
|
|
ArgvArray CArgv;
|
|
|
|
ArgvArray CEnv;
|
2004-08-16 01:05:35 +00:00
|
|
|
if (NumArgs) {
|
|
|
|
GVArgs.push_back(GVArgc); // Arg #0 = argc.
|
|
|
|
if (NumArgs > 1) {
|
2009-08-13 21:58:54 +00:00
|
|
|
// Arg #1 = argv.
|
2010-03-26 00:59:12 +00:00
|
|
|
GVArgs.push_back(PTOGV(CArgv.reset(Fn->getContext(), this, argv)));
|
2007-12-14 19:38:31 +00:00
|
|
|
assert(!isTargetNullPtr(this, GVTOP(GVArgs[1])) &&
|
2004-08-16 01:05:35 +00:00
|
|
|
"argv[0] was null after CreateArgv");
|
|
|
|
if (NumArgs > 2) {
|
|
|
|
std::vector<std::string> EnvVars;
|
|
|
|
for (unsigned i = 0; envp[i]; ++i)
|
|
|
|
EnvVars.push_back(envp[i]);
|
2009-08-13 21:58:54 +00:00
|
|
|
// Arg #2 = envp.
|
2010-03-26 00:59:12 +00:00
|
|
|
GVArgs.push_back(PTOGV(CEnv.reset(Fn->getContext(), this, EnvVars)));
|
2004-08-16 01:05:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2007-03-06 03:04:04 +00:00
|
|
|
return runFunction(Fn, GVArgs).IntVal.getZExtValue();
|
2003-12-26 06:50:30 +00:00
|
|
|
}
|
|
|
|
|
2010-01-27 20:34:15 +00:00
|
|
|
ExecutionEngine *ExecutionEngine::create(Module *M,
|
2007-03-03 18:19:18 +00:00
|
|
|
bool ForceInterpreter,
|
2008-08-08 08:11:34 +00:00
|
|
|
std::string *ErrorStr,
|
2009-07-08 21:59:57 +00:00
|
|
|
CodeGenOpt::Level OptLevel,
|
|
|
|
bool GVsWithCode) {
|
2012-03-23 17:40:56 +00:00
|
|
|
EngineBuilder EB = EngineBuilder(M)
|
2009-07-18 00:42:18 +00:00
|
|
|
.setEngineKind(ForceInterpreter
|
|
|
|
? EngineKind::Interpreter
|
|
|
|
: EngineKind::JIT)
|
|
|
|
.setErrorStr(ErrorStr)
|
|
|
|
.setOptLevel(OptLevel)
|
2012-03-23 17:40:56 +00:00
|
|
|
.setAllocateGVsWithCode(GVsWithCode);
|
|
|
|
|
|
|
|
return EB.create();
|
2009-07-18 00:42:18 +00:00
|
|
|
}
|
|
|
|
|
2011-05-13 22:02:53 +00:00
|
|
|
/// createJIT - This is the factory method for creating a JIT for the current
|
|
|
|
/// machine, it does not fall back to the interpreter. This takes ownership
|
|
|
|
/// of the module.
|
|
|
|
ExecutionEngine *ExecutionEngine::createJIT(Module *M,
|
|
|
|
std::string *ErrorStr,
|
|
|
|
JITMemoryManager *JMM,
|
2011-12-01 21:49:21 +00:00
|
|
|
CodeGenOpt::Level OL,
|
2011-05-13 22:02:53 +00:00
|
|
|
bool GVsWithCode,
|
2011-07-19 06:37:02 +00:00
|
|
|
Reloc::Model RM,
|
2011-05-13 22:02:53 +00:00
|
|
|
CodeModel::Model CMM) {
|
|
|
|
if (ExecutionEngine::JITCtor == 0) {
|
|
|
|
if (ErrorStr)
|
|
|
|
*ErrorStr = "JIT has not been linked in.";
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Use the defaults for extra parameters. Users can use EngineBuilder to
|
|
|
|
// set them.
|
2012-03-23 17:40:56 +00:00
|
|
|
EngineBuilder EB(M);
|
|
|
|
EB.setEngineKind(EngineKind::JIT);
|
|
|
|
EB.setErrorStr(ErrorStr);
|
|
|
|
EB.setRelocationModel(RM);
|
|
|
|
EB.setCodeModel(CMM);
|
|
|
|
EB.setAllocateGVsWithCode(GVsWithCode);
|
|
|
|
EB.setOptLevel(OL);
|
|
|
|
EB.setJITMemoryManager(JMM);
|
2011-05-13 22:02:53 +00:00
|
|
|
|
2011-12-07 23:58:57 +00:00
|
|
|
// TODO: permit custom TargetOptions here
|
2012-03-23 17:40:56 +00:00
|
|
|
TargetMachine *TM = EB.selectTarget();
|
2011-05-13 22:02:53 +00:00
|
|
|
if (!TM || (ErrorStr && ErrorStr->length() > 0)) return 0;
|
|
|
|
|
2011-12-12 04:20:36 +00:00
|
|
|
return ExecutionEngine::JITCtor(M, ErrorStr, JMM, GVsWithCode, TM);
|
2011-05-13 22:02:53 +00:00
|
|
|
}
|
|
|
|
|
2012-03-23 17:40:56 +00:00
|
|
|
ExecutionEngine *EngineBuilder::create(TargetMachine *TM) {
|
2012-04-08 14:53:14 +00:00
|
|
|
OwningPtr<TargetMachine> TheTM(TM); // Take ownership.
|
|
|
|
|
2008-03-08 02:49:45 +00:00
|
|
|
// Make sure we can resolve symbols in the program as well. The zero arg
|
|
|
|
// to the function tells DynamicLibrary to load the program, not a library.
|
|
|
|
if (sys::DynamicLibrary::LoadLibraryPermanently(0, ErrorStr))
|
|
|
|
return 0;
|
|
|
|
|
2013-05-14 19:29:00 +00:00
|
|
|
assert(!(JMM && MCJMM));
|
|
|
|
|
2009-07-18 00:42:18 +00:00
|
|
|
// If the user specified a memory manager but didn't specify which engine to
|
|
|
|
// create, we assume they only want the JIT, and we fail if they only want
|
|
|
|
// the interpreter.
|
2013-05-14 19:29:00 +00:00
|
|
|
if (JMM || MCJMM) {
|
2009-09-23 01:46:04 +00:00
|
|
|
if (WhichEngine & EngineKind::JIT)
|
2009-07-18 00:42:18 +00:00
|
|
|
WhichEngine = EngineKind::JIT;
|
2009-09-23 01:46:04 +00:00
|
|
|
else {
|
2009-09-23 02:03:49 +00:00
|
|
|
if (ErrorStr)
|
|
|
|
*ErrorStr = "Cannot create an interpreter with a memory manager.";
|
2009-09-23 01:46:04 +00:00
|
|
|
return 0;
|
2009-07-18 00:42:18 +00:00
|
|
|
}
|
|
|
|
}
|
2013-05-14 19:29:00 +00:00
|
|
|
|
|
|
|
if (MCJMM && ! UseMCJIT) {
|
|
|
|
if (ErrorStr)
|
|
|
|
*ErrorStr =
|
|
|
|
"Cannot create a legacy JIT with a runtime dyld memory "
|
|
|
|
"manager.";
|
|
|
|
return 0;
|
|
|
|
}
|
2003-09-03 20:34:19 +00:00
|
|
|
|
2009-07-18 00:42:18 +00:00
|
|
|
// Unless the interpreter was explicitly selected or the JIT is not linked,
|
|
|
|
// try making a JIT.
|
2012-04-08 14:53:14 +00:00
|
|
|
if ((WhichEngine & EngineKind::JIT) && TheTM) {
|
2011-12-12 04:20:36 +00:00
|
|
|
Triple TT(M->getTargetTriple());
|
2012-03-23 17:40:56 +00:00
|
|
|
if (!TM->getTarget().hasJIT()) {
|
|
|
|
errs() << "WARNING: This target JIT is not designed for the host"
|
|
|
|
<< " you are running. If bad things happen, please choose"
|
|
|
|
<< " a different -march switch.\n";
|
|
|
|
}
|
2011-12-12 04:20:36 +00:00
|
|
|
|
2012-03-23 17:40:56 +00:00
|
|
|
if (UseMCJIT && ExecutionEngine::MCJITCtor) {
|
|
|
|
ExecutionEngine *EE =
|
2013-05-14 19:29:00 +00:00
|
|
|
ExecutionEngine::MCJITCtor(M, ErrorStr, MCJMM ? MCJMM : JMM,
|
2012-04-08 14:53:14 +00:00
|
|
|
AllocateGVsWithCode, TheTM.take());
|
2012-03-23 17:40:56 +00:00
|
|
|
if (EE) return EE;
|
|
|
|
} else if (ExecutionEngine::JITCtor) {
|
|
|
|
ExecutionEngine *EE =
|
|
|
|
ExecutionEngine::JITCtor(M, ErrorStr, JMM,
|
2012-04-08 14:53:14 +00:00
|
|
|
AllocateGVsWithCode, TheTM.take());
|
2012-03-23 17:40:56 +00:00
|
|
|
if (EE) return EE;
|
2009-09-23 01:46:04 +00:00
|
|
|
}
|
2009-07-18 00:42:18 +00:00
|
|
|
}
|
2003-09-03 20:34:19 +00:00
|
|
|
|
2009-07-18 00:42:18 +00:00
|
|
|
// If we can't make a JIT and we didn't request one specifically, try making
|
|
|
|
// an interpreter instead.
|
2009-09-23 01:46:04 +00:00
|
|
|
if (WhichEngine & EngineKind::Interpreter) {
|
|
|
|
if (ExecutionEngine::InterpCtor)
|
2010-01-27 20:34:15 +00:00
|
|
|
return ExecutionEngine::InterpCtor(M, ErrorStr);
|
2009-09-23 02:03:49 +00:00
|
|
|
if (ErrorStr)
|
|
|
|
*ErrorStr = "Interpreter has not been linked in.";
|
2009-09-23 01:46:04 +00:00
|
|
|
return 0;
|
2009-07-18 00:42:18 +00:00
|
|
|
}
|
2009-09-23 02:03:49 +00:00
|
|
|
|
2012-08-21 15:42:49 +00:00
|
|
|
if ((WhichEngine & EngineKind::JIT) && ExecutionEngine::JITCtor == 0 &&
|
|
|
|
ExecutionEngine::MCJITCtor == 0) {
|
2009-09-23 02:03:49 +00:00
|
|
|
if (ErrorStr)
|
|
|
|
*ErrorStr = "JIT has not been linked in.";
|
2010-11-13 02:48:57 +00:00
|
|
|
}
|
|
|
|
|
2009-09-23 01:46:04 +00:00
|
|
|
return 0;
|
2007-10-21 22:57:11 +00:00
|
|
|
}
|
|
|
|
|
2002-12-24 00:01:05 +00:00
|
|
|
void *ExecutionEngine::getPointerToGlobal(const GlobalValue *GV) {
|
2003-08-13 18:16:14 +00:00
|
|
|
if (Function *F = const_cast<Function*>(dyn_cast<Function>(GV)))
|
2002-12-24 00:01:05 +00:00
|
|
|
return getPointerToFunction(F);
|
|
|
|
|
2005-07-12 15:51:55 +00:00
|
|
|
MutexGuard locked(lock);
|
2010-11-13 02:48:57 +00:00
|
|
|
if (void *P = EEState.getGlobalAddressMap(locked)[GV])
|
|
|
|
return P;
|
2006-02-07 05:11:57 +00:00
|
|
|
|
|
|
|
// Global variable might have been added since interpreter started.
|
|
|
|
if (GlobalVariable *GVar =
|
|
|
|
const_cast<GlobalVariable *>(dyn_cast<GlobalVariable>(GV)))
|
|
|
|
EmitGlobalVariable(GVar);
|
|
|
|
else
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Global hasn't had an address allocated yet!");
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2009-10-23 22:37:43 +00:00
|
|
|
return EEState.getGlobalAddressMap(locked)[GV];
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
/// \brief Converts a Constant* into a GenericValue, including handling of
|
|
|
|
/// ConstantExpr values.
|
2002-12-24 00:01:05 +00:00
|
|
|
GenericValue ExecutionEngine::getConstantValue(const Constant *C) {
|
2006-11-27 01:05:10 +00:00
|
|
|
// If its undefined, return the garbage.
|
2010-01-15 08:32:58 +00:00
|
|
|
if (isa<UndefValue>(C)) {
|
|
|
|
GenericValue Result;
|
|
|
|
switch (C->getType()->getTypeID()) {
|
2013-04-01 15:53:30 +00:00
|
|
|
default:
|
|
|
|
break;
|
2010-01-15 08:32:58 +00:00
|
|
|
case Type::IntegerTyID:
|
|
|
|
case Type::X86_FP80TyID:
|
|
|
|
case Type::FP128TyID:
|
|
|
|
case Type::PPC_FP128TyID:
|
|
|
|
// Although the value is undefined, we still have to construct an APInt
|
|
|
|
// with the correct bit width.
|
|
|
|
Result.IntVal = APInt(C->getType()->getPrimitiveSizeInBits(), 0);
|
|
|
|
break;
|
2013-09-12 10:48:23 +00:00
|
|
|
case Type::StructTyID: {
|
|
|
|
// if the whole struct is 'undef' just reserve memory for the value.
|
|
|
|
if(StructType *STy = dyn_cast<StructType>(C->getType())) {
|
|
|
|
unsigned int elemNum = STy->getNumElements();
|
|
|
|
Result.AggregateVal.resize(elemNum);
|
|
|
|
for (unsigned int i = 0; i < elemNum; ++i) {
|
|
|
|
Type *ElemTy = STy->getElementType(i);
|
|
|
|
if (ElemTy->isIntegerTy())
|
|
|
|
Result.AggregateVal[i].IntVal =
|
|
|
|
APInt(ElemTy->getPrimitiveSizeInBits(), 0);
|
|
|
|
else if (ElemTy->isAggregateType()) {
|
|
|
|
const Constant *ElemUndef = UndefValue::get(ElemTy);
|
|
|
|
Result.AggregateVal[i] = getConstantValue(ElemUndef);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2013-04-01 15:53:30 +00:00
|
|
|
case Type::VectorTyID:
|
|
|
|
// if the whole vector is 'undef' just reserve memory for the value.
|
|
|
|
const VectorType* VTy = dyn_cast<VectorType>(C->getType());
|
|
|
|
const Type *ElemTy = VTy->getElementType();
|
|
|
|
unsigned int elemNum = VTy->getNumElements();
|
|
|
|
Result.AggregateVal.resize(elemNum);
|
|
|
|
if (ElemTy->isIntegerTy())
|
|
|
|
for (unsigned int i = 0; i < elemNum; ++i)
|
2013-09-12 10:48:23 +00:00
|
|
|
Result.AggregateVal[i].IntVal =
|
2013-04-01 15:53:30 +00:00
|
|
|
APInt(ElemTy->getPrimitiveSizeInBits(), 0);
|
2010-01-15 08:32:58 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
return Result;
|
|
|
|
}
|
2003-04-23 19:01:49 +00:00
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
// Otherwise, if the value is a ConstantExpr...
|
2006-11-27 01:05:10 +00:00
|
|
|
if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
|
2007-03-06 22:23:15 +00:00
|
|
|
Constant *Op0 = CE->getOperand(0);
|
2003-04-23 19:01:49 +00:00
|
|
|
switch (CE->getOpcode()) {
|
|
|
|
case Instruction::GetElementPtr: {
|
2010-11-13 02:48:57 +00:00
|
|
|
// Compute the index
|
2007-03-06 22:23:15 +00:00
|
|
|
GenericValue Result = getConstantValue(Op0);
|
2012-12-30 16:25:48 +00:00
|
|
|
APInt Offset(TD->getPointerSizeInBits(), 0);
|
|
|
|
cast<GEPOperator>(CE)->accumulateConstantOffset(*TD, Offset);
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2007-03-06 03:04:04 +00:00
|
|
|
char* tmp = (char*) Result.PointerVal;
|
2012-12-30 16:25:48 +00:00
|
|
|
Result = PTOGV(tmp + Offset.getSExtValue());
|
2003-04-23 19:01:49 +00:00
|
|
|
return Result;
|
|
|
|
}
|
2007-03-06 22:23:15 +00:00
|
|
|
case Instruction::Trunc: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
|
|
|
uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
|
|
|
|
GV.IntVal = GV.IntVal.trunc(BitWidth);
|
2006-11-27 01:05:10 +00:00
|
|
|
return GV;
|
|
|
|
}
|
2007-03-06 22:23:15 +00:00
|
|
|
case Instruction::ZExt: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
|
|
|
uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
|
|
|
|
GV.IntVal = GV.IntVal.zext(BitWidth);
|
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::SExt: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
|
|
|
uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
|
|
|
|
GV.IntVal = GV.IntVal.sext(BitWidth);
|
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::FPTrunc: {
|
2007-09-17 18:44:13 +00:00
|
|
|
// FIXME long double
|
2007-03-06 22:23:15 +00:00
|
|
|
GenericValue GV = getConstantValue(Op0);
|
|
|
|
GV.FloatVal = float(GV.DoubleVal);
|
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::FPExt:{
|
2007-09-17 18:44:13 +00:00
|
|
|
// FIXME long double
|
2007-03-06 22:23:15 +00:00
|
|
|
GenericValue GV = getConstantValue(Op0);
|
|
|
|
GV.DoubleVal = double(GV.FloatVal);
|
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::UIToFP: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
2009-10-05 05:54:46 +00:00
|
|
|
if (CE->getType()->isFloatTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = float(GV.IntVal.roundToDouble());
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (CE->getType()->isDoubleTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = GV.IntVal.roundToDouble();
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (CE->getType()->isX86_FP80Ty()) {
|
2010-12-04 15:28:22 +00:00
|
|
|
APFloat apf = APFloat::getZero(APFloat::x87DoubleExtended);
|
2010-11-13 02:48:57 +00:00
|
|
|
(void)apf.convertFromAPInt(GV.IntVal,
|
2008-02-29 01:27:13 +00:00
|
|
|
false,
|
|
|
|
APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apf.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
}
|
2007-03-06 22:23:15 +00:00
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::SIToFP: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
2009-10-05 05:54:46 +00:00
|
|
|
if (CE->getType()->isFloatTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = float(GV.IntVal.signedRoundToDouble());
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (CE->getType()->isDoubleTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = GV.IntVal.signedRoundToDouble();
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (CE->getType()->isX86_FP80Ty()) {
|
2010-12-04 15:28:22 +00:00
|
|
|
APFloat apf = APFloat::getZero(APFloat::x87DoubleExtended);
|
2010-11-13 02:48:57 +00:00
|
|
|
(void)apf.convertFromAPInt(GV.IntVal,
|
2008-02-29 01:27:13 +00:00
|
|
|
true,
|
|
|
|
APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apf.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
}
|
2007-03-06 22:23:15 +00:00
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::FPToUI: // double->APInt conversion handles sign
|
|
|
|
case Instruction::FPToSI: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
|
|
|
uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
|
2009-10-05 05:54:46 +00:00
|
|
|
if (Op0->getType()->isFloatTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.IntVal = APIntOps::RoundFloatToAPInt(GV.FloatVal, BitWidth);
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (Op0->getType()->isDoubleTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.IntVal = APIntOps::RoundDoubleToAPInt(GV.DoubleVal, BitWidth);
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (Op0->getType()->isX86_FP80Ty()) {
|
2013-01-22 09:46:31 +00:00
|
|
|
APFloat apf = APFloat(APFloat::x87DoubleExtended, GV.IntVal);
|
2007-09-17 18:44:13 +00:00
|
|
|
uint64_t v;
|
2008-10-09 23:00:39 +00:00
|
|
|
bool ignored;
|
2007-09-17 18:44:13 +00:00
|
|
|
(void)apf.convertToInteger(&v, BitWidth,
|
2010-11-13 02:48:57 +00:00
|
|
|
CE->getOpcode()==Instruction::FPToSI,
|
2008-10-09 23:00:39 +00:00
|
|
|
APFloat::rmTowardZero, &ignored);
|
2007-09-17 18:44:13 +00:00
|
|
|
GV.IntVal = v; // endian?
|
|
|
|
}
|
2007-03-06 22:23:15 +00:00
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::PtrToInt: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
2012-10-30 22:21:55 +00:00
|
|
|
uint32_t PtrWidth = TD->getTypeSizeInBits(Op0->getType());
|
|
|
|
assert(PtrWidth <= 64 && "Bad pointer width");
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.IntVal = APInt(PtrWidth, uintptr_t(GV.PointerVal));
|
2012-10-30 22:21:55 +00:00
|
|
|
uint32_t IntWidth = TD->getTypeSizeInBits(CE->getType());
|
|
|
|
GV.IntVal = GV.IntVal.zextOrTrunc(IntWidth);
|
2007-03-06 22:23:15 +00:00
|
|
|
return GV;
|
2006-11-27 01:05:10 +00:00
|
|
|
}
|
|
|
|
case Instruction::IntToPtr: {
|
2007-03-06 22:23:15 +00:00
|
|
|
GenericValue GV = getConstantValue(Op0);
|
2012-10-24 18:36:13 +00:00
|
|
|
uint32_t PtrWidth = TD->getTypeSizeInBits(CE->getType());
|
2012-10-30 22:21:55 +00:00
|
|
|
GV.IntVal = GV.IntVal.zextOrTrunc(PtrWidth);
|
2007-03-06 22:23:15 +00:00
|
|
|
assert(GV.IntVal.getBitWidth() <= 64 && "Bad pointer width");
|
|
|
|
GV.PointerVal = PointerTy(uintptr_t(GV.IntVal.getZExtValue()));
|
|
|
|
return GV;
|
|
|
|
}
|
|
|
|
case Instruction::BitCast: {
|
|
|
|
GenericValue GV = getConstantValue(Op0);
|
2011-07-18 04:54:35 +00:00
|
|
|
Type* DestTy = CE->getType();
|
2007-03-06 22:23:15 +00:00
|
|
|
switch (Op0->getType()->getTypeID()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Invalid bitcast operand");
|
2007-03-06 22:23:15 +00:00
|
|
|
case Type::IntegerTyID:
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(DestTy->isFloatingPointTy() && "invalid bitcast");
|
2009-10-05 05:54:46 +00:00
|
|
|
if (DestTy->isFloatTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = GV.IntVal.bitsToFloat();
|
2009-10-05 05:54:46 +00:00
|
|
|
else if (DestTy->isDoubleTy())
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = GV.IntVal.bitsToDouble();
|
|
|
|
break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Type::FloatTyID:
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(DestTy->isIntegerTy(32) && "Invalid bitcast");
|
2010-11-28 21:04:48 +00:00
|
|
|
GV.IntVal = APInt::floatToBits(GV.FloatVal);
|
2007-03-06 22:23:15 +00:00
|
|
|
break;
|
|
|
|
case Type::DoubleTyID:
|
2010-02-15 16:12:20 +00:00
|
|
|
assert(DestTy->isIntegerTy(64) && "Invalid bitcast");
|
2010-11-28 21:04:48 +00:00
|
|
|
GV.IntVal = APInt::doubleToBits(GV.DoubleVal);
|
2007-03-06 22:23:15 +00:00
|
|
|
break;
|
|
|
|
case Type::PointerTyID:
|
2010-02-16 11:11:14 +00:00
|
|
|
assert(DestTy->isPointerTy() && "Invalid bitcast");
|
2007-03-06 22:23:15 +00:00
|
|
|
break; // getConstantValue(Op0) above already converted it
|
|
|
|
}
|
|
|
|
return GV;
|
2003-04-23 19:01:49 +00:00
|
|
|
}
|
2003-05-14 17:51:49 +00:00
|
|
|
case Instruction::Add:
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FAdd:
|
2007-03-06 22:23:15 +00:00
|
|
|
case Instruction::Sub:
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FSub:
|
2007-03-06 22:23:15 +00:00
|
|
|
case Instruction::Mul:
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FMul:
|
2007-03-06 22:23:15 +00:00
|
|
|
case Instruction::UDiv:
|
|
|
|
case Instruction::SDiv:
|
|
|
|
case Instruction::URem:
|
|
|
|
case Instruction::SRem:
|
|
|
|
case Instruction::And:
|
|
|
|
case Instruction::Or:
|
|
|
|
case Instruction::Xor: {
|
|
|
|
GenericValue LHS = getConstantValue(Op0);
|
|
|
|
GenericValue RHS = getConstantValue(CE->getOperand(1));
|
|
|
|
GenericValue GV;
|
2004-07-11 08:01:11 +00:00
|
|
|
switch (CE->getOperand(0)->getType()->getTypeID()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Bad add type!");
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
case Type::IntegerTyID:
|
2007-03-06 22:23:15 +00:00
|
|
|
switch (CE->getOpcode()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Invalid integer opcode");
|
2007-03-06 22:23:15 +00:00
|
|
|
case Instruction::Add: GV.IntVal = LHS.IntVal + RHS.IntVal; break;
|
|
|
|
case Instruction::Sub: GV.IntVal = LHS.IntVal - RHS.IntVal; break;
|
|
|
|
case Instruction::Mul: GV.IntVal = LHS.IntVal * RHS.IntVal; break;
|
|
|
|
case Instruction::UDiv:GV.IntVal = LHS.IntVal.udiv(RHS.IntVal); break;
|
|
|
|
case Instruction::SDiv:GV.IntVal = LHS.IntVal.sdiv(RHS.IntVal); break;
|
|
|
|
case Instruction::URem:GV.IntVal = LHS.IntVal.urem(RHS.IntVal); break;
|
|
|
|
case Instruction::SRem:GV.IntVal = LHS.IntVal.srem(RHS.IntVal); break;
|
|
|
|
case Instruction::And: GV.IntVal = LHS.IntVal & RHS.IntVal; break;
|
|
|
|
case Instruction::Or: GV.IntVal = LHS.IntVal | RHS.IntVal; break;
|
|
|
|
case Instruction::Xor: GV.IntVal = LHS.IntVal ^ RHS.IntVal; break;
|
|
|
|
}
|
2004-07-11 08:01:11 +00:00
|
|
|
break;
|
|
|
|
case Type::FloatTyID:
|
2007-03-06 22:23:15 +00:00
|
|
|
switch (CE->getOpcode()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Invalid float opcode");
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FAdd:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = LHS.FloatVal + RHS.FloatVal; break;
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FSub:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = LHS.FloatVal - RHS.FloatVal; break;
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FMul:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = LHS.FloatVal * RHS.FloatVal; break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Instruction::FDiv:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.FloatVal = LHS.FloatVal / RHS.FloatVal; break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Instruction::FRem:
|
2010-05-15 17:10:24 +00:00
|
|
|
GV.FloatVal = std::fmod(LHS.FloatVal,RHS.FloatVal); break;
|
2007-03-06 22:23:15 +00:00
|
|
|
}
|
2004-07-11 08:01:11 +00:00
|
|
|
break;
|
|
|
|
case Type::DoubleTyID:
|
2007-03-06 22:23:15 +00:00
|
|
|
switch (CE->getOpcode()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Invalid double opcode");
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FAdd:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = LHS.DoubleVal + RHS.DoubleVal; break;
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FSub:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = LHS.DoubleVal - RHS.DoubleVal; break;
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FMul:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = LHS.DoubleVal * RHS.DoubleVal; break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Instruction::FDiv:
|
2007-03-06 22:23:15 +00:00
|
|
|
GV.DoubleVal = LHS.DoubleVal / RHS.DoubleVal; break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Instruction::FRem:
|
2010-05-15 17:10:24 +00:00
|
|
|
GV.DoubleVal = std::fmod(LHS.DoubleVal,RHS.DoubleVal); break;
|
2007-03-06 22:23:15 +00:00
|
|
|
}
|
2004-07-11 08:01:11 +00:00
|
|
|
break;
|
2007-09-17 18:44:13 +00:00
|
|
|
case Type::X86_FP80TyID:
|
|
|
|
case Type::PPC_FP128TyID:
|
|
|
|
case Type::FP128TyID: {
|
2013-01-22 09:46:31 +00:00
|
|
|
const fltSemantics &Sem = CE->getOperand(0)->getType()->getFltSemantics();
|
|
|
|
APFloat apfLHS = APFloat(Sem, LHS.IntVal);
|
2007-09-17 18:44:13 +00:00
|
|
|
switch (CE->getOpcode()) {
|
2010-11-13 00:55:42 +00:00
|
|
|
default: llvm_unreachable("Invalid long double opcode");
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FAdd:
|
2013-01-22 09:46:31 +00:00
|
|
|
apfLHS.add(APFloat(Sem, RHS.IntVal), APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apfLHS.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FSub:
|
2013-01-22 09:46:31 +00:00
|
|
|
apfLHS.subtract(APFloat(Sem, RHS.IntVal),
|
|
|
|
APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apfLHS.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
2009-06-04 22:49:04 +00:00
|
|
|
case Instruction::FMul:
|
2013-01-22 09:46:31 +00:00
|
|
|
apfLHS.multiply(APFloat(Sem, RHS.IntVal),
|
|
|
|
APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apfLHS.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Instruction::FDiv:
|
2013-01-22 09:46:31 +00:00
|
|
|
apfLHS.divide(APFloat(Sem, RHS.IntVal),
|
|
|
|
APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apfLHS.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
2010-11-13 02:48:57 +00:00
|
|
|
case Instruction::FRem:
|
2013-01-22 09:46:31 +00:00
|
|
|
apfLHS.mod(APFloat(Sem, RHS.IntVal),
|
|
|
|
APFloat::rmNearestTiesToEven);
|
2008-10-09 18:53:47 +00:00
|
|
|
GV.IntVal = apfLHS.bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2004-07-11 08:01:11 +00:00
|
|
|
}
|
2007-03-06 22:23:15 +00:00
|
|
|
return GV;
|
|
|
|
}
|
2003-05-14 17:51:49 +00:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
SmallString<256> Msg;
|
|
|
|
raw_svector_ostream OS(Msg);
|
|
|
|
OS << "ConstantExpr not handled: " << *CE;
|
|
|
|
report_fatal_error(OS.str());
|
2003-05-14 17:51:49 +00:00
|
|
|
}
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
// Otherwise, we have a simple constant.
|
2007-03-06 22:23:15 +00:00
|
|
|
GenericValue Result;
|
2004-06-17 18:19:28 +00:00
|
|
|
switch (C->getType()->getTypeID()) {
|
2010-11-13 02:48:57 +00:00
|
|
|
case Type::FloatTyID:
|
|
|
|
Result.FloatVal = cast<ConstantFP>(C)->getValueAPF().convertToFloat();
|
2007-03-06 03:04:04 +00:00
|
|
|
break;
|
|
|
|
case Type::DoubleTyID:
|
2007-09-06 18:13:44 +00:00
|
|
|
Result.DoubleVal = cast<ConstantFP>(C)->getValueAPF().convertToDouble();
|
2007-03-06 03:04:04 +00:00
|
|
|
break;
|
2007-09-17 18:44:13 +00:00
|
|
|
case Type::X86_FP80TyID:
|
|
|
|
case Type::FP128TyID:
|
|
|
|
case Type::PPC_FP128TyID:
|
2008-10-09 18:53:47 +00:00
|
|
|
Result.IntVal = cast <ConstantFP>(C)->getValueAPF().bitcastToAPInt();
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
2007-03-06 03:04:04 +00:00
|
|
|
case Type::IntegerTyID:
|
|
|
|
Result.IntVal = cast<ConstantInt>(C)->getValue();
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
break;
|
2002-12-24 00:01:05 +00:00
|
|
|
case Type::PointerTyID:
|
2004-07-18 00:41:27 +00:00
|
|
|
if (isa<ConstantPointerNull>(C))
|
2002-12-24 00:01:05 +00:00
|
|
|
Result.PointerVal = 0;
|
2004-07-18 00:41:27 +00:00
|
|
|
else if (const Function *F = dyn_cast<Function>(C))
|
|
|
|
Result = PTOGV(getPointerToFunctionOrStub(const_cast<Function*>(F)));
|
2009-10-29 05:26:09 +00:00
|
|
|
else if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(C))
|
2004-07-18 00:41:27 +00:00
|
|
|
Result = PTOGV(getOrEmitGlobalVariable(const_cast<GlobalVariable*>(GV)));
|
2009-10-29 05:26:09 +00:00
|
|
|
else if (const BlockAddress *BA = dyn_cast<BlockAddress>(C))
|
|
|
|
Result = PTOGV(getPointerToBasicBlock(const_cast<BasicBlock*>(
|
|
|
|
BA->getBasicBlock())));
|
2004-07-18 00:41:27 +00:00
|
|
|
else
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unknown constant pointer type!");
|
2002-12-24 00:01:05 +00:00
|
|
|
break;
|
2013-04-01 15:53:30 +00:00
|
|
|
case Type::VectorTyID: {
|
|
|
|
unsigned elemNum;
|
|
|
|
Type* ElemTy;
|
|
|
|
const ConstantDataVector *CDV = dyn_cast<ConstantDataVector>(C);
|
|
|
|
const ConstantVector *CV = dyn_cast<ConstantVector>(C);
|
|
|
|
const ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(C);
|
|
|
|
|
|
|
|
if (CDV) {
|
|
|
|
elemNum = CDV->getNumElements();
|
|
|
|
ElemTy = CDV->getElementType();
|
|
|
|
} else if (CV || CAZ) {
|
|
|
|
VectorType* VTy = dyn_cast<VectorType>(C->getType());
|
|
|
|
elemNum = VTy->getNumElements();
|
|
|
|
ElemTy = VTy->getElementType();
|
|
|
|
} else {
|
|
|
|
llvm_unreachable("Unknown constant vector type!");
|
|
|
|
}
|
|
|
|
|
|
|
|
Result.AggregateVal.resize(elemNum);
|
|
|
|
// Check if vector holds floats.
|
|
|
|
if(ElemTy->isFloatTy()) {
|
|
|
|
if (CAZ) {
|
|
|
|
GenericValue floatZero;
|
|
|
|
floatZero.FloatVal = 0.f;
|
|
|
|
std::fill(Result.AggregateVal.begin(), Result.AggregateVal.end(),
|
|
|
|
floatZero);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(CV) {
|
|
|
|
for (unsigned i = 0; i < elemNum; ++i)
|
|
|
|
if (!isa<UndefValue>(CV->getOperand(i)))
|
|
|
|
Result.AggregateVal[i].FloatVal = cast<ConstantFP>(
|
|
|
|
CV->getOperand(i))->getValueAPF().convertToFloat();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(CDV)
|
|
|
|
for (unsigned i = 0; i < elemNum; ++i)
|
|
|
|
Result.AggregateVal[i].FloatVal = CDV->getElementAsFloat(i);
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Check if vector holds doubles.
|
|
|
|
if (ElemTy->isDoubleTy()) {
|
|
|
|
if (CAZ) {
|
|
|
|
GenericValue doubleZero;
|
|
|
|
doubleZero.DoubleVal = 0.0;
|
|
|
|
std::fill(Result.AggregateVal.begin(), Result.AggregateVal.end(),
|
|
|
|
doubleZero);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(CV) {
|
|
|
|
for (unsigned i = 0; i < elemNum; ++i)
|
|
|
|
if (!isa<UndefValue>(CV->getOperand(i)))
|
|
|
|
Result.AggregateVal[i].DoubleVal = cast<ConstantFP>(
|
|
|
|
CV->getOperand(i))->getValueAPF().convertToDouble();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(CDV)
|
|
|
|
for (unsigned i = 0; i < elemNum; ++i)
|
|
|
|
Result.AggregateVal[i].DoubleVal = CDV->getElementAsDouble(i);
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Check if vector holds integers.
|
|
|
|
if (ElemTy->isIntegerTy()) {
|
|
|
|
if (CAZ) {
|
|
|
|
GenericValue intZero;
|
|
|
|
intZero.IntVal = APInt(ElemTy->getScalarSizeInBits(), 0ull);
|
|
|
|
std::fill(Result.AggregateVal.begin(), Result.AggregateVal.end(),
|
|
|
|
intZero);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(CV) {
|
|
|
|
for (unsigned i = 0; i < elemNum; ++i)
|
|
|
|
if (!isa<UndefValue>(CV->getOperand(i)))
|
|
|
|
Result.AggregateVal[i].IntVal = cast<ConstantInt>(
|
|
|
|
CV->getOperand(i))->getValue();
|
|
|
|
else {
|
|
|
|
Result.AggregateVal[i].IntVal =
|
|
|
|
APInt(CV->getOperand(i)->getType()->getPrimitiveSizeInBits(), 0);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(CDV)
|
|
|
|
for (unsigned i = 0; i < elemNum; ++i)
|
|
|
|
Result.AggregateVal[i].IntVal = APInt(
|
|
|
|
CDV->getElementType()->getPrimitiveSizeInBits(),
|
|
|
|
CDV->getElementAsInteger(i));
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
llvm_unreachable("Unknown constant pointer type!");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2002-12-24 00:01:05 +00:00
|
|
|
default:
|
2010-11-13 02:48:57 +00:00
|
|
|
SmallString<256> Msg;
|
|
|
|
raw_svector_ostream OS(Msg);
|
|
|
|
OS << "ERROR: Constant unimplemented for type: " << *C->getType();
|
|
|
|
report_fatal_error(OS.str());
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2002-12-24 00:01:05 +00:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2007-12-14 19:38:31 +00:00
|
|
|
/// StoreIntToMemory - Fills the StoreBytes bytes of memory starting from Dst
|
|
|
|
/// with the integer held in IntVal.
|
|
|
|
static void StoreIntToMemory(const APInt &IntVal, uint8_t *Dst,
|
|
|
|
unsigned StoreBytes) {
|
|
|
|
assert((IntVal.getBitWidth()+7)/8 >= StoreBytes && "Integer too small!");
|
2012-09-05 22:26:57 +00:00
|
|
|
const uint8_t *Src = (const uint8_t *)IntVal.getRawData();
|
2007-12-14 19:38:31 +00:00
|
|
|
|
2013-04-15 14:44:24 +00:00
|
|
|
if (sys::IsLittleEndianHost) {
|
2007-12-14 19:38:31 +00:00
|
|
|
// Little-endian host - the source is ordered from LSB to MSB. Order the
|
|
|
|
// destination from LSB to MSB: Do a straight copy.
|
|
|
|
memcpy(Dst, Src, StoreBytes);
|
2010-11-13 02:48:57 +00:00
|
|
|
} else {
|
2007-12-14 19:38:31 +00:00
|
|
|
// Big-endian host - the source is an array of 64 bit words ordered from
|
|
|
|
// LSW to MSW. Each word is ordered from MSB to LSB. Order the destination
|
|
|
|
// from MSB to LSB: Reverse the word order, but not the bytes in a word.
|
|
|
|
while (StoreBytes > sizeof(uint64_t)) {
|
|
|
|
StoreBytes -= sizeof(uint64_t);
|
|
|
|
// May not be aligned so use memcpy.
|
|
|
|
memcpy(Dst + StoreBytes, Src, sizeof(uint64_t));
|
|
|
|
Src += sizeof(uint64_t);
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(Dst, Src + sizeof(uint64_t) - StoreBytes, StoreBytes);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-11-04 06:10:31 +00:00
|
|
|
void ExecutionEngine::StoreValueToMemory(const GenericValue &Val,
|
2011-07-18 04:54:35 +00:00
|
|
|
GenericValue *Ptr, Type *Ty) {
|
2012-10-08 16:38:25 +00:00
|
|
|
const unsigned StoreBytes = getDataLayout()->getTypeStoreSize(Ty);
|
2007-12-10 17:43:13 +00:00
|
|
|
|
2007-12-14 19:38:31 +00:00
|
|
|
switch (Ty->getTypeID()) {
|
2013-04-01 15:53:30 +00:00
|
|
|
default:
|
|
|
|
dbgs() << "Cannot store value of type " << *Ty << "!\n";
|
|
|
|
break;
|
2007-12-14 19:38:31 +00:00
|
|
|
case Type::IntegerTyID:
|
|
|
|
StoreIntToMemory(Val.IntVal, (uint8_t*)Ptr, StoreBytes);
|
2007-03-06 03:04:04 +00:00
|
|
|
break;
|
|
|
|
case Type::FloatTyID:
|
|
|
|
*((float*)Ptr) = Val.FloatVal;
|
|
|
|
break;
|
|
|
|
case Type::DoubleTyID:
|
|
|
|
*((double*)Ptr) = Val.DoubleVal;
|
|
|
|
break;
|
2009-03-24 18:16:17 +00:00
|
|
|
case Type::X86_FP80TyID:
|
|
|
|
memcpy(Ptr, Val.IntVal.getRawData(), 10);
|
|
|
|
break;
|
2007-12-14 19:38:31 +00:00
|
|
|
case Type::PointerTyID:
|
|
|
|
// Ensure 64 bit target pointers are fully initialized on 32 bit hosts.
|
|
|
|
if (StoreBytes != sizeof(PointerTy))
|
2011-04-28 08:37:18 +00:00
|
|
|
memset(&(Ptr->PointerVal), 0, StoreBytes);
|
2007-12-14 19:38:31 +00:00
|
|
|
|
2007-03-06 03:04:04 +00:00
|
|
|
*((PointerTy*)Ptr) = Val.PointerVal;
|
|
|
|
break;
|
2013-04-01 15:53:30 +00:00
|
|
|
case Type::VectorTyID:
|
|
|
|
for (unsigned i = 0; i < Val.AggregateVal.size(); ++i) {
|
|
|
|
if (cast<VectorType>(Ty)->getElementType()->isDoubleTy())
|
|
|
|
*(((double*)Ptr)+i) = Val.AggregateVal[i].DoubleVal;
|
|
|
|
if (cast<VectorType>(Ty)->getElementType()->isFloatTy())
|
|
|
|
*(((float*)Ptr)+i) = Val.AggregateVal[i].FloatVal;
|
|
|
|
if (cast<VectorType>(Ty)->getElementType()->isIntegerTy()) {
|
|
|
|
unsigned numOfBytes =(Val.AggregateVal[i].IntVal.getBitWidth()+7)/8;
|
|
|
|
StoreIntToMemory(Val.AggregateVal[i].IntVal,
|
|
|
|
(uint8_t*)Ptr + numOfBytes*i, numOfBytes);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
2007-12-14 19:38:31 +00:00
|
|
|
|
2013-04-15 14:44:24 +00:00
|
|
|
if (sys::IsLittleEndianHost != getDataLayout()->isLittleEndian())
|
2007-12-14 19:38:31 +00:00
|
|
|
// Host and target are different endian - reverse the stored bytes.
|
|
|
|
std::reverse((uint8_t*)Ptr, StoreBytes + (uint8_t*)Ptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// LoadIntFromMemory - Loads the integer stored in the LoadBytes bytes starting
|
|
|
|
/// from Src into IntVal, which is assumed to be wide enough and to hold zero.
|
|
|
|
static void LoadIntFromMemory(APInt &IntVal, uint8_t *Src, unsigned LoadBytes) {
|
|
|
|
assert((IntVal.getBitWidth()+7)/8 >= LoadBytes && "Integer too small!");
|
2013-01-14 21:04:45 +00:00
|
|
|
uint8_t *Dst = reinterpret_cast<uint8_t *>(
|
|
|
|
const_cast<uint64_t *>(IntVal.getRawData()));
|
2007-12-14 19:38:31 +00:00
|
|
|
|
2013-04-15 14:44:24 +00:00
|
|
|
if (sys::IsLittleEndianHost)
|
2007-12-14 19:38:31 +00:00
|
|
|
// Little-endian host - the destination must be ordered from LSB to MSB.
|
|
|
|
// The source is ordered from LSB to MSB: Do a straight copy.
|
|
|
|
memcpy(Dst, Src, LoadBytes);
|
|
|
|
else {
|
|
|
|
// Big-endian - the destination is an array of 64 bit words ordered from
|
|
|
|
// LSW to MSW. Each word must be ordered from MSB to LSB. The source is
|
|
|
|
// ordered from MSB to LSB: Reverse the word order, but not the bytes in
|
|
|
|
// a word.
|
|
|
|
while (LoadBytes > sizeof(uint64_t)) {
|
|
|
|
LoadBytes -= sizeof(uint64_t);
|
|
|
|
// May not be aligned so use memcpy.
|
|
|
|
memcpy(Dst, Src + LoadBytes, sizeof(uint64_t));
|
|
|
|
Dst += sizeof(uint64_t);
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(Dst + sizeof(uint64_t) - LoadBytes, Src, LoadBytes);
|
|
|
|
}
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
2003-10-10 17:45:12 +00:00
|
|
|
/// FIXME: document
|
|
|
|
///
|
2007-12-14 19:38:31 +00:00
|
|
|
void ExecutionEngine::LoadValueFromMemory(GenericValue &Result,
|
2008-03-10 16:38:37 +00:00
|
|
|
GenericValue *Ptr,
|
2011-07-18 04:54:35 +00:00
|
|
|
Type *Ty) {
|
2012-10-08 16:38:25 +00:00
|
|
|
const unsigned LoadBytes = getDataLayout()->getTypeStoreSize(Ty);
|
2007-12-14 19:38:31 +00:00
|
|
|
|
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
case Type::IntegerTyID:
|
2007-12-10 17:43:13 +00:00
|
|
|
// An APInt with all words initially zero.
|
2007-12-14 19:38:31 +00:00
|
|
|
Result.IntVal = APInt(cast<IntegerType>(Ty)->getBitWidth(), 0);
|
|
|
|
LoadIntFromMemory(Result.IntVal, (uint8_t*)Ptr, LoadBytes);
|
2007-03-06 03:04:04 +00:00
|
|
|
break;
|
|
|
|
case Type::FloatTyID:
|
|
|
|
Result.FloatVal = *((float*)Ptr);
|
|
|
|
break;
|
|
|
|
case Type::DoubleTyID:
|
2007-12-14 19:38:31 +00:00
|
|
|
Result.DoubleVal = *((double*)Ptr);
|
2007-03-06 03:04:04 +00:00
|
|
|
break;
|
2007-12-14 19:38:31 +00:00
|
|
|
case Type::PointerTyID:
|
2007-03-06 03:04:04 +00:00
|
|
|
Result.PointerVal = *((PointerTy*)Ptr);
|
|
|
|
break;
|
2007-09-17 18:44:13 +00:00
|
|
|
case Type::X86_FP80TyID: {
|
|
|
|
// This is endian dependent, but it will only work on x86 anyway.
|
2007-12-15 17:37:40 +00:00
|
|
|
// FIXME: Will not trap if loading a signaling NaN.
|
2009-03-24 18:16:17 +00:00
|
|
|
uint64_t y[2];
|
|
|
|
memcpy(y, Ptr, 10);
|
2011-07-18 21:45:40 +00:00
|
|
|
Result.IntVal = APInt(80, y);
|
2007-09-17 18:44:13 +00:00
|
|
|
break;
|
|
|
|
}
|
2013-04-01 15:53:30 +00:00
|
|
|
case Type::VectorTyID: {
|
|
|
|
const VectorType *VT = cast<VectorType>(Ty);
|
|
|
|
const Type *ElemT = VT->getElementType();
|
|
|
|
const unsigned numElems = VT->getNumElements();
|
|
|
|
if (ElemT->isFloatTy()) {
|
|
|
|
Result.AggregateVal.resize(numElems);
|
|
|
|
for (unsigned i = 0; i < numElems; ++i)
|
|
|
|
Result.AggregateVal[i].FloatVal = *((float*)Ptr+i);
|
|
|
|
}
|
|
|
|
if (ElemT->isDoubleTy()) {
|
|
|
|
Result.AggregateVal.resize(numElems);
|
|
|
|
for (unsigned i = 0; i < numElems; ++i)
|
|
|
|
Result.AggregateVal[i].DoubleVal = *((double*)Ptr+i);
|
|
|
|
}
|
|
|
|
if (ElemT->isIntegerTy()) {
|
|
|
|
GenericValue intZero;
|
|
|
|
const unsigned elemBitWidth = cast<IntegerType>(ElemT)->getBitWidth();
|
|
|
|
intZero.IntVal = APInt(elemBitWidth, 0);
|
|
|
|
Result.AggregateVal.resize(numElems, intZero);
|
|
|
|
for (unsigned i = 0; i < numElems; ++i)
|
|
|
|
LoadIntFromMemory(Result.AggregateVal[i].IntVal,
|
|
|
|
(uint8_t*)Ptr+((elemBitWidth+7)/8)*i, (elemBitWidth+7)/8);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2007-03-06 03:04:04 +00:00
|
|
|
default:
|
2010-11-13 02:48:57 +00:00
|
|
|
SmallString<256> Msg;
|
|
|
|
raw_svector_ostream OS(Msg);
|
|
|
|
OS << "Cannot load value of type " << *Ty << "!";
|
|
|
|
report_fatal_error(OS.str());
|
2003-05-08 16:52:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-12-24 00:01:05 +00:00
|
|
|
void ExecutionEngine::InitializeMemory(const Constant *Init, void *Addr) {
|
2010-01-05 01:27:39 +00:00
|
|
|
DEBUG(dbgs() << "JIT: Initializing " << Addr << " ");
|
2008-08-07 01:30:15 +00:00
|
|
|
DEBUG(Init->dump());
|
2012-01-24 13:41:11 +00:00
|
|
|
if (isa<UndefValue>(Init))
|
2004-10-16 18:19:26 +00:00
|
|
|
return;
|
2012-01-24 13:41:11 +00:00
|
|
|
|
|
|
|
if (const ConstantVector *CP = dyn_cast<ConstantVector>(Init)) {
|
2006-01-20 18:18:40 +00:00
|
|
|
unsigned ElementSize =
|
2012-10-08 16:38:25 +00:00
|
|
|
getDataLayout()->getTypeAllocSize(CP->getType()->getElementType());
|
2006-01-20 18:18:40 +00:00
|
|
|
for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
|
|
|
|
InitializeMemory(CP->getOperand(i), (char*)Addr+i*ElementSize);
|
|
|
|
return;
|
2012-01-24 13:41:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (isa<ConstantAggregateZero>(Init)) {
|
2012-10-08 16:38:25 +00:00
|
|
|
memset(Addr, 0, (size_t)getDataLayout()->getTypeAllocSize(Init->getType()));
|
2008-02-15 00:57:28 +00:00
|
|
|
return;
|
2012-01-24 13:41:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (const ConstantArray *CPA = dyn_cast<ConstantArray>(Init)) {
|
2005-04-21 22:36:52 +00:00
|
|
|
unsigned ElementSize =
|
2012-10-08 16:38:25 +00:00
|
|
|
getDataLayout()->getTypeAllocSize(CPA->getType()->getElementType());
|
2004-08-04 08:44:43 +00:00
|
|
|
for (unsigned i = 0, e = CPA->getNumOperands(); i != e; ++i)
|
|
|
|
InitializeMemory(CPA->getOperand(i), (char*)Addr+i*ElementSize);
|
2002-12-24 00:01:05 +00:00
|
|
|
return;
|
2012-01-24 13:41:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (const ConstantStruct *CPS = dyn_cast<ConstantStruct>(Init)) {
|
2002-12-24 00:01:05 +00:00
|
|
|
const StructLayout *SL =
|
2012-10-08 16:38:25 +00:00
|
|
|
getDataLayout()->getStructLayout(cast<StructType>(CPS->getType()));
|
2004-08-04 08:44:43 +00:00
|
|
|
for (unsigned i = 0, e = CPS->getNumOperands(); i != e; ++i)
|
2007-02-10 19:55:17 +00:00
|
|
|
InitializeMemory(CPS->getOperand(i), (char*)Addr+SL->getElementOffset(i));
|
2002-12-24 00:01:05 +00:00
|
|
|
return;
|
2012-01-24 13:41:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (const ConstantDataSequential *CDS =
|
|
|
|
dyn_cast<ConstantDataSequential>(Init)) {
|
|
|
|
// CDS is already laid out in host memory order.
|
|
|
|
StringRef Data = CDS->getRawDataValues();
|
|
|
|
memcpy(Addr, Data.data(), Data.size());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Init->getType()->isFirstClassType()) {
|
2008-05-20 03:20:09 +00:00
|
|
|
GenericValue Val = getConstantValue(Init);
|
|
|
|
StoreValueToMemory(Val, (GenericValue*)Addr, Init->getType());
|
|
|
|
return;
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
DEBUG(dbgs() << "Bad Type: " << *Init->getType() << "\n");
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unknown constant type to initialize memory with!");
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// EmitGlobals - Emit all of the global variables to memory, storing their
|
|
|
|
/// addresses into GlobalAddress. This must make sure to copy the contents of
|
|
|
|
/// their initializers into the memory.
|
|
|
|
void ExecutionEngine::emitGlobals() {
|
|
|
|
// Loop over all of the global variables in the program, allocating the memory
|
2006-08-16 01:24:12 +00:00
|
|
|
// to hold them. If there is more than one module, do a prepass over globals
|
|
|
|
// to figure out how the different modules should link together.
|
2011-07-18 04:54:35 +00:00
|
|
|
std::map<std::pair<std::string, Type*>,
|
2006-08-16 01:24:12 +00:00
|
|
|
const GlobalValue*> LinkedGlobalsMap;
|
|
|
|
|
|
|
|
if (Modules.size() != 1) {
|
|
|
|
for (unsigned m = 0, e = Modules.size(); m != e; ++m) {
|
2010-01-27 20:34:15 +00:00
|
|
|
Module &M = *Modules[m];
|
2006-08-16 01:24:12 +00:00
|
|
|
for (Module::const_global_iterator I = M.global_begin(),
|
|
|
|
E = M.global_end(); I != E; ++I) {
|
|
|
|
const GlobalValue *GV = I;
|
2009-01-15 20:18:42 +00:00
|
|
|
if (GV->hasLocalLinkage() || GV->isDeclaration() ||
|
2006-08-16 01:24:12 +00:00
|
|
|
GV->hasAppendingLinkage() || !GV->hasName())
|
|
|
|
continue;// Ignore external globals and globals with internal linkage.
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
const GlobalValue *&GVEntry =
|
2006-08-16 01:24:12 +00:00
|
|
|
LinkedGlobalsMap[std::make_pair(GV->getName(), GV->getType())];
|
|
|
|
|
|
|
|
// If this is the first time we've seen this global, it is the canonical
|
|
|
|
// version.
|
|
|
|
if (!GVEntry) {
|
|
|
|
GVEntry = GV;
|
|
|
|
continue;
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2006-08-16 01:24:12 +00:00
|
|
|
// If the existing global is strong, never replace it.
|
2014-01-14 15:22:47 +00:00
|
|
|
if (GVEntry->hasExternalLinkage())
|
2006-08-16 01:24:12 +00:00
|
|
|
continue;
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2006-08-16 01:24:12 +00:00
|
|
|
// Otherwise, we know it's linkonce/weak, replace it if this is a strong
|
2008-05-14 20:12:51 +00:00
|
|
|
// symbol. FIXME is this right for common?
|
2006-12-01 00:25:12 +00:00
|
|
|
if (GV->hasExternalLinkage() || GVEntry->hasExternalWeakLinkage())
|
2006-08-16 01:24:12 +00:00
|
|
|
GVEntry = GV;
|
2003-04-23 19:01:49 +00:00
|
|
|
}
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
2006-08-16 01:24:12 +00:00
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2006-08-16 01:24:12 +00:00
|
|
|
std::vector<const GlobalValue*> NonCanonicalGlobals;
|
|
|
|
for (unsigned m = 0, e = Modules.size(); m != e; ++m) {
|
2010-01-27 20:34:15 +00:00
|
|
|
Module &M = *Modules[m];
|
2006-08-16 01:24:12 +00:00
|
|
|
for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
|
|
|
|
I != E; ++I) {
|
|
|
|
// In the multi-module case, see what this global maps to.
|
|
|
|
if (!LinkedGlobalsMap.empty()) {
|
2010-11-13 02:48:57 +00:00
|
|
|
if (const GlobalValue *GVEntry =
|
2006-08-16 01:24:12 +00:00
|
|
|
LinkedGlobalsMap[std::make_pair(I->getName(), I->getType())]) {
|
|
|
|
// If something else is the canonical global, ignore this one.
|
|
|
|
if (GVEntry != &*I) {
|
|
|
|
NonCanonicalGlobals.push_back(I);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2007-01-30 20:08:39 +00:00
|
|
|
if (!I->isDeclaration()) {
|
2008-10-25 15:41:43 +00:00
|
|
|
addGlobalMapping(I, getMemoryForGV(I));
|
2006-08-16 01:24:12 +00:00
|
|
|
} else {
|
|
|
|
// External variable reference. Try to use the dynamic loader to
|
|
|
|
// get a pointer to it.
|
|
|
|
if (void *SymAddr =
|
2009-07-21 08:54:24 +00:00
|
|
|
sys::DynamicLibrary::SearchForAddressOfSymbol(I->getName()))
|
2006-08-16 01:24:12 +00:00
|
|
|
addGlobalMapping(I, SymAddr);
|
|
|
|
else {
|
2010-04-07 22:58:41 +00:00
|
|
|
report_fatal_error("Could not resolve external global address: "
|
2009-07-07 17:32:34 +00:00
|
|
|
+I->getName());
|
2006-08-16 01:24:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2006-08-16 01:24:12 +00:00
|
|
|
// If there are multiple modules, map the non-canonical globals to their
|
|
|
|
// canonical location.
|
|
|
|
if (!NonCanonicalGlobals.empty()) {
|
|
|
|
for (unsigned i = 0, e = NonCanonicalGlobals.size(); i != e; ++i) {
|
|
|
|
const GlobalValue *GV = NonCanonicalGlobals[i];
|
|
|
|
const GlobalValue *CGV =
|
|
|
|
LinkedGlobalsMap[std::make_pair(GV->getName(), GV->getType())];
|
|
|
|
void *Ptr = getPointerToGlobalIfAvailable(CGV);
|
|
|
|
assert(Ptr && "Canonical global wasn't codegen'd!");
|
2008-10-14 10:04:52 +00:00
|
|
|
addGlobalMapping(GV, Ptr);
|
2006-08-16 01:24:12 +00:00
|
|
|
}
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
// Now that all of the globals are set up in memory, loop through them all
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33113 91177308-0d34-0410-b5e6-96231b3b80d8
2007-01-12 07:05:14 +00:00
|
|
|
// and initialize their contents.
|
2006-08-16 01:24:12 +00:00
|
|
|
for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
|
|
|
|
I != E; ++I) {
|
2007-01-30 20:08:39 +00:00
|
|
|
if (!I->isDeclaration()) {
|
2006-08-16 01:24:12 +00:00
|
|
|
if (!LinkedGlobalsMap.empty()) {
|
2010-11-13 02:48:57 +00:00
|
|
|
if (const GlobalValue *GVEntry =
|
2006-08-16 01:24:12 +00:00
|
|
|
LinkedGlobalsMap[std::make_pair(I->getName(), I->getType())])
|
|
|
|
if (GVEntry != &*I) // Not the canonical variable.
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
EmitGlobalVariable(I);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2003-12-20 02:45:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// EmitGlobalVariable - This method emits the specified global variable to the
|
|
|
|
// address specified in GlobalAddresses, or allocates new memory if it's not
|
|
|
|
// already in the map.
|
2003-12-20 03:36:47 +00:00
|
|
|
void ExecutionEngine::EmitGlobalVariable(const GlobalVariable *GV) {
|
2003-12-31 20:21:04 +00:00
|
|
|
void *GA = getPointerToGlobalIfAvailable(GV);
|
2004-02-08 19:33:23 +00:00
|
|
|
|
2003-12-20 02:45:37 +00:00
|
|
|
if (GA == 0) {
|
|
|
|
// If it's not already specified, allocate memory for the global.
|
2008-10-25 15:41:43 +00:00
|
|
|
GA = getMemoryForGV(GV);
|
2013-11-15 17:52:54 +00:00
|
|
|
|
|
|
|
// If we failed to allocate memory for this global, return.
|
|
|
|
if (GA == 0) return;
|
|
|
|
|
2003-12-31 20:21:04 +00:00
|
|
|
addGlobalMapping(GV, GA);
|
2003-12-20 02:45:37 +00:00
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2008-10-25 15:41:43 +00:00
|
|
|
// Don't initialize if it's thread local, let the client do it.
|
|
|
|
if (!GV->isThreadLocal())
|
|
|
|
InitializeMemory(GV->getInitializer(), GA);
|
2010-11-13 02:48:57 +00:00
|
|
|
|
2011-07-18 04:54:35 +00:00
|
|
|
Type *ElTy = GV->getType()->getElementType();
|
2012-10-08 16:38:25 +00:00
|
|
|
size_t GVSize = (size_t)getDataLayout()->getTypeAllocSize(ElTy);
|
2005-01-08 20:13:19 +00:00
|
|
|
NumInitBytes += (unsigned)GVSize;
|
2003-12-20 02:45:37 +00:00
|
|
|
++NumGlobals;
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
2009-10-13 17:42:08 +00:00
|
|
|
|
2009-10-23 22:37:43 +00:00
|
|
|
ExecutionEngineState::ExecutionEngineState(ExecutionEngine &EE)
|
|
|
|
: EE(EE), GlobalAddressMap(this) {
|
|
|
|
}
|
2009-10-13 17:42:08 +00:00
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
sys::Mutex *
|
|
|
|
ExecutionEngineState::AddressMapConfig::getMutex(ExecutionEngineState *EES) {
|
2009-10-23 22:37:43 +00:00
|
|
|
return &EES->EE.lock;
|
|
|
|
}
|
2010-11-13 02:48:57 +00:00
|
|
|
|
|
|
|
void ExecutionEngineState::AddressMapConfig::onDelete(ExecutionEngineState *EES,
|
|
|
|
const GlobalValue *Old) {
|
2009-10-23 22:37:43 +00:00
|
|
|
void *OldVal = EES->GlobalAddressMap.lookup(Old);
|
|
|
|
EES->GlobalAddressReverseMap.erase(OldVal);
|
2009-10-13 17:42:08 +00:00
|
|
|
}
|
|
|
|
|
2010-11-13 02:48:57 +00:00
|
|
|
void ExecutionEngineState::AddressMapConfig::onRAUW(ExecutionEngineState *,
|
|
|
|
const GlobalValue *,
|
|
|
|
const GlobalValue *) {
|
2012-02-07 05:05:23 +00:00
|
|
|
llvm_unreachable("The ExecutionEngine doesn't know how to handle a"
|
|
|
|
" RAUW on a value it has a global mapping for.");
|
2009-10-13 17:42:08 +00:00
|
|
|
}
|