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
use iced_x86::{Code, Instruction, Mnemonic};
use super::Emu;
impl Emu {
/// Bulk fast-path for REP-prefixed string instructions. Returns `true` when
/// it fully executed the whole REP (already advanced `rip`, `pos`,
/// `instruction_count`, and the string registers/flags); `false` to let the
/// per-element path run unchanged.
///
/// The per-element loop in `run_loop` pays the full interpreter overhead
/// (state tracing, the SSDT heap-list fixup, hook/breakpoint checks, decode
/// re-entry) for EVERY element of a REP — so a `rep stos` of 100 KB costs
/// ~12 500 loop iterations. Real loader code does huge `rep stosq`/`repe
/// scasd` (heap fills/scans), which dominated Win11 SSDT init. This path
/// performs the whole operation with one bulk memory access instead.
///
/// Semantics are identical to the per-element path; only the redundant
/// per-element work is removed. It engages ONLY when nothing needs to
/// observe individual elements (no `-vvv`, traces, hooks, or memory
/// watchpoints), only for x64, only forward (DF=0), and only for REPs large
/// enough to be worth it. Anything else returns `false` and falls back.
pub(crate) fn try_fast_rep_string(&mut self, ins: &Instruction, size: usize) -> bool {
use Mnemonic::*;
if !(ins.has_rep_prefix() || ins.has_repe_prefix() || ins.has_repne_prefix()) {
return false;
}
// Element size by mnemonic. CMPS is intentionally left to the per-element
// path (rare, and its operand/flag order is easy to get subtly wrong).
let esz: u64 = match ins.mnemonic() {
Stosb | Movsb | Scasb | Lodsb => 1,
Stosw | Movsw | Scasw | Lodsw => 2,
Stosd | Movsd | Scasd | Lodsd => 4,
Stosq | Movsq | Scasq | Lodsq => 8,
_ => return false,
};
// x64 + forward (DF=0) only. 32-bit and DF=1 fall back.
if !self.cfg.is_x64() || self.flags().f_df {
return false;
}
// Only in pure-execution mode: anything that observes individual elements
// disables the fast path so debugging keeps byte-for-byte fidelity.
if self.cfg.verbose >= 3
|| self.cfg.trace_mem
|| self.cfg.trace_regs
|| self.cfg.trace_reg
|| self.cfg.trace_flags
|| self.cfg.trace_string
|| self.cfg.inspect
|| self.cfg.entropy
|| self.hooks.hook_on_pre_instruction.is_some()
|| self.hooks.hook_on_post_instruction.is_some()
|| self.hooks.hook_on_memory_read.is_some()
|| self.hooks.hook_on_memory_write.is_some()
|| !self.bp.mem_read_addr.is_empty()
|| !self.bp.mem_write_addr.is_empty()
{
return false;
}
let count = self.regs().rcx;
// Tiny REPs aren't worth the setup; the normal path also handles rcx==0
// (it advances rip), so let it.
if count < 16 {
return false;
}
// Don't bulk past an instruction-count breakpoint / console / exit
// position that lands strictly inside this REP — fall back so it stops.
let lo = self.pos;
let hi = self.pos + count;
if self.exp != u64::MAX && self.exp > lo && self.exp < hi {
return false;
}
if self.cfg.exit_position != 0 && self.cfg.exit_position > lo && self.cfg.exit_position < hi
{
return false;
}
if self.bp.instruction.iter().any(|&b| b > lo && b < hi) {
return false;
}
let mask: u64 = if esz == 8 { u64::MAX } else { (1u64 << (esz * 8)) - 1 };
let le = |b: &[u8]| -> u64 {
let mut v = 0u64;
for (i, &x) in b.iter().enumerate() {
v |= (x as u64) << (8 * i);
}
v
};
let di = self.regs().rdi;
let si = self.regs().rsi;
let total = (count * esz) as usize;
let processed: u64;
match ins.mnemonic() {
Stosb | Stosw | Stosd | Stosq => {
let end = di + total as u64 - 1;
let writable = self
.maps
.get_mem_by_addr(di)
.map(|mm| mm.inside(end) && mm.can_write())
.unwrap_or(false);
if !writable {
return false;
}
let unit = self.regs().rax.to_le_bytes();
let unit = &unit[..esz as usize];
let mut buf = Vec::with_capacity(total);
for _ in 0..count {
buf.extend_from_slice(unit);
}
if let Some(mm) = self.maps.get_mem_by_addr_mut(di) {
mm.write_bytes(di, &buf);
}
self.regs_mut().rdi = di + total as u64;
self.regs_mut().rcx = 0;
processed = count;
}
Movsb | Movsw | Movsd | Movsq => {
let dend = di + total as u64 - 1;
let send = si + total as u64 - 1;
// Overlapping forward copy has propagation semantics a flat
// memcpy wouldn't reproduce — leave those to the per-element path.
if di <= send && si <= dend {
return false;
}
let readable = self
.maps
.get_mem_by_addr(si)
.map(|mm| mm.inside(send) && mm.can_read())
.unwrap_or(false);
let writable = self
.maps
.get_mem_by_addr(di)
.map(|mm| mm.inside(dend) && mm.can_write())
.unwrap_or(false);
if !readable || !writable {
return false;
}
let src = self.maps.read_bytes(si, total).to_vec();
if let Some(mm) = self.maps.get_mem_by_addr_mut(di) {
mm.write_bytes(di, &src);
}
self.regs_mut().rsi = si + total as u64;
self.regs_mut().rdi = di + total as u64;
self.regs_mut().rcx = 0;
processed = count;
}
Scasb | Scasw | Scasd | Scasq => {
let end = di + total as u64 - 1;
let readable = self
.maps
.get_mem_by_addr(di)
.map(|mm| mm.inside(end) && mm.can_read())
.unwrap_or(false);
if !readable {
return false;
}
let bytes = self.maps.read_bytes(di, total).to_vec();
let acc = self.regs().rax & mask;
let repne = ins.has_repne_prefix();
let mut k = 0u64;
let term = loop {
let off = (k * esz) as usize;
let elem = le(&bytes[off..off + esz as usize]);
k += 1;
let equal = acc == elem;
// repe/rep: stop on first mismatch; repne: stop on first match.
let stop = if repne { equal } else { !equal };
if stop || k == count {
break elem;
}
};
self.set_sub_flags(esz, acc, term);
self.regs_mut().rcx = count - k;
self.regs_mut().rdi = di + k * esz;
processed = k;
}
Lodsb | Lodsw | Lodsd | Lodsq => {
let send = si + total as u64 - 1;
let readable = self
.maps
.get_mem_by_addr(si)
.map(|mm| mm.inside(send) && mm.can_read())
.unwrap_or(false);
if !readable {
return false;
}
let off = ((count - 1) * esz) as usize;
let bytes = self.maps.read_bytes(si, total);
let last = le(&bytes[off..off + esz as usize]);
self.set_acc(esz, last);
self.regs_mut().rsi = si + total as u64;
self.regs_mut().rcx = 0;
processed = count;
}
_ => return false,
}
self.rep = None;
self.pos += processed;
self.instruction_count += processed;
self.regs_mut().rip += size as u64;
true
}
#[inline]
fn set_sub_flags(&mut self, esz: u64, a: u64, b: u64) {
match esz {
1 => {
self.flags_mut().sub8(a, b);
}
2 => {
self.flags_mut().sub16(a, b);
}
4 => {
self.flags_mut().sub32(a, b);
}
_ => {
self.flags_mut().sub64(a, b);
}
}
}
#[inline]
fn set_acc(&mut self, esz: u64, v: u64) {
match esz {
1 => self.regs_mut().set_al(v),
2 => self.regs_mut().set_ax(v),
4 => self.regs_mut().set_eax(v),
_ => self.regs_mut().rax = v,
}
}
pub(crate) fn handle_x86_rep_pre_execution(
&mut self,
instruction: Instruction,
size: usize,
) -> bool {
let is_ret = matches!(instruction.code(), Code::Retnw | Code::Retnd | Code::Retnq);
let has_rep_prefix = instruction.has_rep_prefix()
|| instruction.has_repe_prefix()
|| instruction.has_repne_prefix();
if is_ret || !has_rep_prefix {
return false;
}
if self.rep.is_none() {
self.rep = Some(0);
}
if self.regs().rcx == 0 {
self.rep = None;
if self.cfg.is_x64() {
self.regs_mut().rip += size as u64;
} else {
let new_eip = self.regs().get_eip() + size as u64;
self.regs_mut().set_eip(new_eip);
}
return true;
}
false
}
pub(crate) fn update_x86_rep_state_after_execution(&mut self, instruction: Instruction) {
let Some(rep_count) = self.rep else {
return;
};
if self.cfg.verbose >= 3 {
log::trace!(" rcx: {}", self.regs().rcx);
}
if self.regs().rcx > 0 {
self.regs_mut().rcx -= 1;
if self.regs().rcx == 0 {
self.rep = None;
} else {
self.rep = Some(rep_count + 1);
}
}
let is_string_movement = matches!(
instruction.mnemonic(),
Mnemonic::Movsb
| Mnemonic::Movsw
| Mnemonic::Movsd
| Mnemonic::Movsq
| Mnemonic::Stosb
| Mnemonic::Stosw
| Mnemonic::Stosd
| Mnemonic::Stosq
| Mnemonic::Lodsb
| Mnemonic::Lodsw
| Mnemonic::Lodsd
| Mnemonic::Lodsq
);
let is_string_comparison = matches!(
instruction.mnemonic(),
Mnemonic::Cmpsb
| Mnemonic::Cmpsw
| Mnemonic::Cmpsd
| Mnemonic::Cmpsq
| Mnemonic::Scasb
| Mnemonic::Scasw
| Mnemonic::Scasd
| Mnemonic::Scasq
);
if is_string_movement {
return;
}
if is_string_comparison {
if instruction.has_repe_prefix() && !self.flag_zf() {
self.rep = None;
}
if instruction.has_repne_prefix() && self.flag_zf() {
self.rep = None;
}
return;
}
self.rep = None;
}
}