sourcehook/sh_pagealloc.h
author Pavol Marko <pavolmarko@gmail.com>
Sat Nov 17 09:53:58 2007 +0000 (2007-11-17)
branchhookman_autogen
changeset 461 2fa049f36721
parent 452 2efe13dab607
child 478 f2317a2cb421
permissions -rw-r--r--
New hookfunc local vars code; first step to vafmt support
pavolmarko@445
     1
#ifndef __SH_PAGEALLOC_H__
pavolmarko@445
     2
#define __SH_PAGEALLOC_H__
pavolmarko@445
     3
pavolmarko@445
     4
# if	/********/ defined _WIN32
pavolmarko@445
     5
#		include <windows.h>
pavolmarko@445
     6
# elif /******/ defined __linux__
pavolmarko@445
     7
#		include <sys/mman.h>
pavolmarko@445
     8
#		include <unistd.h>
pavolmarko@445
     9
# else
pavolmarko@445
    10
#		error Unsupported OS/Compiler
pavolmarko@445
    11
# endif
pavolmarko@445
    12
pavolmarko@445
    13
pavolmarko@445
    14
namespace SourceHook
pavolmarko@445
    15
{
pavolmarko@445
    16
pavolmarko@445
    17
	/*
pavolmarko@445
    18
	Class which lets us allocate memory regions in special pages only meant for on the fly code generation.
pavolmarko@445
    19
pavolmarko@445
    20
	If we alloc with malloc and then set the page access type to read/exec only, other regions returned by
pavolmarko@445
    21
	malloc that are in the same page would lose their write access as well and the process could crash.
pavolmarko@445
    22
pavolmarko@452
    23
	Allocating one page per code generation session is usually a waste of memory and on some platforms also
pavolmarko@445
    24
	a waste of virtual address space (Windows� VirtualAlloc has a granularity of 64K).
pavolmarko@445
    25
pavolmarko@445
    26
pavolmarko@445
    27
	IMPORTANT: the memory that Alloc() returns is not a in a defined state!
pavolmarko@445
    28
	It could be in read+exec OR read+write mode.
pavolmarko@445
    29
	-> call SetRE() or SetRW() before using allocated memory!
pavolmarko@445
    30
	*/
pavolmarko@445
    31
	class CPageAlloc
pavolmarko@445
    32
	{
pavolmarko@445
    33
		struct AllocationUnit
pavolmarko@445
    34
		{
pavolmarko@445
    35
			size_t begin_offset;
pavolmarko@445
    36
			size_t size;
pavolmarko@445
    37
pavolmarko@445
    38
			AllocationUnit(size_t p_offs, size_t p_size) : begin_offset(p_offs), size(p_size)
pavolmarko@445
    39
			{
pavolmarko@445
    40
			}
pavolmarko@445
    41
pavolmarko@445
    42
			bool operator < (const AllocationUnit &other) const
pavolmarko@445
    43
			{
pavolmarko@445
    44
				return begin_offset < other.begin_offset;
pavolmarko@445
    45
			}
pavolmarko@445
    46
		};
pavolmarko@445
    47
pavolmarko@445
    48
		typedef List<AllocationUnit> AUList;
pavolmarko@445
    49
pavolmarko@445
    50
		struct AllocatedRegion
pavolmarko@445
    51
		{
pavolmarko@445
    52
			void *startPtr;
pavolmarko@445
    53
			size_t size;
pavolmarko@445
    54
			bool isolated;					// may contain only one AU
pavolmarko@445
    55
			AUList allocUnits;
pavolmarko@445
    56
pavolmarko@445
    57
			bool TryAlloc(size_t reqsize, void * &outAddr)
pavolmarko@445
    58
			{
pavolmarko@445
    59
				// Check for isolated
pavolmarko@445
    60
				if (isolated && !allocUnits.empty())
pavolmarko@445
    61
					return false;
pavolmarko@445
    62
pavolmarko@445
    63
				// Find the smallest gap where req fits
pavolmarko@445
    64
				size_t lastend = 0;
pavolmarko@445
    65
				size_t smallestgap_pos = size + 1;
pavolmarko@445
    66
				size_t smallestgap_size = size + 1;
pavolmarko@445
    67
pavolmarko@445
    68
				for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter)
pavolmarko@445
    69
				{
pavolmarko@445
    70
					if (iter->begin_offset - lastend >= reqsize)
pavolmarko@445
    71
					{
pavolmarko@445
    72
						if (iter->begin_offset - lastend < smallestgap_size)
pavolmarko@445
    73
						{
pavolmarko@445
    74
							smallestgap_size = iter->begin_offset - lastend;
pavolmarko@445
    75
							smallestgap_pos = lastend;
pavolmarko@445
    76
						}
pavolmarko@445
    77
					}
pavolmarko@445
    78
					lastend = iter->begin_offset + iter->size;
pavolmarko@445
    79
				}
pavolmarko@445
    80
pavolmarko@445
    81
				if (size - lastend >= reqsize)
pavolmarko@445
    82
				{
pavolmarko@445
    83
					if (size - lastend < smallestgap_size)
pavolmarko@445
    84
					{
pavolmarko@445
    85
						smallestgap_size = size - lastend;
pavolmarko@445
    86
						smallestgap_pos = lastend;
pavolmarko@445
    87
					}
pavolmarko@445
    88
				}
pavolmarko@445
    89
pavolmarko@445
    90
				if (smallestgap_pos < size)
pavolmarko@445
    91
				{
pavolmarko@445
    92
					outAddr = reinterpret_cast<void*>(reinterpret_cast<char*>(startPtr) + smallestgap_pos);
pavolmarko@445
    93
					allocUnits.push_sorted( AllocationUnit(smallestgap_pos, reqsize) );
pavolmarko@445
    94
					return true;
pavolmarko@445
    95
				}
pavolmarko@445
    96
				else
pavolmarko@445
    97
				{
pavolmarko@445
    98
					return false;
pavolmarko@445
    99
				}
pavolmarko@445
   100
			}
pavolmarko@445
   101
pavolmarko@445
   102
			bool TryFree(void *addr)
pavolmarko@445
   103
			{
pavolmarko@445
   104
				if (addr < startPtr || addr >= reinterpret_cast<void*>(reinterpret_cast<char*>(startPtr) + size))
pavolmarko@445
   105
					return false;
pavolmarko@445
   106
pavolmarko@445
   107
				size_t offs = reinterpret_cast<char*>(addr) - reinterpret_cast<char*>(startPtr);
pavolmarko@445
   108
pavolmarko@445
   109
				for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter)
pavolmarko@445
   110
				{
pavolmarko@445
   111
					if (iter->begin_offset == offs)
pavolmarko@445
   112
					{
pavolmarko@445
   113
						allocUnits.erase(iter);
pavolmarko@445
   114
						return true;
pavolmarko@445
   115
					}
pavolmarko@445
   116
				}
pavolmarko@445
   117
pavolmarko@445
   118
				return false;
pavolmarko@445
   119
			}
pavolmarko@445
   120
pavolmarko@445
   121
			bool Contains(void *addr)
pavolmarko@445
   122
			{
pavolmarko@445
   123
				return addr >= startPtr && addr < reinterpret_cast<void*>(reinterpret_cast<char*>(startPtr) + size);
pavolmarko@445
   124
			}
pavolmarko@445
   125
pavolmarko@445
   126
			void FreeRegion()
pavolmarko@445
   127
			{
pavolmarko@445
   128
#ifdef __linux__
pavolmarko@445
   129
				munmap(startPtr, size);
pavolmarko@445
   130
#else
pavolmarko@445
   131
				VirtualFree(startPtr, 0, MEM_RELEASE);
pavolmarko@445
   132
#endif
pavolmarko@445
   133
			}
pavolmarko@445
   134
		};
pavolmarko@445
   135
pavolmarko@445
   136
		typedef List<AllocatedRegion> ARList;
pavolmarko@445
   137
pavolmarko@445
   138
		size_t m_PageSize;
pavolmarko@445
   139
		ARList m_Regions;
pavolmarko@445
   140
pavolmarko@445
   141
		bool AddRegion(size_t minSize, bool isolated)
pavolmarko@445
   142
		{
pavolmarko@445
   143
			AllocatedRegion newRegion;
pavolmarko@445
   144
			newRegion.startPtr = 0;
pavolmarko@445
   145
			newRegion.isolated = isolated;
pavolmarko@445
   146
pavolmarko@445
   147
			// Compute real size -> align up to m_PageSize boundary
pavolmarko@445
   148
pavolmarko@445
   149
			newRegion.size = minSize - (minSize % m_PageSize);
pavolmarko@445
   150
			if (newRegion.size < minSize)
pavolmarko@445
   151
				newRegion.size += m_PageSize;
pavolmarko@445
   152
pavolmarko@445
   153
#ifdef __linux__
pavolmarko@445
   154
			newRegion.startPtr = mmap(0, newRegion.size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
pavolmarko@445
   155
#else
pavolmarko@445
   156
			newRegion.startPtr = VirtualAlloc(NULL, newRegion.size, MEM_COMMIT, PAGE_READWRITE);
pavolmarko@445
   157
#endif
pavolmarko@445
   158
pavolmarko@445
   159
			if (newRegion.startPtr)
pavolmarko@445
   160
			{
pavolmarko@445
   161
				m_Regions.push_back(newRegion);
pavolmarko@445
   162
				return true;
pavolmarko@445
   163
			}
pavolmarko@445
   164
			else
pavolmarko@445
   165
			{
pavolmarko@445
   166
				return false;
pavolmarko@445
   167
			}
pavolmarko@445
   168
pavolmarko@445
   169
		}
pavolmarko@445
   170
pavolmarko@445
   171
		void *AllocPriv(size_t size, bool isolated)
pavolmarko@445
   172
		{
pavolmarko@445
   173
			void *addr;
pavolmarko@445
   174
pavolmarko@445
   175
			if (!isolated)
pavolmarko@445
   176
			{
pavolmarko@445
   177
				for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter)
pavolmarko@445
   178
				{
pavolmarko@445
   179
					if (iter->TryAlloc(size, addr))
pavolmarko@445
   180
						return addr;
pavolmarko@445
   181
				}
pavolmarko@445
   182
			}
pavolmarko@445
   183
pavolmarko@445
   184
			if (!AddRegion(size, isolated))
pavolmarko@445
   185
				return NULL;
pavolmarko@445
   186
pavolmarko@445
   187
			bool tmp = m_Regions.back().TryAlloc(size, addr);
pavolmarko@445
   188
			SH_ASSERT(tmp, ("TryAlloc fails after AddRegion"));
pavolmarko@445
   189
			return addr;
pavolmarko@445
   190
		}
pavolmarko@445
   191
pavolmarko@445
   192
	public:
pavolmarko@445
   193
		CPageAlloc()
pavolmarko@445
   194
		{
pavolmarko@445
   195
#ifdef __linux__
pavolmarko@445
   196
			m_PageSize = sysconf(_SC_PAGESIZE);
pavolmarko@445
   197
#else
pavolmarko@445
   198
			SYSTEM_INFO sysInfo;
pavolmarko@445
   199
			GetSystemInfo(&sysInfo);
pavolmarko@445
   200
			m_PageSize = sysInfo.dwPageSize;
pavolmarko@445
   201
#endif
pavolmarko@445
   202
		}
pavolmarko@445
   203
pavolmarko@445
   204
		~CPageAlloc()
pavolmarko@445
   205
		{
pavolmarko@445
   206
			// Free all regions
pavolmarko@445
   207
			for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter)
pavolmarko@445
   208
			{
pavolmarko@445
   209
				iter->FreeRegion();
pavolmarko@445
   210
			}
pavolmarko@445
   211
		}
pavolmarko@445
   212
pavolmarko@445
   213
		void *Alloc(size_t size)
pavolmarko@445
   214
		{
pavolmarko@445
   215
			return AllocPriv(size, false);
pavolmarko@445
   216
		}
pavolmarko@445
   217
pavolmarko@445
   218
		void *AllocIsolated(size_t size)
pavolmarko@445
   219
		{
pavolmarko@445
   220
			return AllocPriv(size, true);
pavolmarko@445
   221
		}
pavolmarko@445
   222
pavolmarko@445
   223
		void Free(void *ptr)
pavolmarko@445
   224
		{
pavolmarko@445
   225
			for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter)
pavolmarko@445
   226
			{
pavolmarko@445
   227
				if (iter->TryFree(ptr))
pavolmarko@445
   228
				{
pavolmarko@445
   229
					if (iter->allocUnits.empty())
pavolmarko@445
   230
					{
pavolmarko@445
   231
						iter->FreeRegion();
pavolmarko@445
   232
						m_Regions.erase(iter);
pavolmarko@445
   233
					}
pavolmarko@445
   234
					break;
pavolmarko@445
   235
				}
pavolmarko@445
   236
			}
pavolmarko@445
   237
		}
pavolmarko@445
   238
pavolmarko@445
   239
		void SetRE(void *ptr)
pavolmarko@445
   240
		{
pavolmarko@445
   241
			for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter)
pavolmarko@445
   242
			{
pavolmarko@445
   243
				if (iter->Contains(ptr))
pavolmarko@445
   244
				{
pavolmarko@445
   245
					SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_EXEC);
pavolmarko@445
   246
					break;
pavolmarko@445
   247
				}
pavolmarko@445
   248
			}
pavolmarko@445
   249
		}
pavolmarko@445
   250
pavolmarko@445
   251
		void SetRW(void *ptr)
pavolmarko@445
   252
		{
pavolmarko@445
   253
			for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter)
pavolmarko@445
   254
			{
pavolmarko@445
   255
				if (iter->Contains(ptr))
pavolmarko@445
   256
				{
pavolmarko@445
   257
					SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_WRITE);
pavolmarko@445
   258
					break;
pavolmarko@445
   259
				}
pavolmarko@445
   260
			}
pavolmarko@445
   261
		}
pavolmarko@445
   262
pavolmarko@445
   263
		size_t GetPageSize()
pavolmarko@445
   264
		{
pavolmarko@445
   265
			return m_PageSize;
pavolmarko@445
   266
		}
pavolmarko@445
   267
	};
pavolmarko@445
   268
}
pavolmarko@445
   269
pavolmarko@446
   270
#endif
pavolmarko@446
   271