-
Notifications
You must be signed in to change notification settings - Fork 59
/
memory.cpp
264 lines (235 loc) · 6.91 KB
/
memory.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
//////////////////////////////////////////////////////////////////////
// MemorySearchFunctions.cpp
// -------------------------------------------------------------------
// Pattern search algorithm and other memory related issues.
//
// <[email protected]>
//////////////////////////////////////////////////////////////////////
#include "memory.h"
#include "main.h"
#ifdef WITHOUT_GFWL_LIB
//////////////////////////////////////////////////////////////////////
// GetMemoryAddressFromPattern
// -------------------------------------------------------------------
// Returns the address of szSearchPattern+offset if found in szDllName
//
// The search criteria are determined by the first character of
// szSearchPattern:
//
// ! An ordinal inside (ex. !NameOfFuntion or !10005)
// # An actual hexadecimal address (ex. #6fba80b4)
// other Fingerprint pattern (see below)
//
// Patterns are interpreted as a string of bytes. The value 00 to ff
// represents an actual value. A byte represented as 'xx' is not
// important to the fingerprint and are masked out. Example of masked
// bytes are absolute addresses/offsets inside the code that are
// likely to change location on blizzard patches.
//
// Once the address of the ordinal, actual address or fingerprint has
// been found, the offset is added to the result and passed back to
// the calling function.
//
// If the address is not found the function returns 0
//
// <thohell>
//////////////////////////////////////////////////////////////////////
DWORD GetMemoryAddressFromPattern(LPSTR szDllName, LPCSTR szSearchPattern, DWORD offset)
{
DWORD lResult = 0;
// Check for actual address
if (szSearchPattern[0] == '#')
{
LPSTR t="";
lResult=strtoul(&szSearchPattern[1], &t, 0x10);
return lResult+=(lResult?offset:0);
}
// Check for ordinal
if (szSearchPattern[0] == '!')
{
HMODULE hModule = GetModuleHandle(szDllName);
// First let's try to find ordinal by name
if (hModule)
lResult = (DWORD)GetProcAddress(hModule, &szSearchPattern[1]);
// No luck, lets try by ordinal number instead
if (!lResult)
{
LPSTR x="";
lResult = (DWORD)GetProcAddress(hModule, (LPCSTR)MAKELONG(strtoul(&szSearchPattern[1], &x, 10),0));
}
return lResult+=(lResult?offset:0);
}
// Parse fingerprint
DWORD len=(strlen(szSearchPattern))/2;
WORD *pPattern=new WORD[len];
DWORD SearchSize = NULL, SearchAddress = NULL;
MODULEINFO moduleInfo;
HMODULE hDllModule = GetModuleHandle(szDllName);
if(hDllModule != NULL)
if(GetModuleInformation(GetCurrentProcess(), hDllModule, &moduleInfo, sizeof(moduleInfo)))
{
SearchAddress = (DWORD)moduleInfo.lpBaseOfDll;
SearchSize = moduleInfo.SizeOfImage;
MakeSearchPattern(szSearchPattern,pPattern);
if (lResult = (DWORD)PatternSearch((BYTE*)SearchAddress, SearchSize, pPattern, len))
lResult+=offset;
}
else
lResult = NULL;
delete [] pPattern;
return lResult;
}
//////////////////////////////////////////////////////////////////////
// Pattern search algorithm written by Druttis.
//
// Patterns string is in the form of
//
// 0xMMVV, 0xMMVV, 0xMMVV
//
// Where MM = Mask & VV = Value
//
// Pattern Equals is doing the following match
//
// (BB[p] & MM[p]) == VV[p]
//
// Where BB = buffer data
//
// That means :
//
// a0, b0, c0, d0, e0 is equal to
//
// 1) 0xffa0, 0xffb0, 0x0000, 0x0000, 0xffe0
// 2) 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
// 3) 0x8080, 0x3030, 0x0000, 0xffdd, 0xffee
//
// I think you got the idea of it...BOOL _fastcall PatternEquals(LPBYTE buf, LPWORD pat, DWORD plen)
//////////////////////////////////////////////////////////////////////
BOOL PatternEquals(LPBYTE buf, LPWORD pat, DWORD plen)
{
//
// Just a counter
DWORD i;
//
// Offset
DWORD ofs = 0;
//
// Loop
for (i = 0; plen > 0; i++) {
//
// Compare mask buf and compare result
// <thohell>Swapped mask/data. Old code was buggy.</thohell>
if ((buf[ofs] & ((pat[ofs] & 0xff00)>>8)) != (pat[ofs] & 0xff))
return FALSE;
//
// Move ofs in zigzag direction
plen--;
if ((i & 1) == 0)
ofs += plen;
else
ofs -= plen;
}
//
// Yep, we found
return TRUE;
}
//
// Search for the pattern, returns the pointer to buf+ofset matching
// the pattern or null.
LPVOID PatternSearch(LPBYTE buf, DWORD blen, LPWORD pat, DWORD plen)
{
//
// Offset and End of search
DWORD ofs;
DWORD end;
//
// Buffer length and Pattern length may not be 0
if ((blen == 0) || (plen == 0))
return NULL;
//
// Calculate End of search
end = blen - plen;
//
// Do the booring loop
for (ofs = 0; ofs != end; ofs++) {
// Return offset to first byte of buf matching width the pattern
if (PatternEquals(&buf[ofs], pat, plen))
return &buf[ofs];
}
//
// Me no find, me return 0, NULL, nil
return NULL;
}
//////////////////////////////////////////////////////////////////////
// MakeSearchPattern
// -------------------------------------------------------------------
// Convert a pattern-string into a pattern array for use with pattern
// search.
//
// <thohell>
//////////////////////////////////////////////////////////////////////
VOID MakeSearchPattern(LPCSTR pString, LPWORD pat)
{
char *tmp=new char[strlen(pString)+1];
strcpy(tmp, pString);
for (int i=(strlen(tmp)/2)-1; strlen(tmp) > 0; i--)
{
char *x="";
BYTE value=(BYTE)strtoul(&tmp[i*2], &x, 0x10);
if (strlen(x))
pat[i]=0;
else
pat[i]=MAKEWORD(value, 0xff);
tmp[i*2]=0;
}
delete [] tmp;
}
#endif
//////////////////////////////////////////////////////////////////////
// Misc. Functions
//
//////////////////////////////////////////////////////////////////////
void writeToAddress(void* Data, DWORD Address, int Size)
{
DWORD oldProtect;
VirtualProtect((LPVOID)Address, Size, PAGE_READWRITE, &oldProtect);
memcpy((void*)Address, Data, Size);
VirtualProtect((LPVOID)Address, Size, oldProtect, &oldProtect);
}
// Detour
//------------------------------------
//Make sure to adjust length according to instructions below detoured address!
//Partially overwritten instructions will mess-up disassembly and capacity to debug
void *DetourApply(BYTE *orig, BYTE *hook, int len, BYTE type)
{
BYTE OP, SZ;
if (type == JMPOP)
{
OP = JMPOP;
SZ = JMP32_SZ;
}
else if (type == CALLOP)
{
OP = CALLOP;
SZ = CALL32_SZ;
}
else return 0;
DWORD dwProt = 0;
BYTE *jmp = (BYTE*)malloc(len+SZ);
VirtualProtect(orig, len, PAGE_READWRITE, &dwProt);
memcpy(jmp, orig, len);
jmp += len; // increment to the end of the copied bytes
jmp[0] = OP;
*(DWORD*)(jmp+1) = (DWORD)(orig+len - jmp) - SZ;
memset(orig, NOPOP, len);
orig[0] = OP;
*(DWORD*)(orig+1) = (DWORD)(hook - orig) - SZ;
VirtualProtect(orig, len, dwProt, 0);
return (jmp-len);
}
void DetourRemove(BYTE *src, BYTE *jmp, int len)
{
DWORD dwProt = 0;
VirtualProtect(src, len, PAGE_READWRITE, &dwProt);
memcpy(src, jmp, len);
VirtualProtect(src, len, dwProt, 0);
}