2004-11-22 22:00:25 +00:00
|
|
|
//===-- JITEmitter.cpp - Write machine code to executable memory ----------===//
|
2005-04-21 22:55:34 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
2005-04-21 22:55:34 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-12-24 00:01:05 +00:00
|
|
|
//
|
2004-11-20 03:46:14 +00:00
|
|
|
// This file defines a MachineCodeEmitter object that is used by the JIT to
|
|
|
|
// write machine code to memory and remember where relocatable values are.
|
2002-12-24 00:01:05 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2003-08-05 17:00:32 +00:00
|
|
|
#define DEBUG_TYPE "jit"
|
2003-12-20 01:46:27 +00:00
|
|
|
#include "JIT.h"
|
2003-11-30 04:23:21 +00:00
|
|
|
#include "llvm/Constant.h"
|
|
|
|
#include "llvm/Module.h"
|
2005-03-17 15:38:16 +00:00
|
|
|
#include "llvm/Type.h"
|
2002-12-24 00:01:05 +00:00
|
|
|
#include "llvm/CodeGen/MachineCodeEmitter.h"
|
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2003-01-13 01:00:12 +00:00
|
|
|
#include "llvm/CodeGen/MachineConstantPool.h"
|
2006-04-22 18:53:45 +00:00
|
|
|
#include "llvm/CodeGen/MachineJumpTableInfo.h"
|
2004-11-20 03:46:14 +00:00
|
|
|
#include "llvm/CodeGen/MachineRelocation.h"
|
2006-04-22 18:53:45 +00:00
|
|
|
#include "llvm/ExecutionEngine/GenericValue.h"
|
2003-01-13 01:00:12 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2004-11-20 03:46:14 +00:00
|
|
|
#include "llvm/Target/TargetJITInfo.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
2004-09-11 04:31:03 +00:00
|
|
|
#include "llvm/System/Memory.h"
|
2005-07-29 23:40:16 +00:00
|
|
|
#include <algorithm>
|
2006-01-22 23:41:42 +00:00
|
|
|
#include <iostream>
|
2003-12-08 08:06:28 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2002-12-24 00:01:05 +00:00
|
|
|
namespace {
|
2003-10-20 05:45:49 +00:00
|
|
|
Statistic<> NumBytes("jit", "Number of bytes of machine code compiled");
|
2005-07-20 16:29:20 +00:00
|
|
|
Statistic<> NumRelos("jit", "Number of relocations applied");
|
2003-12-20 01:46:27 +00:00
|
|
|
JIT *TheJIT = 0;
|
2004-11-20 23:57:07 +00:00
|
|
|
}
|
|
|
|
|
2002-12-24 00:01:05 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// JITMemoryManager code.
|
|
|
|
//
|
|
|
|
namespace {
|
2003-08-14 18:35:27 +00:00
|
|
|
/// JITMemoryManager - Manage memory for the JIT code generation in a logical,
|
|
|
|
/// sane way. This splits a large block of MAP_NORESERVE'd memory into two
|
|
|
|
/// sections, one for function stubs, one for the functions themselves. We
|
|
|
|
/// have to do this because we may need to emit a function stub while in the
|
|
|
|
/// middle of emitting a function, and we don't know how large the function we
|
|
|
|
/// are emitting is. This never bothers to release the memory, because when
|
|
|
|
/// we are ready to destroy the JIT, the program exits.
|
|
|
|
class JITMemoryManager {
|
2006-05-03 00:54:49 +00:00
|
|
|
std::vector<sys::MemoryBlock> Blocks; // Memory blocks allocated by the JIT
|
2003-08-14 18:35:27 +00:00
|
|
|
unsigned char *FunctionBase; // Start of the function body area
|
2006-05-02 23:22:24 +00:00
|
|
|
unsigned char *CurStubPtr, *CurFunctionPtr;
|
2006-05-02 21:44:14 +00:00
|
|
|
unsigned char *GOTBase; // Target Specific reserved memory
|
2005-07-29 23:40:16 +00:00
|
|
|
|
|
|
|
// centralize memory block allocation
|
|
|
|
sys::MemoryBlock getNewMemoryBlock(unsigned size);
|
2003-08-14 18:35:27 +00:00
|
|
|
public:
|
2005-07-22 20:48:12 +00:00
|
|
|
JITMemoryManager(bool useGOT);
|
2004-12-13 16:04:04 +00:00
|
|
|
~JITMemoryManager();
|
2005-04-21 22:55:34 +00:00
|
|
|
|
2003-08-14 18:35:27 +00:00
|
|
|
inline unsigned char *allocateStub(unsigned StubSize);
|
|
|
|
inline unsigned char *startFunctionBody();
|
2005-01-10 18:23:22 +00:00
|
|
|
inline void endFunctionBody(unsigned char *FunctionEnd);
|
2006-05-02 21:44:14 +00:00
|
|
|
|
|
|
|
unsigned char *getGOTBase() const {
|
|
|
|
return GOTBase;
|
|
|
|
}
|
|
|
|
bool isManagingGOT() const {
|
|
|
|
return GOTBase != NULL;
|
|
|
|
}
|
2003-08-14 18:35:27 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2005-07-22 20:48:12 +00:00
|
|
|
JITMemoryManager::JITMemoryManager(bool useGOT) {
|
2005-07-29 23:40:16 +00:00
|
|
|
// Allocate a 16M block of memory for functions
|
|
|
|
sys::MemoryBlock FunBlock = getNewMemoryBlock(16 << 20);
|
|
|
|
|
|
|
|
FunctionBase = reinterpret_cast<unsigned char*>(FunBlock.base());
|
|
|
|
|
|
|
|
// Allocate stubs backwards from the base, allocate functions forward
|
|
|
|
// from the base.
|
|
|
|
CurStubPtr = CurFunctionPtr = FunctionBase + 512*1024;// Use 512k for stubs
|
|
|
|
|
2006-05-02 21:57:51 +00:00
|
|
|
// Allocate the GOT.
|
2005-08-01 17:35:40 +00:00
|
|
|
GOTBase = NULL;
|
2006-05-02 21:57:51 +00:00
|
|
|
if (useGOT) GOTBase = (unsigned char*)malloc(sizeof(void*) * 8192);
|
2003-08-14 18:35:27 +00:00
|
|
|
}
|
|
|
|
|
2004-12-13 16:04:04 +00:00
|
|
|
JITMemoryManager::~JITMemoryManager() {
|
2006-05-03 00:54:49 +00:00
|
|
|
for (unsigned i = 0, e = Blocks.size(); i != e; ++i)
|
|
|
|
sys::Memory::ReleaseRWX(Blocks[i]);
|
2005-07-29 23:40:16 +00:00
|
|
|
Blocks.clear();
|
2004-12-13 16:04:04 +00:00
|
|
|
}
|
|
|
|
|
2003-08-14 18:35:27 +00:00
|
|
|
unsigned char *JITMemoryManager::allocateStub(unsigned StubSize) {
|
|
|
|
CurStubPtr -= StubSize;
|
2005-07-29 23:40:16 +00:00
|
|
|
if (CurStubPtr < FunctionBase) {
|
2006-05-02 21:44:14 +00:00
|
|
|
// FIXME: allocate a new block
|
2003-08-14 18:35:27 +00:00
|
|
|
std::cerr << "JIT ran out of memory for function stubs!\n";
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
return CurStubPtr;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char *JITMemoryManager::startFunctionBody() {
|
2006-05-03 01:03:20 +00:00
|
|
|
return CurFunctionPtr;
|
2003-08-14 18:35:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void JITMemoryManager::endFunctionBody(unsigned char *FunctionEnd) {
|
|
|
|
assert(FunctionEnd > CurFunctionPtr);
|
|
|
|
CurFunctionPtr = FunctionEnd;
|
|
|
|
}
|
|
|
|
|
2005-07-29 23:40:16 +00:00
|
|
|
sys::MemoryBlock JITMemoryManager::getNewMemoryBlock(unsigned size) {
|
|
|
|
try {
|
2006-05-03 00:54:49 +00:00
|
|
|
const sys::MemoryBlock *BOld = Blocks.empty() ? 0 : &Blocks.front();
|
|
|
|
sys::MemoryBlock B = sys::Memory::AllocateRWX(size, BOld);
|
|
|
|
Blocks.push_back(B);
|
|
|
|
return B;
|
|
|
|
} catch (std::string &err) {
|
2005-07-29 23:40:16 +00:00
|
|
|
std::cerr << "Allocation failed when allocating new memory in the JIT\n";
|
|
|
|
std::cerr << err << "\n";
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// JIT lazy compilation code.
|
|
|
|
//
|
|
|
|
namespace {
|
2005-07-12 15:51:55 +00:00
|
|
|
class JITResolverState {
|
|
|
|
private:
|
|
|
|
/// FunctionToStubMap - Keep track of the stub created for a particular
|
|
|
|
/// function so that we can reuse them if necessary.
|
|
|
|
std::map<Function*, void*> FunctionToStubMap;
|
|
|
|
|
|
|
|
/// StubToFunctionMap - Keep track of the function that each stub
|
|
|
|
/// corresponds to.
|
|
|
|
std::map<void*, Function*> StubToFunctionMap;
|
2005-07-27 06:12:32 +00:00
|
|
|
|
2005-07-12 15:51:55 +00:00
|
|
|
public:
|
|
|
|
std::map<Function*, void*>& getFunctionToStubMap(const MutexGuard& locked) {
|
|
|
|
assert(locked.holds(TheJIT->lock));
|
|
|
|
return FunctionToStubMap;
|
|
|
|
}
|
2005-07-27 06:12:32 +00:00
|
|
|
|
2005-07-12 15:51:55 +00:00
|
|
|
std::map<void*, Function*>& getStubToFunctionMap(const MutexGuard& locked) {
|
|
|
|
assert(locked.holds(TheJIT->lock));
|
|
|
|
return StubToFunctionMap;
|
|
|
|
}
|
|
|
|
};
|
2005-07-27 06:12:32 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
/// JITResolver - Keep track of, and resolve, call sites for functions that
|
|
|
|
/// have not yet been compiled.
|
|
|
|
class JITResolver {
|
2004-11-21 03:37:42 +00:00
|
|
|
/// MCE - The MachineCodeEmitter to use to emit stubs with.
|
2004-11-20 23:57:07 +00:00
|
|
|
MachineCodeEmitter &MCE;
|
2003-08-14 18:35:27 +00:00
|
|
|
|
2004-11-21 03:37:42 +00:00
|
|
|
/// LazyResolverFn - The target lazy resolver function that we actually
|
|
|
|
/// rewrite instructions to use.
|
|
|
|
TargetJITInfo::LazyResolverFn LazyResolverFn;
|
|
|
|
|
2005-07-12 15:51:55 +00:00
|
|
|
JITResolverState state;
|
2004-11-20 23:57:07 +00:00
|
|
|
|
2005-04-18 01:44:27 +00:00
|
|
|
/// ExternalFnToStubMap - This is the equivalent of FunctionToStubMap for
|
|
|
|
/// external functions.
|
|
|
|
std::map<void*, void*> ExternalFnToStubMap;
|
2005-07-28 12:44:13 +00:00
|
|
|
|
|
|
|
//map addresses to indexes in the GOT
|
|
|
|
std::map<void*, unsigned> revGOTMap;
|
|
|
|
unsigned nextGOTIndex;
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
public:
|
2005-07-28 12:44:13 +00:00
|
|
|
JITResolver(MachineCodeEmitter &mce) : MCE(mce), nextGOTIndex(0) {
|
2004-11-21 03:37:42 +00:00
|
|
|
LazyResolverFn =
|
|
|
|
TheJIT->getJITInfo().getLazyResolverFunction(JITCompilerFn);
|
|
|
|
}
|
2004-11-20 23:57:07 +00:00
|
|
|
|
|
|
|
/// getFunctionStub - This returns a pointer to a function stub, creating
|
|
|
|
/// one on demand as needed.
|
|
|
|
void *getFunctionStub(Function *F);
|
|
|
|
|
2005-04-18 01:44:27 +00:00
|
|
|
/// getExternalFunctionStub - Return a stub for the function at the
|
|
|
|
/// specified address, created lazily on demand.
|
|
|
|
void *getExternalFunctionStub(void *FnAddr);
|
|
|
|
|
2004-11-21 03:37:42 +00:00
|
|
|
/// AddCallbackAtLocation - If the target is capable of rewriting an
|
|
|
|
/// instruction without the use of a stub, record the location of the use so
|
|
|
|
/// we know which function is being used at the location.
|
|
|
|
void *AddCallbackAtLocation(Function *F, void *Location) {
|
2005-07-12 15:51:55 +00:00
|
|
|
MutexGuard locked(TheJIT->lock);
|
2004-11-21 03:37:42 +00:00
|
|
|
/// Get the target-specific JIT resolver function.
|
2005-07-12 15:51:55 +00:00
|
|
|
state.getStubToFunctionMap(locked)[Location] = F;
|
2004-11-21 03:37:42 +00:00
|
|
|
return (void*)LazyResolverFn;
|
|
|
|
}
|
|
|
|
|
2005-07-28 12:44:13 +00:00
|
|
|
/// getGOTIndexForAddress - Return a new or existing index in the GOT for
|
|
|
|
/// and address. This function only manages slots, it does not manage the
|
|
|
|
/// contents of the slots or the memory associated with the GOT.
|
|
|
|
unsigned getGOTIndexForAddr(void* addr);
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
/// JITCompilerFn - This function is called to resolve a stub to a compiled
|
|
|
|
/// address. If the LLVM Function corresponding to the stub has not yet
|
|
|
|
/// been compiled, this function compiles it first.
|
|
|
|
static void *JITCompilerFn(void *Stub);
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getJITResolver - This function returns the one instance of the JIT resolver.
|
|
|
|
///
|
|
|
|
static JITResolver &getJITResolver(MachineCodeEmitter *MCE = 0) {
|
|
|
|
static JITResolver TheJITResolver(*MCE);
|
|
|
|
return TheJITResolver;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getFunctionStub - This returns a pointer to a function stub, creating
|
|
|
|
/// one on demand as needed.
|
|
|
|
void *JITResolver::getFunctionStub(Function *F) {
|
2005-07-12 15:51:55 +00:00
|
|
|
MutexGuard locked(TheJIT->lock);
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
// If we already have a stub for this function, recycle it.
|
2005-07-12 15:51:55 +00:00
|
|
|
void *&Stub = state.getFunctionToStubMap(locked)[F];
|
2004-11-20 23:57:07 +00:00
|
|
|
if (Stub) return Stub;
|
|
|
|
|
2004-11-22 07:24:43 +00:00
|
|
|
// Call the lazy resolver function unless we already KNOW it is an external
|
|
|
|
// function, in which case we just skip the lazy resolution step.
|
|
|
|
void *Actual = (void*)LazyResolverFn;
|
2005-02-20 18:43:35 +00:00
|
|
|
if (F->isExternal() && F->hasExternalLinkage())
|
2004-11-22 07:24:43 +00:00
|
|
|
Actual = TheJIT->getPointerToFunction(F);
|
2005-04-21 22:55:34 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
// Otherwise, codegen a new stub. For now, the stub will call the lazy
|
|
|
|
// resolver function.
|
2004-11-22 07:24:43 +00:00
|
|
|
Stub = TheJIT->getJITInfo().emitFunctionStub(Actual, MCE);
|
|
|
|
|
2005-02-20 18:43:35 +00:00
|
|
|
if (Actual != (void*)LazyResolverFn) {
|
2004-11-22 07:24:43 +00:00
|
|
|
// If we are getting the stub for an external function, we really want the
|
|
|
|
// address of the stub in the GlobalAddressMap for the JIT, not the address
|
|
|
|
// of the external function.
|
|
|
|
TheJIT->updateGlobalMapping(F, Stub);
|
|
|
|
}
|
2004-11-20 23:57:07 +00:00
|
|
|
|
2004-11-21 03:44:32 +00:00
|
|
|
DEBUG(std::cerr << "JIT: Stub emitted at [" << Stub << "] for function '"
|
2004-11-22 21:48:33 +00:00
|
|
|
<< F->getName() << "'\n");
|
2004-11-21 03:44:32 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
// Finally, keep track of the stub-to-Function mapping so that the
|
|
|
|
// JITCompilerFn knows which function to compile!
|
2005-07-12 15:51:55 +00:00
|
|
|
state.getStubToFunctionMap(locked)[Stub] = F;
|
2004-11-20 23:57:07 +00:00
|
|
|
return Stub;
|
|
|
|
}
|
|
|
|
|
2005-04-18 01:44:27 +00:00
|
|
|
/// getExternalFunctionStub - Return a stub for the function at the
|
|
|
|
/// specified address, created lazily on demand.
|
|
|
|
void *JITResolver::getExternalFunctionStub(void *FnAddr) {
|
|
|
|
// If we already have a stub for this function, recycle it.
|
|
|
|
void *&Stub = ExternalFnToStubMap[FnAddr];
|
|
|
|
if (Stub) return Stub;
|
|
|
|
|
|
|
|
Stub = TheJIT->getJITInfo().emitFunctionStub(FnAddr, MCE);
|
|
|
|
DEBUG(std::cerr << "JIT: Stub emitted at [" << Stub
|
|
|
|
<< "] for external function at '" << FnAddr << "'\n");
|
|
|
|
return Stub;
|
|
|
|
}
|
|
|
|
|
2005-07-28 12:44:13 +00:00
|
|
|
unsigned JITResolver::getGOTIndexForAddr(void* addr) {
|
|
|
|
unsigned idx = revGOTMap[addr];
|
|
|
|
if (!idx) {
|
|
|
|
idx = ++nextGOTIndex;
|
|
|
|
revGOTMap[addr] = idx;
|
|
|
|
DEBUG(std::cerr << "Adding GOT entry " << idx
|
|
|
|
<< " for addr " << addr << "\n");
|
|
|
|
// ((void**)MemMgr.getGOTBase())[idx] = addr;
|
|
|
|
}
|
|
|
|
return idx;
|
|
|
|
}
|
2005-04-18 01:44:27 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
/// JITCompilerFn - This function is called when a lazy compilation stub has
|
|
|
|
/// been entered. It looks up which function this stub corresponds to, compiles
|
|
|
|
/// it if necessary, then returns the resultant function pointer.
|
|
|
|
void *JITResolver::JITCompilerFn(void *Stub) {
|
|
|
|
JITResolver &JR = getJITResolver();
|
2005-04-21 22:55:34 +00:00
|
|
|
|
2005-07-12 15:51:55 +00:00
|
|
|
MutexGuard locked(TheJIT->lock);
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
// The address given to us for the stub may not be exactly right, it might be
|
|
|
|
// a little bit after the stub. As such, use upper_bound to find it.
|
|
|
|
std::map<void*, Function*>::iterator I =
|
2005-07-12 15:51:55 +00:00
|
|
|
JR.state.getStubToFunctionMap(locked).upper_bound(Stub);
|
2006-01-07 06:20:51 +00:00
|
|
|
assert(I != JR.state.getStubToFunctionMap(locked).begin() &&
|
|
|
|
"This is not a known stub!");
|
2004-11-20 23:57:07 +00:00
|
|
|
Function *F = (--I)->second;
|
|
|
|
|
2005-07-12 15:51:55 +00:00
|
|
|
// We might like to remove the stub from the StubToFunction map.
|
|
|
|
// We can't do that! Multiple threads could be stuck, waiting to acquire the
|
|
|
|
// lock above. As soon as the 1st function finishes compiling the function,
|
2006-01-07 06:20:51 +00:00
|
|
|
// the next one will be released, and needs to be able to find the function it
|
|
|
|
// needs to call.
|
2005-07-12 15:51:55 +00:00
|
|
|
//JR.state.getStubToFunctionMap(locked).erase(I);
|
2004-11-20 23:57:07 +00:00
|
|
|
|
2004-11-21 03:44:32 +00:00
|
|
|
DEBUG(std::cerr << "JIT: Lazily resolving function '" << F->getName()
|
2004-11-20 23:57:07 +00:00
|
|
|
<< "' In stub ptr = " << Stub << " actual ptr = "
|
|
|
|
<< I->first << "\n");
|
|
|
|
|
|
|
|
void *Result = TheJIT->getPointerToFunction(F);
|
|
|
|
|
|
|
|
// We don't need to reuse this stub in the future, as F is now compiled.
|
2005-07-12 15:51:55 +00:00
|
|
|
JR.state.getFunctionToStubMap(locked).erase(F);
|
2004-11-20 23:57:07 +00:00
|
|
|
|
|
|
|
// FIXME: We could rewrite all references to this stub if we knew them.
|
2005-07-28 12:44:13 +00:00
|
|
|
|
2005-07-30 18:33:25 +00:00
|
|
|
// What we will do is set the compiled function address to map to the
|
|
|
|
// same GOT entry as the stub so that later clients may update the GOT
|
2005-07-28 12:44:13 +00:00
|
|
|
// if they see it still using the stub address.
|
|
|
|
// Note: this is done so the Resolver doesn't have to manage GOT memory
|
|
|
|
// Do this without allocating map space if the target isn't using a GOT
|
|
|
|
if(JR.revGOTMap.find(Stub) != JR.revGOTMap.end())
|
|
|
|
JR.revGOTMap[Result] = JR.revGOTMap[Stub];
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-12-05 07:19:16 +00:00
|
|
|
// getPointerToFunctionOrStub - If the specified function has been
|
|
|
|
// code-gen'd, return a pointer to the function. If not, compile it, or use
|
|
|
|
// a stub to implement lazy compilation if available.
|
|
|
|
//
|
|
|
|
void *JIT::getPointerToFunctionOrStub(Function *F) {
|
|
|
|
// If we have already code generated the function, just return the address.
|
|
|
|
if (void *Addr = getPointerToGlobalIfAvailable(F))
|
|
|
|
return Addr;
|
|
|
|
|
|
|
|
// Get a stub if the target supports it
|
|
|
|
return getJITResolver(MCE).getFunctionStub(F);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2004-11-22 22:00:25 +00:00
|
|
|
// JITEmitter code.
|
2004-11-20 23:57:07 +00:00
|
|
|
//
|
2003-08-14 18:35:27 +00:00
|
|
|
namespace {
|
2004-11-22 22:00:25 +00:00
|
|
|
/// JITEmitter - The JIT implementation of the MachineCodeEmitter, which is
|
|
|
|
/// used to output functions to memory for execution.
|
|
|
|
class JITEmitter : public MachineCodeEmitter {
|
2003-08-14 18:35:27 +00:00
|
|
|
JITMemoryManager MemMgr;
|
|
|
|
|
2003-05-09 03:30:07 +00:00
|
|
|
// When outputting a function stub in the context of some other function, we
|
2006-05-02 18:27:26 +00:00
|
|
|
// save BufferBegin/BufferEnd/CurBufferPtr here.
|
|
|
|
unsigned char *SavedBufferBegin, *SavedBufferEnd, *SavedCurBufferPtr;
|
2003-06-01 23:24:36 +00:00
|
|
|
|
2004-11-20 03:46:14 +00:00
|
|
|
/// Relocations - These are the relocations that the function needs, as
|
|
|
|
/// emitted.
|
|
|
|
std::vector<MachineRelocation> Relocations;
|
2005-07-22 20:48:12 +00:00
|
|
|
|
2006-02-09 04:49:59 +00:00
|
|
|
/// ConstantPool - The constant pool for the current function.
|
|
|
|
///
|
|
|
|
MachineConstantPool *ConstantPool;
|
|
|
|
|
|
|
|
/// ConstantPoolBase - A pointer to the first entry in the constant pool.
|
|
|
|
///
|
|
|
|
void *ConstantPoolBase;
|
2006-04-22 18:53:45 +00:00
|
|
|
|
|
|
|
/// ConstantPool - The constant pool for the current function.
|
|
|
|
///
|
|
|
|
MachineJumpTableInfo *JumpTable;
|
|
|
|
|
|
|
|
/// JumpTableBase - A pointer to the first entry in the jump table.
|
|
|
|
///
|
|
|
|
void *JumpTableBase;
|
|
|
|
public:
|
2006-02-09 04:49:59 +00:00
|
|
|
JITEmitter(JIT &jit) : MemMgr(jit.getJITInfo().needsGOT()) {
|
2005-07-27 06:12:32 +00:00
|
|
|
TheJIT = &jit;
|
2006-05-02 21:44:14 +00:00
|
|
|
DEBUG(if (MemMgr.isManagingGOT()) std::cerr << "JIT is managing a GOT\n");
|
2005-07-22 20:48:12 +00:00
|
|
|
}
|
2002-12-24 00:01:05 +00:00
|
|
|
|
|
|
|
virtual void startFunction(MachineFunction &F);
|
2006-05-02 18:27:26 +00:00
|
|
|
virtual bool finishFunction(MachineFunction &F);
|
2006-05-02 23:22:24 +00:00
|
|
|
|
|
|
|
void emitConstantPool(MachineConstantPool *MCP);
|
|
|
|
void initJumpTableInfo(MachineJumpTableInfo *MJTI);
|
2006-04-22 18:53:45 +00:00
|
|
|
virtual void emitJumpTableInfo(MachineJumpTableInfo *MJTI,
|
2006-05-03 00:32:55 +00:00
|
|
|
std::vector<uint64_t> &MBBM);
|
2006-05-02 23:22:24 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
virtual void startFunctionStub(unsigned StubSize);
|
|
|
|
virtual void* finishFunctionStub(const Function *F);
|
2003-06-01 23:24:36 +00:00
|
|
|
|
2004-11-20 03:46:14 +00:00
|
|
|
virtual void addRelocation(const MachineRelocation &MR) {
|
|
|
|
Relocations.push_back(MR);
|
|
|
|
}
|
|
|
|
|
2003-06-01 23:24:36 +00:00
|
|
|
virtual uint64_t getConstantPoolEntryAddress(unsigned Entry);
|
2006-04-22 18:53:45 +00:00
|
|
|
virtual uint64_t getJumpTableEntryAddress(unsigned Entry);
|
2003-06-01 23:24:36 +00:00
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
private:
|
2004-11-21 03:37:42 +00:00
|
|
|
void *getPointerToGlobal(GlobalValue *GV, void *Reference, bool NoNeedStub);
|
2002-12-24 00:01:05 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2003-12-20 01:46:27 +00:00
|
|
|
MachineCodeEmitter *JIT::createEmitter(JIT &jit) {
|
2004-11-22 22:00:25 +00:00
|
|
|
return new JITEmitter(jit);
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
2004-11-22 22:00:25 +00:00
|
|
|
void *JITEmitter::getPointerToGlobal(GlobalValue *V, void *Reference,
|
|
|
|
bool DoesntNeedStub) {
|
2004-11-20 23:57:07 +00:00
|
|
|
if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
|
|
|
|
/// FIXME: If we straightened things out, this could actually emit the
|
|
|
|
/// global immediately instead of queuing it for codegen later!
|
|
|
|
return TheJIT->getOrEmitGlobalVariable(GV);
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we have already compiled the function, return a pointer to its body.
|
|
|
|
Function *F = cast<Function>(V);
|
|
|
|
void *ResultPtr = TheJIT->getPointerToGlobalIfAvailable(F);
|
|
|
|
if (ResultPtr) return ResultPtr;
|
|
|
|
|
2004-11-30 17:41:49 +00:00
|
|
|
if (F->hasExternalLinkage() && F->isExternal()) {
|
2004-11-20 23:57:07 +00:00
|
|
|
// If this is an external function pointer, we can force the JIT to
|
|
|
|
// 'compile' it, which really just adds it to the map.
|
2004-11-22 07:24:43 +00:00
|
|
|
if (DoesntNeedStub)
|
|
|
|
return TheJIT->getPointerToFunction(F);
|
|
|
|
|
|
|
|
return getJITResolver(this).getFunctionStub(F);
|
2004-11-20 23:57:07 +00:00
|
|
|
}
|
|
|
|
|
2004-11-21 03:37:42 +00:00
|
|
|
// Okay, the function has not been compiled yet, if the target callback
|
|
|
|
// mechanism is capable of rewriting the instruction directly, prefer to do
|
|
|
|
// that instead of emitting a stub.
|
|
|
|
if (DoesntNeedStub)
|
|
|
|
return getJITResolver(this).AddCallbackAtLocation(F, Reference);
|
|
|
|
|
2004-11-20 23:57:07 +00:00
|
|
|
// Otherwise, we have to emit a lazy resolving stub.
|
|
|
|
return getJITResolver(this).getFunctionStub(F);
|
|
|
|
}
|
|
|
|
|
2004-11-22 22:00:25 +00:00
|
|
|
void JITEmitter::startFunction(MachineFunction &F) {
|
2006-05-02 18:27:26 +00:00
|
|
|
BufferBegin = CurBufferPtr = MemMgr.startFunctionBody();
|
|
|
|
|
|
|
|
/// FIXME: implement out of space handling correctly!
|
|
|
|
BufferEnd = (unsigned char*)(intptr_t)~0ULL;
|
2006-05-02 23:22:24 +00:00
|
|
|
|
|
|
|
emitConstantPool(F.getConstantPool());
|
|
|
|
initJumpTableInfo(F.getJumpTableInfo());
|
|
|
|
|
|
|
|
// About to start emitting the machine code for the function.
|
2006-05-03 01:03:20 +00:00
|
|
|
emitAlignment(std::max(F.getFunction()->getAlignment(), 8U));
|
2006-05-02 23:22:24 +00:00
|
|
|
TheJIT->updateGlobalMapping(F.getFunction(), CurBufferPtr);
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
2006-05-02 18:27:26 +00:00
|
|
|
bool JITEmitter::finishFunction(MachineFunction &F) {
|
|
|
|
MemMgr.endFunctionBody(CurBufferPtr);
|
|
|
|
NumBytes += getCurrentPCOffset();
|
2002-12-24 00:01:05 +00:00
|
|
|
|
2004-11-20 03:46:14 +00:00
|
|
|
if (!Relocations.empty()) {
|
2005-07-20 16:29:20 +00:00
|
|
|
NumRelos += Relocations.size();
|
|
|
|
|
2004-11-20 03:46:14 +00:00
|
|
|
// Resolve the relocations to concrete pointers.
|
|
|
|
for (unsigned i = 0, e = Relocations.size(); i != e; ++i) {
|
|
|
|
MachineRelocation &MR = Relocations[i];
|
|
|
|
void *ResultPtr;
|
2005-04-18 01:44:27 +00:00
|
|
|
if (MR.isString()) {
|
2004-11-20 03:46:14 +00:00
|
|
|
ResultPtr = TheJIT->getPointerToNamedFunction(MR.getString());
|
2005-04-21 22:55:34 +00:00
|
|
|
|
2005-04-18 01:44:27 +00:00
|
|
|
// If the target REALLY wants a stub for this function, emit it now.
|
|
|
|
if (!MR.doesntNeedFunctionStub())
|
|
|
|
ResultPtr = getJITResolver(this).getExternalFunctionStub(ResultPtr);
|
2005-07-27 06:12:32 +00:00
|
|
|
} else if (MR.isGlobalValue())
|
2004-11-21 03:37:42 +00:00
|
|
|
ResultPtr = getPointerToGlobal(MR.getGlobalValue(),
|
2006-05-02 18:27:26 +00:00
|
|
|
BufferBegin+MR.getMachineCodeOffset(),
|
2004-11-21 03:37:42 +00:00
|
|
|
MR.doesntNeedFunctionStub());
|
2005-07-22 20:48:12 +00:00
|
|
|
else //ConstantPoolIndex
|
2005-07-27 06:12:32 +00:00
|
|
|
ResultPtr =
|
2005-07-25 23:42:58 +00:00
|
|
|
(void*)(intptr_t)getConstantPoolEntryAddress(MR.getConstantPoolIndex());
|
2005-07-27 06:12:32 +00:00
|
|
|
|
2004-11-20 03:46:14 +00:00
|
|
|
MR.setResultPointer(ResultPtr);
|
2005-07-22 20:48:12 +00:00
|
|
|
|
2005-07-28 12:44:13 +00:00
|
|
|
// if we are managing the GOT and the relocation wants an index,
|
|
|
|
// give it one
|
|
|
|
if (MemMgr.isManagingGOT() && !MR.isConstantPoolIndex() &&
|
|
|
|
MR.isGOTRelative()) {
|
|
|
|
unsigned idx = getJITResolver(this).getGOTIndexForAddr(ResultPtr);
|
|
|
|
MR.setGOTIndex(idx);
|
|
|
|
if (((void**)MemMgr.getGOTBase())[idx] != ResultPtr) {
|
|
|
|
DEBUG(std::cerr << "GOT was out of date for " << ResultPtr
|
2006-01-07 06:20:51 +00:00
|
|
|
<< " pointing at " << ((void**)MemMgr.getGOTBase())[idx]
|
|
|
|
<< "\n");
|
2005-07-28 12:44:13 +00:00
|
|
|
((void**)MemMgr.getGOTBase())[idx] = ResultPtr;
|
|
|
|
}
|
2005-07-22 20:48:12 +00:00
|
|
|
}
|
2004-11-20 03:46:14 +00:00
|
|
|
}
|
|
|
|
|
2006-05-02 18:27:26 +00:00
|
|
|
TheJIT->getJITInfo().relocate(BufferBegin, &Relocations[0],
|
2005-07-22 20:48:12 +00:00
|
|
|
Relocations.size(), MemMgr.getGOTBase());
|
2004-11-20 03:46:14 +00:00
|
|
|
}
|
|
|
|
|
2005-07-28 12:44:13 +00:00
|
|
|
//Update the GOT entry for F to point to the new code.
|
|
|
|
if(MemMgr.isManagingGOT()) {
|
2006-05-02 18:27:26 +00:00
|
|
|
unsigned idx = getJITResolver(this).getGOTIndexForAddr((void*)BufferBegin);
|
|
|
|
if (((void**)MemMgr.getGOTBase())[idx] != (void*)BufferBegin) {
|
|
|
|
DEBUG(std::cerr << "GOT was out of date for " << (void*)BufferBegin
|
2005-07-28 12:44:13 +00:00
|
|
|
<< " pointing at " << ((void**)MemMgr.getGOTBase())[idx] << "\n");
|
2006-05-02 18:27:26 +00:00
|
|
|
((void**)MemMgr.getGOTBase())[idx] = (void*)BufferBegin;
|
2005-07-28 12:44:13 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-02 18:27:26 +00:00
|
|
|
DEBUG(std::cerr << "JIT: Finished CodeGen of [" << (void*)BufferBegin
|
2003-06-06 06:52:35 +00:00
|
|
|
<< "] Function: " << F.getFunction()->getName()
|
2006-05-02 18:27:26 +00:00
|
|
|
<< ": " << getCurrentPCOffset() << " bytes of text, "
|
2004-11-20 03:46:14 +00:00
|
|
|
<< Relocations.size() << " relocations\n");
|
|
|
|
Relocations.clear();
|
2006-05-02 18:27:26 +00:00
|
|
|
return false;
|
2002-12-24 00:01:05 +00:00
|
|
|
}
|
|
|
|
|
2004-11-22 22:00:25 +00:00
|
|
|
void JITEmitter::emitConstantPool(MachineConstantPool *MCP) {
|
2006-02-09 04:22:52 +00:00
|
|
|
const std::vector<MachineConstantPoolEntry> &Constants = MCP->getConstants();
|
2003-11-30 04:23:21 +00:00
|
|
|
if (Constants.empty()) return;
|
|
|
|
|
2006-02-09 04:46:04 +00:00
|
|
|
unsigned Size = Constants.back().Offset;
|
|
|
|
Size += TheJIT->getTargetData().getTypeSize(Constants.back().Val->getType());
|
|
|
|
|
2006-05-02 23:22:24 +00:00
|
|
|
ConstantPoolBase = allocateSpace(Size, 1 << MCP->getConstantPoolAlignment());
|
2006-02-09 04:49:59 +00:00
|
|
|
ConstantPool = MCP;
|
2006-05-02 23:22:24 +00:00
|
|
|
|
|
|
|
if (ConstantPoolBase == 0) return; // Buffer overflow.
|
|
|
|
|
2006-02-09 04:49:59 +00:00
|
|
|
// Initialize the memory for all of the constant pool entries.
|
2006-02-09 04:46:04 +00:00
|
|
|
for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
|
2006-02-09 04:49:59 +00:00
|
|
|
void *CAddr = (char*)ConstantPoolBase+Constants[i].Offset;
|
2006-02-09 04:46:04 +00:00
|
|
|
TheJIT->InitializeMemory(Constants[i].Val, CAddr);
|
2003-01-13 01:00:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-22 18:53:45 +00:00
|
|
|
void JITEmitter::initJumpTableInfo(MachineJumpTableInfo *MJTI) {
|
|
|
|
const std::vector<MachineJumpTableEntry> &JT = MJTI->getJumpTables();
|
|
|
|
if (JT.empty()) return;
|
|
|
|
|
2006-05-02 23:22:24 +00:00
|
|
|
unsigned NumEntries = 0;
|
2006-04-22 18:53:45 +00:00
|
|
|
for (unsigned i = 0, e = JT.size(); i != e; ++i)
|
2006-05-02 23:22:24 +00:00
|
|
|
NumEntries += JT[i].MBBs.size();
|
|
|
|
|
|
|
|
unsigned EntrySize = MJTI->getEntrySize();
|
|
|
|
|
2006-04-22 18:53:45 +00:00
|
|
|
// Just allocate space for all the jump tables now. We will fix up the actual
|
|
|
|
// MBB entries in the tables after we emit the code for each block, since then
|
|
|
|
// we will know the final locations of the MBBs in memory.
|
|
|
|
JumpTable = MJTI;
|
2006-05-02 23:22:24 +00:00
|
|
|
JumpTableBase = allocateSpace(NumEntries * EntrySize, MJTI->getAlignment());
|
2006-04-22 18:53:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void JITEmitter::emitJumpTableInfo(MachineJumpTableInfo *MJTI,
|
2006-05-03 00:32:55 +00:00
|
|
|
std::vector<uint64_t> &MBBM) {
|
2006-04-22 18:53:45 +00:00
|
|
|
const std::vector<MachineJumpTableEntry> &JT = MJTI->getJumpTables();
|
2006-05-02 23:22:24 +00:00
|
|
|
if (JT.empty() || JumpTableBase == 0) return;
|
2006-04-22 18:53:45 +00:00
|
|
|
|
|
|
|
unsigned Offset = 0;
|
2006-05-03 00:13:06 +00:00
|
|
|
assert(MJTI->getEntrySize() == sizeof(void*) && "Cross JIT'ing?");
|
2006-04-22 18:53:45 +00:00
|
|
|
|
|
|
|
// For each jump table, map each target in the jump table to the address of
|
|
|
|
// an emitted MachineBasicBlock.
|
2006-05-03 00:13:06 +00:00
|
|
|
intptr_t *SlotPtr = (intptr_t*)JumpTableBase;
|
|
|
|
|
2006-04-22 18:53:45 +00:00
|
|
|
for (unsigned i = 0, e = JT.size(); i != e; ++i) {
|
|
|
|
const std::vector<MachineBasicBlock*> &MBBs = JT[i].MBBs;
|
2006-05-03 00:13:06 +00:00
|
|
|
// Store the address of the basic block for this jump table slot in the
|
|
|
|
// memory we allocated for the jump table in 'initJumpTableInfo'
|
|
|
|
for (unsigned mi = 0, me = MBBs.size(); mi != me; ++mi)
|
2006-05-03 00:32:55 +00:00
|
|
|
*SlotPtr++ = (intptr_t)MBBM[MBBs[mi]->getNumber()];
|
2006-04-22 18:53:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-11-22 22:00:25 +00:00
|
|
|
void JITEmitter::startFunctionStub(unsigned StubSize) {
|
2006-05-02 18:27:26 +00:00
|
|
|
SavedBufferBegin = BufferBegin;
|
|
|
|
SavedBufferEnd = BufferEnd;
|
|
|
|
SavedCurBufferPtr = CurBufferPtr;
|
|
|
|
|
|
|
|
BufferBegin = CurBufferPtr = MemMgr.allocateStub(StubSize);
|
|
|
|
BufferEnd = BufferBegin+StubSize+1;
|
2003-05-09 03:30:07 +00:00
|
|
|
}
|
|
|
|
|
2004-11-22 22:00:25 +00:00
|
|
|
void *JITEmitter::finishFunctionStub(const Function *F) {
|
2006-05-02 18:27:26 +00:00
|
|
|
NumBytes += getCurrentPCOffset();
|
|
|
|
std::swap(SavedBufferBegin, BufferBegin);
|
|
|
|
BufferEnd = SavedBufferEnd;
|
|
|
|
CurBufferPtr = SavedCurBufferPtr;
|
|
|
|
return SavedBufferBegin;
|
2003-06-01 23:24:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// getConstantPoolEntryAddress - Return the address of the 'ConstantNum' entry
|
|
|
|
// in the constant pool that was last emitted with the 'emitConstantPool'
|
|
|
|
// method.
|
|
|
|
//
|
2004-11-22 22:00:25 +00:00
|
|
|
uint64_t JITEmitter::getConstantPoolEntryAddress(unsigned ConstantNum) {
|
2006-02-09 04:49:59 +00:00
|
|
|
assert(ConstantNum < ConstantPool->getConstants().size() &&
|
2005-04-22 04:08:30 +00:00
|
|
|
"Invalid ConstantPoolIndex!");
|
2006-02-09 04:49:59 +00:00
|
|
|
return (intptr_t)ConstantPoolBase +
|
|
|
|
ConstantPool->getConstants()[ConstantNum].Offset;
|
2003-06-01 23:24:36 +00:00
|
|
|
}
|
|
|
|
|
2006-04-22 18:53:45 +00:00
|
|
|
// getJumpTableEntryAddress - Return the address of the JumpTable with index
|
|
|
|
// 'Index' in the jumpp table that was last initialized with 'initJumpTableInfo'
|
|
|
|
//
|
|
|
|
uint64_t JITEmitter::getJumpTableEntryAddress(unsigned Index) {
|
|
|
|
const std::vector<MachineJumpTableEntry> &JT = JumpTable->getJumpTables();
|
|
|
|
assert(Index < JT.size() && "Invalid jump table index!");
|
|
|
|
|
|
|
|
unsigned Offset = 0;
|
|
|
|
unsigned EntrySize = JumpTable->getEntrySize();
|
|
|
|
|
|
|
|
for (unsigned i = 0; i < Index; ++i)
|
|
|
|
Offset += JT[i].MBBs.size() * EntrySize;
|
|
|
|
|
2006-04-25 17:46:32 +00:00
|
|
|
return (intptr_t)((char *)JumpTableBase + Offset);
|
2006-04-22 18:53:45 +00:00
|
|
|
}
|
|
|
|
|
2003-07-28 19:09:06 +00:00
|
|
|
// getPointerToNamedFunction - This function is used as a global wrapper to
|
2003-12-20 01:46:27 +00:00
|
|
|
// JIT::getPointerToNamedFunction for the purpose of resolving symbols when
|
2003-07-28 19:09:06 +00:00
|
|
|
// bugpoint is debugging the JIT. In that scenario, we are loading an .so and
|
|
|
|
// need to resolve function(s) that are being mis-codegenerated, so we need to
|
|
|
|
// resolve their addresses at runtime, and this is the way to do it.
|
|
|
|
extern "C" {
|
|
|
|
void *getPointerToNamedFunction(const char *Name) {
|
2003-12-20 01:46:27 +00:00
|
|
|
Module &M = TheJIT->getModule();
|
2003-07-28 19:09:06 +00:00
|
|
|
if (Function *F = M.getNamedFunction(Name))
|
2003-12-20 01:46:27 +00:00
|
|
|
return TheJIT->getPointerToFunction(F);
|
|
|
|
return TheJIT->getPointerToNamedFunction(Name);
|
2003-07-28 19:09:06 +00:00
|
|
|
}
|
|
|
|
}
|