-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathusermode.h
375 lines (284 loc) · 7.77 KB
/
usermode.h
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
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
#pragma once
#include "CmdInterface.h"
#include <set>
DECLARE_CMD(usearch_astr)
DECLARE_CMD(usearch_ustr)
DECLARE_CMD(usearch_bytes)
DECLARE_CMD(usearch_addr)
DECLARE_CMD(uaddr_ref_disp)
DECLARE_CMD(uaddr_ref_by)
DECLARE_CMD(uaddr_ref_tree)
DECLARE_CMD(uaddr_analyze)
DECLARE_CMD(uaddr_analyze_svg)
DECLARE_CMD(uaddr_analyze2)
DECLARE_CMD(ustacks)
DECLARE_CMD(uregs)
void usermode_search_astr(string pattern, size_t level);
void usermode_search_ustr(string pattern, size_t level);
void usermode_search_bytes(string bytes, size_t level);
void usermode_search_addr(size_t addr, size_t level);
void usermode_addr_ref_disp(size_t start, size_t len, size_t ref_start, size_t ref_len, size_t ref_disp);
void usermode_addr_ref_by(size_t start);
void usermode_addr_ref_tree(size_t start, size_t level);
void usermode_addr_analyze(size_t start, size_t len, size_t offset);
void usermode_addr_analyze_svg(size_t start, size_t len, string svg_filename, size_t offset);
void usermode_addr_analyze2(size_t start, size_t len, size_t offset);
void usermode_stacks();
void usermode_regs();
class CUsermodeStack
{
public:
CUsermodeStack(size_t start, size_t end, size_t size, size_t t_index, size_t tid, size_t pid, string usage);
~CUsermodeStack();
void Analyze();
bool in_range(size_t addr)
{
return addr >= m_start && addr < m_end;
}
string desc(size_t addr);
tuple<size_t, size_t> dump();
private:
size_t m_start{ 0 };
size_t m_end{ 0 };
size_t m_size{ 0 };
size_t m_t_index{ 0 };
size_t m_tid{ 0 };
size_t m_pid{ 0 };
string m_usage_str;
};
class CUsermodeModule
{
public:
CUsermodeModule(size_t start, size_t end, size_t size, string name, string path, string usage);
~CUsermodeModule();
void Analyze();
bool in_range(size_t addr)
{
return addr >= m_start && addr < m_end;
}
bool is_code()
{
return m_usage_str.find("PAGE_EXECUTE_READ") != string::npos;
}
bool is_readonly()
{
return m_usage_str.find("PAGE_READONLY") != string::npos;
}
bool is_global()
{
return m_usage_str.find("PAGE_READWRITE") != string::npos ||
m_usage_str.find("PAGE_WRITECOPY") != string::npos;
}
string code_desc(size_t addr);
string data_desc(size_t addr);
private:
size_t m_start{ 0 };
size_t m_end{ 0 };
size_t m_size{ 0 };
string m_name{ 0 };
string m_path{ 0 };
string m_usage_str;
};
class CUsermodeHeapAllocation
{
public:
CUsermodeHeapAllocation(size_t start, size_t end);
~CUsermodeHeapAllocation();
bool in_range(size_t addr)
{
return addr >= m_start && addr < m_end;
}
bool equal(shared_ptr<CUsermodeHeapAllocation> other)
{
return other && m_start == other->start() && m_end == other->end();
}
void add_ref(shared_ptr<CUsermodeHeapAllocation> ref)
{
for (auto& it_ref : m_references)
{
if (it_ref->equal(ref))
return;
}
m_references.push_back(ref);
}
void add_ptr(shared_ptr<CUsermodeHeapAllocation> ptr)
{
for (auto& it_ptr : m_pointers)
{
if (it_ptr->equal(ptr))
return;
}
m_pointers.push_back(ptr);
}
size_t start()
{
return m_start;
}
size_t end()
{
return m_end;
}
size_t size()
{
return m_size;
}
void set_desc(string desc)
{
m_desc = desc;
}
string desc()
{
return m_desc;
}
private:
size_t m_start;
size_t m_end;
size_t m_size;
string m_desc;
vector<shared_ptr<CUsermodeHeapAllocation>> m_pointers;
vector<shared_ptr<CUsermodeHeapAllocation>> m_references;
};
class CUsermodeHeap
{
public:
CUsermodeHeap(size_t start, size_t end, size_t size, size_t id, size_t handle, string type, string usage);
~CUsermodeHeap();
void Analyze();
bool in_range(size_t addr)
{
return addr >= m_start && addr < m_end;
}
string desc(size_t addr);
string ref_by_desc(size_t addr);
tuple<vector<shared_ptr<CUsermodeHeapAllocation>>, set<size_t>> ref_by(size_t addr);
shared_ptr<CUsermodeHeapAllocation> get_allocation(size_t start, size_t end)
{
for (auto& alloc : m_allocations)
{
if (alloc->start() == start && alloc->end() == end)
return alloc;
}
return nullptr;
}
void add_allocation(shared_ptr<CUsermodeHeapAllocation> alloc)
{
m_allocations.push_back(alloc);
}
shared_ptr<CUsermodeHeapAllocation> get_alloc_for_addr(size_t addr)
{
for (auto& alloc : m_allocations)
{
if (alloc->start() <= addr && alloc->end() > addr)
return alloc;
}
return nullptr;
}
private:
size_t m_start{ 0 };
size_t m_end{ 0 };
size_t m_size{ 0 };
size_t m_id{ 0 };
size_t m_handle{ 0 };
string m_type{ 0 };
string m_usage_str;
vector<shared_ptr<CUsermodeHeapAllocation>> m_allocations;
};
class CUsermodeMemory
{
public:
static CUsermodeMemory* GetInstance()
{
static CUsermodeMemory s_instance;
return &s_instance;
}
CUsermodeMemory();
~CUsermodeMemory();
void Analyze();
bool is_stack(size_t addr)
{
for (auto& stack : m_stacks)
{
if (stack->in_range(addr))
return true;
}
return false;
}
bool is_heap(size_t addr)
{
for (auto& heap : m_heaps)
{
if (heap->in_range(addr))
return true;
}
return false;
}
bool is_code(size_t addr)
{
for (auto& module : m_images)
{
if (module->in_range(addr) && module->is_code())
return true;
}
return false;
}
bool is_readonly(size_t addr)
{
for (auto& module : m_images)
{
if (module->in_range(addr) && module->is_readonly())
return true;
}
return false;
}
bool is_global(size_t addr)
{
for (auto& module : m_images)
{
if (module->in_range(addr) && module->is_global())
return true;
}
return false;
}
bool is_module_data(size_t addr)
{
for (auto& module : m_images)
{
if (module->in_range(addr) && !module->is_code())
return true;
}
return false;
}
string heap_desc(size_t addr);
string code_desc(size_t addr);
string module_data_desc(size_t addr);
string stack_desc(size_t addr);
string heap_ref_by_desc(size_t addr);
tuple<vector<shared_ptr<CUsermodeHeapAllocation>>, set<size_t>> heap_ref_by(size_t addr);
shared_ptr<CUsermodeHeapAllocation> get_allocation(size_t start, size_t end);
shared_ptr<CUsermodeHeapAllocation> get_alloc_for_addr(size_t addr);
void analyze_mem(size_t addr, size_t len, size_t offset, bool b_recurse = false);
void analyze_mem_svg(size_t addr, size_t len, size_t offset, string svg_filename, bool b_recurse = false);
void analyze_qword(size_t qword);
void analyze_mem_around(size_t addr);
void analyze_ref_by(size_t addr);
void analyze_ref_tree(size_t addr, size_t level = 0);
void dump_all_stacks();
void dummy()
{
}
string qword_2_buffer(size_t qw)
{
string str(8, '0');
memcpy(str.data(), &qw, 8);
return str;
}
void set_ref_by_tree_levels(size_t level)
{
m_max_ref_by_tree_levels = level;
}
private:
vector<unique_ptr<CUsermodeStack>> m_stacks;
vector<unique_ptr<CUsermodeHeap>> m_heaps;
vector<unique_ptr<CUsermodeModule>> m_images;
size_t m_max_ref_by_tree_levels{ 10 };
};