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
//! Hot-path scan and rule evaluation for [`super::SimpleMatcher`].
//!
//! Implements the two-pass matching loop: Pass 1 scans each text variant and updates
//! per-rule state; Pass 2 iterates touched rules and collects the satisfied ones.
use std::borrow::Cow;
use tinyvec::TinyVec;
use crate::process::ProcessedTextMasks;
use super::types::{
AsciiMatcher, NonAsciiMatcher, PatternEntry, PatternKind, SIMPLE_MATCH_STATE, ScanContext,
SimpleMatchState,
};
use super::{SimpleMatcher, SimpleResult};
impl SimpleMatcher {
/// Runs both Pass 1 and Pass 2, appending all satisfied rules to `results`.
pub(super) fn process_preprocessed_into<'a>(
&'a self,
processed_text_process_type_masks: &ProcessedTextMasks<'a>,
results: &mut Vec<SimpleResult<'a>>,
) {
let mut state = SIMPLE_MATCH_STATE.borrow_mut();
state.prepare(self.rule_hot.len());
self.scan_all_variants(processed_text_process_type_masks, &mut state, false);
let generation = state.generation;
for &rule_idx in &state.touched_indices {
let word_state = &state.word_states[rule_idx];
if word_state.positive_generation == generation
&& word_state.not_generation != generation
{
let cold = &self.rule_cold[rule_idx];
results.push(SimpleResult {
word_id: cold.word_id,
word: Cow::Borrowed(&cold.word),
});
}
}
}
/// Pass 1: scans all text variants, updating [`SimpleMatchState`].
///
/// Dispatches to the const-generic inner function based on whether all rules share
/// a single process type. When `SINGLE_PT=true`, the per-entry process-type mask
/// check is eliminated at compile time.
///
/// Returns `true` only when `exit_early` is `true` and at least one rule fired early.
pub(super) fn scan_all_variants<'a>(
&'a self,
processed_text_process_type_masks: &ProcessedTextMasks<'a>,
state: &mut SimpleMatchState,
exit_early: bool,
) -> bool {
if self.single_pt_index.is_some() {
self.scan_all_variants_inner::<true>(
processed_text_process_type_masks,
state,
exit_early,
)
} else {
self.scan_all_variants_inner::<false>(
processed_text_process_type_masks,
state,
exit_early,
)
}
}
#[inline(always)]
fn scan_all_variants_inner<'a, const SINGLE_PT: bool>(
&'a self,
processed_text_process_type_masks: &ProcessedTextMasks<'a>,
state: &mut SimpleMatchState,
exit_early: bool,
) -> bool {
if self.ac_dedup_ranges.is_empty() {
return false;
}
let num_variants = processed_text_process_type_masks.len();
for (index, tv) in processed_text_process_type_masks.iter().enumerate() {
if tv.mask == 0 {
continue;
}
let ctx = ScanContext {
text_index: index,
process_type_mask: tv.mask,
num_variants,
exit_early,
is_ascii: tv.is_ascii,
};
if self.scan_variant::<SINGLE_PT>(tv.text.as_ref(), ctx, state) {
return true;
}
}
false
}
/// Scans one pre-processed text variant through the relevant matcher engines.
///
/// Generic over `SINGLE_PT`: when `true`, the per-entry process-type mask check
/// in `process_match` is dead code and the compiler eliminates it entirely.
///
/// Returns `true` if a rule was fully satisfied and `ctx.exit_early` is set; `false` otherwise.
#[inline(always)]
pub(super) fn scan_variant<const SINGLE_PT: bool>(
&self,
processed_text: &str,
ctx: ScanContext,
state: &mut SimpleMatchState,
) -> bool {
if ctx.is_ascii {
if let Some(ref ascii_matcher) = self.ascii_matcher {
match ascii_matcher {
#[cfg(feature = "dfa")]
AsciiMatcher::AcDfa { matcher, to_dedup } => {
for hit in matcher.find_overlapping_iter(processed_text) {
let dedup_idx = to_dedup[hit.pattern().as_usize()] as usize;
if self.process_match::<SINGLE_PT>(dedup_idx, ctx, state) {
return true;
}
}
}
AsciiMatcher::DaacBytewise(daac_matcher) => {
for hit in daac_matcher.find_overlapping_iter(processed_text) {
let dedup_idx = hit.value() as usize;
if self.process_match::<SINGLE_PT>(dedup_idx, ctx, state) {
return true;
}
}
}
}
}
} else if let Some(ref non_ascii_matcher) = self.non_ascii_matcher {
match non_ascii_matcher {
NonAsciiMatcher::DaacCharwise(daac_matcher) => {
for hit in daac_matcher.find_overlapping_iter(processed_text) {
let dedup_idx = hit.value() as usize;
if self.process_match::<SINGLE_PT>(dedup_idx, ctx, state) {
return true;
}
}
}
}
} else if let Some(ref ascii_matcher) = self.ascii_matcher {
match ascii_matcher {
#[cfg(feature = "dfa")]
AsciiMatcher::AcDfa { matcher, to_dedup } => {
for hit in matcher.find_overlapping_iter(processed_text) {
let dedup_idx = to_dedup[hit.pattern().as_usize()] as usize;
if self.process_match::<SINGLE_PT>(dedup_idx, ctx, state) {
return true;
}
}
}
AsciiMatcher::DaacBytewise(daac_matcher) => {
for hit in daac_matcher.find_overlapping_iter(processed_text) {
let dedup_idx = hit.value() as usize;
if self.process_match::<SINGLE_PT>(dedup_idx, ctx, state) {
return true;
}
}
}
}
}
false
}
/// Updates rule counters for a single automaton hit (called from Pass 1).
///
/// Generic over `SINGLE_PT`: when `true`, all rules share the same process type,
/// so the per-entry `pt_index` mask check is compiled away.
#[inline(always)]
pub(super) fn process_match<const SINGLE_PT: bool>(
&self,
pattern_idx: usize,
ctx: ScanContext,
state: &mut SimpleMatchState,
) -> bool {
let generation = state.generation;
let (start, len) = self.ac_dedup_ranges[pattern_idx];
for entry in &self.ac_dedup_entries[start..start + len] {
let &PatternEntry {
rule_idx,
offset,
pt_index,
kind,
} = entry;
let rule_idx = rule_idx as usize;
if !SINGLE_PT && ctx.process_type_mask & (1u64 << pt_index) == 0 {
continue;
}
match kind {
PatternKind::Simple => {
let word_state = &mut state.word_states[rule_idx];
if word_state.positive_generation == generation {
if ctx.exit_early {
return true;
}
continue;
}
if word_state.matrix_generation != generation {
word_state.matrix_generation = generation;
word_state.positive_generation = generation;
state.touched_indices.push(rule_idx);
if ctx.exit_early {
return true;
}
}
}
PatternKind::And => {
let offset = offset as usize;
let rule = &self.rule_hot[rule_idx];
let word_state = &mut state.word_states[rule_idx];
if word_state.not_generation == generation {
continue;
}
if word_state.positive_generation == generation {
if !rule.has_not && ctx.exit_early {
return true;
}
continue;
}
if word_state.matrix_generation != generation {
word_state.matrix_generation = generation;
word_state.positive_generation =
if rule.and_count == 0 { generation } else { 0 };
word_state.remaining_and = rule.and_count as u16;
word_state.satisfied_mask = 0;
state.touched_indices.push(rule_idx);
if rule.use_matrix {
Self::init_matrix(
&mut state.matrix[rule_idx],
&mut state.matrix_status[rule_idx],
&rule.segment_counts,
ctx.num_variants,
);
}
}
let is_satisfied = if rule.use_matrix {
let flat_matrix = &mut state.matrix[rule_idx];
let flat_status = &mut state.matrix_status[rule_idx];
let counter = &mut flat_matrix[offset * ctx.num_variants + ctx.text_index];
*counter -= 1;
if flat_status[offset] == 0 && *counter <= 0 {
flat_status[offset] = 1;
word_state.remaining_and -= 1;
if word_state.remaining_and == 0 {
word_state.positive_generation = generation;
}
}
word_state.positive_generation == generation
} else if rule.and_count == 1 {
word_state.positive_generation = generation;
true
} else {
let bit = 1u64 << offset;
if word_state.satisfied_mask & bit == 0 {
word_state.satisfied_mask |= bit;
word_state.remaining_and -= 1;
if word_state.remaining_and == 0 {
word_state.positive_generation = generation;
}
}
word_state.positive_generation == generation
};
if ctx.exit_early
&& is_satisfied
&& !rule.has_not
&& word_state.not_generation != generation
{
return true;
}
}
PatternKind::Not => {
let offset = offset as usize;
let rule = &self.rule_hot[rule_idx];
let word_state = &mut state.word_states[rule_idx];
if word_state.not_generation == generation {
continue;
}
if word_state.matrix_generation != generation {
word_state.matrix_generation = generation;
word_state.positive_generation =
if rule.and_count == 0 { generation } else { 0 };
word_state.remaining_and = rule.and_count as u16;
word_state.satisfied_mask = 0;
state.touched_indices.push(rule_idx);
if rule.use_matrix {
Self::init_matrix(
&mut state.matrix[rule_idx],
&mut state.matrix_status[rule_idx],
&rule.segment_counts,
ctx.num_variants,
);
}
}
if rule.use_matrix {
let flat_matrix = &mut state.matrix[rule_idx];
let flat_status = &mut state.matrix_status[rule_idx];
let counter = &mut flat_matrix[offset * ctx.num_variants + ctx.text_index];
*counter += 1;
if flat_status[offset] == 0 && *counter > 0 {
flat_status[offset] = 1;
word_state.not_generation = generation;
}
} else {
word_state.not_generation = generation;
}
}
}
}
false
}
/// Initializes the flat counter matrix for a rule on its first touch in a generation.
#[cold]
#[inline(never)]
pub(super) fn init_matrix(
flat_matrix: &mut TinyVec<[i32; 16]>,
flat_status: &mut TinyVec<[u8; 16]>,
segment_counts: &[i32],
num_variants: usize,
) {
let num_splits = segment_counts.len();
flat_matrix.clear();
flat_matrix.resize(num_splits * num_variants, 0i32);
flat_status.clear();
flat_status.resize(num_splits, 0u8);
for (s, &bit) in segment_counts.iter().enumerate() {
let row_start = s * num_variants;
flat_matrix[row_start..row_start + num_variants].fill(bit);
}
}
}