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
//! Confirmed-pattern extraction for the postprocess tail.
//!
//! Confirmed extraction owns suffix gating, shared-anchor localization, and the
//! direct-prefix duplicate filter. It stays separate from decode
//! recursion and ML scoring so the postprocess folder has one owner per job.
use super::{absolute_offset, scan_postprocess, scan_postprocess_profile, CompiledScanner};
use crate::types::{ScanState, ScannerPreprocessedText};
use keyhog_core::Chunk;
use std::sync::atomic::Ordering::Relaxed;
impl CompiledScanner {
#[allow(clippy::too_many_arguments)]
pub(crate) fn extract_confirmed_patterns(
&self,
confirmed_patterns: &[usize],
preprocessed: &ScannerPreprocessedText<'_>,
line_offsets: &[usize],
code_lines: &[&str],
documentation_lines: &[bool],
chunk: &Chunk,
scan_state: &mut ScanState,
deadline: Option<std::time::Instant>,
confirmed_anchor_literal_matches: Option<&[(u32, u32)]>,
) {
let prof = scan_postprocess_profile::confirmed_prof_enabled();
let total = self.ac_map.len() + self.phase2_patterns.len();
// Suffix gate: one AC pass marks which required-suffix literals are
// present in the chunk; a triggered pattern whose suffix literals are
// ALL absent cannot match (every match ends with one of them), so its
// whole-chunk regex run is skipped. `None` when the gate is disabled or
// no pattern is gateable.
let needs_suffix_gate = self.tuning.confirmed_suffix_gate_enabled()
&& confirmed_patterns.iter().any(|&pat_idx| {
let anchored = self
.confirmed_anchor_index
.as_ref()
.is_some_and(|anchor_index| anchor_index.is_eligible(pat_idx));
self.ac_suffix_gate
.get(pat_idx)
.is_some_and(|gate| !gate.is_empty() && !anchored)
});
let suffix_present: Option<std::collections::HashSet<usize>> = match &self.suffix_gate_ac {
Some(ac) if needs_suffix_gate => {
let t0 = prof.then(std::time::Instant::now);
let present = ac
.find_overlapping_iter(&*preprocessed.text)
.map(|m| m.pattern().as_usize())
.collect();
if let Some(t0) = t0 {
scan_postprocess_profile::confirmed_prof_record(
scan_postprocess_profile::ConfirmedStage::SuffixGate,
t0.elapsed(),
);
}
Some(present)
}
_ => None,
};
let suffix_allows = |pat_idx: usize| -> bool {
if let Some(present) = &suffix_present {
if let Some(gate) = self.ac_suffix_gate.get(pat_idx) {
if !gate.is_empty() && !gate.iter().any(|id| present.contains(&(*id as usize)))
{
return false;
}
}
}
true
};
let hot_direct_offsets = self.hot_direct_emitted_offsets(confirmed_patterns, scan_state);
if let Some(anchor_index) = &self.confirmed_anchor_index {
let has_active_anchored = confirmed_patterns
.iter()
.any(|&pat_idx| anchor_index.is_eligible(pat_idx) && suffix_allows(pat_idx));
if has_active_anchored {
scan_postprocess::confirmed_anchor::CONFIRMED_ANCHOR_CANDIDATES.with(|cell| {
let mut candidates = cell.borrow_mut();
let collect_t0 = prof.then(std::time::Instant::now);
let is_active = |pat_idx| {
confirmed_patterns.binary_search(&pat_idx).is_ok() && suffix_allows(pat_idx)
};
if let Some(literal_matches) = confirmed_anchor_literal_matches {
anchor_index.collect_candidates_from_literal_matches(
literal_matches,
is_active,
&mut candidates,
);
} else {
anchor_index.collect_candidates(
&preprocessed.text,
is_active,
&mut candidates,
);
}
if let Some(collect_t0) = collect_t0 {
scan_postprocess_profile::confirmed_prof_record(
scan_postprocess_profile::ConfirmedStage::AnchorCollect,
collect_t0.elapsed(),
);
}
let mut i = 0usize;
let mut deadline_tick = 0usize;
while i < candidates.len() {
if crate::deadline::expired_on_cadence(
deadline,
deadline_tick,
crate::deadline::HOT_LOOP_DEADLINE_CADENCE,
) {
break;
}
deadline_tick += 1;
let pat_idx = candidates[i].0 as usize;
let mut j = i + 1;
while j < candidates.len() && candidates[j].0 as usize == pat_idx {
j += 1;
}
let group = &candidates[i..j];
if let Some(entry) = self.ac_map.get(pat_idx) {
let mut filtered_group = Vec::new();
let group = if self.is_hot_confirmed_pattern(pat_idx) {
if let Some(offsets) = hot_direct_offsets.as_ref() {
let detector_index = entry.detector_index;
filtered_group.reserve(group.len());
filtered_group.extend(group.iter().copied().filter(
|&(_, pos)| {
// Overflow (impossible on real input) can't collide
// with an already-emitted hot offset: keep it.
absolute_offset(
chunk.metadata.base_offset,
pos as usize,
)
.map_or(true, |ao| {
!offsets.contains(&(detector_index, ao))
})
},
));
if filtered_group.is_empty() {
i = j;
continue;
}
filtered_group.as_slice()
} else {
group
}
} else {
group
};
let t0 = if prof {
Some(std::time::Instant::now())
} else {
None
};
match anchor_index.anchored_regex(pat_idx) {
Some(re) => self.extract_anchored(
entry,
re,
group,
preprocessed,
line_offsets,
code_lines,
documentation_lines,
chunk,
scan_state,
deadline,
),
None => self.extract_matches_inner(
entry,
preprocessed,
line_offsets,
code_lines,
documentation_lines,
chunk,
scan_state,
None,
deadline,
),
}
if let Some(t0) = t0 {
let elapsed = t0.elapsed();
scan_postprocess_profile::confirmed_prof_record(
scan_postprocess_profile::ConfirmedStage::Extract,
elapsed,
);
let (ns, runs) =
scan_postprocess_profile::confirmed_prof_vecs(total);
if let (Some(n), Some(r)) = (ns.get(pat_idx), runs.get(pat_idx)) {
n.fetch_add(elapsed.as_nanos() as u64, Relaxed);
r.fetch_add(1, Relaxed);
}
}
}
i = j;
}
});
}
}
for (deadline_tick, &pat_idx) in confirmed_patterns.iter().enumerate() {
if crate::deadline::expired_on_cadence(
deadline,
deadline_tick,
crate::deadline::HOT_LOOP_DEADLINE_CADENCE,
) {
break;
}
// Skip a gated ac_map pattern whose required suffix literal is absent.
if !suffix_allows(pat_idx) {
continue;
}
if self
.confirmed_anchor_index
.as_ref()
.is_some_and(|anchor_index| anchor_index.is_eligible(pat_idx))
{
continue;
}
// `confirmed_patterns` is ac_map-only: every production caller
// filters `idx < ac_map.len()` (backend_triggered.rs). This bound is
// load-bearing: `is_hot_confirmed_pattern` and
// `hot_confirmed_by_pattern` are index-parallel to `ac_map`
// and panic on any phase-2 index. Assert the contract; fail closed
// (skip) in release rather than index out of bounds.
debug_assert!(
pat_idx < self.ac_map.len(),
"extract_confirmed_patterns got phase-2 index {pat_idx} (ac_map len {}); callers must filter to ac_map-only",
self.ac_map.len()
);
let Some(entry) = self.ac_map.get(pat_idx) else {
continue;
};
let t0 = if prof {
Some(std::time::Instant::now())
} else {
None
};
self.extract_matches_inner(
entry,
preprocessed,
line_offsets,
code_lines,
documentation_lines,
chunk,
scan_state,
None,
deadline,
);
if let Some(t0) = t0 {
let elapsed = t0.elapsed();
scan_postprocess_profile::confirmed_prof_record(
scan_postprocess_profile::ConfirmedStage::Extract,
elapsed,
);
let (ns, runs) = scan_postprocess_profile::confirmed_prof_vecs(total);
if let (Some(n), Some(r)) = (ns.get(pat_idx), runs.get(pat_idx)) {
n.fetch_add(elapsed.as_nanos() as u64, Relaxed);
r.fetch_add(1, Relaxed);
}
}
}
}
fn hot_direct_emitted_offsets(
&self,
confirmed_patterns: &[usize],
scan_state: &ScanState,
) -> Option<std::collections::HashSet<(usize, usize)>> {
let detector_by_id: std::collections::HashMap<&str, usize> = confirmed_patterns
.iter()
.filter_map(|&pat_idx| {
if !self.is_hot_confirmed_pattern(pat_idx) {
return None;
}
self.ac_map.get(pat_idx).map(|entry| entry.detector_index)
})
.map(|detector_index| {
let plan = self.detector_plans.get(detector_index);
(plan.metadata.0.as_ref(), detector_index)
})
.collect();
if detector_by_id.is_empty() {
return None;
}
let mut offsets = std::collections::HashSet::new();
scan_state.for_each_produced_match(|produced| {
if let Some(&detector_index) = detector_by_id.get(produced.detector_id) {
offsets.insert((detector_index, produced.offset));
}
});
(!offsets.is_empty()).then_some(offsets)
}
fn is_hot_confirmed_pattern(&self, pat_idx: usize) -> bool {
match self.hot_confirmed_by_pattern.get(pat_idx) {
Some(is_hot) => *is_hot,
None => {
panic!(
"internal invariant violation: missing hot-confirmed detector classification for pattern index {pat_idx}"
);
}
}
}
}