dvander@10: /* ======== SourceHook ======== ds@294: * Copyright (C) 2004-2007 Metamod:Source Development Team pavolmarko@1: * No warranties of any kind pavolmarko@1: * dvander@10: * License: zlib/libpng pavolmarko@1: * dvander@10: * Author(s): Pavol "PM OnoTo" Marko, Scott "Damaged Soul" Ehlert dvander@10: * Contributors: lancevorgin, XAD, theqizmo pavolmarko@1: * ============================ pavolmarko@1: */ pavolmarko@1: pavolmarko@1: #ifndef __SHINT_MEMORY_H__ pavolmarko@1: #define __SHINT_MEMORY_H__ pavolmarko@1: pavolmarko@1: // Feb 17 / 2005: pavolmarko@1: // Unprotect now sets to readwrite pavolmarko@1: // The vtable doesn't need to be executable anyway pavolmarko@1: pavolmarko@1: # if /********/ defined _WIN32 pavolmarko@1: # include pavolmarko@1: # define SH_MEM_READ 1 pavolmarko@1: # define SH_MEM_WRITE 2 pavolmarko@1: # define SH_MEM_EXEC 4 pavolmarko@1: # elif /******/ defined __linux__ pavolmarko@1: # include pavolmarko@117: # include pavolmarko@442: namespace LinuxSignal pavolmarko@442: { pavolmarko@117: # include pavolmarko@442: } pavolmarko@117: # include pavolmarko@1: // http://www.die.net/doc/linux/man/man2/mprotect.2.html pavolmarko@1: # include pavolmarko@1: # ifndef PAGESIZE pavolmarko@1: # define PAGESIZE 4096 pavolmarko@1: # endif pavolmarko@1: # define SH_MEM_READ PROT_READ pavolmarko@1: # define SH_MEM_WRITE PROT_WRITE pavolmarko@1: # define SH_MEM_EXEC PROT_EXEC pavolmarko@1: pavolmarko@1: // We need to align addr down to pagesize on linux pavolmarko@1: // We assume PAGESIZE is a power of two pavolmarko@61: # define SH_LALIGN(x) (void*)((intptr_t)(x) & ~(PAGESIZE-1)) pavolmarko@61: # define SH_LALDIF(x) ((intptr_t)(x) & (PAGESIZE-1)) pavolmarko@1: # else pavolmarko@1: # error Unsupported OS/Compiler pavolmarko@1: # endif pavolmarko@1: pavolmarko@435: #include "sh_list.h" pavolmarko@1: pavolmarko@1: namespace SourceHook pavolmarko@1: { pavolmarko@1: inline bool SetMemAccess(void *addr, size_t len, int access) pavolmarko@1: { pavolmarko@1: # ifdef __linux__ pavolmarko@50: return mprotect(SH_LALIGN(addr), len + SH_LALDIF(addr), access)==0 ? true : false; pavolmarko@1: # else pavolmarko@1: DWORD tmp; pavolmarko@1: DWORD prot; pavolmarko@1: switch (access) pavolmarko@1: { pavolmarko@1: case SH_MEM_READ: pavolmarko@1: prot = PAGE_READONLY; break; pavolmarko@1: case SH_MEM_READ | SH_MEM_WRITE: pavolmarko@1: prot = PAGE_READWRITE; break; pavolmarko@1: case SH_MEM_READ | SH_MEM_EXEC: pavolmarko@1: prot = PAGE_EXECUTE_READ; break; pavolmarko@1: default: pavolmarko@1: case SH_MEM_READ | SH_MEM_WRITE | SH_MEM_EXEC: pavolmarko@1: prot = PAGE_EXECUTE_READWRITE; break; pavolmarko@1: } pavolmarko@1: return VirtualProtect(addr, len, prot, &tmp) ? true : false; pavolmarko@1: # endif pavolmarko@1: } pavolmarko@1: pavolmarko@117: #ifdef __linux__ pavolmarko@117: namespace pavolmarko@117: { pavolmarko@117: bool g_BadReadCalled; pavolmarko@117: jmp_buf g_BadReadJmpBuf; pavolmarko@117: pavolmarko@117: static void BadReadHandler(int sig) pavolmarko@117: { pavolmarko@117: if (g_BadReadCalled) pavolmarko@117: longjmp(g_BadReadJmpBuf, 1); pavolmarko@117: } pavolmarko@117: } pavolmarko@117: #endif pavolmarko@117: pavolmarko@117: /** pavolmarko@117: * @brief Checks whether the specified memory region is (still) accessible pavolmarko@117: * pavolmarko@117: * @param addr The lower boundary pavolmarko@117: * @param len Length of the region to be checked pavolmarko@117: */ pavolmarko@117: namespace pavolmarko@117: { pavolmarko@117: bool ModuleInMemory(char *addr, size_t len) pavolmarko@117: { pavolmarko@117: #ifdef __linux__ pavolmarko@117: // On linux, first check /proc/self/maps pavolmarko@117: long lower = reinterpret_cast(addr); pavolmarko@117: long upper = lower + len; pavolmarko@117: pavolmarko@117: FILE *pF = fopen("/proc/self/maps", "r"); pavolmarko@117: if (pF) pavolmarko@117: { pavolmarko@117: // Linux /proc/self/maps -> parse pavolmarko@117: // Format: pavolmarko@117: // lower upper prot stuff path pavolmarko@117: // 08048000-0804c000 r-xp 00000000 03:03 1010107 /bin/cat pavolmarko@117: long rlower, rupper; pavolmarko@117: while (fscanf(pF, "%lx-%lx", &rlower, &rupper) != EOF) pavolmarko@117: { pavolmarko@117: // Check whether we're IN THERE! pavolmarko@117: if (lower >= rlower && upper <= rupper) pavolmarko@117: { pavolmarko@117: fclose(pF); pavolmarko@117: return true; pavolmarko@117: } pavolmarko@117: // Read to end of line pavolmarko@117: int c; pavolmarko@117: while ((c = fgetc(pF)) != '\n') pavolmarko@117: { pavolmarko@117: if (c == EOF) pavolmarko@117: break; pavolmarko@117: } pavolmarko@117: if (c == EOF) pavolmarko@117: break; pavolmarko@117: } pavolmarko@117: fclose(pF); pavolmarko@117: return false; pavolmarko@117: } pavolmarko@117: pF = fopen("/proc/curproc/map", "r"); pavolmarko@117: if (pF) pavolmarko@117: { pavolmarko@117: // FreeBSD /proc/curproc/map -> parse pavolmarko@117: // 0x804800 0x805500 13 15 0xc6e18960 r-x 21 0x0 COW NC vnode pavolmarko@117: long rlower, rupper; pavolmarko@117: while (fscanf(pF, "0x%lx 0x%lx", &rlower, &rupper) != EOF) pavolmarko@117: { pavolmarko@117: // Check whether we're IN THERE! pavolmarko@117: if (lower >= rlower && upper <= rupper) pavolmarko@117: { pavolmarko@117: fclose(pF); pavolmarko@117: return true; pavolmarko@117: } pavolmarko@117: // Read to end of line pavolmarko@117: int c; pavolmarko@117: while ((c = fgetc(pF)) != '\n') pavolmarko@117: { pavolmarko@117: if (c == EOF) pavolmarko@117: break; pavolmarko@117: } pavolmarko@117: if (c == EOF) pavolmarko@117: break; pavolmarko@117: } pavolmarko@117: fclose(pF); pavolmarko@117: return false; pavolmarko@117: } pavolmarko@117: pavolmarko@117: // Both of the above failed, try to actually read and trap sigsegv (implemented by Damaged Soul) pavolmarko@117: void(*prevHandler)(int sig); pavolmarko@117: g_BadReadCalled = true; pavolmarko@117: pavolmarko@117: if (setjmp(g_BadReadJmpBuf)) pavolmarko@117: return true; pavolmarko@117: pavolmarko@442: prevHandler = LinuxSignal::signal(SIGSEGV, BadReadHandler); pavolmarko@117: pavolmarko@117: volatile const char *p = reinterpret_cast(addr); pavolmarko@117: char dummy; pavolmarko@117: pavolmarko@117: for (size_t i = 0; i < len; i++) pavolmarko@117: dummy = p[i]; pavolmarko@117: pavolmarko@117: g_BadReadCalled = false; pavolmarko@117: pavolmarko@442: LinuxSignal::signal(SIGSEGV, prevHandler); pavolmarko@117: pavolmarko@117: return false; pavolmarko@117: #else pavolmarko@117: // On Win32, simply use IsBadReadPtr pavolmarko@117: return !IsBadReadPtr(addr, len); pavolmarko@117: #endif pavolmarko@117: } pavolmarko@117: } pavolmarko@435: pavolmarko@435: /* pavolmarko@435: Class which lets us allocate memory regions in special pages only meant for on the fly code generation. pavolmarko@435: pavolmarko@435: If we alloc with malloc and then set the page access type to read/exec only, other regions returned by pavolmarko@435: malloc that are in the same page would lose their write access as well and the process could crash. pavolmarko@435: pavolmarko@435: Allocating one page per code generation session is usually a waste of memory and on some plattforms also pavolmarko@435: a waste of virtual address space (Windows’ VirtualAlloc has a granularity of 64K). pavolmarko@435: pavolmarko@435: pavolmarko@435: IMPORTANT: the memory that Alloc() returns is not a in a defined state! pavolmarko@435: It could be in read+exec OR read+write mode. pavolmarko@435: -> call SetRE() or SetRW() before using allocated memory! pavolmarko@435: */ pavolmarko@435: class CPageAlloc pavolmarko@435: { pavolmarko@435: struct AllocationUnit pavolmarko@435: { pavolmarko@435: size_t begin_offset; pavolmarko@435: size_t size; pavolmarko@435: pavolmarko@435: AllocationUnit(size_t p_offs, size_t p_size) : begin_offset(p_offs), size(p_size) pavolmarko@435: { pavolmarko@435: } pavolmarko@435: pavolmarko@435: bool operator < (const AllocationUnit &other) const pavolmarko@435: { pavolmarko@435: return begin_offset < other.begin_offset; pavolmarko@435: } pavolmarko@435: }; pavolmarko@435: pavolmarko@435: typedef List AUList; pavolmarko@435: pavolmarko@435: struct AllocatedRegion pavolmarko@435: { pavolmarko@435: void *startPtr; pavolmarko@435: size_t size; pavolmarko@435: bool isolated; // may contain only one AU pavolmarko@435: AUList allocUnits; pavolmarko@435: pavolmarko@435: bool TryAlloc(size_t reqsize, void * &outAddr) pavolmarko@435: { pavolmarko@435: // Check for isolated pavolmarko@435: if (isolated && !allocUnits.empty()) pavolmarko@435: return false; pavolmarko@435: pavolmarko@435: // Find the smallest gap where req fits pavolmarko@435: size_t lastend = 0; pavolmarko@435: size_t smallestgap_pos = size + 1; pavolmarko@435: size_t smallestgap_size = size + 1; pavolmarko@435: pavolmarko@435: for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter) pavolmarko@435: { pavolmarko@435: if (iter->begin_offset - lastend >= reqsize) pavolmarko@435: { pavolmarko@435: if (iter->begin_offset - lastend < smallestgap_size) pavolmarko@435: { pavolmarko@435: smallestgap_size = iter->begin_offset - lastend; pavolmarko@435: smallestgap_pos = lastend; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: lastend = iter->begin_offset + iter->size; pavolmarko@435: } pavolmarko@435: pavolmarko@435: if (size - lastend >= reqsize) pavolmarko@435: { pavolmarko@435: if (size - lastend < smallestgap_size) pavolmarko@435: { pavolmarko@435: smallestgap_size = size - lastend; pavolmarko@435: smallestgap_pos = lastend; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: if (smallestgap_pos < size) pavolmarko@435: { pavolmarko@435: outAddr = reinterpret_cast(reinterpret_cast(startPtr) + smallestgap_pos); pavolmarko@435: allocUnits.push_sorted( AllocationUnit(smallestgap_pos, reqsize) ); pavolmarko@435: return true; pavolmarko@435: } pavolmarko@435: else pavolmarko@435: { pavolmarko@435: return false; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: bool TryFree(void *addr) pavolmarko@435: { pavolmarko@435: if (addr < startPtr || addr >= reinterpret_cast(reinterpret_cast(startPtr) + size)) pavolmarko@435: return false; pavolmarko@435: pavolmarko@435: size_t offs = reinterpret_cast(addr) - reinterpret_cast(startPtr); pavolmarko@435: pavolmarko@435: for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter) pavolmarko@435: { pavolmarko@435: if (iter->begin_offset == offs) pavolmarko@435: { pavolmarko@435: allocUnits.erase(iter); pavolmarko@435: return true; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: return false; pavolmarko@435: } pavolmarko@435: pavolmarko@435: bool Contains(void *addr) pavolmarko@435: { pavolmarko@435: return addr >= startPtr && addr < reinterpret_cast(reinterpret_cast(startPtr) + size); pavolmarko@435: } pavolmarko@435: pavolmarko@435: void FreeRegion() pavolmarko@435: { pavolmarko@435: #ifdef __linux__ pavolmarko@435: munmap(startPtr, size); pavolmarko@435: #else pavolmarko@435: VirtualFree(startPtr, 0, MEM_RELEASE); pavolmarko@435: #endif pavolmarko@435: } pavolmarko@435: }; pavolmarko@435: pavolmarko@435: typedef List ARList; pavolmarko@435: pavolmarko@435: size_t m_PageSize; pavolmarko@435: ARList m_Regions; pavolmarko@435: pavolmarko@435: bool AddRegion(size_t minSize, bool isolated) pavolmarko@435: { pavolmarko@435: AllocatedRegion newRegion; pavolmarko@435: newRegion.startPtr = 0; pavolmarko@435: newRegion.isolated = isolated; pavolmarko@435: pavolmarko@435: // Compute real size -> align up to m_PageSize boundary pavolmarko@435: pavolmarko@435: newRegion.size = minSize - (minSize % m_PageSize); pavolmarko@435: if (newRegion.size < minSize) pavolmarko@435: newRegion.size += m_PageSize; pavolmarko@435: pavolmarko@435: #ifdef __linux__ pavolmarko@442: newRegion.startPtr = mmap(0, newRegion.size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); pavolmarko@435: #else pavolmarko@435: newRegion.startPtr = VirtualAlloc(NULL, newRegion.size, MEM_COMMIT, PAGE_READWRITE); pavolmarko@435: #endif pavolmarko@435: pavolmarko@435: if (newRegion.startPtr) pavolmarko@435: { pavolmarko@435: m_Regions.push_back(newRegion); pavolmarko@435: return true; pavolmarko@435: } pavolmarko@435: else pavolmarko@435: { pavolmarko@435: return false; pavolmarko@435: } pavolmarko@435: pavolmarko@435: } pavolmarko@435: pavolmarko@435: void *AllocPriv(size_t size, bool isolated) pavolmarko@435: { pavolmarko@435: void *addr; pavolmarko@435: pavolmarko@435: if (!isolated) pavolmarko@435: { pavolmarko@435: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@435: { pavolmarko@435: if (iter->TryAlloc(size, addr)) pavolmarko@435: return addr; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: if (!AddRegion(size, isolated)) pavolmarko@435: return NULL; pavolmarko@435: pavolmarko@435: bool tmp = m_Regions.back().TryAlloc(size, addr); pavolmarko@435: SH_ASSERT(tmp, ("TryAlloc fails after AddRegion")); pavolmarko@435: return addr; pavolmarko@435: } pavolmarko@435: pavolmarko@435: public: pavolmarko@435: CPageAlloc() pavolmarko@435: { pavolmarko@435: #ifdef __linux__ pavolmarko@435: m_PageSize = sysconf(_SC_PAGESIZE); pavolmarko@435: #else pavolmarko@435: SYSTEM_INFO sysInfo; pavolmarko@435: GetSystemInfo(&sysInfo); pavolmarko@435: m_PageSize = sysInfo.dwPageSize; pavolmarko@435: #endif pavolmarko@435: } pavolmarko@435: pavolmarko@435: ~CPageAlloc() pavolmarko@435: { pavolmarko@435: // Free all regions pavolmarko@435: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@435: { pavolmarko@435: iter->FreeRegion(); pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: void *Alloc(size_t size) pavolmarko@435: { pavolmarko@435: return AllocPriv(size, false); pavolmarko@435: } pavolmarko@435: pavolmarko@435: void *AllocIsolated(size_t size) pavolmarko@435: { pavolmarko@435: return AllocPriv(size, true); pavolmarko@435: } pavolmarko@435: pavolmarko@435: void Free(void *ptr) pavolmarko@435: { pavolmarko@435: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@435: { pavolmarko@435: if (iter->TryFree(ptr)) pavolmarko@435: { pavolmarko@435: if (iter->allocUnits.empty()) pavolmarko@435: { pavolmarko@435: iter->FreeRegion(); pavolmarko@435: m_Regions.erase(iter); pavolmarko@435: } pavolmarko@435: break; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: void SetRE(void *ptr) pavolmarko@435: { pavolmarko@435: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@435: { pavolmarko@435: if (iter->Contains(ptr)) pavolmarko@435: { pavolmarko@435: SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_EXEC); pavolmarko@435: break; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: void SetRW(void *ptr) pavolmarko@435: { pavolmarko@435: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@435: { pavolmarko@435: if (iter->Contains(ptr)) pavolmarko@435: { pavolmarko@435: SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_WRITE); pavolmarko@435: break; pavolmarko@435: } pavolmarko@435: } pavolmarko@435: } pavolmarko@435: pavolmarko@435: size_t GetPageSize() pavolmarko@435: { pavolmarko@435: return m_PageSize; pavolmarko@435: } pavolmarko@435: }; pavolmarko@1: } pavolmarko@1: dvander@34: #endif