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
pub mod error;
use error::MemoryResult;
use regex::Regex;
fn is_sub(mut haystack: &[u8], needle: &[u8]) -> Option<usize> {
if needle.len() == 0 {
return Some(0);
}
let mut offset = 0;
while !haystack.is_empty() {
if haystack.starts_with(needle) {
return Some(offset);
}
haystack = &haystack[1..];
offset += 1;
}
None
}
fn structure_is_sub<T: DefaultInit>(mut haystack: &[u8]) -> Option<usize> {
let mut offset = 0;
while !haystack.is_empty() {
let first_entry_ptr = &haystack[0] as *const u8;
if haystack.len() < std::mem::size_of::<T>() {
break;
}
if unsafe {
(*std::mem::transmute::<*const u8, *const T>(first_entry_ptr)).is_default_init()
} {
return Some(offset);
}
haystack = &haystack[1..];
offset += 1;
}
None
}
fn wildcard_is_sub(mut haystack: &[u8], needle: &[Option<u8>]) -> Option<usize> {
if needle.len() == 0 {
return Some(0);
}
let mut offset = 0;
while !haystack.is_empty() {
let starts_with = needle
.iter()
.zip(haystack.iter())
.map(|(n, h)| {
if let Some(val) = n {
match val == h {
true => Some(()),
false => None,
}
} else {
Some(())
}
})
.collect::<Option<()>>();
if starts_with == Some(()) && haystack.len() >= needle.len() {
return Some(offset);
}
haystack = &haystack[1..];
offset += 1;
}
None
}
pub trait DefaultInit {
fn is_default_init(&self) -> bool;
}
pub trait MemoryManipulation {
fn read(&self, address: usize, buf: &mut [u8]) -> MemoryResult<usize>;
fn write(&self, address: usize, payload: &[u8]) -> MemoryResult<usize>;
fn read_structure<T>(&self, address: usize) -> MemoryResult<&mut T> {
let mut buf = vec![0_u8; std::mem::size_of::<T>()];
self.read(address, &mut buf)?;
Ok(unsafe { std::mem::transmute::<*mut u8, &mut T>(&mut buf[0] as *mut u8) })
}
fn write_structure<T>(&self, address: usize, payload: T) -> MemoryResult<usize> {
let payload = unsafe { std::mem::transmute::<&T, *const u8>(&payload) };
self.write(address, unsafe {
std::slice::from_raw_parts(payload, std::mem::size_of::<T>())
})
}
fn find(&self, start: usize, end: usize, signature: &[u8]) -> Option<usize> {
(start..end)
.step_by(std::mem::size_of_val(signature) * 4)
.into_iter()
.find_map(|addr| {
let mut buffer = vec![0_u8; std::mem::size_of_val(signature) * 4];
match self.read(addr, &mut buffer) {
Ok(_) => (),
Err(_) => return None,
}
match is_sub(&mut buffer, signature) {
Some(inner) => Some(addr + inner),
None => None,
}
})
}
fn find_structure<T: DefaultInit>(&self, start: usize, end: usize) -> Option<usize> {
(start..end)
.step_by(std::mem::size_of::<T>() * 4)
.into_iter()
.find_map(|addr| {
let mut buffer = vec![0_u8; std::mem::size_of::<T>() * 4];
match self.read(addr, &mut buffer) {
Ok(_) => (),
Err(_) => return None,
}
match structure_is_sub::<T>(&mut buffer) {
Some(inner) => Some(addr + inner),
None => None,
}
})
}
fn find_wildcard(&self, start: usize, end: usize, signature: &str) -> Option<usize> {
let re = Regex::new(r"[[:xdigit:]][[:xdigit:]]|::").unwrap();
let signature = re
.captures_iter(signature)
.into_iter()
.map(|caps| {
caps.get(0)
.map(|m| match u8::from_str_radix(m.as_str(), 16) {
Ok(num) => Some(num),
Err(_) => None,
})
.unwrap_or(None)
})
.collect::<Vec<Option<u8>>>();
(start..end)
.step_by(signature.len() * 4)
.into_iter()
.find_map(|addr| {
let mut buffer = vec![0_u8; signature.len() * 4];
match self.read(addr, &mut buffer) {
Ok(_) => (),
Err(_) => return None,
}
match wildcard_is_sub(&mut buffer, &signature) {
Some(inner) => Some(addr + inner),
None => None,
}
})
}
}