pavolmarko@445: #ifndef __SH_PAGEALLOC_H__ pavolmarko@445: #define __SH_PAGEALLOC_H__ pavolmarko@445: pavolmarko@445: # if /********/ defined _WIN32 pavolmarko@445: # include pavolmarko@445: # elif /******/ defined __linux__ pavolmarko@445: # include pavolmarko@445: # include pavolmarko@445: # else pavolmarko@445: # error Unsupported OS/Compiler pavolmarko@445: # endif pavolmarko@445: pavolmarko@445: pavolmarko@445: namespace SourceHook pavolmarko@445: { pavolmarko@445: pavolmarko@445: /* pavolmarko@445: Class which lets us allocate memory regions in special pages only meant for on the fly code generation. pavolmarko@445: pavolmarko@445: If we alloc with malloc and then set the page access type to read/exec only, other regions returned by pavolmarko@445: malloc that are in the same page would lose their write access as well and the process could crash. pavolmarko@445: pavolmarko@452: Allocating one page per code generation session is usually a waste of memory and on some platforms also pavolmarko@445: a waste of virtual address space (Windows’ VirtualAlloc has a granularity of 64K). pavolmarko@445: pavolmarko@445: pavolmarko@445: IMPORTANT: the memory that Alloc() returns is not a in a defined state! pavolmarko@445: It could be in read+exec OR read+write mode. pavolmarko@445: -> call SetRE() or SetRW() before using allocated memory! pavolmarko@445: */ pavolmarko@445: class CPageAlloc pavolmarko@445: { pavolmarko@445: struct AllocationUnit pavolmarko@445: { pavolmarko@445: size_t begin_offset; pavolmarko@445: size_t size; pavolmarko@445: pavolmarko@445: AllocationUnit(size_t p_offs, size_t p_size) : begin_offset(p_offs), size(p_size) pavolmarko@445: { pavolmarko@445: } pavolmarko@445: pavolmarko@445: bool operator < (const AllocationUnit &other) const pavolmarko@445: { pavolmarko@445: return begin_offset < other.begin_offset; pavolmarko@445: } pavolmarko@445: }; pavolmarko@445: pavolmarko@445: typedef List AUList; pavolmarko@445: pavolmarko@445: struct AllocatedRegion pavolmarko@445: { pavolmarko@445: void *startPtr; pavolmarko@445: size_t size; pavolmarko@445: bool isolated; // may contain only one AU pavolmarko@445: AUList allocUnits; pavolmarko@445: pavolmarko@445: bool TryAlloc(size_t reqsize, void * &outAddr) pavolmarko@445: { pavolmarko@445: // Check for isolated pavolmarko@445: if (isolated && !allocUnits.empty()) pavolmarko@445: return false; pavolmarko@445: pavolmarko@445: // Find the smallest gap where req fits pavolmarko@445: size_t lastend = 0; pavolmarko@445: size_t smallestgap_pos = size + 1; pavolmarko@445: size_t smallestgap_size = size + 1; pavolmarko@445: pavolmarko@445: for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter) pavolmarko@445: { pavolmarko@445: if (iter->begin_offset - lastend >= reqsize) pavolmarko@445: { pavolmarko@445: if (iter->begin_offset - lastend < smallestgap_size) pavolmarko@445: { pavolmarko@445: smallestgap_size = iter->begin_offset - lastend; pavolmarko@445: smallestgap_pos = lastend; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: lastend = iter->begin_offset + iter->size; pavolmarko@445: } pavolmarko@445: pavolmarko@445: if (size - lastend >= reqsize) pavolmarko@445: { pavolmarko@445: if (size - lastend < smallestgap_size) pavolmarko@445: { pavolmarko@445: smallestgap_size = size - lastend; pavolmarko@445: smallestgap_pos = lastend; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: if (smallestgap_pos < size) pavolmarko@445: { pavolmarko@445: outAddr = reinterpret_cast(reinterpret_cast(startPtr) + smallestgap_pos); pavolmarko@445: allocUnits.push_sorted( AllocationUnit(smallestgap_pos, reqsize) ); pavolmarko@445: return true; pavolmarko@445: } pavolmarko@445: else pavolmarko@445: { pavolmarko@445: return false; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: bool TryFree(void *addr) pavolmarko@445: { pavolmarko@445: if (addr < startPtr || addr >= reinterpret_cast(reinterpret_cast(startPtr) + size)) pavolmarko@445: return false; pavolmarko@445: pavolmarko@445: size_t offs = reinterpret_cast(addr) - reinterpret_cast(startPtr); pavolmarko@445: pavolmarko@445: for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter) pavolmarko@445: { pavolmarko@445: if (iter->begin_offset == offs) pavolmarko@445: { pavolmarko@445: allocUnits.erase(iter); pavolmarko@445: return true; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: return false; pavolmarko@445: } pavolmarko@445: pavolmarko@445: bool Contains(void *addr) pavolmarko@445: { pavolmarko@445: return addr >= startPtr && addr < reinterpret_cast(reinterpret_cast(startPtr) + size); pavolmarko@445: } pavolmarko@445: pavolmarko@445: void FreeRegion() pavolmarko@445: { pavolmarko@445: #ifdef __linux__ pavolmarko@445: munmap(startPtr, size); pavolmarko@445: #else pavolmarko@445: VirtualFree(startPtr, 0, MEM_RELEASE); pavolmarko@445: #endif pavolmarko@445: } pavolmarko@445: }; pavolmarko@445: pavolmarko@445: typedef List ARList; pavolmarko@445: pavolmarko@445: size_t m_PageSize; pavolmarko@445: ARList m_Regions; pavolmarko@445: pavolmarko@445: bool AddRegion(size_t minSize, bool isolated) pavolmarko@445: { pavolmarko@445: AllocatedRegion newRegion; pavolmarko@445: newRegion.startPtr = 0; pavolmarko@445: newRegion.isolated = isolated; pavolmarko@445: pavolmarko@445: // Compute real size -> align up to m_PageSize boundary pavolmarko@445: pavolmarko@445: newRegion.size = minSize - (minSize % m_PageSize); pavolmarko@445: if (newRegion.size < minSize) pavolmarko@445: newRegion.size += m_PageSize; pavolmarko@445: pavolmarko@445: #ifdef __linux__ pavolmarko@445: newRegion.startPtr = mmap(0, newRegion.size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); pavolmarko@445: #else pavolmarko@445: newRegion.startPtr = VirtualAlloc(NULL, newRegion.size, MEM_COMMIT, PAGE_READWRITE); pavolmarko@445: #endif pavolmarko@445: pavolmarko@445: if (newRegion.startPtr) pavolmarko@445: { pavolmarko@445: m_Regions.push_back(newRegion); pavolmarko@445: return true; pavolmarko@445: } pavolmarko@445: else pavolmarko@445: { pavolmarko@445: return false; pavolmarko@445: } pavolmarko@445: pavolmarko@445: } pavolmarko@445: pavolmarko@445: void *AllocPriv(size_t size, bool isolated) pavolmarko@445: { pavolmarko@445: void *addr; pavolmarko@445: pavolmarko@445: if (!isolated) pavolmarko@445: { pavolmarko@445: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@445: { pavolmarko@445: if (iter->TryAlloc(size, addr)) pavolmarko@445: return addr; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: if (!AddRegion(size, isolated)) pavolmarko@445: return NULL; pavolmarko@445: pavolmarko@445: bool tmp = m_Regions.back().TryAlloc(size, addr); pavolmarko@445: SH_ASSERT(tmp, ("TryAlloc fails after AddRegion")); pavolmarko@445: return addr; pavolmarko@445: } pavolmarko@445: pavolmarko@445: public: pavolmarko@445: CPageAlloc() pavolmarko@445: { pavolmarko@445: #ifdef __linux__ pavolmarko@445: m_PageSize = sysconf(_SC_PAGESIZE); pavolmarko@445: #else pavolmarko@445: SYSTEM_INFO sysInfo; pavolmarko@445: GetSystemInfo(&sysInfo); pavolmarko@445: m_PageSize = sysInfo.dwPageSize; pavolmarko@445: #endif pavolmarko@445: } pavolmarko@445: pavolmarko@445: ~CPageAlloc() pavolmarko@445: { pavolmarko@445: // Free all regions pavolmarko@445: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@445: { pavolmarko@445: iter->FreeRegion(); pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: void *Alloc(size_t size) pavolmarko@445: { pavolmarko@445: return AllocPriv(size, false); pavolmarko@445: } pavolmarko@445: pavolmarko@445: void *AllocIsolated(size_t size) pavolmarko@445: { pavolmarko@445: return AllocPriv(size, true); pavolmarko@445: } pavolmarko@445: pavolmarko@445: void Free(void *ptr) pavolmarko@445: { pavolmarko@445: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@445: { pavolmarko@445: if (iter->TryFree(ptr)) pavolmarko@445: { pavolmarko@445: if (iter->allocUnits.empty()) pavolmarko@445: { pavolmarko@445: iter->FreeRegion(); pavolmarko@445: m_Regions.erase(iter); pavolmarko@445: } pavolmarko@445: break; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: void SetRE(void *ptr) pavolmarko@445: { pavolmarko@445: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@445: { pavolmarko@445: if (iter->Contains(ptr)) pavolmarko@445: { pavolmarko@445: SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_EXEC); pavolmarko@445: break; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: void SetRW(void *ptr) pavolmarko@445: { pavolmarko@445: for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) pavolmarko@445: { pavolmarko@445: if (iter->Contains(ptr)) pavolmarko@445: { pavolmarko@445: SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_WRITE); pavolmarko@445: break; pavolmarko@445: } pavolmarko@445: } pavolmarko@445: } pavolmarko@445: pavolmarko@445: size_t GetPageSize() pavolmarko@445: { pavolmarko@445: return m_PageSize; pavolmarko@445: } pavolmarko@445: }; pavolmarko@445: } pavolmarko@445: pavolmarko@446: #endif pavolmarko@446: