1 //===-- JITMemoryManager.cpp - Memory Allocator for JIT'd code ------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the DefaultJITMemoryManager class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/GlobalValue.h"
15 #include "llvm/ExecutionEngine/JITMemoryManager.h"
16 #include "llvm/Support/Compiler.h"
17 #include "llvm/System/Memory.h"
27 JITMemoryManager::~JITMemoryManager() {}
29 //===----------------------------------------------------------------------===//
30 // Memory Block Implementation.
31 //===----------------------------------------------------------------------===//
34 /// MemoryRangeHeader - For a range of memory, this is the header that we put
35 /// on the block of memory. It is carefully crafted to be one word of memory.
36 /// Allocated blocks have just this header, free'd blocks have FreeRangeHeader
37 /// which starts with this.
38 struct FreeRangeHeader;
39 struct MemoryRangeHeader {
40 /// ThisAllocated - This is true if this block is currently allocated. If
41 /// not, this can be converted to a FreeRangeHeader.
42 unsigned ThisAllocated : 1;
44 /// PrevAllocated - Keep track of whether the block immediately before us is
45 /// allocated. If not, the word immediately before this header is the size
46 /// of the previous block.
47 unsigned PrevAllocated : 1;
49 /// BlockSize - This is the size in bytes of this memory block,
50 /// including this header.
51 uintptr_t BlockSize : (sizeof(intptr_t)*8 - 2);
54 /// getBlockAfter - Return the memory block immediately after this one.
56 MemoryRangeHeader &getBlockAfter() const {
57 return *(MemoryRangeHeader*)((char*)this+BlockSize);
60 /// getFreeBlockBefore - If the block before this one is free, return it,
61 /// otherwise return null.
62 FreeRangeHeader *getFreeBlockBefore() const {
63 if (PrevAllocated) return 0;
64 intptr_t PrevSize = ((intptr_t *)this)[-1];
65 return (FreeRangeHeader*)((char*)this-PrevSize);
68 /// FreeBlock - Turn an allocated block into a free block, adjusting
69 /// bits in the object headers, and adding an end of region memory block.
70 FreeRangeHeader *FreeBlock(FreeRangeHeader *FreeList);
72 /// TrimAllocationToSize - If this allocated block is significantly larger
73 /// than NewSize, split it into two pieces (where the former is NewSize
74 /// bytes, including the header), and add the new block to the free list.
75 FreeRangeHeader *TrimAllocationToSize(FreeRangeHeader *FreeList,
79 /// FreeRangeHeader - For a memory block that isn't already allocated, this
80 /// keeps track of the current block and has a pointer to the next free block.
81 /// Free blocks are kept on a circularly linked list.
82 struct FreeRangeHeader : public MemoryRangeHeader {
83 FreeRangeHeader *Prev;
84 FreeRangeHeader *Next;
86 /// getMinBlockSize - Get the minimum size for a memory block. Blocks
87 /// smaller than this size cannot be created.
88 static unsigned getMinBlockSize() {
89 return sizeof(FreeRangeHeader)+sizeof(intptr_t);
92 /// SetEndOfBlockSizeMarker - The word at the end of every free block is
93 /// known to be the size of the free block. Set it for this block.
94 void SetEndOfBlockSizeMarker() {
95 void *EndOfBlock = (char*)this + BlockSize;
96 ((intptr_t *)EndOfBlock)[-1] = BlockSize;
99 FreeRangeHeader *RemoveFromFreeList() {
100 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
102 return Prev->Next = Next;
105 void AddToFreeList(FreeRangeHeader *FreeList) {
107 Prev = FreeList->Prev;
112 /// GrowBlock - The block after this block just got deallocated. Merge it
113 /// into the current block.
114 void GrowBlock(uintptr_t NewSize);
116 /// AllocateBlock - Mark this entire block allocated, updating freelists
117 /// etc. This returns a pointer to the circular free-list.
118 FreeRangeHeader *AllocateBlock();
123 /// AllocateBlock - Mark this entire block allocated, updating freelists
124 /// etc. This returns a pointer to the circular free-list.
125 FreeRangeHeader *FreeRangeHeader::AllocateBlock() {
126 assert(!ThisAllocated && !getBlockAfter().PrevAllocated &&
127 "Cannot allocate an allocated block!");
128 // Mark this block allocated.
130 getBlockAfter().PrevAllocated = 1;
132 // Remove it from the free list.
133 return RemoveFromFreeList();
136 /// FreeBlock - Turn an allocated block into a free block, adjusting
137 /// bits in the object headers, and adding an end of region memory block.
138 /// If possible, coalesce this block with neighboring blocks. Return the
139 /// FreeRangeHeader to allocate from.
140 FreeRangeHeader *MemoryRangeHeader::FreeBlock(FreeRangeHeader *FreeList) {
141 MemoryRangeHeader *FollowingBlock = &getBlockAfter();
142 assert(ThisAllocated && "This block is already allocated!");
143 assert(FollowingBlock->PrevAllocated && "Flags out of sync!");
145 FreeRangeHeader *FreeListToReturn = FreeList;
147 // If the block after this one is free, merge it into this block.
148 if (!FollowingBlock->ThisAllocated) {
149 FreeRangeHeader &FollowingFreeBlock = *(FreeRangeHeader *)FollowingBlock;
150 // "FreeList" always needs to be a valid free block. If we're about to
151 // coalesce with it, update our notion of what the free list is.
152 if (&FollowingFreeBlock == FreeList) {
153 FreeList = FollowingFreeBlock.Next;
154 FreeListToReturn = 0;
155 assert(&FollowingFreeBlock != FreeList && "No tombstone block?");
157 FollowingFreeBlock.RemoveFromFreeList();
159 // Include the following block into this one.
160 BlockSize += FollowingFreeBlock.BlockSize;
161 FollowingBlock = &FollowingFreeBlock.getBlockAfter();
163 // Tell the block after the block we are coalescing that this block is
165 FollowingBlock->PrevAllocated = 1;
168 assert(FollowingBlock->ThisAllocated && "Missed coalescing?");
170 if (FreeRangeHeader *PrevFreeBlock = getFreeBlockBefore()) {
171 PrevFreeBlock->GrowBlock(PrevFreeBlock->BlockSize + BlockSize);
172 return FreeListToReturn ? FreeListToReturn : PrevFreeBlock;
175 // Otherwise, mark this block free.
176 FreeRangeHeader &FreeBlock = *(FreeRangeHeader*)this;
177 FollowingBlock->PrevAllocated = 0;
178 FreeBlock.ThisAllocated = 0;
180 // Link this into the linked list of free blocks.
181 FreeBlock.AddToFreeList(FreeList);
183 // Add a marker at the end of the block, indicating the size of this free
185 FreeBlock.SetEndOfBlockSizeMarker();
186 return FreeListToReturn ? FreeListToReturn : &FreeBlock;
189 /// GrowBlock - The block after this block just got deallocated. Merge it
190 /// into the current block.
191 void FreeRangeHeader::GrowBlock(uintptr_t NewSize) {
192 assert(NewSize > BlockSize && "Not growing block?");
194 SetEndOfBlockSizeMarker();
195 getBlockAfter().PrevAllocated = 0;
198 /// TrimAllocationToSize - If this allocated block is significantly larger
199 /// than NewSize, split it into two pieces (where the former is NewSize
200 /// bytes, including the header), and add the new block to the free list.
201 FreeRangeHeader *MemoryRangeHeader::
202 TrimAllocationToSize(FreeRangeHeader *FreeList, uint64_t NewSize) {
203 assert(ThisAllocated && getBlockAfter().PrevAllocated &&
204 "Cannot deallocate part of an allocated block!");
206 // Don't allow blocks to be trimmed below minimum required size
207 NewSize = std::max<uint64_t>(FreeRangeHeader::getMinBlockSize(), NewSize);
209 // Round up size for alignment of header.
210 unsigned HeaderAlign = __alignof(FreeRangeHeader);
211 NewSize = (NewSize+ (HeaderAlign-1)) & ~(HeaderAlign-1);
213 // Size is now the size of the block we will remove from the start of the
215 assert(NewSize <= BlockSize &&
216 "Allocating more space from this block than exists!");
218 // If splitting this block will cause the remainder to be too small, do not
220 if (BlockSize <= NewSize+FreeRangeHeader::getMinBlockSize())
223 // Otherwise, we splice the required number of bytes out of this block, form
224 // a new block immediately after it, then mark this block allocated.
225 MemoryRangeHeader &FormerNextBlock = getBlockAfter();
227 // Change the size of this block.
230 // Get the new block we just sliced out and turn it into a free block.
231 FreeRangeHeader &NewNextBlock = (FreeRangeHeader &)getBlockAfter();
232 NewNextBlock.BlockSize = (char*)&FormerNextBlock - (char*)&NewNextBlock;
233 NewNextBlock.ThisAllocated = 0;
234 NewNextBlock.PrevAllocated = 1;
235 NewNextBlock.SetEndOfBlockSizeMarker();
236 FormerNextBlock.PrevAllocated = 0;
237 NewNextBlock.AddToFreeList(FreeList);
238 return &NewNextBlock;
241 //===----------------------------------------------------------------------===//
242 // Memory Block Implementation.
243 //===----------------------------------------------------------------------===//
246 /// DefaultJITMemoryManager - Manage memory for the JIT code generation.
247 /// This splits a large block of MAP_NORESERVE'd memory into two
248 /// sections, one for function stubs, one for the functions themselves. We
249 /// have to do this because we may need to emit a function stub while in the
250 /// middle of emitting a function, and we don't know how large the function we
252 class VISIBILITY_HIDDEN DefaultJITMemoryManager : public JITMemoryManager {
253 std::vector<sys::MemoryBlock> Blocks; // Memory blocks allocated by the JIT
254 FreeRangeHeader *FreeMemoryList; // Circular list of free blocks.
256 // When emitting code into a memory block, this is the block.
257 MemoryRangeHeader *CurBlock;
259 unsigned char *CurStubPtr, *StubBase;
260 unsigned char *GOTBase; // Target Specific reserved memory
261 void *DlsymTable; // Stub external symbol information
263 // Centralize memory block allocation.
264 sys::MemoryBlock getNewMemoryBlock(unsigned size);
266 std::map<const Function*, MemoryRangeHeader*> FunctionBlocks;
267 std::map<const Function*, MemoryRangeHeader*> TableBlocks;
269 DefaultJITMemoryManager();
270 ~DefaultJITMemoryManager();
273 void SetDlsymTable(void *);
275 unsigned char *allocateStub(const GlobalValue* F, unsigned StubSize,
278 /// startFunctionBody - When a function starts, allocate a block of free
279 /// executable memory, returning a pointer to it and its actual size.
280 unsigned char *startFunctionBody(const Function *F, uintptr_t &ActualSize) {
282 FreeRangeHeader* candidateBlock = FreeMemoryList;
283 FreeRangeHeader* head = FreeMemoryList;
284 FreeRangeHeader* iter = head->Next;
286 uintptr_t largest = candidateBlock->BlockSize;
288 // Search for the largest free block
289 while (iter != head) {
290 if (iter->BlockSize > largest) {
291 largest = iter->BlockSize;
292 candidateBlock = iter;
297 // Select this candidate block for allocation
298 CurBlock = candidateBlock;
300 // Allocate the entire memory block.
301 FreeMemoryList = candidateBlock->AllocateBlock();
302 ActualSize = CurBlock->BlockSize-sizeof(MemoryRangeHeader);
303 return (unsigned char *)(CurBlock+1);
306 /// endFunctionBody - The function F is now allocated, and takes the memory
307 /// in the range [FunctionStart,FunctionEnd).
308 void endFunctionBody(const Function *F, unsigned char *FunctionStart,
309 unsigned char *FunctionEnd) {
310 assert(FunctionEnd > FunctionStart);
311 assert(FunctionStart == (unsigned char *)(CurBlock+1) &&
312 "Mismatched function start/end!");
314 uintptr_t BlockSize = FunctionEnd - (unsigned char *)CurBlock;
315 FunctionBlocks[F] = CurBlock;
317 // Release the memory at the end of this block that isn't needed.
318 FreeMemoryList =CurBlock->TrimAllocationToSize(FreeMemoryList, BlockSize);
321 /// allocateSpace - Allocate a memory block of the given size.
322 unsigned char *allocateSpace(intptr_t Size, unsigned Alignment) {
323 CurBlock = FreeMemoryList;
324 FreeMemoryList = FreeMemoryList->AllocateBlock();
326 unsigned char *result = (unsigned char *)CurBlock+1;
328 if (Alignment == 0) Alignment = 1;
329 result = (unsigned char*)(((intptr_t)result+Alignment-1) &
330 ~(intptr_t)(Alignment-1));
332 uintptr_t BlockSize = result + Size - (unsigned char *)CurBlock;
333 FreeMemoryList =CurBlock->TrimAllocationToSize(FreeMemoryList, BlockSize);
338 /// startExceptionTable - Use startFunctionBody to allocate memory for the
339 /// function's exception table.
340 unsigned char* startExceptionTable(const Function* F,
341 uintptr_t &ActualSize) {
342 return startFunctionBody(F, ActualSize);
345 /// endExceptionTable - The exception table of F is now allocated,
346 /// and takes the memory in the range [TableStart,TableEnd).
347 void endExceptionTable(const Function *F, unsigned char *TableStart,
348 unsigned char *TableEnd,
349 unsigned char* FrameRegister) {
350 assert(TableEnd > TableStart);
351 assert(TableStart == (unsigned char *)(CurBlock+1) &&
352 "Mismatched table start/end!");
354 uintptr_t BlockSize = TableEnd - (unsigned char *)CurBlock;
355 TableBlocks[F] = CurBlock;
357 // Release the memory at the end of this block that isn't needed.
358 FreeMemoryList =CurBlock->TrimAllocationToSize(FreeMemoryList, BlockSize);
361 unsigned char *getGOTBase() const {
365 void *getDlsymTable() const {
369 /// deallocateMemForFunction - Deallocate all memory for the specified
371 void deallocateMemForFunction(const Function *F) {
372 std::map<const Function*, MemoryRangeHeader*>::iterator
373 I = FunctionBlocks.find(F);
374 if (I == FunctionBlocks.end()) return;
376 // Find the block that is allocated for this function.
377 MemoryRangeHeader *MemRange = I->second;
378 assert(MemRange->ThisAllocated && "Block isn't allocated!");
380 // Fill the buffer with garbage!
382 memset(MemRange+1, 0xCD, MemRange->BlockSize-sizeof(*MemRange));
386 FreeMemoryList = MemRange->FreeBlock(FreeMemoryList);
388 // Finally, remove this entry from FunctionBlocks.
389 FunctionBlocks.erase(I);
391 I = TableBlocks.find(F);
392 if (I == TableBlocks.end()) return;
394 // Find the block that is allocated for this function.
395 MemRange = I->second;
396 assert(MemRange->ThisAllocated && "Block isn't allocated!");
398 // Fill the buffer with garbage!
400 memset(MemRange+1, 0xCD, MemRange->BlockSize-sizeof(*MemRange));
404 FreeMemoryList = MemRange->FreeBlock(FreeMemoryList);
406 // Finally, remove this entry from TableBlocks.
407 TableBlocks.erase(I);
410 /// setMemoryWritable - When code generation is in progress,
411 /// the code pages may need permissions changed.
412 void setMemoryWritable(void)
414 for (unsigned i = 0, e = Blocks.size(); i != e; ++i)
415 sys::Memory::setWritable(Blocks[i]);
417 /// setMemoryExecutable - When code generation is done and we're ready to
418 /// start execution, the code pages may need permissions changed.
419 void setMemoryExecutable(void)
421 for (unsigned i = 0, e = Blocks.size(); i != e; ++i)
422 sys::Memory::setExecutable(Blocks[i]);
427 DefaultJITMemoryManager::DefaultJITMemoryManager() {
428 // Allocate a 16M block of memory for functions.
429 #if defined(__APPLE__) && defined(__arm__)
430 sys::MemoryBlock MemBlock = getNewMemoryBlock(4 << 20);
432 sys::MemoryBlock MemBlock = getNewMemoryBlock(16 << 20);
435 unsigned char *MemBase = static_cast<unsigned char*>(MemBlock.base());
437 // Allocate stubs backwards from the base, allocate functions forward
440 CurStubPtr = MemBase + 512*1024; // Use 512k for stubs, working backwards.
442 // We set up the memory chunk with 4 mem regions, like this:
444 // [ Free #0 ] -> Large space to allocate functions from.
445 // [ Allocated #1 ] -> Tiny space to separate regions.
446 // [ Free #2 ] -> Tiny space so there is always at least 1 free block.
447 // [ Allocated #3 ] -> Tiny space to prevent looking past end of block.
450 // The last three blocks are never deallocated or touched.
452 // Add MemoryRangeHeader to the end of the memory region, indicating that
453 // the space after the block of memory is allocated. This is block #3.
454 MemoryRangeHeader *Mem3 = (MemoryRangeHeader*)(MemBase+MemBlock.size())-1;
455 Mem3->ThisAllocated = 1;
456 Mem3->PrevAllocated = 0;
459 /// Add a tiny free region so that the free list always has one entry.
460 FreeRangeHeader *Mem2 =
461 (FreeRangeHeader *)(((char*)Mem3)-FreeRangeHeader::getMinBlockSize());
462 Mem2->ThisAllocated = 0;
463 Mem2->PrevAllocated = 1;
464 Mem2->BlockSize = FreeRangeHeader::getMinBlockSize();
465 Mem2->SetEndOfBlockSizeMarker();
466 Mem2->Prev = Mem2; // Mem2 *is* the free list for now.
469 /// Add a tiny allocated region so that Mem2 is never coalesced away.
470 MemoryRangeHeader *Mem1 = (MemoryRangeHeader*)Mem2-1;
471 Mem1->ThisAllocated = 1;
472 Mem1->PrevAllocated = 0;
473 Mem1->BlockSize = (char*)Mem2 - (char*)Mem1;
475 // Add a FreeRangeHeader to the start of the function body region, indicating
476 // that the space is free. Mark the previous block allocated so we never look
478 FreeRangeHeader *Mem0 = (FreeRangeHeader*)CurStubPtr;
479 Mem0->ThisAllocated = 0;
480 Mem0->PrevAllocated = 1;
481 Mem0->BlockSize = (char*)Mem1-(char*)Mem0;
482 Mem0->SetEndOfBlockSizeMarker();
483 Mem0->AddToFreeList(Mem2);
485 // Start out with the freelist pointing to Mem0.
486 FreeMemoryList = Mem0;
492 void DefaultJITMemoryManager::AllocateGOT() {
493 assert(GOTBase == 0 && "Cannot allocate the got multiple times");
494 GOTBase = new unsigned char[sizeof(void*) * 8192];
498 void DefaultJITMemoryManager::SetDlsymTable(void *ptr) {
502 DefaultJITMemoryManager::~DefaultJITMemoryManager() {
503 for (unsigned i = 0, e = Blocks.size(); i != e; ++i)
504 sys::Memory::ReleaseRWX(Blocks[i]);
510 unsigned char *DefaultJITMemoryManager::allocateStub(const GlobalValue* F,
512 unsigned Alignment) {
513 CurStubPtr -= StubSize;
514 CurStubPtr = (unsigned char*)(((intptr_t)CurStubPtr) &
515 ~(intptr_t)(Alignment-1));
516 if (CurStubPtr < StubBase) {
517 // FIXME: allocate a new block
518 fprintf(stderr, "JIT ran out of memory for function stubs!\n");
524 sys::MemoryBlock DefaultJITMemoryManager::getNewMemoryBlock(unsigned size) {
525 // Allocate a new block close to the last one.
526 const sys::MemoryBlock *BOld = Blocks.empty() ? 0 : &Blocks.front();
528 sys::MemoryBlock B = sys::Memory::AllocateRWX(size, BOld, &ErrMsg);
531 "Allocation failed when allocating new memory in the JIT\n%s\n",
540 JITMemoryManager *JITMemoryManager::CreateDefaultMemManager() {
541 return new DefaultJITMemoryManager();