|
dvander@10
|
1 |
/* ======== SourceHook ======== |
|
ds@294
|
2 |
* Copyright (C) 2004-2007 Metamod:Source Development Team |
|
pavolmarko@1
|
3 |
* No warranties of any kind |
|
pavolmarko@1
|
4 |
* |
|
dvander@10
|
5 |
* License: zlib/libpng |
|
pavolmarko@1
|
6 |
* |
|
dvander@10
|
7 |
* Author(s): Pavol "PM OnoTo" Marko, Scott "Damaged Soul" Ehlert |
|
dvander@10
|
8 |
* Contributors: lancevorgin, XAD, theqizmo |
|
pavolmarko@1
|
9 |
* ============================ |
|
pavolmarko@1
|
10 |
*/ |
|
pavolmarko@1
|
11 |
|
|
pavolmarko@1
|
12 |
#ifndef __SHINT_MEMORY_H__ |
|
pavolmarko@1
|
13 |
#define __SHINT_MEMORY_H__ |
|
pavolmarko@1
|
14 |
|
|
pavolmarko@1
|
15 |
// Feb 17 / 2005: |
|
pavolmarko@1
|
16 |
// Unprotect now sets to readwrite |
|
pavolmarko@1
|
17 |
// The vtable doesn't need to be executable anyway |
|
pavolmarko@1
|
18 |
|
|
pavolmarko@1
|
19 |
# if /********/ defined _WIN32 |
|
pavolmarko@1
|
20 |
# include <windows.h> |
|
pavolmarko@1
|
21 |
# define SH_MEM_READ 1 |
|
pavolmarko@1
|
22 |
# define SH_MEM_WRITE 2 |
|
pavolmarko@1
|
23 |
# define SH_MEM_EXEC 4 |
|
pavolmarko@1
|
24 |
# elif /******/ defined __linux__ |
|
pavolmarko@1
|
25 |
# include <sys/mman.h> |
|
pavolmarko@117
|
26 |
# include <stdio.h> |
|
pavolmarko@442
|
27 |
namespace LinuxSignal |
|
pavolmarko@442
|
28 |
{ |
|
pavolmarko@117
|
29 |
# include <signal.h> |
|
pavolmarko@442
|
30 |
} |
|
pavolmarko@117
|
31 |
# include <setjmp.h> |
|
pavolmarko@1
|
32 |
// http://www.die.net/doc/linux/man/man2/mprotect.2.html |
|
pavolmarko@1
|
33 |
# include <limits.h> |
|
pavolmarko@1
|
34 |
# ifndef PAGESIZE |
|
pavolmarko@1
|
35 |
# define PAGESIZE 4096 |
|
pavolmarko@1
|
36 |
# endif |
|
pavolmarko@1
|
37 |
# define SH_MEM_READ PROT_READ |
|
pavolmarko@1
|
38 |
# define SH_MEM_WRITE PROT_WRITE |
|
pavolmarko@1
|
39 |
# define SH_MEM_EXEC PROT_EXEC |
|
pavolmarko@1
|
40 |
|
|
pavolmarko@1
|
41 |
// We need to align addr down to pagesize on linux |
|
pavolmarko@1
|
42 |
// We assume PAGESIZE is a power of two |
|
pavolmarko@61
|
43 |
# define SH_LALIGN(x) (void*)((intptr_t)(x) & ~(PAGESIZE-1)) |
|
pavolmarko@61
|
44 |
# define SH_LALDIF(x) ((intptr_t)(x) & (PAGESIZE-1)) |
|
pavolmarko@1
|
45 |
# else |
|
pavolmarko@1
|
46 |
# error Unsupported OS/Compiler |
|
pavolmarko@1
|
47 |
# endif |
|
pavolmarko@1
|
48 |
|
|
pavolmarko@435
|
49 |
#include "sh_list.h" |
|
pavolmarko@1
|
50 |
|
|
pavolmarko@1
|
51 |
namespace SourceHook |
|
pavolmarko@1
|
52 |
{ |
|
pavolmarko@1
|
53 |
inline bool SetMemAccess(void *addr, size_t len, int access) |
|
pavolmarko@1
|
54 |
{ |
|
pavolmarko@1
|
55 |
# ifdef __linux__ |
|
pavolmarko@50
|
56 |
return mprotect(SH_LALIGN(addr), len + SH_LALDIF(addr), access)==0 ? true : false; |
|
pavolmarko@1
|
57 |
# else |
|
pavolmarko@1
|
58 |
DWORD tmp; |
|
pavolmarko@1
|
59 |
DWORD prot; |
|
pavolmarko@1
|
60 |
switch (access) |
|
pavolmarko@1
|
61 |
{ |
|
pavolmarko@1
|
62 |
case SH_MEM_READ: |
|
pavolmarko@1
|
63 |
prot = PAGE_READONLY; break; |
|
pavolmarko@1
|
64 |
case SH_MEM_READ | SH_MEM_WRITE: |
|
pavolmarko@1
|
65 |
prot = PAGE_READWRITE; break; |
|
pavolmarko@1
|
66 |
case SH_MEM_READ | SH_MEM_EXEC: |
|
pavolmarko@1
|
67 |
prot = PAGE_EXECUTE_READ; break; |
|
pavolmarko@1
|
68 |
default: |
|
pavolmarko@1
|
69 |
case SH_MEM_READ | SH_MEM_WRITE | SH_MEM_EXEC: |
|
pavolmarko@1
|
70 |
prot = PAGE_EXECUTE_READWRITE; break; |
|
pavolmarko@1
|
71 |
} |
|
pavolmarko@1
|
72 |
return VirtualProtect(addr, len, prot, &tmp) ? true : false; |
|
pavolmarko@1
|
73 |
# endif |
|
pavolmarko@1
|
74 |
} |
|
pavolmarko@1
|
75 |
|
|
pavolmarko@117
|
76 |
#ifdef __linux__ |
|
pavolmarko@117
|
77 |
namespace |
|
pavolmarko@117
|
78 |
{ |
|
pavolmarko@117
|
79 |
bool g_BadReadCalled; |
|
pavolmarko@117
|
80 |
jmp_buf g_BadReadJmpBuf; |
|
pavolmarko@117
|
81 |
|
|
pavolmarko@117
|
82 |
static void BadReadHandler(int sig) |
|
pavolmarko@117
|
83 |
{ |
|
pavolmarko@117
|
84 |
if (g_BadReadCalled) |
|
pavolmarko@117
|
85 |
longjmp(g_BadReadJmpBuf, 1); |
|
pavolmarko@117
|
86 |
} |
|
pavolmarko@117
|
87 |
} |
|
pavolmarko@117
|
88 |
#endif |
|
pavolmarko@117
|
89 |
|
|
pavolmarko@117
|
90 |
/** |
|
pavolmarko@117
|
91 |
* @brief Checks whether the specified memory region is (still) accessible |
|
pavolmarko@117
|
92 |
* |
|
pavolmarko@117
|
93 |
* @param addr The lower boundary |
|
pavolmarko@117
|
94 |
* @param len Length of the region to be checked |
|
pavolmarko@117
|
95 |
*/ |
|
pavolmarko@117
|
96 |
namespace |
|
pavolmarko@117
|
97 |
{ |
|
pavolmarko@117
|
98 |
bool ModuleInMemory(char *addr, size_t len) |
|
pavolmarko@117
|
99 |
{ |
|
pavolmarko@117
|
100 |
#ifdef __linux__ |
|
pavolmarko@117
|
101 |
// On linux, first check /proc/self/maps |
|
pavolmarko@117
|
102 |
long lower = reinterpret_cast<long>(addr); |
|
pavolmarko@117
|
103 |
long upper = lower + len; |
|
pavolmarko@117
|
104 |
|
|
pavolmarko@117
|
105 |
FILE *pF = fopen("/proc/self/maps", "r"); |
|
pavolmarko@117
|
106 |
if (pF) |
|
pavolmarko@117
|
107 |
{ |
|
pavolmarko@117
|
108 |
// Linux /proc/self/maps -> parse |
|
pavolmarko@117
|
109 |
// Format: |
|
pavolmarko@117
|
110 |
// lower upper prot stuff path |
|
pavolmarko@117
|
111 |
// 08048000-0804c000 r-xp 00000000 03:03 1010107 /bin/cat |
|
pavolmarko@117
|
112 |
long rlower, rupper; |
|
pavolmarko@117
|
113 |
while (fscanf(pF, "%lx-%lx", &rlower, &rupper) != EOF) |
|
pavolmarko@117
|
114 |
{ |
|
pavolmarko@117
|
115 |
// Check whether we're IN THERE! |
|
pavolmarko@117
|
116 |
if (lower >= rlower && upper <= rupper) |
|
pavolmarko@117
|
117 |
{ |
|
pavolmarko@117
|
118 |
fclose(pF); |
|
pavolmarko@117
|
119 |
return true; |
|
pavolmarko@117
|
120 |
} |
|
pavolmarko@117
|
121 |
// Read to end of line |
|
pavolmarko@117
|
122 |
int c; |
|
pavolmarko@117
|
123 |
while ((c = fgetc(pF)) != '\n') |
|
pavolmarko@117
|
124 |
{ |
|
pavolmarko@117
|
125 |
if (c == EOF) |
|
pavolmarko@117
|
126 |
break; |
|
pavolmarko@117
|
127 |
} |
|
pavolmarko@117
|
128 |
if (c == EOF) |
|
pavolmarko@117
|
129 |
break; |
|
pavolmarko@117
|
130 |
} |
|
pavolmarko@117
|
131 |
fclose(pF); |
|
pavolmarko@117
|
132 |
return false; |
|
pavolmarko@117
|
133 |
} |
|
pavolmarko@117
|
134 |
pF = fopen("/proc/curproc/map", "r"); |
|
pavolmarko@117
|
135 |
if (pF) |
|
pavolmarko@117
|
136 |
{ |
|
pavolmarko@117
|
137 |
// FreeBSD /proc/curproc/map -> parse |
|
pavolmarko@117
|
138 |
// 0x804800 0x805500 13 15 0xc6e18960 r-x 21 0x0 COW NC vnode |
|
pavolmarko@117
|
139 |
long rlower, rupper; |
|
pavolmarko@117
|
140 |
while (fscanf(pF, "0x%lx 0x%lx", &rlower, &rupper) != EOF) |
|
pavolmarko@117
|
141 |
{ |
|
pavolmarko@117
|
142 |
// Check whether we're IN THERE! |
|
pavolmarko@117
|
143 |
if (lower >= rlower && upper <= rupper) |
|
pavolmarko@117
|
144 |
{ |
|
pavolmarko@117
|
145 |
fclose(pF); |
|
pavolmarko@117
|
146 |
return true; |
|
pavolmarko@117
|
147 |
} |
|
pavolmarko@117
|
148 |
// Read to end of line |
|
pavolmarko@117
|
149 |
int c; |
|
pavolmarko@117
|
150 |
while ((c = fgetc(pF)) != '\n') |
|
pavolmarko@117
|
151 |
{ |
|
pavolmarko@117
|
152 |
if (c == EOF) |
|
pavolmarko@117
|
153 |
break; |
|
pavolmarko@117
|
154 |
} |
|
pavolmarko@117
|
155 |
if (c == EOF) |
|
pavolmarko@117
|
156 |
break; |
|
pavolmarko@117
|
157 |
} |
|
pavolmarko@117
|
158 |
fclose(pF); |
|
pavolmarko@117
|
159 |
return false; |
|
pavolmarko@117
|
160 |
} |
|
pavolmarko@117
|
161 |
|
|
pavolmarko@117
|
162 |
// Both of the above failed, try to actually read and trap sigsegv (implemented by Damaged Soul) |
|
pavolmarko@117
|
163 |
void(*prevHandler)(int sig); |
|
pavolmarko@117
|
164 |
g_BadReadCalled = true; |
|
pavolmarko@117
|
165 |
|
|
pavolmarko@117
|
166 |
if (setjmp(g_BadReadJmpBuf)) |
|
pavolmarko@117
|
167 |
return true; |
|
pavolmarko@117
|
168 |
|
|
pavolmarko@442
|
169 |
prevHandler = LinuxSignal::signal(SIGSEGV, BadReadHandler); |
|
pavolmarko@117
|
170 |
|
|
pavolmarko@117
|
171 |
volatile const char *p = reinterpret_cast<const char*>(addr); |
|
pavolmarko@117
|
172 |
char dummy; |
|
pavolmarko@117
|
173 |
|
|
pavolmarko@117
|
174 |
for (size_t i = 0; i < len; i++) |
|
pavolmarko@117
|
175 |
dummy = p[i]; |
|
pavolmarko@117
|
176 |
|
|
pavolmarko@117
|
177 |
g_BadReadCalled = false; |
|
pavolmarko@117
|
178 |
|
|
pavolmarko@442
|
179 |
LinuxSignal::signal(SIGSEGV, prevHandler); |
|
pavolmarko@117
|
180 |
|
|
pavolmarko@117
|
181 |
return false; |
|
pavolmarko@117
|
182 |
#else |
|
pavolmarko@117
|
183 |
// On Win32, simply use IsBadReadPtr |
|
pavolmarko@117
|
184 |
return !IsBadReadPtr(addr, len); |
|
pavolmarko@117
|
185 |
#endif |
|
pavolmarko@117
|
186 |
} |
|
pavolmarko@117
|
187 |
} |
|
pavolmarko@435
|
188 |
|
|
pavolmarko@435
|
189 |
/* |
|
pavolmarko@435
|
190 |
Class which lets us allocate memory regions in special pages only meant for on the fly code generation. |
|
pavolmarko@435
|
191 |
|
|
pavolmarko@435
|
192 |
If we alloc with malloc and then set the page access type to read/exec only, other regions returned by |
|
pavolmarko@435
|
193 |
malloc that are in the same page would lose their write access as well and the process could crash. |
|
pavolmarko@435
|
194 |
|
|
pavolmarko@435
|
195 |
Allocating one page per code generation session is usually a waste of memory and on some plattforms also |
|
pavolmarko@435
|
196 |
a waste of virtual address space (Windows� VirtualAlloc has a granularity of 64K). |
|
pavolmarko@435
|
197 |
|
|
pavolmarko@435
|
198 |
|
|
pavolmarko@435
|
199 |
IMPORTANT: the memory that Alloc() returns is not a in a defined state! |
|
pavolmarko@435
|
200 |
It could be in read+exec OR read+write mode. |
|
pavolmarko@435
|
201 |
-> call SetRE() or SetRW() before using allocated memory! |
|
pavolmarko@435
|
202 |
*/ |
|
pavolmarko@435
|
203 |
class CPageAlloc |
|
pavolmarko@435
|
204 |
{ |
|
pavolmarko@435
|
205 |
struct AllocationUnit |
|
pavolmarko@435
|
206 |
{ |
|
pavolmarko@435
|
207 |
size_t begin_offset; |
|
pavolmarko@435
|
208 |
size_t size; |
|
pavolmarko@435
|
209 |
|
|
pavolmarko@435
|
210 |
AllocationUnit(size_t p_offs, size_t p_size) : begin_offset(p_offs), size(p_size) |
|
pavolmarko@435
|
211 |
{ |
|
pavolmarko@435
|
212 |
} |
|
pavolmarko@435
|
213 |
|
|
pavolmarko@435
|
214 |
bool operator < (const AllocationUnit &other) const |
|
pavolmarko@435
|
215 |
{ |
|
pavolmarko@435
|
216 |
return begin_offset < other.begin_offset; |
|
pavolmarko@435
|
217 |
} |
|
pavolmarko@435
|
218 |
}; |
|
pavolmarko@435
|
219 |
|
|
pavolmarko@435
|
220 |
typedef List<AllocationUnit> AUList; |
|
pavolmarko@435
|
221 |
|
|
pavolmarko@435
|
222 |
struct AllocatedRegion |
|
pavolmarko@435
|
223 |
{ |
|
pavolmarko@435
|
224 |
void *startPtr; |
|
pavolmarko@435
|
225 |
size_t size; |
|
pavolmarko@435
|
226 |
bool isolated; // may contain only one AU |
|
pavolmarko@435
|
227 |
AUList allocUnits; |
|
pavolmarko@435
|
228 |
|
|
pavolmarko@435
|
229 |
bool TryAlloc(size_t reqsize, void * &outAddr) |
|
pavolmarko@435
|
230 |
{ |
|
pavolmarko@435
|
231 |
// Check for isolated |
|
pavolmarko@435
|
232 |
if (isolated && !allocUnits.empty()) |
|
pavolmarko@435
|
233 |
return false; |
|
pavolmarko@435
|
234 |
|
|
pavolmarko@435
|
235 |
// Find the smallest gap where req fits |
|
pavolmarko@435
|
236 |
size_t lastend = 0; |
|
pavolmarko@435
|
237 |
size_t smallestgap_pos = size + 1; |
|
pavolmarko@435
|
238 |
size_t smallestgap_size = size + 1; |
|
pavolmarko@435
|
239 |
|
|
pavolmarko@435
|
240 |
for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter) |
|
pavolmarko@435
|
241 |
{ |
|
pavolmarko@435
|
242 |
if (iter->begin_offset - lastend >= reqsize) |
|
pavolmarko@435
|
243 |
{ |
|
pavolmarko@435
|
244 |
if (iter->begin_offset - lastend < smallestgap_size) |
|
pavolmarko@435
|
245 |
{ |
|
pavolmarko@435
|
246 |
smallestgap_size = iter->begin_offset - lastend; |
|
pavolmarko@435
|
247 |
smallestgap_pos = lastend; |
|
pavolmarko@435
|
248 |
} |
|
pavolmarko@435
|
249 |
} |
|
pavolmarko@435
|
250 |
lastend = iter->begin_offset + iter->size; |
|
pavolmarko@435
|
251 |
} |
|
pavolmarko@435
|
252 |
|
|
pavolmarko@435
|
253 |
if (size - lastend >= reqsize) |
|
pavolmarko@435
|
254 |
{ |
|
pavolmarko@435
|
255 |
if (size - lastend < smallestgap_size) |
|
pavolmarko@435
|
256 |
{ |
|
pavolmarko@435
|
257 |
smallestgap_size = size - lastend; |
|
pavolmarko@435
|
258 |
smallestgap_pos = lastend; |
|
pavolmarko@435
|
259 |
} |
|
pavolmarko@435
|
260 |
} |
|
pavolmarko@435
|
261 |
|
|
pavolmarko@435
|
262 |
if (smallestgap_pos < size) |
|
pavolmarko@435
|
263 |
{ |
|
pavolmarko@435
|
264 |
outAddr = reinterpret_cast<void*>(reinterpret_cast<char*>(startPtr) + smallestgap_pos); |
|
pavolmarko@435
|
265 |
allocUnits.push_sorted( AllocationUnit(smallestgap_pos, reqsize) ); |
|
pavolmarko@435
|
266 |
return true; |
|
pavolmarko@435
|
267 |
} |
|
pavolmarko@435
|
268 |
else |
|
pavolmarko@435
|
269 |
{ |
|
pavolmarko@435
|
270 |
return false; |
|
pavolmarko@435
|
271 |
} |
|
pavolmarko@435
|
272 |
} |
|
pavolmarko@435
|
273 |
|
|
pavolmarko@435
|
274 |
bool TryFree(void *addr) |
|
pavolmarko@435
|
275 |
{ |
|
pavolmarko@435
|
276 |
if (addr < startPtr || addr >= reinterpret_cast<void*>(reinterpret_cast<char*>(startPtr) + size)) |
|
pavolmarko@435
|
277 |
return false; |
|
pavolmarko@435
|
278 |
|
|
pavolmarko@435
|
279 |
size_t offs = reinterpret_cast<char*>(addr) - reinterpret_cast<char*>(startPtr); |
|
pavolmarko@435
|
280 |
|
|
pavolmarko@435
|
281 |
for (AUList::iterator iter = allocUnits.begin(); iter != allocUnits.end(); ++iter) |
|
pavolmarko@435
|
282 |
{ |
|
pavolmarko@435
|
283 |
if (iter->begin_offset == offs) |
|
pavolmarko@435
|
284 |
{ |
|
pavolmarko@435
|
285 |
allocUnits.erase(iter); |
|
pavolmarko@435
|
286 |
return true; |
|
pavolmarko@435
|
287 |
} |
|
pavolmarko@435
|
288 |
} |
|
pavolmarko@435
|
289 |
|
|
pavolmarko@435
|
290 |
return false; |
|
pavolmarko@435
|
291 |
} |
|
pavolmarko@435
|
292 |
|
|
pavolmarko@435
|
293 |
bool Contains(void *addr) |
|
pavolmarko@435
|
294 |
{ |
|
pavolmarko@435
|
295 |
return addr >= startPtr && addr < reinterpret_cast<void*>(reinterpret_cast<char*>(startPtr) + size); |
|
pavolmarko@435
|
296 |
} |
|
pavolmarko@435
|
297 |
|
|
pavolmarko@435
|
298 |
void FreeRegion() |
|
pavolmarko@435
|
299 |
{ |
|
pavolmarko@435
|
300 |
#ifdef __linux__ |
|
pavolmarko@435
|
301 |
munmap(startPtr, size); |
|
pavolmarko@435
|
302 |
#else |
|
pavolmarko@435
|
303 |
VirtualFree(startPtr, 0, MEM_RELEASE); |
|
pavolmarko@435
|
304 |
#endif |
|
pavolmarko@435
|
305 |
} |
|
pavolmarko@435
|
306 |
}; |
|
pavolmarko@435
|
307 |
|
|
pavolmarko@435
|
308 |
typedef List<AllocatedRegion> ARList; |
|
pavolmarko@435
|
309 |
|
|
pavolmarko@435
|
310 |
size_t m_PageSize; |
|
pavolmarko@435
|
311 |
ARList m_Regions; |
|
pavolmarko@435
|
312 |
|
|
pavolmarko@435
|
313 |
bool AddRegion(size_t minSize, bool isolated) |
|
pavolmarko@435
|
314 |
{ |
|
pavolmarko@435
|
315 |
AllocatedRegion newRegion; |
|
pavolmarko@435
|
316 |
newRegion.startPtr = 0; |
|
pavolmarko@435
|
317 |
newRegion.isolated = isolated; |
|
pavolmarko@435
|
318 |
|
|
pavolmarko@435
|
319 |
// Compute real size -> align up to m_PageSize boundary |
|
pavolmarko@435
|
320 |
|
|
pavolmarko@435
|
321 |
newRegion.size = minSize - (minSize % m_PageSize); |
|
pavolmarko@435
|
322 |
if (newRegion.size < minSize) |
|
pavolmarko@435
|
323 |
newRegion.size += m_PageSize; |
|
pavolmarko@435
|
324 |
|
|
pavolmarko@435
|
325 |
#ifdef __linux__ |
|
pavolmarko@442
|
326 |
newRegion.startPtr = mmap(0, newRegion.size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); |
|
pavolmarko@435
|
327 |
#else |
|
pavolmarko@435
|
328 |
newRegion.startPtr = VirtualAlloc(NULL, newRegion.size, MEM_COMMIT, PAGE_READWRITE); |
|
pavolmarko@435
|
329 |
#endif |
|
pavolmarko@435
|
330 |
|
|
pavolmarko@435
|
331 |
if (newRegion.startPtr) |
|
pavolmarko@435
|
332 |
{ |
|
pavolmarko@435
|
333 |
m_Regions.push_back(newRegion); |
|
pavolmarko@435
|
334 |
return true; |
|
pavolmarko@435
|
335 |
} |
|
pavolmarko@435
|
336 |
else |
|
pavolmarko@435
|
337 |
{ |
|
pavolmarko@435
|
338 |
return false; |
|
pavolmarko@435
|
339 |
} |
|
pavolmarko@435
|
340 |
|
|
pavolmarko@435
|
341 |
} |
|
pavolmarko@435
|
342 |
|
|
pavolmarko@435
|
343 |
void *AllocPriv(size_t size, bool isolated) |
|
pavolmarko@435
|
344 |
{ |
|
pavolmarko@435
|
345 |
void *addr; |
|
pavolmarko@435
|
346 |
|
|
pavolmarko@435
|
347 |
if (!isolated) |
|
pavolmarko@435
|
348 |
{ |
|
pavolmarko@435
|
349 |
for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) |
|
pavolmarko@435
|
350 |
{ |
|
pavolmarko@435
|
351 |
if (iter->TryAlloc(size, addr)) |
|
pavolmarko@435
|
352 |
return addr; |
|
pavolmarko@435
|
353 |
} |
|
pavolmarko@435
|
354 |
} |
|
pavolmarko@435
|
355 |
|
|
pavolmarko@435
|
356 |
if (!AddRegion(size, isolated)) |
|
pavolmarko@435
|
357 |
return NULL; |
|
pavolmarko@435
|
358 |
|
|
pavolmarko@435
|
359 |
bool tmp = m_Regions.back().TryAlloc(size, addr); |
|
pavolmarko@435
|
360 |
SH_ASSERT(tmp, ("TryAlloc fails after AddRegion")); |
|
pavolmarko@435
|
361 |
return addr; |
|
pavolmarko@435
|
362 |
} |
|
pavolmarko@435
|
363 |
|
|
pavolmarko@435
|
364 |
public: |
|
pavolmarko@435
|
365 |
CPageAlloc() |
|
pavolmarko@435
|
366 |
{ |
|
pavolmarko@435
|
367 |
#ifdef __linux__ |
|
pavolmarko@435
|
368 |
m_PageSize = sysconf(_SC_PAGESIZE); |
|
pavolmarko@435
|
369 |
#else |
|
pavolmarko@435
|
370 |
SYSTEM_INFO sysInfo; |
|
pavolmarko@435
|
371 |
GetSystemInfo(&sysInfo); |
|
pavolmarko@435
|
372 |
m_PageSize = sysInfo.dwPageSize; |
|
pavolmarko@435
|
373 |
#endif |
|
pavolmarko@435
|
374 |
} |
|
pavolmarko@435
|
375 |
|
|
pavolmarko@435
|
376 |
~CPageAlloc() |
|
pavolmarko@435
|
377 |
{ |
|
pavolmarko@435
|
378 |
// Free all regions |
|
pavolmarko@435
|
379 |
for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) |
|
pavolmarko@435
|
380 |
{ |
|
pavolmarko@435
|
381 |
iter->FreeRegion(); |
|
pavolmarko@435
|
382 |
} |
|
pavolmarko@435
|
383 |
} |
|
pavolmarko@435
|
384 |
|
|
pavolmarko@435
|
385 |
void *Alloc(size_t size) |
|
pavolmarko@435
|
386 |
{ |
|
pavolmarko@435
|
387 |
return AllocPriv(size, false); |
|
pavolmarko@435
|
388 |
} |
|
pavolmarko@435
|
389 |
|
|
pavolmarko@435
|
390 |
void *AllocIsolated(size_t size) |
|
pavolmarko@435
|
391 |
{ |
|
pavolmarko@435
|
392 |
return AllocPriv(size, true); |
|
pavolmarko@435
|
393 |
} |
|
pavolmarko@435
|
394 |
|
|
pavolmarko@435
|
395 |
void Free(void *ptr) |
|
pavolmarko@435
|
396 |
{ |
|
pavolmarko@435
|
397 |
for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) |
|
pavolmarko@435
|
398 |
{ |
|
pavolmarko@435
|
399 |
if (iter->TryFree(ptr)) |
|
pavolmarko@435
|
400 |
{ |
|
pavolmarko@435
|
401 |
if (iter->allocUnits.empty()) |
|
pavolmarko@435
|
402 |
{ |
|
pavolmarko@435
|
403 |
iter->FreeRegion(); |
|
pavolmarko@435
|
404 |
m_Regions.erase(iter); |
|
pavolmarko@435
|
405 |
} |
|
pavolmarko@435
|
406 |
break; |
|
pavolmarko@435
|
407 |
} |
|
pavolmarko@435
|
408 |
} |
|
pavolmarko@435
|
409 |
} |
|
pavolmarko@435
|
410 |
|
|
pavolmarko@435
|
411 |
void SetRE(void *ptr) |
|
pavolmarko@435
|
412 |
{ |
|
pavolmarko@435
|
413 |
for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) |
|
pavolmarko@435
|
414 |
{ |
|
pavolmarko@435
|
415 |
if (iter->Contains(ptr)) |
|
pavolmarko@435
|
416 |
{ |
|
pavolmarko@435
|
417 |
SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_EXEC); |
|
pavolmarko@435
|
418 |
break; |
|
pavolmarko@435
|
419 |
} |
|
pavolmarko@435
|
420 |
} |
|
pavolmarko@435
|
421 |
} |
|
pavolmarko@435
|
422 |
|
|
pavolmarko@435
|
423 |
void SetRW(void *ptr) |
|
pavolmarko@435
|
424 |
{ |
|
pavolmarko@435
|
425 |
for (ARList::iterator iter = m_Regions.begin(); iter != m_Regions.end(); ++iter) |
|
pavolmarko@435
|
426 |
{ |
|
pavolmarko@435
|
427 |
if (iter->Contains(ptr)) |
|
pavolmarko@435
|
428 |
{ |
|
pavolmarko@435
|
429 |
SetMemAccess(iter->startPtr, iter->size, SH_MEM_READ | SH_MEM_WRITE); |
|
pavolmarko@435
|
430 |
break; |
|
pavolmarko@435
|
431 |
} |
|
pavolmarko@435
|
432 |
} |
|
pavolmarko@435
|
433 |
} |
|
pavolmarko@435
|
434 |
|
|
pavolmarko@435
|
435 |
size_t GetPageSize() |
|
pavolmarko@435
|
436 |
{ |
|
pavolmarko@435
|
437 |
return m_PageSize; |
|
pavolmarko@435
|
438 |
} |
|
pavolmarko@435
|
439 |
}; |
|
pavolmarko@1
|
440 |
} |
|
pavolmarko@1
|
441 |
|
|
dvander@34
|
442 |
#endif |