/************************************************************************** * * Copyright (C) 1999-2005 Brian Paul All Rights Reserved. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included * in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR * OTHER DEALINGS IN THE SOFTWARE. * **************************************************************************/ /** * \file exemem.c * Functions for allocating executable memory. * * \author Keith Whitwell */ #include "pipe/p_compiler.h" #include "util/u_debug.h" #include "os/os_thread.h" #include "util/u_memory.h" #include "rtasm_execmem.h" #if defined(PIPE_OS_BSD) #define MAP_ANONYMOUS MAP_ANON #endif #if defined(PIPE_OS_WINDOWS) #ifndef WIN32_LEAN_AND_MEAN #define WIN32_LEAN_AND_MEAN 1 #endif #include #endif #if defined(PIPE_OS_LINUX) || defined(PIPE_OS_BSD) || defined(PIPE_OS_SOLARIS) || defined(PIPE_OS_HAIKU) || defined(PIPE_OS_CYGWIN) /* * Allocate a large block of memory which can hold code then dole it out * in pieces by means of the generic memory manager code. */ #include #include #include "util/u_mm.h" #define EXEC_HEAP_SIZE (10*1024*1024) pipe_static_mutex(exec_mutex); static struct mem_block *exec_heap = NULL; static unsigned char *exec_mem = NULL; static void init_heap(void) { if (!exec_heap) exec_heap = u_mmInit( 0, EXEC_HEAP_SIZE ); if (!exec_mem) exec_mem = (unsigned char *) mmap(0, EXEC_HEAP_SIZE, PROT_EXEC | PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); } void * rtasm_exec_malloc(size_t size) { struct mem_block *block = NULL; void *addr = NULL; pipe_mutex_lock(exec_mutex); init_heap(); if (exec_heap) { size = (size + 31) & ~31; /* next multiple of 32 bytes */ block = u_mmAllocMem( exec_heap, size, 5, 0 ); /* 5 -> 32-byte alignment */ } if (block) addr = exec_mem + block->ofs; else debug_printf("rtasm_exec_malloc failed\n"); pipe_mutex_unlock(exec_mutex); return addr; } void rtasm_exec_free(void *addr) { pipe_mutex_lock(exec_mutex); if (exec_heap) { struct mem_block *block = u_mmFindBlock(exec_heap, (unsigned char *)addr - exec_mem); if (block) u_mmFreeMem(block); } pipe_mutex_unlock(exec_mutex); } #elif defined(PIPE_OS_WINDOWS) /* * Avoid Data Execution Prevention. */ void * rtasm_exec_malloc(size_t size) { return VirtualAlloc(NULL, size, MEM_COMMIT, PAGE_EXECUTE_READWRITE); } void rtasm_exec_free(void *addr) { VirtualFree(addr, 0, MEM_RELEASE); } #else /* * Just use regular memory. */ void * rtasm_exec_malloc(size_t size) { return MALLOC( size ); } void rtasm_exec_free(void *addr) { FREE(addr); } #endif